home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: sci.math.num-analysis
- Path: sparky!uunet!charon.amdahl.com!pacbell.com!decwrl!ames!agate!spool.mu.edu!howland.reston.ans.net!usc!cs.utexas.edu!newsfeed.rice.edu!rice!cyclone.rice.edu!dharry
- From: dharry@cyclone.rice.edu (Dennis Harry)
- Subject: Re: Numerical solution of ODEs with Bulirsch-Stoer extrapolation
- Message-ID: <C1H5uF.5HC@rice.edu>
- Sender: news@rice.edu (News)
- Organization: Rice University
- References: <1993Jan20.024502.23189@leland.Stanford.EDU> <1993Jan20.054301.455@seas.smu.edu>
- Date: Tue, 26 Jan 1993 18:54:14 GMT
- Lines: 13
-
- In article <1993Jan20.054301.455@seas.smu.edu>, mhosea@seas.smu.edu (Mike Hosea) writes:
-
- |> The reason extrapolation methods get very accurate results with large step
- |> sizes is because they can use very high order approximations. However,
- |> my research has shown that when compared to conventional Runge-Kutta
- |> and Adams methods of the same order, the extrapolation formulas are not
- |> as efficient in terms of function evaluations per unit step.
- ^^^^^^^^^^^^^
- Yes, but the point is that they may take much larger steps. Ideally,
- their relative inefficiency per unit step is (more than) offset by having
- to take fewer steps?
-
- -- Dennis Harry (dharry@rice.edu)
-