Randomized preprocessing of homogeneous linear systems of equations
From MaRDI portal
(Redirected from Publication:968998)
Recommendations
- Accelerating Linear System Solutions Using Randomization Techniques
- Randomized iterative methods for linear systems
- Solving linear systems of equations with randomization, augmentation and aggregation
- Randomized method of successive approximations for solving systems of linear algebraic equations
- Randomization and the parallel solution of linear algebra problems
- A Randomized Solver for Linear Systems with Exponential Convergence
- A randomised iterative method for solving factorised linear systems
- Randomized algorithms in numerical linear algebra
- Randomized methods for rank-deficient linear systems
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 4215266 (Why is no real title available?)
- scientific article; zbMATH DE number 5527834 (Why is no real title available?)
- scientific article; zbMATH DE number 3816925 (Why is no real title available?)
- scientific article; zbMATH DE number 3976197 (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 1962932 (Why is no real title available?)
- scientific article; zbMATH DE number 1855970 (Why is no real title available?)
- scientific article; zbMATH DE number 778080 (Why is no real title available?)
- scientific article; zbMATH DE number 2206814 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- scientific article; zbMATH DE number 3412083 (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 bibliography on semiseparable matrices
- 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
- A unifying convergence analysis of second-order methods for secular equations
- Accuracy and Stability of Numerical Algorithms
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Accurate Sum and Dot Product
- Accurate and Efficient Floating Point Summation
- Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
- Additive Preconditioning for Matrix Computations
- Additive preconditioning for matrix computations
- Additive preconditioning, eigenspaces, and the inverse iteration
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- Approximate displacement rank and applications
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- Computations with quasiseparable polynomials and matrices
- Decreasing the Displacement Rank of a Matrix
- Degeneration of structured integer matrices modulo an integer
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Design, implementation and testing of extended and mixed precision BLAS
- 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
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- 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
- Fast and Efficient Parallel Solution of Sparse Linear Systems
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Generalized Nested Dissection
- Generalized inverses of certain Toeplitz matrices
- How Can We Speed Up Matrix Multiplication?
- How bad are Hankel matrices?
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Iterative inversion of structured matrices
- Local operator theory, random matrices and Banach spaces.
- Lower bounds for the condition number of Vandermonde matrices
- Matrix multiplication via arithmetic progressions
- Methods of aggregation
- Multivariate polynomials, duality, and structured matrices
- Numerical Linear Algebra for High-Performance Computers
- Numerics of Gram-Schmidt orthogonalization
- On Computations with Dense Structured Matrices
- On a new class of structured matrices
- On practical algorithms for accelerated matrix multiplication
- Parallel solution of Toeplitzlike linear systems
- Randomized preprocessing versus pivoting
- Schur aggregation for linear systems and determinants
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- Smoothed analysis of \(\kappa(A)\)
- Some Modified Matrix Eigenvalue Problems
- Stability analysis of the method of seminormal equations for linear least squares problems
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- Structured matrices and Newton's iteration: unified approach
- Superfast inversion of two-level Toeplitz matrices using Newton iteration and tensor-displacement structure
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- Tensor properties of multilevel Toeplitz and related matrices
- The Probability That a Numerical Analysis Problem is Difficult
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
Cited in
(18)- Accelerating Linear System Solutions Using Randomization Techniques
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- New progress in real and complex polynomial root-finding
- Root-finding by expansion with independent constraints
- A derivative-free nonlinear least squares solver for nonsmooth functions
- Randomized method of successive approximations for solving systems of linear algebraic equations
- Linear processing with pregroups
- Numerically safe Gaussian elimination with no pivoting
- Effective matrix-free preconditioning for the augmented immersed interface method
- A Derivative-Free Nonlinear Least Squares Solver
- 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
- Additive preconditioning for matrix computations
- Advancing matrix computations with randomized preprocessing
- Randomized circulant and Gaussian pre-processing
- Randomized preprocessing versus pivoting
This page was built for publication: Randomized preprocessing of homogeneous linear systems of equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968998)
