A fast direct solver for boundary integral equations in two dimensions (Q1780663): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A fast, direct algorithm for the Lippmann-Schwinger integral equation in two dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Compression of Low Rank Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: LU factorization of non-standard forms and direct multiresolution solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Computing a Strong Rank-Revealing QR Factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A sparse matrix arithmetic based on \({\mathfrak H}\)-matrices. I: Introduction to \({\mathfrak H}\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Data-sparse approximation by adaptive \({\mathcal H}^2\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-Order Corrected Trapezoidal Quadrature Rules for Singular Functions / rank
 
Normal rank

Latest revision as of 12:35, 10 June 2024

scientific article
Language Label Description Also known as
English
A fast direct solver for boundary integral equations in two dimensions
scientific article

    Statements

    A fast direct solver for boundary integral equations in two dimensions (English)
    0 references
    13 June 2005
    0 references
    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.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    classical potential theory equations
    0 references
    boundary integral equations
    0 references
    non-oscillatory kernels
    0 references
    two dimensions
    0 references
    Nyström discretization
    0 references
    inverse of a matrix
    0 references
    compressed factorization
    0 references
    computational complexity
    0 references
    algorithm
    0 references
    numerical examples
    0 references
    direct matrix inversion
    0 references
    0 references
    0 references
    0 references