Complexity bounds for solving some tridiagonal systems with preconditioning
From MaRDI portal
Publication:1343622
DOI10.1007/BF02576177zbMath0838.65019MaRDI QIDQ1343622
G. Temperanza, Roberto Bevilacqua, Enrico Bozzo, Paolo Zellini
Publication date: 19 January 1995
Published in: Calcolo (Search for Journal in Brave)
Numerical computation of matrix norms, conditioning, scaling (65F35) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast parallel and sequential computations and spectral properties concerning band Toeplitz matrices
- Spectral and computational properties of band symmetric Toeplitz matrices
- On the inverse of band matrices
- On periodic block-tridiagonal matrices
- Sulla determinazione della inversa delle matrici tridiagonali e tridiagonali a blicchi
- On band matrices and their inverses
- Optimal Bounds for Solving Tridiagonal Systems with Preconditioning
- Accelerated Iterative Methods for the Solution of Tridiagonal Systems on Parallel Computers
- Properties of Some Tridiagonal Matrices and Their Application to Boundary Value Problems