Conjugate gradient algorithms and the Galerkin boundary element method

DOI10.1016/j.camwa.2004.02.002zbMath1063.65129OpenAlexW2007531051MaRDI QIDQ1767944

O. O. Ademoyero, S. C. Parkhurst, Michael Bartholomew-Biggs, Alan J. Davies

Publication date: 8 March 2005

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.camwa.2004.02.002

zbMATH Keywords

Galerkin methodLaplace equationBoundary elementsPreconditioningNumerical resultsConjugate gradientLinear solversQMR algorithm

Mathematics Subject Classification ID

Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Laplace operator, Helmholtz equation (reduced wave equation), Poisson equation (35J05) Boundary element methods for boundary value problems involving PDEs (65N38)

Cites Work

• Unnamed Item
• Unnamed Item
• On the use of conjugate gradient-type methods for boundary integral equations
• Relaxationsmethoden bester Strategie zur Lösung linearer Gleichungssysteme
• A conjugate direction algorithm without line searches
• Computational linear algebra issues in the Galerkin boundary element method
• Singular integrals and boundary elements
• Numerical experience with iterative methods for equality constrained nonlinear programming problems
• Methods of conjugate gradients for solving linear systems

This page was built for publication: Conjugate gradient algorithms and the Galerkin boundary element method