menu
{ "item_title" : "Analysis of Discretization Methods for Ordinary Differential Equations", "item_author" : [" Hans J. Stetter "], "item_description" : "Due to the fundamental role of differential equations in science and engineering it has long been a basic task of numerical analysts to generate numerical values of solutions to differential equations. Nearly all approaches to this task involve a finitization of the original differential equation problem, usually by a projection into a finite-dimensional space. By far the most popular of these finitization processes consists of a reduction to a difference equation problem for functions which take values only on a grid of argument points. Although some of these finite- difference methods have been known for a long time, their wide applica- bility and great efficiency came to light only with the spread of electronic computers. This in tum strongly stimulated research on the properties and practical use of finite-difference methods. While the theory or partial differential equations and their discrete analogues is a very hard subject, and progress is consequently slow, the initial value problem for a system of first order ordinary differential equations lends itself so naturally to discretization that hundreds of numerical analysts have felt inspired to invent an ever-increasing number of finite-difference methods for its solution. For about 15 years, there has hardly been an issue of a numerical journal without new results of this kind; but clearly the vast majority of these methods have just been variations of a few basic themes. In this situation, the classical text- book by P.", "item_img_path" : "https://covers1.booksamillion.com/covers/bam/3/64/265/473/3642654738_b.jpg", "price_data" : { "retail_price" : "54.99", "online_price" : "54.99", "our_price" : "54.99", "club_price" : "54.99", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
Analysis of Discretization Methods for Ordinary Differential Equations|Hans J. Stetter

Analysis of Discretization Methods for Ordinary Differential Equations

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

Due to the fundamental role of differential equations in science and engineering it has long been a basic task of numerical analysts to generate numerical values of solutions to differential equations. Nearly all approaches to this task involve a "finitization" of the original differential equation problem, usually by a projection into a finite-dimensional space. By far the most popular of these finitization processes consists of a reduction to a difference equation problem for functions which take values only on a grid of argument points. Although some of these finite- difference methods have been known for a long time, their wide applica- bility and great efficiency came to light only with the spread of electronic computers. This in tum strongly stimulated research on the properties and practical use of finite-difference methods. While the theory or partial differential equations and their discrete analogues is a very hard subject, and progress is consequently slow, the initial value problem for a system of first order ordinary differential equations lends itself so naturally to discretization that hundreds of numerical analysts have felt inspired to invent an ever-increasing number of finite-difference methods for its solution. For about 15 years, there has hardly been an issue of a numerical journal without new results of this kind; but clearly the vast majority of these methods have just been variations of a few basic themes. In this situation, the classical text- book by P.

This item is Non-Returnable

Details

  • ISBN-13: 9783642654732
  • ISBN-10: 3642654738
  • Publisher: Springer
  • Publish Date: November 2011
  • Dimensions: 9 x 6 x 0.84 inches
  • Shipping Weight: 1.21 pounds
  • Page Count: 390

Related Categories

You May Also Like...

    1

BAM Customer Reviews