Linear complexity parallel algorithms for linear systems of equations with recursive structure
DOI10.1016/0024-3795(87)90113-3zbMath0624.65020OpenAlexW1978166789WikidataQ127780741 ScholiaQ127780741MaRDI QIDQ578844
Peter Lancaster, Israel Koltracht, Thomas Kailath, Israel Gohberg
Publication date: 1987
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0024-3795(87)90113-3
stabilitynumerical examplesfast algorithmsHankel matrixVandermonde matrixmatrix inversionHilbert matrixrecursive structuretriangular factorizationLevinson's algorithmlinear complexity parallel algorithmsstrongly regular symmetric Toeplitz matricesUDL factorization
Theory of matrix inversion and generalized inverses (15A09) Parallel numerical computation (65Y05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Cites Work
- New inversion formulas for matrices classified in terms of their distance from Toeplitz matrices
- Numerical solution of integral equations, fast algorithms and Krein- Sobolev equation
- Efficient solution of linear systems of equations with recursive structure
- Numerical solution of linear equations with Toeplitz and vector Toeplitz matrices
- The \(QR\) algorithm for band symmetric matrices
- Displacement ranks of a matrix
- A highly concurrent algorithm and pipeleined architecture for solving Toeplitz systems
- The Numerical Stability of the Levinson-Durbin Algorithm for Toeplitz Systems of Equations
- Simplified Treatment of Integrals of Cauchy Type, the Hilbert Problem and Singular Integral Equations. Appendix: Poincaré-Bertrand Formula
- Solution of Vandermonde systems of equations
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item