# Robust parallel iterative solvers for linear and least-squares problems, Final Technical Report

## Abstract

The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations onmore »

- Authors:

- Publication Date:

- Research Org.:
- University of Minnesota, Twin-Cities, MN

- Sponsoring Org.:
- USDOE Office of Science (SC)

- Contributing Org.:
- University of Minnesota, Dept. of Computer Science and Engineering

- OSTI Identifier:
- 1114834

- Report Number(s):
- Final Technical Report

- DOE Contract Number:
- FG02-08ER25841

- Resource Type:
- Technical Report

- Country of Publication:
- United States

- Language:
- English

- Subject:
- 97 MATHEMATICS AND COMPUTING; Numerical methods; Sparse matrix techniques; Parallel algorithms.

### Citation Formats

```
Saad, Yousef.
```*Robust parallel iterative solvers for linear and least-squares problems, Final Technical Report*. United States: N. p., 2014.
Web. doi:10.2172/1114834.

```
Saad, Yousef.
```*Robust parallel iterative solvers for linear and least-squares problems, Final Technical Report*. United States. doi:10.2172/1114834.

```
Saad, Yousef. Thu .
"Robust parallel iterative solvers for linear and least-squares problems, Final Technical Report". United States. doi:10.2172/1114834. https://www.osti.gov/servlets/purl/1114834.
```

```
@article{osti_1114834,
```

title = {Robust parallel iterative solvers for linear and least-squares problems, Final Technical Report},

author = {Saad, Yousef},

abstractNote = {The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the problem of evaluating f(A)v which arises in statistical sampling. 11. As an application to the methods we developed, we tackled the problem of computing the diagonal of the inverse of a matrix. This arises in statistical applications as well as in many applications in physics. We explored probing methods as well as domain-decomposition type methods. 12. A collaboration with researchers from Toulouse, France, considered the important problem of computing the Schur complement in a domain-decomposition approach. 13. We explored new ways of preconditioning linear systems, based on low-rank approximations.},

doi = {10.2172/1114834},

journal = {},

number = ,

volume = ,

place = {United States},

year = {2014},

month = {1}

}