Article View: sci.math.num-analysis
Article #715Re: Automatic Time Step for an ODE
From: Barry Merriman
Date: Sun, 08 Nov 1992 01:08
Date: Sun, 08 Nov 1992 01:08
21 lines
1318 bytes
1318 bytes
In article <KJELL.92Nov6120116@sccm.Stanford.EDU> kjell@sccm.Stanford.EDU (Kjell Gustafsson) writes: > I've studied this problem in my thesis "Control of Error and > Convergence in ODE Solvers", Kjell Gustafsson, Department of Automatic > Control, Lund Institute of Technology, Sweden, 1992". It turns out > that with some ideas from feedback control you can get a better > understanding of the stepsize adjustment problem and also design > improved algorithms. Step control is usually based on simple trial-and-error, plus an assumed asymptotic form for the time step error term. Does applying control theory to such a simple situation really lead to algorithms that are more _efficient_ for typical problems? -- Barry Merriman UCLA Dept. of Math UCLA Inst. for Fusion and Plasma Research barry@math.ucla.edu (Internet; NeXTMail is welcome)
Technical Details
Message-ID:
<1992Nov8.010847.24207@math.ucla.edu>Path:
arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!swrinde!elroy.jpl.nasa.gov!ucla-cs!ucla-ma!newsReferences:
<KJELL.92Nov6120116@sccm.Stanford.EDU>Show Full Headers
Complete Article Headers
Newsgroups: sci.math.num-analysis Path: arc1-ca.pugleaf.net!sparky!uunet!zaphod.mps.ohio-state.edu!swrinde!elroy.jpl.nasa.gov!ucla-cs!ucla-ma!news From: barry@arnold.math.ucla.edu (Barry Merriman) Subject: Re: Automatic Time Step for an ODE Message-ID: <1992Nov8.010847.24207@math.ucla.edu> Sender: news@math.ucla.edu Organization: UCLA, Mathematics Department References: <KJELL.92Nov6120116@sccm.Stanford.EDU> Date: Sun, 8 Nov 92 01:08:47 GMT Lines: 23