Preconditioning of elliptic problems by approximation in the transform domain
DOI10.1007/BF02510358zbMath0890.65042OpenAlexW2024670688MaRDI QIDQ1378469
Publication date: 6 July 1998
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02510358
numerical resultsfinite elementsconjugate gradient methodfinite differencessparse matrixpreconditionersecond-order elliptic boundary value problemstransform approximation
Computational methods for sparse matrices (65F50) Boundary value problems for second-order elliptic equations (35J25) Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs (65N30) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Finite difference methods for boundary value problems involving PDEs (65N06)
Related Items
Cites Work
- Fast decimation-in-time algorithms for a family of discrete sine and cosine transforms
- A note on skewcirculant preconditioners for elliptic problems
- Circulant block-factorization preconditioners for elliptic problems
- Optimal trigonometric preconditioners for elliptic and queueing problems
- Sine transform based preconditioners for symmetric Toeplitz systems
- Finite Element Solution of Boundary Value Problems
- Block Preconditioning for the Conjugate Gradient Method
- Iterative Solution Methods and Preconditioners for Block-Tridiagonal Systems of Equations
- Semicirculant Preconditioners for First-Order Partial Differential Equations
- Sine transform based preconditioners for elliptic problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Preconditioning of elliptic problems by approximation in the transform domain