Rapid solution of integral equations of classical potential theory (Q1094119)

From MaRDI portal
Revision as of 02:10, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
scientific article
Language Label Description Also known as
English
Rapid solution of integral equations of classical potential theory
scientific article

    Statements

    Rapid solution of integral equations of classical potential theory (English)
    0 references
    0 references
    1985
    0 references
    A rapid solution of integral equations is described which is applicable to Dirichlet and Neumann boundary value problems for the Laplace equation. The method has computational requirements proportional to n, where n is the number of nodes on the boundary. It uses the classical approach of transforming the problem to an integral equation for the single or double layer potential on the boundary. This equation is then discretized using the Nyström algorithm associated with the trapezoidal quadrature rule. The resulting system is solved by the generalized conjugate residual algorithm (GCRA). The decrease of computational requirements is achieved by reducing the number of operations needed for applying a matrix to a vector in the process of solving by the GCRA. This is made possible by approximations based on harmonic expansions. The algorithm is tested on some standard problems which confirm the theoretically predicted properties. It must, however, be kept in mind that the method is superior to fast Poisson solvers only when the solution in a limited number of points outside the boundary is required.
    0 references
    0 references
    boundary integral equation method
    0 references
    comparison of methods
    0 references
    Laplace equation
    0 references
    single or double layer potential
    0 references
    Nyström algorithm
    0 references
    trapezoidal quadrature rule
    0 references
    conjugate residual algorithm
    0 references
    harmonic expansions
    0 references
    fast Poisson solvers
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references