Additive preconditioning and aggregation in matrix computations
From MaRDI portal
Publication:2425466
DOI10.1016/j.camwa.2004.03.022zbMath1139.65034MaRDI QIDQ2425466
Pan, Victor Y., Xiaodong Yan, Dmitriy Ivolgin, Brian Murphy, Rhys Eric Rosholt, Yuqing Tang, Islam Taj-Eddin
Publication date: 5 May 2008
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2004.03.022
aggregation; ill-conditioned matrix; matrix computations; additive preconditioning; multiplication and summation algorithms (MSAs); singular value decomposition (SVD)-free
65F22: Ill-posedness and regularization problems in numerical linear algebra
65F10: Iterative numerical methods for linear systems
65F35: Numerical computation of matrix norms, conditioning, scaling
Related Items
The Schur aggregation and solving ill conditioned linear systems: the convergence theorem, Chebyshev-type methods and preconditioning techniques, Additive preconditioning for matrix computations, Eigen-solving via reduction to DPR1 matrices, Additive preconditioning, eigenspaces, and the inverse iteration, A new error-free floating-point summation algorithm, Schur aggregation for linear systems and determinants, Additive preconditioning and aggregation in matrix computations, Effect of small rank modification on the condition number of a matrix, Additive Preconditioning for Matrix Computations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The aggregation and cancellation techniques as a practical tool for faster matrix multiplication
- An iterated eigenvalue algorithm for approximating roots of univariate polynomials
- Matrix multiplication via arithmetic progressions
- Additive preconditioning, eigenspaces, and the inverse iteration
- Lower bounds for the condition number of Vandermonde matrices
- Methods of aggregation
- On practical algorithms for accelerated matrix multiplication
- Sign determination in residue number systems
- How bad are Hankel matrices?
- Polynomial zerofinding iterative matrix algorithms
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Inverse power and Durand-Kerner iterations for univariate polynomial root-finding
- Improved algorithms for computing determinants and resultants
- Improved initialization of the accelerated and robust QR-like polynomial root-finding
- Fast and stable QR eigenvalue algorithms for generalized companion matrices and secular equations
- Preconditioning techniques for large linear systems: A survey
- A composite polynomial zerofinding matrix algorithm
- Multivariate polynomials, duality, and structured matrices
- Fast and accurate floating point summation with application to computational geometry
- Additive preconditioning and aggregation in matrix computations
- Effect of small rank modification on the condition number of a matrix
- A floating-point technique for extending the available precision
- Matrix Algorithms
- On Computations with Dense Structured Matrices
- Additive Preconditioning for Matrix Computations
- How Can We Speed Up Matrix Multiplication?
- Generalized Nested Dissection
- Numerical Linear Algebra for High-Performance Computers
- Fast and Efficient Parallel Solution of Sparse Linear Systems
- Solving a Polynomial Equation: Some History and Recent Progress
- Accurate and Efficient Floating Point Summation
- Matrix Preconditioning Techniques and Applications
- Accuracy and Stability of Numerical Algorithms
- A Rank–One Reduction Formula and Its Applications to Matrix Factorizations
- Fast Gaussian Elimination with Partial Pivoting for Matrices with Displacement Structure
- Two Purposes for Matrix Factorization: A Historical Appraisal
- Design, implementation and testing of extended and mixed precision BLAS
- Extensions and Applications of the Householder Algorithm for Solving Linear Least Squares Problems
- On accurate floating-point summation
- Some Modified Matrix Eigenvalue Problems
- Accurate Sum and Dot Product
- A bibliography on semiseparable matrices
- Computation of a specified root of a polynomial system of equations using eigenvectors
- Certification of numerical computation of the sign of the determinant of a matrix
