Symplectic factorizations and parallel iterative algorithms for tridiagonal systems of equations

DOI10.1007/BF02576181zbMath0793.65021WikidataQ114233779 ScholiaQ114233779MaRDI QIDQ1324744

Roberto Bevilacqua, Paolo Zellini, Luca Bergamaschi

Publication date: 26 May 1994

Published in: Calcolo (Search for Journal in Brave)

zbMATH Keywords

convergencetridiagonal systemsparallel iterative algorithmssymplectic factorization

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Parallel numerical computation (65Y05)

Related Items

On algebras related to the discrete cosine transform

Cites Work

• Unnamed Item
• A Schur decomposition for Hamiltonian matrices
• A symplectic method for approximating all the eigenvalues of a Hamiltonian matrix
• On some parallel banded system solvers
• Numerical linear algorithms and group theory
• On some algebraic problems in connection with general eigenvalue algorithms
• Matrix factorizations for symplectic QR-like methods
• Parallel Tridiagonal Equation Solvers
• The Solution of Tridiagonal Linear Systems on the CDC STAR 100 Computer
• Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers
• A Parallel QR Algorithm for Symmetric Tridiagonal Matrices
• On Stable Parallel Linear System Solvers
• A symplectic QR like algorithm for the solution of the real algebraic Riccati equation
• An Efficient Parallel Algorithm for the Solution of a Tridiagonal Linear System of Equations