Stable solutions of linear systems involving long chain of matrix multiplications (Q541930): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114152388, #quickstatements; #temporary_batch_1710982311091
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3361799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jacobi’s Method is More Accurate than QR / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the singular value decomposition with high relative accuracy / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Fast and Accurate Jacobi SVD Algorithm. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Fast and Accurate Jacobi SVD Algorithm. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accuracy and Stability of Numerical Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4494865 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On graded QR decompositions of products of matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4220521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3998482 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition numbers and equilibration of matrices / rank
 
Normal rank

Latest revision as of 03:05, 4 July 2024

scientific article
Language Label Description Also known as
English
Stable solutions of linear systems involving long chain of matrix multiplications
scientific article

    Statements

    Stable solutions of linear systems involving long chain of matrix multiplications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 June 2011
    0 references
    The authors propose two numerical methods for solving linear system \((I_n + B_L \dots B_2 B_1)x=b\) arising from the Green's function calculation in the quantum Monte Carlo simulation of interacting electrons. The methods are based on the QR decomposition with column pivoting and the singular value decomposition, respectively, and provide a weakly backward stable solution.
    0 references
    graded QR decomposition
    0 references
    singular value decomposition
    0 references
    condition number
    0 references
    numerical stability
    0 references
    quantum Monte Carlo method
    0 references
    long chain of matrix multiplications
    0 references
    Green's function
    0 references
    interacting electrons
    0 references
    column pivoting
    0 references

    Identifiers

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