A direct solver for a class of symmetric linear systems
From MaRDI portal
Publication:2367566
The authors suggest a new direct method for solving a special symmetric block tridiagonal system. The algorithm is based on the Cramer-rule and the use of Chebyshev polynomials and costs \(O(N^ 3)\) operations, where \(N\) is the common size of blocks and the matrix contains \(N\times N\) blocks.
Recommendations
Cites work
- A Cyclic Reduction Algorithm for Solving Block Tridiagonal Systems of Arbitrary Dimension
- A Fast Direct Solution of Poisson's Equation Using Fourier Analysis
- A Generalized Cyclic Reduction Algorithm
- An O(n^2 ) Method for Solving Constant Coefficient Boundary Value Problems in Two Dimensions
- Comparison of performance of three parallel versions of the block cyclic reduction algorithm for solving linear elliptic partial differential equations
- Direct methods for the solution of the discrete Poisson equation: some comparisons
- Fast Poisson solvers on general two dimensional regions for the Dirichlet problem
- General scheme for solving linear algebraic problems by direct methods
- On Direct Methods for Solving Poisson’s Equations
- Some Aspects of the Cyclic Reduction Algorithm for Block Tridiagonal Linear Systems
Cited in
(6)- Fast direct solvers for some complex symmetric block Toeplitz linear systems
- A symmetric linear system solver
- Direct method for a class of symmetric linear systems
- scientific article; zbMATH DE number 1071788 (Why is no real title available?)
- scientific article; zbMATH DE number 1159774 (Why is no real title available?)
- scientific article; zbMATH DE number 908202 (Why is no real title available?)
This page was built for publication: A direct solver for a class of symmetric linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2367566)
