A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix (Q494684): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006321608 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.2350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some large-scale matrix computation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimations of the trace of powers of positive self-adjoint operators by extrapolation of the moments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A floating-point technique for extending the available precision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate singular values and differential qd algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5851422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for the smallest singular value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurate computation of singular values in terms of shifted integrable schemes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Gershgorin-type lower bound for the smallest singular value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further lower bounds for the smallest singular value / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conserved quantities of the discrete finite Toda equation and lower bounds of the minimal singular value of upper bidiagonal matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the smallest singular value / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Orthogonal qd-Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error analysis of the mdLVs algorithm for computing bidiagonal singular values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further bounds for the smallest singular value and the spectral condition number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5674306 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2935586 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of the Kato-Temple inequality on matrix eigenvalues to the dqds algorithm for singular values / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a lower bound for the smallest singular value / rank
 
Normal rank

Latest revision as of 17:44, 10 July 2024

scientific article
Language Label Description Also known as
English
A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix
scientific article

    Statements

    A new subtraction-free formula for lower bounds of the minimal singular value of an upper bidiagonal matrix (English)
    0 references
    0 references
    0 references
    0 references
    1 September 2015
    0 references
    Traces of inverse powers of a matrix \(BB^T\) determine lower bounds of the smallest singular value of an upper bidiagonal matrix \(B\) with positive entries on both diagonals. Several approaches to the computation of these traces have been studied previously, including one subtraction-free formula. This paper derives another subtraction-free formula different from the previous one. An algorithm for its computation is presented. A comparison of computational costs shows that the evaluation of the new formula requires less operations than the previously proposed one. An efficient implementation of the algorithm for the special case of the second power is included. Numerical experiments conclude the paper.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    singular values
    0 references
    lower bounds
    0 references
    bidiagonal matrix
    0 references
    matrix trace
    0 references
    subtraction-free formula
    0 references
    algorithm
    0 references
    numerical experiment
    0 references
    0 references
    0 references