Linear complexity parallel algorithms for linear systems of equations with recursive structure
DOI10.1016/0024-3795(87)90113-3zbMath0624.65020MaRDI QIDQ578844
Israel Gohberg, Peter Lancaster, Thomas Kailath, Israel Koltracht
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
stability; numerical examples; fast algorithms; Hankel matrix; Vandermonde matrix; matrix inversion; Hilbert matrix; recursive structure; triangular factorization; Levinson's algorithm; linear complexity parallel algorithms; strongly regular symmetric Toeplitz matrices; UDL factorization
15A09: Theory of matrix inversion and generalized inverses
65Y05: Parallel numerical computation
65F05: Direct numerical methods for linear systems and matrix inversion
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