Accelerating Linear System Solutions Using Randomization Techniques
From MaRDI portal
Recommendations
- Randomized iterative methods for linear systems
- A Randomized Solver for Linear Systems with Exponential Convergence
- Randomization and the parallel solution of linear algebra problems
- scientific article; zbMATH DE number 1855626
- Randomized method of successive approximations for solving systems of linear algebraic equations
- Using Strassen's algorithm to accelerate the solution of linear systems
- Randomized preprocessing of homogeneous linear systems of equations
- Solving linear systems of equations with randomization, augmentation and aggregation
- A randomised iterative method for solving factorised linear systems
- On Accelerated Iterative Methods for the Solution of Systems of Linear Equations
Cited in
(11)- A Randomized Solver for Linear Systems with Exponential Convergence
- Randomized complete pivoting for solving symmetric indefinite linear systems
- Randomized Block Adaptive Linear System Solvers
- Randomized method of successive approximations for solving systems of linear algebraic equations
- Numerical algorithms for high-performance computational science
- Numerically safe Gaussian elimination with no pivoting
- Linear algebra software for large-scale accelerated multicore computing
- Generalizing random butterfly transforms to arbitrary matrix sizes
- Using Random Butterfly Transformations to Avoid Pivoting in Sparse Direct Methods
- Solving linear systems of equations with randomization, augmentation and aggregation
- Randomized preprocessing of homogeneous linear systems of equations
This page was built for publication: Accelerating Linear System Solutions Using Randomization Techniques
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3189664)
