Supporting GENP with Random Multipliers

2013/12/13 by Victor Y. Pan, Pan, Victor Y., Guoliang Qian +3 · 1 citation
Computer Science · Engineering · #Error Correcting Code Techniques #FOS: Mathematics #Numerical Analysis (math.NA) #Stochastic Gradient Optimization Techniques #Wireless Communication Security Techniques

paper · pdf · doi:10.48550/arxiv.1312.3805

openalex publication_date 2013/12/13 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We prove that standard Gaussian random multipliers are expected to stabilize numerically both Gaussian elimination with no pivoting and block Gaussian elimination. Our tests show similar results where we applied circulant random multipliers instead of Gaussian ones.

Citations

• Finding Structure with Randomness: Probabilistic Algorithms for Constructing Approximate Matrix Decompositions

Cited by

• Random Multipliers Numerically Stabilize Gaussian and Block Gaussian Elimination: Proofs and an Extension to Low-rank Approximation

Related

• Random Multipliers Numerically Stabilize Gaussian and Block Gaussian Elimination: Proofs and an Extension to Low-rank Approximation
• Numerically Safe Gaussian Elimination with No Pivoting
• Numerical Stability in Gaussian Elimination
• Average-case analysis of the Gaussian Elimination with Partial Pivoting
• More on the Power of Randomized Matrix Computations