Rapid solution of integral equations of classical potential theory
V Rokhlin - Journal of computational physics, 1985 - Elsevier
Journal of computational physics, 1985•Elsevier
An algorithm is described for rapid solution of classical boundary value problems (Dirichlet
an Neumann) for the Laplace equation based on iteratively solving integral equations of
potential theory. CPU time requirements for previously published algorithms of this type are
proportional to n 2, where n is the number of nodes in the discretization of the boundary of
the region. The CPU time requirements for the algorithm of the present paper are
proportional to n, making it considerably more practical for large scale problems.
an Neumann) for the Laplace equation based on iteratively solving integral equations of
potential theory. CPU time requirements for previously published algorithms of this type are
proportional to n 2, where n is the number of nodes in the discretization of the boundary of
the region. The CPU time requirements for the algorithm of the present paper are
proportional to n, making it considerably more practical for large scale problems.
Abstract
An algorithm is described for rapid solution of classical boundary value problems (Dirichlet an Neumann) for the Laplace equation based on iteratively solving integral equations of potential theory. CPU time requirements for previously published algorithms of this type are proportional to n2, where n is the number of nodes in the discretization of the boundary of the region. The CPU time requirements for the algorithm of the present paper are proportional to n, making it considerably more practical for large scale problems.
Elsevier
以上显示的是最相近的搜索结果。 查看全部搜索结果