A fast numerical algorithm for solving nearly penta-diagonal linear systems
Publication:4903579
DOI10.1080/00207160.2012.665903zbMath1258.65041OpenAlexW1965917178MaRDI QIDQ4903579
Ji-Teng Jia, Tomohiro Sogabe, Qiong-Xiang Kong
Publication date: 22 January 2013
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2012.665903
linear systemsdeterminantsSherman-Morrison-Woodbury formulanearly penta-diagonal matricescomputer algebra systems (CAS)
Factorization of matrices (15A23) Theory of matrix inversion and generalized inverses (15A09) Symbolic computation of special functions (Gosper and Zeilberger algorithms, etc.) (33F10)
Related Items (5)
Uses Software
Cites Work
- Unnamed Item
- New algorithms for solving periodic tridiagonal and periodic pentadiagonal linear systems
- Symbolic algorithm for inverting cyclic pentadiagonal matrices recursively - derivation and implementation
- The use of the Sherman-Morrison-Woodbury formula to solve cyclic block tri-diagonal and cyclic block penta-diagonal linear systems of equations
- The use of the factorization of five-diagonal matrices by tridiagonal Toeplitz matrices
- A fast algorithm for solving special tridiagonal systems
- Symmetric centrosymmetric matrix-vector multiplication
- On the reconstruction of Toeplitz matrix inverses from columns
- A computational algorithm for solving nearly penta-diagonal linear systems
- A note on solving nearly penta-diagonal linear systems
- Two algorithms for solving general backward pentadiagonal linear systems
- Generalized tridiagonal preconditioners for solving linear systems
- Pent: A periodic pentadiagonal systems solver
- On the Solution of Circulant Linear Systems
- A General Approach to Waveform Relaxation Solutions of Nonlinear Differential-Algebraic Equations: The Continuous-Time and Discrete-Time Cases
- Cyclic and stride reduction methods for generalised tridiagonal matrices
This page was built for publication: A fast numerical algorithm for solving nearly penta-diagonal linear systems