Randomized preprocessing versus pivoting
From MaRDI portal
Publication:1940337
DOI10.1016/J.LAA.2011.02.052zbMATH Open1261.65030OpenAlexW2016375103MaRDI QIDQ1940337FDOQ1940337
Authors: Guoliang Qian, Victor Y. Pan, Ai-Long Zheng 
Publication date: 6 March 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2011.02.052
Recommendations
- Numerically safe Gaussian elimination with no pivoting
- Randomized circulant and Gaussian pre-processing
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Randomized preprocessing of homogeneous linear systems of equations
- Probabilistic analysis of complex Gaussian elimination without pivoting
Gaussian eliminationpivotingnumerical examplesToeplitz matrixiterative refinementHankel matrix computationsrandomized preconditioning
Direct numerical methods for linear systems and matrix inversion (65F05) Preconditioners for iterative methods (65F08) Toeplitz, Cauchy, and related matrices (15B05)
Cites Work
- Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems
- Title not available (Why is that?)
- Title not available (Why is that?)
- Local operator theory, random matrices and Banach spaces.
- A probabilistic remark on algebraic program testing
- Eigenvalues and Condition Numbers of Random Matrices
- Title not available (Why is that?)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Accuracy and Stability of Numerical Algorithms
- Matrix multiplication via arithmetic progressions
- Title not available (Why is that?)
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Sign determination in residue number systems
- Stability of Methods for Solving Toeplitz Systems of Equations
- Title not available (Why is that?)
- Smoothed analysis of \(\kappa(A)\)
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- The Probability That a Numerical Analysis Problem is Difficult
- A stabilized superfast solver for nonsymmetric Toeplitz systems
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Certification of numerical computation of the sign of the determinant of a matrix
- Schur aggregation for linear systems and determinants
- Effect of small rank modification on the condition number of a matrix
- Title not available (Why is that?)
- Matrix computations and polynomial root-finding with preprocessing
- Randomized preprocessing of homogeneous linear systems of equations
- On Computations with Dense Structured Matrices
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Generalized inverses of certain Toeplitz matrices
- A note on the \(O(n)\)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
- New progress in real and complex polynomial root-finding
- Structured matrices and Newton's iteration: unified approach
- Newton-like iteration based on a cubic polynomial for structured matrices
- Iterative inversion of structured matrices
- Title not available (Why is that?)
- A stabilized superfast solver for indefinite Hankel systems
- On practical algorithms for accelerated matrix multiplication
- Parallel solution of Toeplitzlike linear systems
- Decreasing the Displacement Rank of a Matrix
- Unified nearly optimal algorithms for structured integer matrices
- Degeneration of structured integer matrices modulo an integer
- Improved algorithms for computing determinants and resultants
Cited In (11)
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Estimating the norms of random circulant and Toeplitz matrices and their inverses
- How bad are Vandermonde matrices?
- Distribution of the number of pivots needed using Gaussian elimination with partial pivoting on random matrices
- Numerically safe Gaussian elimination with no pivoting
- New studies of randomized augmentation and additive preprocessing
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
- Solving linear systems of equations with randomization, augmentation and aggregation
- Matrix computations and polynomial root-finding with preprocessing
- Randomized preprocessing of homogeneous linear systems of equations
- Randomized circulant and Gaussian pre-processing
This page was built for publication: Randomized preprocessing versus pivoting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1940337)
