We present an iterative method based on a generalization of the Golub-Kahan bidiagonalization for solving indefinite matrices with a 2×2 block structure. We focus in particular on our recent imple- mentation of the algorithm using the parallel numerical library PETSc. Since the algorithm is a nested solver, we investigate different choices for parallel inner solvers and show its strong scalability for two Stokes test problems. The algorithm is found to be scalable for large sparse problems.
Parallel Performance of an Iterative Solver Based on the Golub-Kahan Bidiagonalization
ARIOLI M
2020
Abstract
We present an iterative method based on a generalization of the Golub-Kahan bidiagonalization for solving indefinite matrices with a 2×2 block structure. We focus in particular on our recent imple- mentation of the algorithm using the parallel numerical library PETSc. Since the algorithm is a nested solver, we investigate different choices for parallel inner solvers and show its strong scalability for two Stokes test problems. The algorithm is found to be scalable for large sparse problems.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
