GMRES: a generalized minimal residual algorithm for solving nonsymmetric linear systems
SIAM Journal on Scientific and Statistical Computing
An iterative method for nonsymmetric systems with multiple right-hand sides
SIAM Journal on Scientific Computing
A Restarted GMRES Method Augmented with Eigenvectors
SIAM Journal on Matrix Analysis and Applications
Restarted GMRES preconditioned by deflation
Journal of Computational and Applied Mathematics
Parallel Preconditioning with Sparse Approximate Inverses
SIAM Journal on Scientific Computing
A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems
SIAM Journal on Scientific Computing
Adaptively Preconditioned GMRES Algorithms
SIAM Journal on Scientific Computing
The fast multipole method: numerical implementation
Journal of Computational Physics
Implicitly Restarted GMRES and Arnoldi Methods for Nonsymmetric Systems of Equations
SIAM Journal on Matrix Analysis and Applications
GMRES with Deflated Restarting
SIAM Journal on Scientific Computing
The Fast Multipole Method I: Error Analysis and Asymptotic Complexity
SIAM Journal on Numerical Analysis
A Class of Spectral Two-Level Preconditioners
SIAM Journal on Scientific Computing
A Comparison of Deflation and Coarse Grid Correction Applied to Porous Media Flow
SIAM Journal on Numerical Analysis
SIAM Journal on Scientific Computing
PiCAP: a parallel and incremental capacitance extraction considering stochastic process variation
Proceedings of the 46th Annual Design Automation Conference
SIAM Journal on Scientific Computing
Flexible GMRES with Deflated Restarting
SIAM Journal on Scientific Computing
Accelerated GCRO-DR method for solving sequences of systems of linear equations
Journal of Computational and Applied Mathematics
A parallel and incremental extraction of variational capacitance with stochastic geometric moments
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
A technique suited for the solution of sequences of linear systems is described. This technique is a combination of a low rank update spectral preconditioner and a Krylov solver that computes on the fly approximations of the eigenvectors associated with the smallest eigenvalues. A set of Matlab examples illustrates the behaviour of this technique on academic sparse linear systems and its clear interest is showed in large parallel calculations for electromagnetic simulations. In this latter context, the solution technique enables the reduction of the simulation times by a factor of up to eight; these simulation times previously exceeded several hours of computation on a modern high performance computer.