The weak and strong stability of algorithms in numerical linear algebra
- 1 April 1987
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 88-89, 49-66
- https://doi.org/10.1016/0024-3795(87)90102-9
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Fast solution of toeplitz systems of equations and computation of Padé approximantsPublished by Elsevier ,2004
- A new algorithm for solving Toeplitz systems of equationsLinear Algebra and its Applications, 1987
- Stability of Methods for Solving Toeplitz Systems of EquationsSIAM Journal on Scientific and Statistical Computing, 1985
- Asymptotically fast solution of toeplitz and related systems of linear equationsLinear Algebra and its Applications, 1980
- The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of EquationsSIAM Journal on Scientific and Statistical Computing, 1980
- Analysis of the Diagonal Pivoting MethodSIAM Journal on Numerical Analysis, 1971
- Direct Methods for Solving Symmetric Indefinite Systems of Linear EquationsSIAM Journal on Numerical Analysis, 1971
- An Algorithm for the Inversion of Finite Toeplitz MatricesJournal of the Society for Industrial and Applied Mathematics, 1964
- Numerical inverting of matrices of high order. IIProceedings of the American Mathematical Society, 1951
- The Wiener (Root Mean Square) Error Criterion in Filter Design and PredictionJournal of Mathematics and Physics, 1946