A parallel algorithm solving a tridiagonal Toeplitz linear system
From MaRDI portal
A new parallel algorithm, which is a variant of the Gaussian elimination method, is presented to solve a tridiagonal Toeplitz linear system. The algorithm requires a continued fraction and its analytic solution during the decomposition phase to minimize the decomposition overhead. The numerical properties and the computational efficiency of the algorithm are also discussed.
Recommendations
Cited in
(16)- A parallel solver for tridiagonal linear systems for distributed memory parallel computers
- Error analysis of parallel algorithm for the solution of a tridiagonal Toeplitz linear system of equations
- A fast algorithm for solving tridiagonal quasi-Toeplitz linear systems
- The parallel recursive decoupling algorithm for solving tridiagonal linear systems
- Fast solvers for tridiagonal Toeplitz linear systems
- scientific article; zbMATH DE number 4215256 (Why is no real title available?)
- scientific article; zbMATH DE number 5762985 (Why is no real title available?)
- Variant of the Thomas algorithm for opposite-bordered tridiagonal systems of equations
- scientific article; zbMATH DE number 5629970 (Why is no real title available?)
- A fast parallel algorithm for the solution of tridiagonal linear systems
- scientific article; zbMATH DE number 4001307 (Why is no real title available?)
- scientific article; zbMATH DE number 1894937 (Why is no real title available?)
- Computational Science – ICCS 2005
- Error analysis of an APA algorithm for the parallel solution of some special Toeplitz linear systems
- Parallel Processing and Applied Mathematics
- A multilevel parallel algorithm to solve symmetric Toeplitz linear systems
This page was built for publication: A parallel algorithm solving a tridiagonal Toeplitz linear system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803716)