AbstractWe apply our recent preconditioning techniques to the solution of linear systems of equations and computing determinants. We combine these techniques with the Sherman–Morrison–Woodbury formula, its new variations, aggregation, iterative refinement, and advanced algorithms that rapidly compute sums and products either error-free or with the desired high accuracy. Our theoretical and experimental study shows the power of this approach
AbstractWe consider the problem of solving the linear system Ax=b, where A is the coefficient matrix...
A new class of preconditioners for the iterative solution of the linear systems arising from interio...
We propose a framework for building preconditioners for sequences of linear systems of the form (A+Δ...
AbstractWe combine our novel SVD-free additive preconditioning with aggregation and other relevant t...
Multiplicative preconditioning is a popular SVD-based techniques for the solution of linear systems ...
A new class of preconditioners for the iterative solution of the linear systems arising from interio...
AbstractWe study a class of methods for accelerating the convergence of iterative methods for solvin...
AbstractThe approximate solutions in standard iteration methods for linear systems Ax=b, with A an n...
AbstractWe propose a new direct method to solve linear systems. This method is based on the Sherman–...
The recursive construction of Schur-complements is used to construct a multi-level preconditioner fo...
The Newton scheme is used to construct an approximate inverse preconditioner for the Schur complemen...
Many modern numerical simulations give rise to large sparse linear systems of equa-tions that are be...
In this paper we introduce LORASC, a robust algebraic preconditioner for solving sparse linear syste...
AbstractSeeking a basis for the null space of a rectangular and possibly rank deficient and ill cond...
Seeking a basis for the null space of a rectangular and possibly rank deficient and ill con-ditioned...
AbstractWe consider the problem of solving the linear system Ax=b, where A is the coefficient matrix...
A new class of preconditioners for the iterative solution of the linear systems arising from interio...
We propose a framework for building preconditioners for sequences of linear systems of the form (A+Δ...
AbstractWe combine our novel SVD-free additive preconditioning with aggregation and other relevant t...
Multiplicative preconditioning is a popular SVD-based techniques for the solution of linear systems ...
A new class of preconditioners for the iterative solution of the linear systems arising from interio...
AbstractWe study a class of methods for accelerating the convergence of iterative methods for solvin...
AbstractThe approximate solutions in standard iteration methods for linear systems Ax=b, with A an n...
AbstractWe propose a new direct method to solve linear systems. This method is based on the Sherman–...
The recursive construction of Schur-complements is used to construct a multi-level preconditioner fo...
The Newton scheme is used to construct an approximate inverse preconditioner for the Schur complemen...
Many modern numerical simulations give rise to large sparse linear systems of equa-tions that are be...
In this paper we introduce LORASC, a robust algebraic preconditioner for solving sparse linear syste...
AbstractSeeking a basis for the null space of a rectangular and possibly rank deficient and ill cond...
Seeking a basis for the null space of a rectangular and possibly rank deficient and ill con-ditioned...
AbstractWe consider the problem of solving the linear system Ax=b, where A is the coefficient matrix...
A new class of preconditioners for the iterative solution of the linear systems arising from interio...
We propose a framework for building preconditioners for sequences of linear systems of the form (A+Δ...