A Survey of Condition Number Estimation for Triangular Matrices
From MaRDI portal
Publication:3774835
DOI10.1137/1029112zbMath0635.65049OpenAlexW2166036437WikidataQ56999069 ScholiaQ56999069MaRDI QIDQ3774835
Publication date: 1987
Published in: SIAM Review (Search for Journal in Brave)
Full work available at URL: http://eprints.maths.manchester.ac.uk/695/1/high87t.pdf
singular value decompositioncondition numberupper and lower boundsQR decompositioninverse iterationcounterexamplestriangular matrixrank estimationComparisonsLINPACK estimator
Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Related Items
The Laurent expansion of pencils that are singular at the origin, On the comparison of H-matrices with M-matrices, Error norm estimation and stopping criteria in preconditioned conjugate gradient iterations, An upper bound on the growth ratio of Gaussian elimination, On the augmented system approach to sparse least-squares problems, On the low-rank approximation by the pivoted Cholesky decomposition, On the estimation of numerical error bounds in linear algebra based on discrete stochastic arithmetic, Stable algorithm for updating denseLUfactorization after row or column exchange and row and column addition or deletion, Condition numbers for Lanczos bidiagonalization with complete reorthogonalization, The spectral norm of a nonnegative matrix, Certifying feasibility and objective value of linear programs, Sensitivity analysis of the Lanczos reduction, Bounds for the condition number of a class of tridiagonal and block tridiagonal matrices, A polynomial time constraint-reduced algorithm for semidefinite optimization problems, Tracking the condition number for RLS in signal processing, Adaptive Lanczos methods for recursive condition estimation, A note on a lower bound for the smallest singular value, A lower bound for the smallest singular value, Statistical Condition Estimation for Linear Systems, Upper bound of the condition number in spectral norm of tridiagonal matrices, An efficient total least squares algorithm based on a rank-revealing two- sided orthogonal decomposition, Improved rigorous perturbation bounds for the LU and QR factorizations, Integer matrices related to Liouville’s function, A Fast Block-Greedy Algorithm for Quasi-optimal Meshless Trial Subspace Selection, Hybrid norms and bounds for overdetermined linear systems, Green's function of the problem of bounded solutions in the case of a block triangular coefficient, On maximum volume submatrices and cross approximation for symmetric semidefinite and diagonally dominant matrices, Iterative Solution of Saddle-Point Systems from Radial Basis Function (RBF) Interpolation, An estimate for the spectral norm of the inverse of a matrix with the Gauss-Jordan algorithm, Upper bounds for packings of spheres of several radii, Condition number of the Krylov bases and subspaces, WLS-ENO remap: superconvergent and non-oscillatory weighted least squares data transfer on surfaces, Deviation maximization for rank-revealing QR factorizations, Subspace Iteration Randomization and Singular Value Problems, Parallel codes for computing the numerical rank, Some new properties of the equality constrained and weighted least squares problem, Experiments with data perturbations to study condition numbers and numerical stability, Estimating the matrix \(p\)-norm, An alternative algorithm for a sliding window ULV decomposition
