A cross-product approach for low-rank approximations of large matrices (Q2293619): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q126824126, #quickstatements; #temporary_batch_1722518891357
 
(12 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: JDQR / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PRIMME / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TRLan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: IRAM / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PHSVDS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: JDQZ / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: na26 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PRIMME_SVDS / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: a-TRLan / rank
 
Normal rank
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.1016/j.cam.2019.112576 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2984062689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: IRBL: An Implicitly Restarted Block-Lanczos Method for Large-Scale Hermitian Eigenproblems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmented Implicitly Restarted Lanczos Bidiagonalization Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restarted block Lanczos bidiagonalization methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicitly restarted block Lanczos bidiagonalization method using Leja shifts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4868585 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implicit restarted Lanczos method for large symmetric eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extremum properties of orthogonal quotients matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices II: Computing a Low-Rank Approximation to a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Monte Carlo Algorithms for Matrices III: Computing a Compressed Approximate Matrix Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast monte-carlo algorithms for finding low-rank approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4917542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implicitly Restarted Refined Bidiagonalization Lanczos Method for Computing a Partial Singular Value Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized algorithms for the low-rank approximation of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On restarting the Arnoldi method for large nonsymmetric eigenvalue problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3868672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Methods for Large Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implicit Application of Polynomial Filters in a <i>k</i>-Step Arnoldi Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matrix Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matrix Eigenvalue Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thick-Restart Lanczos Method for Large Symmetric Eigenvalue Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIMME_SVDS: A High-Performance Preconditioned SVD Solver for Accurate Large-Scale Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Preconditioned Hybrid SVD Method for Accurately Computing Singular Triplets of Large Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adaptive Projection Subspace Dimension for the Thick-Restart Lanczos Method / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q126824126 / rank
 
Normal rank

Latest revision as of 15:30, 1 August 2024

scientific article
Language Label Description Also known as
English
A cross-product approach for low-rank approximations of large matrices
scientific article

    Statements

    A cross-product approach for low-rank approximations of large matrices (English)
    0 references
    0 references
    5 February 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    low-rank approximations
    0 references
    large sparse matrices
    0 references
    restarted Krylov methods
    0 references
    reduced storage approach
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references