Stability and sensitivity of tridiagonal LU factorization without pivoting
From MaRDI portal
Publication:2566632
DOI10.1007/s10543-004-6025-7zbMath1082.65033OpenAlexW1977758203MaRDI QIDQ2566632
Froilán M. Dopico, María Isabel Bueno
Publication date: 26 September 2005
Published in: BIT (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10543-004-6025-7
Computational methods for sparse matrices (65F50) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (5)
Stability of block \(LU\) factorization for block tridiagonal block \(H\)-matrices ⋮ Structured condition numbers for some matrix factorizations of structured matrices ⋮ Accurate solutions of diagonally dominant tridiagonal linear systems ⋮ Structured condition numbers and statistical condition estimation for the \(LDU\) factorization ⋮ Perturbation and error analyses of the partitioned \textit{LU} factorization for block tridiagonal linear systems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Perturbation bounds for the \(LDL^ H\) and LU decompositions
- Sensitivity analyses for factorizations of sparse or structured matrices
- Componentwise perturbation bounds for some matrix decompositions
- On the sensitivity of the LU factorization
- Accurate singular values and differential qd algorithms
- Darboux transformation and perturbation of linear functionals
- Computing the singular value decomposition with high relative accuracy
- On the perturbation of LU and Cholesky factors
- On the Perturbation of LU, Cholesky, and QR Factorizations
- Algebraic Methods for Modified Orthogonal Polynomials
- Accuracy and Stability of Numerical Algorithms
- An Implemention of Christoffel's Theorem in the Theory of Orthogonal Polynomials
This page was built for publication: Stability and sensitivity of tridiagonal LU factorization without pivoting
