Numerically safe Gaussian elimination with no pivoting

DOI10.1016/j.laa.2017.04.007zbMath1365.15008arXiv1501.05385OpenAlexW2963930528MaRDI QIDQ2359570

Yanyan Li

Publication date: 22 June 2017

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

Full work available at URL: https://arxiv.org/abs/1501.05385

zbMATH Keywords

preconditioningGaussian eliminationpivotinglinear systems of equationsblock Gaussian eliminationrandom matrix algorithms

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Random matrices (algebraic aspects) (15B52) Direct numerical methods for linear systems and matrix inversion (65F05) Linear equations (linear algebraic aspects) (15A06) Conditioning of matrices (15A12)

Related Items (5)

Randomized numerical linear algebra: Foundations and algorithms ⋮ Simpler is better: a comparative study of randomized pivoting algorithms for CUR and interpolative decompositions ⋮ Sublinear Cost Low Rank Approximation via Subspace Sampling ⋮ CUR LRA at Sublinear Cost Based on Volume Maximization ⋮ Real polynomial root-finding by means of matrix and polynomial iterations

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• New studies of randomized augmentation and additive preprocessing
• Solving linear systems of equations with randomization, augmentation and aggregation
• Matrix computations and polynomial root-finding with preprocessing
• Additive preconditioning for matrix computations
• Degeneration of structured integer matrices modulo an integer
• Randomized preprocessing of homogeneous linear systems of equations
• Determinantal rings
• A probabilistic remark on algebraic program testing
• On the existence and computation of rank-revealing LU factorizations
• Randomized preprocessing versus pivoting
• Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
• Schur aggregation for linear systems and determinants
• Estimating the norms of random circulant and Toeplitz matrices and their inverses
• How Bad Are Vandermonde Matrices?
• Computational Advertising: Techniques for Targeting Relevant Ads
• IMPROVED ANALYSIS OF THE SUBSAMPLED RANDOMIZED HADAMARD TRANSFORM
• Randomized Algorithms for Matrices and Data
• Accelerating Linear System Solutions Using Randomization Techniques
• Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
• On Computations with Dense Structured Matrices
• Stability of Methods for Solving Toeplitz Systems of Equations
• Probabilistic Analysis of Gaussian Elimination Without Pivoting
• Accuracy and Stability of Numerical Algorithms
• Tails of Condition Number Distributions
• Condition Numbers of Gaussian Random Matrices
• Low-Rank Approximation of a Matrix: Novel Insights, New Progress, and Extensions

This page was built for publication: Numerically safe Gaussian elimination with no pivoting