Recompression techniques for adaptive cross approximation (Q732338)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Recompression techniques for adaptive cross approximation
scientific article

    Statements

    Recompression techniques for adaptive cross approximation (English)
    0 references
    9 October 2009
    0 references
    The adaptive cross approximation method (ACA) generates low-rank approximations to suitable \(m\times n\) sub-blocks of discrete integral formulations of elliptic boundary value problems. The discretization method by which the sub-blocks are obtained from the integral operator is either the Nyström, the collocation or the Galerkin method. ACA requires \(k(m+n)\), \(k\sim|\log \varepsilon|\) (\(\varepsilon \) represents the approximation accuracy) units of storage and is generated in a purely algebraic manner using only few of matrix entries. Also it is an adaptive algorithm, i.e. the rank of approximation is determined during the approximation. The authors present recompression techniques based on optimized singular value decomposition, Chebyshev approximation and discrete cosine transform. The required amount of storage is brought down to sublinear order \(kk'\), where \(k'\) depends logarithmically on \(\varepsilon \) but is independent of the matrix size. Numerical results support the derived estimates.
    0 references
    adaptive cross approximation
    0 references
    integral equation method
    0 references
    hierarchical matrices
    0 references
    Nyström method
    0 references
    elliptic boundary value problems
    0 references
    collocation
    0 references
    Galerkin method
    0 references
    algorithm
    0 references
    singular value decomposition
    0 references
    Chebyshev approximation
    0 references
    discrete cosine transform
    0 references
    numerical results
    0 references
    0 references
    0 references

    Identifiers