On finding robust approximate inverses for large sparse matrices (Q2929473): Difference between revisions

From MaRDI portal
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.1080/03081087.2013.825910 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1968844996 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast wavelet transforms and numerical algorithms I / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of iterative methods for computing Moore-Penrose inverse of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inversion formula for a matrix polynomial about a (unit) root / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dominance notion for singular matrices with applications to nonnegative generalized inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: A family of iterative methods for computing the approximate inverse of a square matrix and inner inverse of a non-square matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chebyshev-type methods and preconditioning techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing and regularization with modified sparse approximate inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Inverses of Linear Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Successive matrix squaring algorithm for computing outer inverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4814497 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stair Matrices and Their Generalizations with Applications to Iterative Methods I: A Generalization of the Successive Overrelaxation Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Mathematica GuideBook for Numerics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematica in Action / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Numerical Properties of an Iterative Method for Computing the Moore–Penrose Generalized Inverse / rank
 
Normal rank

Latest revision as of 06:34, 9 July 2024

scientific article
Language Label Description Also known as
English
On finding robust approximate inverses for large sparse matrices
scientific article

    Statements

    On finding robust approximate inverses for large sparse matrices (English)
    0 references
    12 November 2014
    0 references
    approximate matrix inversion
    0 references
    large sparse complex matrices
    0 references
    Schulz iterations
    0 references
    Moore-Penrose inverse
    0 references
    parallel computation
    0 references
    numerical examples
    0 references
    error estimate
    0 references
    convergence
    0 references
    preconditioner
    0 references
    generalized minimal residual (GMRES) method
    0 references
    rectangular matrix
    0 references
    algorithm
    0 references

    Identifiers

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