A fast direct solver for boundary integral equations in two dimensions
type: Item
instance of: scholarly article
title: A fast direct solver for boundary integral equations in two dimensions
zbMATH Open document ID: 1078.65112
published in: Journal of Computational Physics
publication date: 2005-06-13T00:00:00Z
full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary
review text: The authors are concerned with important linear algebra issues associated with the discretization of boundary integral equations involving non-oscillatory kernels. They elaborate a fast numerical technique in order to provide directly a compressed (``data-sparse'') factorization of the inverse of a large matrix which comes with the discretization process. The compression algorithm is carefully analyzed and several examples are carried out in order to underline the efficiency of the technique.
Mathematics Subject Classification ID: 65N38
Mathematics Subject Classification ID: 65F05
Mathematics Subject Classification ID: 31A10
Mathematics Subject Classification ID: 35J05
Mathematics Subject Classification ID: 65Y20
zbMATH DE Number: 2175593
zbMATH Keywords: classical potential theory equations
zbMATH Keywords: boundary integral equations
zbMATH Keywords: non-oscillatory kernels
zbMATH Keywords: two dimensions
zbMATH Keywords: Nyström discretization
zbMATH Keywords: inverse of a matrix
zbMATH Keywords: compressed factorization
zbMATH Keywords: computational complexity
zbMATH Keywords: algorithm
zbMATH Keywords: numerical examples
zbMATH Keywords: direct matrix inversion
author: P. G. Martinsson
author: Vladimir Rokhlin
reviewed by: Calin Ioan Gheorghiu
MaRDI profile type: Publication
OpenAlex ID: W4294988936
cites work: A fast, direct algorithm for the Lippmann-Schwinger integral equation in two dimensions
cites work: On the Compression of Low Rank Matrices
cites work: LU factorization of non-standard forms and direct multiresolution solvers
cites work: Q5689624
cites work: Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization
cites work: A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices
cites work: Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices
cites work: High-Order Corrected Trapezoidal Quadrature Rules for Singular Functions
DOI: 10.1016/J.JCP.2004.10.033
description: scientific article; zbMATH DE number 2175593