The recursive tri-reduction method for tridiagonal linear systems
DOI10.1080/00207169108803996zbMATH Open0731.65015OpenAlexW2157863322MaRDI QIDQ3357421FDOQ3357421
Publication date: 1991
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207169108803996
Gaussian eliminationparallel algorithmstridiagonal matricestridiagonal linear systemsodd-even reductionrecursive tri-reduction method
Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Parallel numerical computation (65Y05)
Cites Work
Cited In (8)
- Recursive tridiagonalization of infinite dimensional Hamiltonians
- The numerical solution of periodic boundary value problems by the tri-reducton method
- A truncated cyclic reduction algorithm for interval arithmetic tridiagonal systems of equations
- The solution of periodic tridiagonal linear systems by the stride of 3 reduction algorithm
- Title not available (Why is that?)
- On the tripling algorithm for large-scale nonlinear matrix equations with low rank structure
- On recursive decoupling method for solving tridiagonal linear systems
- A specialised cyclic reduction algorithm for linear algebraic equation systems with quasi-tridiagonal matrices
Recommendations
- Title not available (Why is that?) 👍 👎
- A recursive decoupling method for solving tridiagonal linear systems 👍 👎
- On recursive decoupling method for solving tridiagonal linear systems 👍 👎
- Optimized cyclic reduction for the solution of linear tridiagonal systems on parallel computers 👍 👎
- Title not available (Why is that?) 👍 👎
This page was built for publication: The recursive tri-reduction method for tridiagonal linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3357421)
