Approximate polynomial preconditionings applied to biharmonic equations
From MaRDI portal
Publication:547496
DOI10.1007/BF00129846zbMath1215.65054MaRDI QIDQ547496
Publication date: 2 July 2011
Published in: The Journal of Supercomputing (Search for Journal in Brave)
conjugate gradient methodbiharmonic equationpolynomial preconditioningapproximate preconditionervector computer
Ill-posedness and regularization problems in numerical linear algebra (65F22) Preconditioners for iterative methods (65F08)
Related Items
Numerical simulations for transonic aerodynamic flows, A high-order kernel-free boundary integral method for the biharmonic equation on irregular domains
Cites Work
- Unnamed Item
- Unnamed Item
- The performance of FORTRAN implementations for preconditioned conjugate gradients on vector computers
- Solving large elliptic difference equations on CYBER 205
- Approximating the inverse of a matrix for use in iterative algorithms on vector processors
- Matrix multiplication by diagonals on a vector/parallel processor
- A second order finite difference analog of the first biharmonic boundary value problem
- Polynomial Preconditioners for Conjugate Gradient Calculations
- m-Step Preconditioned Conjugate Gradient Methods
- Practical Use of Polynomial Preconditionings for the Conjugate Gradient Method
- Efficient Implementation of a Class of Preconditioned Conjugate Gradient Methods
- A Vectorizable Variant of some ICCG Methods
- An Iterative Solution Method for Linear Systems of Which the Coefficient Matrix is a Symmetric M-Matrix
- A class of first order factorization methods
- Fast Numerical Solution of the Biharmonic Dirichlet Problem on Rectangles