Matrix computations and polynomial root-finding with preprocessing
From MaRDI portal
Publication:624343
DOI10.1016/j.laa.2010.04.011zbMath1410.65081OpenAlexW2014884518MaRDI QIDQ624343
Ai-Long Zheng, Guoliang Qian, Zhao Chen, Pan, Victor Y.
Publication date: 9 February 2011
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.04.011
Numerical solutions to overdetermined systems, pseudoinverses (65F20) Ill-posedness and regularization problems in numerical linear algebra (65F22) Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
Numerically safe Gaussian elimination with no pivoting, New studies of randomized augmentation and additive preprocessing, Randomized preprocessing versus pivoting, Solving linear systems of equations with randomization, augmentation and aggregation, Root-finding by expansion with independent constraints, New progress in real and complex polynomial root-finding, Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
- Additive preconditioning for matrix computations
- Eigen-solving via reduction to DPR1 matrices
- Additive preconditioning, eigenspaces, and the inverse iteration
- Randomized preprocessing of homogeneous linear systems of equations
- Asymptotically fast solution of Toeplitz and related systems of linear equations
- Methods of aggregation
- A probabilistic remark on algebraic program testing
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Design, analysis, and implementation of a multiprecision polynomial rootfinder
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Randomized preprocessing versus pivoting
- Generalized inverses of certain Toeplitz matrices
- Schur aggregation for linear systems and determinants
- Linking the TPR1, DPR1 and arrow-head matrix structures
- Matrix Algorithms
- Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Solving a Polynomial Equation: Some History and Recent Progress
- Accurate and Efficient Floating Point Summation
- Templates for the Solution of Algebraic Eigenvalue Problems
- Accuracy and Stability of Numerical Algorithms
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Design, implementation and testing of extended and mixed precision BLAS
- Some Modified Matrix Eigenvalue Problems
- A unifying convergence analysis of second-order methods for secular equations
- Accurate Sum and Dot Product
- Nichtlineare Behandlung von Eigenwertaufgaben
