A fast numerical algorithm for solving nearly penta-diagonal linear systems
DOI10.1080/00207160.2012.665903zbMATH Open1258.65041OpenAlexW1965917178MaRDI QIDQ4903579FDOQ4903579
Qiongxiang Kong, Jiteng Jia, Tomohiro Sogabe
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)
Cites Work
- Title not available (Why is that?)
- The use of the factorization of five-diagonal matrices by tridiagonal Toeplitz matrices
- On the reconstruction of Toeplitz matrix inverses from columns
- The use of the Sherman-Morrison-Woodbury formula to solve cyclic block tri-diagonal and cyclic block penta-diagonal linear systems of equations
- A General Approach to Waveform Relaxation Solutions of Nonlinear Differential-Algebraic Equations: The Continuous-Time and Discrete-Time Cases
- A fast algorithm for solving special tridiagonal systems
- A computational algorithm for solving nearly penta-diagonal linear systems
- A note on solving nearly penta-diagonal linear systems
- On the Solution of Circulant Linear Systems
- New algorithms for solving periodic tridiagonal and periodic pentadiagonal linear systems
- Pent: A periodic pentadiagonal systems solver
- Symbolic algorithm for inverting cyclic pentadiagonal matrices recursively - derivation and implementation
- Generalized tridiagonal preconditioners for solving linear systems
- Symmetric centrosymmetric matrix-vector multiplication
- Cyclic and stride reduction methods for generalised tridiagonal matrices
- Two algorithms for solving general backward pentadiagonal linear systems
Cited In (8)
- Title not available (Why is that?)
- On the inverse and determinant of general bordered tridiagonal matrices
- Two fast algorithms for solving diagonal-plus-semiseparable linear systems.
- A fast numerical algorithm for the determinant of a pentadiagonal matrix
- A novel algorithm and its parallelization for solving nearly penta-diagonal linear systems
- A generalized symbolic Thomas algorithm for the solution of opposite-bordered tridiagonal linear systems
- A novel algorithm for solving quasi penta-diagonal linear systems
- On the determinant evaluation of quasi penta-diagonal matrices and quasi penta-diagonal Toeplitz matrices
Uses Software
This page was built for publication: A fast numerical algorithm for solving nearly penta-diagonal linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4903579)
