Randomized preprocessing versus pivoting
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 5872173 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3511563 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 1962932 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- A note on the \(O(n)\)-storage implementation of the GKO algorithm and its adaptation to Trummer-like matrices
- A probabilistic remark on algebraic program testing
- A stabilized superfast solver for indefinite Hankel systems
- A stabilized superfast solver for nonsymmetric Toeplitz systems
- Accuracy and Stability of Numerical Algorithms
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Certification of numerical computation of the sign of the determinant of a matrix
- Decreasing the Displacement Rank of a Matrix
- Degeneration of structured integer matrices modulo an integer
- Effect of small rank modification on the condition number of a matrix
- Eigenvalues and Condition Numbers of Random Matrices
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems
- Generalized inverses of certain Toeplitz matrices
- Improved algorithms for computing determinants and resultants
- Iterative inversion of structured matrices
- Local operator theory, random matrices and Banach spaces.
- Matrix computations and polynomial root-finding with preprocessing
- Matrix multiplication via arithmetic progressions
- New progress in real and complex polynomial root-finding
- Newton-like iteration based on a cubic polynomial for structured matrices
- On Computations with Dense Structured Matrices
- On practical algorithms for accelerated matrix multiplication
- Parallel solution of Toeplitzlike linear systems
- Randomized preprocessing of homogeneous linear systems of equations
- Schur aggregation for linear systems and determinants
- Sign determination in residue number systems
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- Smoothed analysis of \(\kappa(A)\)
- Stability of Methods for Solving Toeplitz Systems of Equations
- Structured matrices and Newton's iteration: unified approach
- Superfast Multifrontal Method for Large Structured Linear Systems of Equations
- The Probability That a Numerical Analysis Problem is Difficult
- Unified nearly optimal algorithms for structured integer matrices
Cited in
(11)- Randomized circulant and Gaussian pre-processing
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
- Estimating the norms of random circulant and Toeplitz matrices and their inverses
- Randomized preprocessing of homogeneous linear systems of equations
- 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
- Solving linear systems of equations with randomization, augmentation and aggregation
- New studies of randomized augmentation and additive preprocessing
- Matrix computations and polynomial root-finding with preprocessing
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
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)
