Randomized preprocessing of homogeneous linear systems of equations
From MaRDI portal
Publication:968998
DOI10.1016/J.LAA.2010.01.023zbMATH Open1202.65038OpenAlexW2017951318MaRDI QIDQ968998FDOQ968998
Authors: Guoliang Qian, Victor Y. Pan 
Publication date: 11 May 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.01.023
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
conditioningNewton's iterationnumerical stabilitycondition numbersmatrix inversiongeneralized inversessystems of linear equationsmatrix productsrandomized preprocessing
Direct numerical methods for linear systems and matrix inversion (65F05) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Preconditioners for iterative methods (65F08) Numerical computation of matrix norms, conditioning, scaling (65F35)
Cites Work
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Fast Solution of Toeplitz‐ and Cauchy‐Like Least‐Squares Problems
- Title not available (Why is that?)
- Generalized Nested Dissection
- Local operator theory, random matrices and Banach spaces.
- Breaking the Curse of Dimensionality, Or How to Use SVD in Many Dimensions
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- A probabilistic remark on algebraic program testing
- Eigenvalues and Condition Numbers of Random Matrices
- Title not available (Why is that?)
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Accuracy and Stability of Numerical Algorithms
- Matrix multiplication via arithmetic progressions
- Title not available (Why is that?)
- Approximate displacement rank and applications
- Title not available (Why is that?)
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Multivariate polynomials, duality, and structured matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Some Modified Matrix Eigenvalue Problems
- Smoothed analysis of \(\kappa(A)\)
- Smoothed Analysis of the Condition Numbers and Growth Factors of Matrices
- The Probability That a Numerical Analysis Problem is Difficult
- A stabilized superfast solver for nonsymmetric Toeplitz systems
- A Superfast Algorithm for Toeplitz Systems of Linear Equations
- Title not available (Why is that?)
- Accurate and Efficient Floating Point Summation
- Title not available (Why is that?)
- Accurate Sum and Dot Product
- Numerics of Gram-Schmidt orthogonalization
- How bad are Hankel matrices?
- Randomized preprocessing versus pivoting
- Schur aggregation for linear systems and determinants
- Effect of small rank modification on the condition number of a matrix
- Title not available (Why is that?)
- Additive Preconditioning for Matrix Computations
- Additive preconditioning for matrix computations
- Additive preconditioning, eigenspaces, and the inverse iteration
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- Methods of aggregation
- On a new class of structured matrices
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- On Computations with Dense Structured Matrices
- Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Generalized inverses of certain Toeplitz matrices
- Title not available (Why is that?)
- Design, implementation and testing of extended and mixed precision BLAS
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Tensor properties of multilevel Toeplitz and related matrices
- Numerical Linear Algebra for High-Performance Computers
- A bibliography on semiseparable matrices
- Structured matrices and Newton's iteration: unified approach
- Iterative inversion of structured matrices
- Title not available (Why is that?)
- A new error-free floating-point summation algorithm
- A stabilized superfast solver for indefinite Hankel systems
- Estimating Extremal Eigenvalues and Condition Numbers of Matrices
- Lower bounds for the condition number of Vandermonde matrices
- Computations with quasiseparable polynomials and matrices
- Fast and Efficient Parallel Solution of Sparse Linear Systems
- Stable and Efficient Algorithms for Structured Systems of Linear Equations
- A unifying convergence analysis of second-order methods for secular equations
- On practical algorithms for accelerated matrix multiplication
- How Can We Speed Up Matrix Multiplication?
- Parallel solution of Toeplitzlike linear systems
- Decreasing the Displacement Rank of a Matrix
- Title not available (Why is that?)
- Degeneration of structured integer matrices modulo an integer
- Stability analysis of the method of seminormal equations for linear least squares problems
- Superfast inversion of two-level Toeplitz matrices using Newton iteration and tensor-displacement structure
- Title not available (Why is that?)
- Title not available (Why is that?)
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
- A Derivative-Free Nonlinear Least Squares Solver
- Effective matrix-free preconditioning for the augmented immersed interface method
- 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
- Advancing matrix computations with randomized preprocessing
- Additive preconditioning for matrix computations
- Randomized circulant and Gaussian pre-processing
- Randomized preprocessing versus pivoting
Uses Software
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)
