Volume 18, Issue 3
Multistep Discretization of Index 3 DAEs

Yang Cao & Qing Yang Li

DOI:

J. Comp. Math., 18 (2000), pp. 325-336

Published online: 2000-06

Preview Full PDF 97 1633
Export citation
  • Abstract

In the past Index-3 DEAs were solved by BDF methods as multistep methods or implicit Runge-Kutta methods as one-step methods. But if the equations are 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.

  • Keywords

Multistep methods Adams method BDF DAEs Index 3

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-18-325, author = {}, title = {Multistep Discretization of Index 3 DAEs}, journal = {Journal of Computational Mathematics}, year = {2000}, volume = {18}, number = {3}, pages = {325--336}, abstract = { In the past Index-3 DEAs were solved by BDF methods as multistep methods or implicit Runge-Kutta methods as one-step methods. But if the equations are 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. }, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9046.html} }
TY - JOUR T1 - Multistep Discretization of Index 3 DAEs JO - Journal of Computational Mathematics VL - 3 SP - 325 EP - 336 PY - 2000 DA - 2000/06 SN - 18 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9046.html KW - Multistep methods KW - Adams method KW - BDF KW - DAEs KW - Index 3 AB - In the past Index-3 DEAs were solved by BDF methods as multistep methods or implicit Runge-Kutta methods as one-step methods. But if the equations are 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.
Yang Cao & Qing Yang Li. (1970). Multistep Discretization of Index 3 DAEs. Journal of Computational Mathematics. 18 (3). 325-336. doi:
Copy to clipboard
The citation has been copied to your clipboard