A fast algorithm for particle simulations
Journal of Computational Physics
Laplace's equation and the Dirichlet-Neumann map in multiply connected domains
Journal of Computational Physics
The convergence of Padé approximants to functions with branch points
Journal of Approximation Theory
Robust rational function approximation algorithm for model generation
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Padé approximants and noise: rational functions
Proceedings of the conference on Continued fractions and geometric function theory
Rapid Evaluation of Nonreflecting Boundary Kernels for Time-Domain Wave Propagation
SIAM Journal on Numerical Analysis
Journal of Computational Physics
Convergence of a Variant of the Zipper Algorithm for Conformal Mapping
SIAM Journal on Numerical Analysis
On the evaluation of layer potentials close to their sources
Journal of Computational Physics
Algorithm 882: Near-Best Fixed Pole Rational Interpolation with Applications in Spectral Methods
ACM Transactions on Mathematical Software (TOMS)
Journal of Computational Physics
Journal of Computational Physics
Journal of Computational and Applied Mathematics
Efficient discretization of Laplace boundary integral equations on polygonal domains
Journal of Computational Physics
Universal quadratures for boundary integral equations on two-dimensional domains with corners
Journal of Computational Physics
SIAM Journal on Scientific Computing
Least squares quantization in PCM
IEEE Transactions on Information Theory
Approximation Theory and Approximation Practice (Other Titles in Applied Mathematics)
Approximation Theory and Approximation Practice (Other Titles in Applied Mathematics)
Hi-index | 31.45 |
A computational scheme for solving 2D Laplace boundary-value problems using rational functions as the basis functions is described. The scheme belongs to the class of desingularized methods, for which the location of singularities and testing points is a major issue that is addressed by the proposed scheme, in the context he 2D Laplace equation. Well-established rational-function fitting techniques are used to set the poles, while residues are determined by enforcing the boundary conditions in the least-squares sense at the nodes of rational Gauss-Chebyshev quadrature rules. Numerical results show that errors approaching the machine epsilon can be obtained for sharp and almost sharp corners, nearly-touching boundaries, and almost-singular boundary data. We show various examples of these cases in which the method yields compact solutions, requiring fewer basis functions than the Nystrom method, for the same accuracy. A scheme for solving fairly large-scale problems is also presented.