New estimates for the recursive low-rank truncation of block-structured matrices (Q2634610): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00211-015-0716-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2031215441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of \(\mathcal H\)-matrix approximants to the inverse FE-matrix of elliptic operators with \(L^\infty\)-coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the singular value decomposition with high relative accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate Computation of the Product-Induced Singular Value Decomposition with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction and arithmetics of \(\mathcal H\)-matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchische Matrizen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Spaces and Numerical Tensor Calculus / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchical matrices based on a weak admissibility criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable and Efficient Spectral Divide and Conquer Algorithms for the Symmetric Eigenvalue Decomposition and the SVD / rank
 
Normal rank

Latest revision as of 10:34, 11 July 2024

scientific article
Language Label Description Also known as
English
New estimates for the recursive low-rank truncation of block-structured matrices
scientific article

    Statements

    New estimates for the recursive low-rank truncation of block-structured matrices (English)
    0 references
    17 February 2016
    0 references
    The author describes a cheap algorithm for the best approximation of a given matrix by a low-rank one. The algorithm uses a recursive truncation and is an obvious divide and conquer method, based on the QR and SVD decomposition.
    0 references
    low-rank truncation
    0 references
    singular value decomposition
    0 references
    block decomposition
    0 references
    recursive truncation
    0 references
    0 references

    Identifiers