Stable solutions of linear systems involving long chain of matrix multiplications
From MaRDI portal
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.
Recommendations
Cites work
- Accuracy and Stability of Numerical Algorithms
- Computing the singular value decomposition with high relative accuracy
- Condition numbers and equilibration of matrices
- scientific article; zbMATH DE number 4215266 (Why is no real title available?)
- scientific article; zbMATH DE number 47363 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1486101 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Jacobi’s Method is More Accurate than QR
- New Fast and Accurate Jacobi SVD Algorithm. I
- New Fast and Accurate Jacobi SVD Algorithm. II
- On graded QR decompositions of products of matrices
Cited in
(3)
This page was built for publication: Stable solutions of linear systems involving long chain of matrix multiplications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q541930)