Numerical algorithms for the fast and reliable solution of periodic tridiagonal Toeplitz linear systems
From MaRDI portal
Publication:6660859
DOI10.1007/S11075-024-01795-YMaRDI QIDQ6660859
Publication date: 10 January 2025
Published in: Numerical Algorithms (Search for Journal in Brave)
Computational methods for sparse matrices (65F50) Factorization of matrices (15A23) Numerical computation of determinants (65F40) Linear equations (linear algebraic aspects) (15A06) Numerical analysis (65-XX)
Cites Work
- Analytical inversion of general periodic tridiagonal matrices
- The use of the Sherman-Morrison-Woodbury formula to solve cyclic block tri-diagonal and cyclic block penta-diagonal linear systems of equations
- High order accurate, one-sided finite-difference approximations to concentration gradients at the boundaries, for the simulation of electrochemical reaction-diffusion problems in one-dimensional space geometry.
- A fast algorithm for solving tridiagonal quasi-Toeplitz linear systems
- A specialised cyclic reduction algorithm for linear algebraic equation systems with quasi-tridiagonal matrices
- A new computational algorithm for solving periodic tri-diagonal linear systems
- A breakdown-free algorithm for computing the determinants of periodic tridiagonal matrices
- Mathematical Modeling of Biosensors
- A Parallel Elimination Method for "Periodic" Tridiagonal Systems
- The solution of periodic tridiagonal linear systems by the stride of 3 reduction algorithm
- Fast algorithms for perturbed Toeplitz-plus-Hankel system based on discrete cosine transform and their applications
- A structure preserving matrix factorization for solving general periodic pentadiagonal Toeplitz linear systems
This page was built for publication: Numerical algorithms for the fast and reliable solution of periodic tridiagonal Toeplitz linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6660859)
