An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem (Q2936585): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/130945995 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027044527 / rank
 
Normal rank

Revision as of 03:48, 20 March 2024

scientific article
Language Label Description Also known as
English
An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem
scientific article

    Statements

    An Accelerated Divide-and-Conquer Algorithm for the Bidiagonal SVD Problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 December 2014
    0 references
    divide-and-conquer algorithm
    0 references
    bidiagonal matrices
    0 references
    Cauchy-like matrices
    0 references
    Schur complements
    0 references
    numerical examples
    0 references
    singular value decomposition
    0 references
    hierarchically semiseparable (HSS) matrices
    0 references
    symmetric tridiagonal eigenvalue problem
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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