Answers are grounded in this paper and cite their sources.
A class of vector-space bases is introduced for the sparse representation of discretizations of integral operators. An operator with a smooth, nonoscillatory kernel possessing a finite number of singularities in each row or column is represented in these bases as a sparse matrix, to high precision. A method is presented that employs these bases for the numerical solution of second-kind integral equations in time bounded by O(nlog ² n), where n is the number of points in the discretization. Numerical results are given which demonstrate the effectiveness of the approach, and several generalizations and applications of the method are discussed.
No takes yet. Share an insight, caveat, or question.
Alpert et al. (1993) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: