A Fast Multilevel Algorithm for Integral Equations
Author:
- 1 April 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Numerical Analysis
- Vol. 32 (2) , 501-513
Abstract
We show how the discretization of integral equations by composite Gauss rules can be related to approximations of integral operators that converge in the operator norm, rather than strongly converge. From this norm convergent formulation a two-level approximate inverse can be constructed whose evaluation requires no fine mesh evaluations of the integral operator. The resulting multilevel algorithm, therefore, is roughly half as costly as the Atkinson–Brakhage iteration. The algorithm is applicable to both linear and nonlinear equations.Keywords
This publication has 18 references indexed in Scilit:
- Multilevel source iteration accelerators for the linear transport equation in slab geometryTransport Theory and Statistical Physics, 1995
- Fast Algorithms for Nonsmooth Compact Fixed-Point ProblemsSIAM Journal on Numerical Analysis, 1992
- A Survey of Numerical Methods for Solving Nonlinear Integral EquationsJournal of Integral Equations and Applications, 1992
- Reduced storage matrix methods in stiff ODE systemsApplied Mathematics and Computation, 1989
- Inaccuracy in quasi-Newton methods: Local improvement theorems1984
- Inexact Newton MethodsSIAM Journal on Numerical Analysis, 1982
- Solution of the Chandrasekhar H-equation by Newton’s MethodJournal of Mathematical Physics, 1980
- Solution ofH-Equations by IterationSIAM Journal on Mathematical Analysis, 1979
- Iterative variants of the Nystr m method for the numerical solution of integral equationsNumerische Mathematik, 1974
- Über die numerische Behandlung von Integralgleichungen nach der QuadraturformelmethodeNumerische Mathematik, 1960