Solving linear systems of equations with randomization, augmentation and aggregation
From MaRDI portal
Publication:454828
Recommendations
- Accelerating Linear System Solutions Using Randomization Techniques
- Randomized preprocessing of homogeneous linear systems of equations
- scientific article
- Randomized method of successive approximations for solving systems of linear algebraic equations
- scientific article; zbMATH DE number 2000359
- A Randomized Solver for Linear Systems with Exponential Convergence
- A structured method for solving the augmented linear systems
- A randomised iterative method for solving factorised linear systems
- Randomized iterative methods for linear systems
- An iterative aggregation-disaggregation algorithm for solving linear equations
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 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A new error-free floating-point summation algorithm
- 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
- Additive preconditioning for matrix computations
- Additive preconditioning, eigenspaces, and the inverse iteration
- Advancing matrix computations with randomized preprocessing
- Algebraic methods for Toeplitz-like matrices and operators
- Complexity of multiplication with vectors for structured matrices
- Condition Numbers of Gaussian Random Matrices
- Displacement ranks of matrices and linear equations
- Effect of small rank modification on the condition number of a matrix
- Eigenvalues and Condition Numbers of Random Matrices
- Estimating Extremal Eigenvalues and Condition Numbers of Matrices
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Local operator theory, random matrices and Banach spaces.
- Matrix computations and polynomial root-finding with preprocessing
- Methods of aggregation
- Multivariate polynomials, duality, and structured matrices
- On Computations with Dense Structured Matrices
- On the existence and computation of rank-revealing LU factorizations
- Randomized preprocessing of homogeneous linear systems of equations
- Randomized preprocessing versus pivoting
- Schur aggregation for linear systems and determinants
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- Tails of Condition Number Distributions
- The Probability That a Numerical Analysis Problem is Difficult
Cited in
(8)- Solving Random Quadratic Systems of Equations Is Nearly as Easy as Solving Linear Systems
- Randomized methods for rank-deficient linear systems
- Randomized preprocessing of homogeneous linear systems of equations
- Advancing matrix computations with randomized preprocessing
- Accelerating Linear System Solutions Using Randomization Techniques
- Numerically safe Gaussian elimination with no pivoting
- New studies of randomized augmentation and additive preprocessing
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
This page was built for publication: Solving linear systems of equations with randomization, augmentation and aggregation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q454828)
