Computation of the fundamental singular subspace of a large matrix (Q1355206): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Estimating the largest singular values of large sparse matrices via modified moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Davidson Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3692703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The iterative calculation of a few of the lowest eigenvalues and corresponding eigenvectors of large real-symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparse matrix test problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Block Lanczos Method for Computing the Singular Values and Corresponding Singular Vectors of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations of Davidson’s Method for Computing Eigenvalues of Sparse Symmetric Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at the Lanczos algorithm for solving symmetric systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lanczos Algorithm with Selective Orthogonalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preconditioning techniques for nonsymmetric and indefinite linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative algorithms for computing the singular subspace of a matrix associated with its smallest singular values / rank
 
Normal rank

Revision as of 12:41, 27 May 2024

scientific article
Language Label Description Also known as
English
Computation of the fundamental singular subspace of a large matrix
scientific article

    Statements

    Computation of the fundamental singular subspace of a large matrix (English)
    0 references
    0 references
    19 May 1997
    0 references
    The block Lanczos and the Davidson methods for computing a basis of a singular subspace associated with the smallest singular values of large matrices are discussed.
    0 references
    0 references
    fundamental singular subspace
    0 references
    large matrix
    0 references
    block Lanczos method
    0 references
    Davidson method
    0 references
    smallest singular values
    0 references