An Approximate Minimum Degree Ordering Algorithm
SIAM Journal on Matrix Analysis and Applications
Constraint Preconditioning for Indefinite Linear Systems
SIAM Journal on Matrix Analysis and Applications
A Note on Preconditioning for Indefinite Linear Systems
SIAM Journal on Scientific Computing
A Note on Preconditioning Nonsymmetric Matrices
SIAM Journal on Scientific Computing
A Note on Constraint Preconditioning for Nonsymmetric Indefinite Matrices
SIAM Journal on Matrix Analysis and Applications
Iterative Methods for Sparse Linear Systems
Iterative Methods for Sparse Linear Systems
Algorithm 866: IFISS, a Matlab toolbox for modelling incompressible flow
ACM Transactions on Mathematical Software (TOMS)
Hi-index | 0.98 |
We proposed a substructure preconditioner for a class of structured linear system of equations. We show that a preconditioner with half of the constraint terms is able to make the preconditioned matrix have only three distinct eigenvalues. For some practical applications, a regularized variant is formulated, and the influence of the regularization parameter is analyzed. Numerical results show that the regularized variant is as efficient and is able to produce nearly optimal convergence behavior with a wide range of parameters.