The Accuracy of Solutions to Triangular Systems
From MaRDI portal
Recommendations
- On the accuracy of solving triangular systems in parallel
- Accurate solutions of diagonally dominant tridiagonal linear systems
- scientific article; zbMATH DE number 17461
- On the accuracy of solving triangular systems in parallel. II
- An accurate tridiagonal equation solver
- On the solutions of tridiagonal linear systems
- Reliable Solution of Tridiagonal Systems of Linear Equations
- Solution of linear systems with verified accuracy
Cited in
(14)- Gaussian elimination: When is scaling beneficial!
- A geometric analysis of Gaussian elimination. II
- Scaled pivoting in Gauss and Neville elimination for totally positive systems
- Solution of augmented linear systems using orthogonal factorizations
- Perturbation and error analyses of the partitioned \textit{LU} factorization for block tridiagonal linear systems
- Perturbation and error analyses for block downdating of a Cholesky decomposition
- Compact cubic splines
- Newton interpolation using \(\Re \)-Leja sequences
- Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion
- scientific article; zbMATH DE number 3994890 (Why is no real title available?)
- Simulating Low Precision Floating-Point Arithmetic
- scientific article; zbMATH DE number 2202307 (Why is no real title available?)
- Probabilistic analyses of condition numbers
- Rounding error bounds for the Clenshaw and Forsythe algorithms for the evaluation of orthogonal polynomial series
This page was built for publication: The Accuracy of Solutions to Triangular Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4733301)
