Perturbation theory for the LDU factorization and accurate computations for diagonally dominant matrices
From MaRDI portal
Publication:644775
DOI10.1007/S00211-011-0382-3zbMATH Open1254.65042OpenAlexW2071653647MaRDI QIDQ644775FDOQ644775
Recommendations
- A New Perturbation Bound for the LDU Factorization of Diagonally Dominant Matrices
- Accurate and efficient LDU decomposition of diagonally dominant M-matrices
- Relative perturbation theory for diagonally dominant matrices
- Accurate and efficient \(LDU\) decomposition of almost diagonally dominant \(Z\)-matrices
- Accurate solutions of diagonally dominant tridiagonal linear systems
Cites Work
- scientific article; zbMATH DE number 3760340 (Why is no real title available?)
- scientific article; zbMATH DE number 194139 (Why is no real title available?)
- scientific article; zbMATH DE number 3473182 (Why is no real title available?)
- scientific article; zbMATH DE number 1235882 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A lower bound for the smallest singular value of a matrix
- Accuracy and Stability of Numerical Algorithms
- Accurate Computation of the Product-Induced Singular Value Decomposition with Applications
- Accurate SVDs of polynomial Vandermonde matrices involving orthonormal polynomials
- Accurate SVDs of weakly diagonally dominant M-matrices
- Accurate Singular Value Decompositions of Structured Matrices
- Accurate Singular Values of Bidiagonal Matrices
- Accurate Symmetric Rank Revealing and Eigendecompositions of Symmetric Structured Matrices
- Accurate computation of the smallest eigenvalue of a diagonally dominant \(M\)-matrix
- Accurate singular values and differential qd algorithms
- Accurate solution of structured linear systems via rank-revealing decompositions
- An Orthogonal High Relative Accuracy Algorithm for the Symmetric Eigenproblem
- Asymptotics for steady-state tail probabilities in structured markov queueing models
- Combinatorial preconditioners for scalar elliptic finite-element problems
- Computing Accurate Eigensystems of Scaled Diagonally Dominant Matrices
- Computing singular values of diagonally dominant matrices to high relative accuracy
- Computing the singular value decomposition with high relative accuracy
- Convergence Properties of the Spline Fit
- Effectively Well-Conditioned Linear Systems
- Entrywise perturbation theory for diagonally dominant M-matrices with applications
- Implicit standard Jacobi gives high relative accuracy
- Jacobi’s Method is More Accurate than QR
- LDU decompositions with \(L\) and \(U\) well conditioned
- Matrix Analysis
- New Fast and Accurate Jacobi SVD Algorithm. I
- New Fast and Accurate Jacobi SVD Algorithm. II
- On computing accurate singular values and eigenvalues of matrices with acyclic graphs
- On diagonal dominance arguments for bounding \(\| A^{-1}\|_\infty\)
- On the asymptotic behaviour of the stationary distribution of markov chains of M/G/1-type
- Pivoting strategies leading to diagonal dominance by rows
- Relative Perturbation Techniques for Singular Value Problems
- Relative Perturbation Theory: II. Eigenspace and Singular Subspace Variations
- Relative perturbation bounds for eigenvalues of symmetric positive definite diagonally dominant matrices
- Relative-error bounds for the LU decomposition via the GTH algorithm
- Solving elliptic finite element systems in near-linear time with support preconditioners
Cited In (24)
- Accurate and efficient \(LDU\) decomposition of almost diagonally dominant \(Z\)-matrices
- Self-corrective iterations (SCI) for generalized diagonally dominant matrices
- Accurate computation of eigenvalues of generalized sign regular quasi-Said-Ball-Vandermonde matrices
- Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations
- Accurate solutions of structured generalized Kronecker product linear systems
- Accurate computations of eigenvalues of quasi-Cauchy-Vandermonde matrices
- Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy
- On the sensitivity of generators for the QR factorization of quasiseparable matrices with total nonpositivity
- Improved rigorous perturbation bounds for the LU and QR factorizations.
- Title not available (Why is no real title available?)
- Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices
- Computing eigenvalues of quasi-rational Said-Ball-Vandermonde matrices
- LDU decompositions with \(L\) and \(U\) well conditioned
- Relative perturbation analysis for eigenvalues and singular values of totally nonpositive matrices
- Accurate solutions of diagonally dominant tridiagonal linear systems
- Title not available (Why is no real title available?)
- Accurate and efficient LDU decomposition of diagonally dominant M-matrices
- Numerical methods for accurate computation of the eigenvalues of Hermitian matrices and the singular values of general matrices
- A New Perturbation Bound for the LDU Factorization of Diagonally Dominant Matrices
- Accurate computations and applications of some classes of matrices
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- Structured condition numbers and statistical condition estimation for the \(LDU\) factorization
- On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices
- Accurate inverses for computing eigenvalues of extremely ill-conditioned matrices and differential operators
This page was built for publication: Perturbation theory for the LDU factorization and accurate computations for diagonally dominant matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644775)
