Volume 3, Issue 4
A-Stable and L-Stable Block Implicit One-Step Method

Bing Zhou

DOI:

J. Comp. Math., 3 (1985), pp. 328-341

Published online: 1985-03

Preview Full PDF 48 1397
Export citation
  • Abstract

A class of methods for solving the initial problem for ordinary differential equations are studied. We develop k-block implicit one step methods whose nodes in a block are noneqidistant. When the components of the node vector are related to the zeros of Jacobi's orthogonal polynomials, we can derive a subclass of formulas which are A or L-stable. The order can be arbitrarily high with A-or L-stability. We suggest a modified algorithm which avoids the inversion of a kmXkm matrix during Newton-Raphson iterations, where m is the number of differential equations. when k=4, for example, only a couple of mXm matrices have to be inversed, but four values can be obtained at one time.

  • Keywords

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-3-328, author = {Bing Zhou}, title = {A-Stable and L-Stable Block Implicit One-Step Method}, journal = {Journal of Computational Mathematics}, year = {1985}, volume = {3}, number = {4}, pages = {328--341}, abstract = { A class of methods for solving the initial problem for ordinary differential equations are studied. We develop k-block implicit one step methods whose nodes in a block are noneqidistant. When the components of the node vector are related to the zeros of Jacobi's orthogonal polynomials, we can derive a subclass of formulas which are A or L-stable. The order can be arbitrarily high with A-or L-stability. We suggest a modified algorithm which avoids the inversion of a kmXkm matrix during Newton-Raphson iterations, where m is the number of differential equations. when k=4, for example, only a couple of mXm matrices have to be inversed, but four values can be obtained at one time. }, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/9629.html} }
TY - JOUR T1 - A-Stable and L-Stable Block Implicit One-Step Method AU - Bing Zhou JO - Journal of Computational Mathematics VL - 4 SP - 328 EP - 341 PY - 1985 DA - 1985/03 SN - 3 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/9629.html KW - AB - A class of methods for solving the initial problem for ordinary differential equations are studied. We develop k-block implicit one step methods whose nodes in a block are noneqidistant. When the components of the node vector are related to the zeros of Jacobi's orthogonal polynomials, we can derive a subclass of formulas which are A or L-stable. The order can be arbitrarily high with A-or L-stability. We suggest a modified algorithm which avoids the inversion of a kmXkm matrix during Newton-Raphson iterations, where m is the number of differential equations. when k=4, for example, only a couple of mXm matrices have to be inversed, but four values can be obtained at one time.
Bing Zhou. (1970). A-Stable and L-Stable Block Implicit One-Step Method. Journal of Computational Mathematics. 3 (4). 328-341. doi:
Copy to clipboard
The citation has been copied to your clipboard