Randomized preprocessing versus pivoting
From MaRDI portal
Publication:1940337
DOI10.1016/j.laa.2011.02.052zbMath1261.65030OpenAlexW2016375103MaRDI QIDQ1940337
Guoliang Qian, Pan, Victor Y., 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
numerical examplesToeplitz matrixGaussian eliminationpivotingiterative refinementHankel matrix computationsrandomized preconditioning
Direct numerical methods for linear systems and matrix inversion (65F05) Toeplitz, Cauchy, and related matrices (15B05) Preconditioners for iterative methods (65F08)
Related Items
Numerically safe Gaussian elimination with no pivoting, New studies of randomized augmentation and additive preprocessing, Matrix computations and polynomial root-finding with preprocessing, Solving linear systems of equations with randomization, augmentation and aggregation, Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization, Randomized preprocessing of homogeneous linear systems of equations, Estimating the norms of random circulant and Toeplitz matrices and their inverses, How Bad Are Vandermonde Matrices?, Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New progress in real and complex polynomial root-finding
- Iterative inversion of structured matrices
- Matrix computations and polynomial root-finding with preprocessing
- Matrix multiplication via arithmetic progressions
- Degeneration of structured integer matrices modulo an integer
- Randomized preprocessing of homogeneous linear systems of equations
- A stabilized superfast solver for indefinite Hankel systems
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- On practical algorithms for accelerated matrix multiplication
- Parallel solution of Toeplitzlike linear systems
- A probabilistic remark on algebraic program testing
- Sign determination in residue number systems
- Structured matrices and Newton's iteration: unified approach
- Improved algorithms for computing determinants and resultants
- Newton-like iteration based on a cubic polynomial for structured matrices
- Smoothed analysis of \(\kappa(A)\)
- Generalized inverses of certain Toeplitz 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
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- On Computations with Dense Structured Matrices
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- Stability of Methods for Solving Toeplitz Systems of Equations
- The Probability That a Numerical Analysis Problem is Difficult
- Eigenvalues and Condition Numbers of Random Matrices
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Decreasing the Displacement Rank of a Matrix
- Accuracy and Stability of Numerical Algorithms
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems
- Certification of numerical computation of the sign of the determinant of a matrix
- A note on the \(O(n)\)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
