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
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / review text
 
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.
Property / review text: 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. / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Iveta Hnetynkova / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F15 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A18 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 15A42 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 65F50 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6477412 / rank
 
Normal rank
Property / zbMATH Keywords
 
singular values
Property / zbMATH Keywords: singular values / rank
 
Normal rank
Property / zbMATH Keywords
 
lower bounds
Property / zbMATH Keywords: lower bounds / rank
 
Normal rank
Property / zbMATH Keywords
 
bidiagonal matrix
Property / zbMATH Keywords: bidiagonal matrix / rank
 
Normal rank
Property / zbMATH Keywords
 
matrix trace
Property / zbMATH Keywords: matrix trace / rank
 
Normal rank
Property / zbMATH Keywords
 
subtraction-free formula
Property / zbMATH Keywords: subtraction-free formula / rank
 
Normal rank
Property / zbMATH Keywords
 
algorithm
Property / zbMATH Keywords: algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
numerical experiment
Property / zbMATH Keywords: numerical experiment / rank
 
Normal rank

Revision as of 23:41, 30 June 2023

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