Construction and arithmetics of \(\mathcal H\)-matrices (Q1408972)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Construction and arithmetics of \(\mathcal H\)-matrices
scientific article

    Statements

    Construction and arithmetics of \(\mathcal H\)-matrices (English)
    0 references
    0 references
    0 references
    0 references
    28 September 2003
    0 references
    The authors give a detailed analysis of the complexity of hierarchical matrices. It is very well pointed out that such an analysis resides on two main criteria related to sparsity and idempotency. For standard finite element and boundary element applications an algorithm for the construction of hierarchical matrix format is also presented. Explicit bounds for the sparsity and idempotency are given.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    hierarchical matrices
    0 references
    data-sparse approximations
    0 references
    formated matrix operations
    0 references
    fast solvers
    0 references
    complexity
    0 references
    boundary element
    0 references
    algorithm
    0 references
    0 references
    0 references