A fast algorithm for solving Toeplitz penta-diagonal systems

DOI10.1016/J.AMC.2009.11.026MaRDI QIDQ2266958zbMATH OpenOpenAlexFDO

Authors S. S. Nemani

Publication date 26 February 2010

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2009.11.026

zbMATH Keywords

error analysesfast solverlinear equationLU factorizationpenta diagonal linear systemperturbed systemToeplitz matrix

Mathematics Subject Classification ID

Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50)

Review text

The author describes a fast solver of linear systems \(Ax = b\) with \(A\) in Toeplitz diagonally dominant penta diagonal form. The method perturbs the system matrix \(A = A' + C\) so that \(A' = LU\) has a 3-diagonal Toeplitz LU factorization and \(C\) is the sum of two dyads specified by the entries of \(L\) and \(U\) and uses subsequent corrections. Detailed operations counts and error analyses are supplied.

Recommendations

• A fast algorithm for solving a Toeplitz system
• A fast algorithm for solving special tridiagonal systems
• A fast algorithm for solving diagonally dominant symmetric pentadiagonal Toeplitz systems
• A fast algorithm for solving diagonally dominant symmetric quasi-pentadiagonal Toeplitz linear systems
• An algorithm for solving nonsymmetric penta-diagonal Toeplitz linear systems

Cites work

• A fast algorithm for solving special tridiagonal systems
• A new method for solving symmetric circulant tridiagonal systems of linear equations
• An Efficient Method for Second Order Boundary Value Problems with Two Point Boundary Conditions
• Efficient solution of a partial integro-differential equation in finance
• scientific article; zbMATH DE number 3254460 (Why is no real title available?)
• Parallel algorithms for solving tridiagonal and near-circulant systems.
• The use of the factorization of five-diagonal matrices by tridiagonal Toeplitz matrices

Cited in

(17)

• A fast algorithm for solving special tridiagonal systems
• On solving pentadiagonal linear systems via transformations
• On a homogeneous recurrence relation for the determinants of general pentadiagonal Toeplitz matrices
• A fast method for solving quasi-pentadiagonal Toeplitz linear systems and its application to the Lax-Wendroff scheme
• An algorithm for solving nonsymmetric penta-diagonal Toeplitz linear systems
• scientific article; zbMATH DE number 5563624 (Why is no real title available?)
• Pent: A periodic pentadiagonal systems solver
• A structure-preserving algorithm for linear systems with circulant pentadiagonal coefficient matrices
• A pseudo symmetric fast algorithm for solving Toeplite systems
• Numerical algorithm for the determinant evaluation of cyclic pentadiagonal matrices with Toeplitz structure
• A fast algorithm for solving a Toeplitz system
• A structure preserving matrix factorization for solving general periodic pentadiagonal Toeplitz linear systems
• Fast algorithms for the solution of perturbed symmetric Toeplitz linear system and its applications
• A fast solver for pentadiagonal Toeplitz systems with multiple right-hand sides
• A tridiagonalization-based arbitrary-stride reduction approach for (p,q)-pentadiagonal linear systems
• A fast algorithm for solving diagonally dominant symmetric quasi-pentadiagonal Toeplitz linear systems
• A fast algorithm for solving diagonally dominant symmetric pentadiagonal Toeplitz systems

This page was built for publication: A fast algorithm for solving Toeplitz penta-diagonal systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2266958)