Schur aggregation for linear systems and determinants
From MaRDI portal
The authors apply additive preconditioning techniques for efficient solution of ill conditioned systems of equations \(Ay=b\) and for the computation of the determinant \(\det(A)\). The computations with the additive modification \(P\) of the initial matrix \(A\) (\(C=A+P\)) and for Schur complements of a smaller size in \(A\) are done efficiently via the Sherman-Morrison-Woodbury formula.
Recommendations
- Additive preconditioning and aggregation in matrix computations
- On the errors of the extended iterative refinement/improvement algorithm combined with the additive preconditioning and the Schur aggregation techniques
- Distributed Schur Complement Techniques for General Sparse Linear Systems
- Preconditioning Sparse Nonsymmetric Linear Systems with the Sherman--Morrison Formula
- Approximate Schur Complement Preconditioners on Serial and Parallel Computers
Cites work
- A floating-point technique for extending the available precision
- A probabilistic remark on algebraic program testing
- Accuracy and Stability of Numerical Algorithms
- Accurate and Efficient Floating Point Summation
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Accurate Sum and Dot Product
- Adaptive precision floating-point arithmetic and fast robust geometric predicates
- Additive preconditioning and aggregation in matrix computations
- Additive Preconditioning for Matrix Computations
- An Improved Newton Iteration for the Generalized Inverse of a Matrix, with Applications
- Certification of numerical computation of the sign of the determinant of a matrix
- Complexity of Computations with Matrices and Polynomials
- Design, implementation and testing of extended and mixed precision BLAS
- Effect of small rank modification on the condition number of a matrix
- Exact solution of linear equations using p-adic expansions
- Fast and accurate floating point summation with application to computational geometry
- Fast Probabilistic Algorithms for Verification of Polynomial Identities
- Homotopic residual correction processes
- How Can We Speed Up Matrix Multiplication?
- scientific article; zbMATH DE number 1682655 (Why is no real title available?)
- scientific article; zbMATH DE number 3651744 (Why is no real title available?)
- scientific article; zbMATH DE number 3679047 (Why is no real title available?)
- scientific article; zbMATH DE number 1226426 (Why is no real title available?)
- scientific article; zbMATH DE number 691245 (Why is no real title available?)
- scientific article; zbMATH DE number 733664 (Why is no real title available?)
- scientific article; zbMATH DE number 1049347 (Why is no real title available?)
- scientific article; zbMATH DE number 1049350 (Why is no real title available?)
- scientific article; zbMATH DE number 2187725 (Why is no real title available?)
- scientific article; zbMATH DE number 3257775 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Improved algorithms for computing determinants and resultants
- Iterative Solution Methods
- Matrix algorithms. Vol. 2: Eigensystems
- Matrix Preconditioning Techniques and Applications
- mctoolbox
- Methods of aggregation
- Multivariate polynomials, duality, and structured matrices
- On Computations with Dense Structured Matrices
- Preconditioning techniques for large linear systems: A survey
- Sign determination in residue number systems
- Solving a Polynomial Equation: Some History and Recent Progress
- Some Modified Matrix Eigenvalue Problems
- Symbolic and numeric methods for exploiting structure in constructing resultant matrices
- The shifted number system for fast linear algebra on integer matrices
- Univariate polynomials: Nearly optimal algorithms for numerical factorization and root-finding
Cited in
(14)- A new error-free floating-point summation algorithm
- Randomized preprocessing versus pivoting
- Random multipliers numerically stabilize Gaussian and block Gaussian elimination: proofs and an extension to low-rank approximation
- Numerically safe Gaussian elimination with no pivoting
- Additive preconditioning and aggregation in matrix computations
- New studies of randomized augmentation and additive preprocessing
- The Schur aggregation and solving ill conditioned linear systems: the convergence theorem
- Solving linear systems of equations with randomization, augmentation and aggregation
- New progress in real and complex polynomial root-finding
- Matrix computations and polynomial root-finding with preprocessing
- Nearly optimal solution of rational linear systems of equations with symbolic lifting and numerical initialization
- Additive preconditioning for matrix computations
- Additive preconditioning, eigenspaces, and the inverse iteration
- Randomized preprocessing of homogeneous linear systems of equations
This page was built for publication: Schur aggregation for linear systems and determinants
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2378504)
