Adaptive low-rank approximation of collocation matrices (Q1404541)

From MaRDI portal
Revision as of 04:46, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/computing/BebendorfR03, #quickstatements; #temporary_batch_1731468600454)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Adaptive low-rank approximation of collocation matrices
scientific article

    Statements

    Adaptive low-rank approximation of collocation matrices (English)
    0 references
    0 references
    0 references
    0 references
    21 August 2003
    0 references
    In this paper there is dealt with the solution of integral equations using collocation methods with almost linear complexity. There are used fast multipole, panel clustering and \(H\)-matrix methods which gain their efficiency from approximating the kernel function. The proposed \(H\)-matrix algorithm is purely algebraic. A new algorithm for matrix partitioning significantly reducing the number of blocks generated is presented.
    0 references
    integral equations
    0 references
    hierarchical matrices
    0 references
    low-rank approximation
    0 references
    fast solvers
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references