Solving linear systems of equations with randomization, augmentation and aggregation

DOI10.1016/j.laa.2012.07.002zbMath1263.65042MaRDI QIDQ454828

Guoliang Qian, Pan, Victor Y.

Publication date: 10 October 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2012.07.002

zbMATH Keywords

aggregation; algorithm; singular value decomposition; numerical experiments; randomization; preconditioning; augmentation; condition number; rank; ill-conditioned matrix; null space; system of linear equations; LU or QR factorization

Mathematics Subject Classification ID

65F22: Ill-posedness and regularization problems in numerical linear algebra

15A03: Vector spaces, linear dependence, rank, lineability

15A06: Linear equations (linear algebraic aspects)

15A12: Conditioning of matrices

65F08: Preconditioners for iterative methods

Related Items

New studies of randomized augmentation and additive preprocessing, Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation, Numerically safe Gaussian elimination with no pivoting

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix computations and polynomial root-finding with preprocessing
• Algebraic methods for Toeplitz-like matrices and operators
• Additive preconditioning for matrix computations
• Additive preconditioning, eigenspaces, and the inverse iteration
• Randomized preprocessing of homogeneous linear systems of equations
• A new error-free floating-point summation algorithm
• A stabilized superfast solver for indefinite Hankel systems
• Displacement ranks of matrices and linear equations
• Methods of aggregation
• A probabilistic remark on algebraic program testing
• Complexity of multiplication with vectors for structured matrices
• On the existence and computation of rank-revealing LU factorizations
• Symbolic and numeric methods for exploiting structure in constructing resultant matrices
• Randomized preprocessing versus pivoting
• Multivariate polynomials, duality, and structured matrices
• Schur aggregation for linear systems and determinants
• Effect of small rank modification on the condition number of a matrix
• A Stabilized Superfast Solver for Nonsymmetric Toeplitz Systems
• Estimating Extremal Eigenvalues and Condition Numbers of Matrices
• Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
• On Computations with Dense Structured Matrices
• Advancing Matrix Computations with Randomized Preprocessing
• The Probability That a Numerical Analysis Problem is Difficult
• Eigenvalues and Condition Numbers of Random Matrices
• Fast Probabilistic Algorithms for Verification of Polynomial Identities
• Accuracy and Stability of Numerical Algorithms
• Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
• Tails of Condition Number Distributions
• Condition Numbers of Gaussian Random Matrices