A direct solver with O ( N ) complexity for integral equations on one-dimensional domains

@inproceedings{Gillman2012ADS,
  title={A direct solver with O ( N ) complexity for integral equations on one-dimensional domains},
  author={Adrianna Gillman and Patrick M. Young and Per-Gunnar Martinsson},
  year={2012}
}
An algorithm for the direct inversion of the linear systems arising from Nyström discretization of integral equations on one-dimensional domains is described. The method typically has O(N) complexity when applied to boundary integral equations (BIEs) in the plane with non-oscillatory kernels such as those associated with the Laplace and Stokes’ equations. The scaling coefficient suppressed by the “big-O” notation depends logarithmically on the requested accuracy. The method can also be applied… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 41 extracted citations

On the Stability of Some Hierarchical Rank Structured Matrix Algorithms

SIAM J. Matrix Analysis Applications • 2016
View 6 Excerpts
Highly Influenced

Fast Sparse Selected Inversion

SIAM J. Matrix Analysis Applications • 2015
View 7 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-10 of 28 references

A hierarchical O(N log N) force-calculation algorithm

Nature • 1986
View 4 Excerpts
Highly Influenced

Efficient Numerical Methods for Non-local Operators: H 2-matrix Compression, Algorithms and Analysis

S. Börm
European Mathematics Society, • 2010
View 1 Excerpt

Fast algorithms for hierarchically semiseparable matrices

S Chandrasekaran, M Gu, X SLi, J. Xia
Numer Linear Algebra Appl, • 2010
View 1 Excerpt

Similar Papers

Loading similar papers…