In this paper we present three different pivoting strategies for solving general tridiagonal systems of linear equations. The first strategy resembles the classical method of Gaussian elimination with no pivoting and is stable provided a simple and easily checkable condition is met. In the second strategy, the growth of the elements is monitored so as to ensure backward stability in most cases. Finally, the third strategy also uses the right-hand side vector to make pivoting decisions and is proved to be unconditionally backward stable.
Stable solution to tridiagonal systems / I., BAR ON; Leoncini, Mauro. - In: NUMERICAL ALGORITHMS. - ISSN 1017-1398. - STAMPA. - 18:(1998), pp. 361-388.
Stable solution to tridiagonal systems
LEONCINI, Mauro
1998
Abstract
In this paper we present three different pivoting strategies for solving general tridiagonal systems of linear equations. The first strategy resembles the classical method of Gaussian elimination with no pivoting and is stable provided a simple and easily checkable condition is met. In the second strategy, the growth of the elements is monitored so as to ensure backward stability in most cases. Finally, the third strategy also uses the right-hand side vector to make pivoting decisions and is proved to be unconditionally backward stable.Pubblicazioni consigliate
I metadati presenti in IRIS UNIMORE sono rilasciati con licenza Creative Commons CC0 1.0 Universal, mentre i file delle pubblicazioni sono rilasciati con licenza Attribuzione 4.0 Internazionale (CC BY 4.0), salvo diversa indicazione.
In caso di violazione di copyright, contattare Supporto Iris