You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
MULTISTEP DISCRETIZATION OF INDEX 3 DAES
Yang Cao and Qing-yang Li
Journal of Computational Mathematics
Vol. 18, No. 3 (May 2000), pp. 325-336
Stable URL: http://www.jstor.org/stable/43692859
Page Count: 12
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
In the past Index-3 DAEs were solved by BDF methods as multistep methods or implicit Runge-Kutta methods as one-step methods. But if the equations axe nonstiff, not only BDF but other multistep methods may be applied. This paper considers four different types of multistep discretization of index 3 DAEs in hessenberg form. The convergence of these methods is proven under the condition that the multistep formula is striculy infinite stable, numerical tests also confirm the results.
Journal of Computational Mathematics © 2000 Institute of Computational Mathematics and Scientific/Engineering Computing