Stability of the Levinson algorithm for Toeplitz-like systems
From MaRDI portal
Recommendations
Cited in
(15)- A fast approach to stabilize two Toeplitz solvers of the Levinson type
- An error-free Levison algorithm to solve integer Toeplitz system
- Superfast algorithms for Cauchy-like matrix computations and extensions
- The even-odd split Levinson algorithm for Toeplitz systems
- Modify Levinson algorithm for symmetric positive definite Toeplitz system
- The Split Levinson Algorithm is Weakly Stable
- Stability of Methods for Solving Toeplitz Systems of Equations
- A Look-Ahead Levinson Algorithm for Indefinite Toeplitz Systems
- Generalized Pascal matrices generate classes closed under multiplication
- Stabilité numérique de l'algorithme de Levinson
- Error sources and error propagation in the Levinson-Durbin algorithm
- A two-step even-odd split Levinson algorithm for Toeplitz systems
- A direct solver for solving systems of linear equations with banded ill-conditioned Toeplitz matrices
- Displacement structure for Hankel, Vandermonde, and related (derived) matrices
- Solving linear systems with a Levinson-like solver
This page was built for publication: Stability of the Levinson algorithm for Toeplitz-like systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3079758)