Sparse Approximate Inverse Preconditioners

  • Scott J
  • Tůma M
N/ACitations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We investigate the use of sparse approximate-inverse preconditioners for the iterative solution of unsymmetric linear systems of equations. Such methods are of particular interest because of the considerable scope for parallelization. We propose a number of enhancements which may improve their performance. When run in a sequential environ-ment, these methods can perform unfavourably when compared with other techniques. However, they can be successful when other methods fail and simulations indicate that they can be competitive when considered in a parallel environment. 1 Current reports available by anonymous ftp from joyous-gard.cc.rl.ac.uk (internet 130.246.9.91) in the directory " pub/reports " .

Cite

CITATION STYLE

APA

Scott, J., & Tůma, M. (2023). Sparse Approximate Inverse Preconditioners (pp. 205–221). https://doi.org/10.1007/978-3-031-25820-6_11

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free