The effect of orderings on sparse approximate inverse preconditioners for non-symmetric problems

Authors:
E. Flórez;M. D. García;L. González;G. Montero
Affiliations:
Department of Mathematics, University of Las Palmas de Gran Canaria, Edif. de Informática y Matemáticas, Campus Universitario de Tafira, 35017 Las Palmas de Gran Canaria, Spain;Department of Mathematics, University of Las Palmas de Gran Canaria, Edif. de Informática y Matemáticas, Campus Universitario de Tafira, 35017 Las Palmas de Gran Canaria, Spain;Department of Mathematics, University of Las Palmas de Gran Canaria, Edif. de Informática y Matemáticas, Campus Universitario de Tafira, 35017 Las Palmas de Gran Canaria, Spain;Department of Mathematics, University of Las Palmas de Gran Canaria, Edif. de Informática y Matemáticas, Campus Universitario de Tafira, 35017 Las Palmas de Gran Canaria, Spain
Venue:
Advances in Engineering Software - Engineering computational technology
Year:
2002

Citing 19
Cited 2

Topics in matrix analysis

Topics in matrix analysis
Sparse matrix test problems

ACM Transactions on Mathematical Software (TOMS)
CGS, a fast Lanczos-type solver for nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
The evolution of the minimum degree ordering algorithm

SIAM Review
BI-CGSTAB: a fast and smoothly converging variant of BI-CG for the solution of nonsymmetric linear systems

SIAM Journal on Scientific and Statistical Computing
A flexible inner-outer preconditioned GMRES algorithm

SIAM Journal on Scientific Computing
A quasi-minimal residual variant of the Bi-CGSTAB algorithm for nonsymmetric systems

SIAM Journal on Scientific Computing
Left-right preconditioning versions of BCG-like methods

Neural, Parallel & Scientific Computations
Parallel Preconditioning with Sparse Approximate Inverses

SIAM Journal on Scientific Computing
Sparse Approximate-Inverse Preconditioners Using Norm-Minimization Techniques

SIAM Journal on Scientific Computing
Orderings for Incomplete Factorization Preconditioning of Nonsymmetric Problems

SIAM Journal on Scientific Computing
Toward an Effective Sparse Approximate Inverse Preconditioner

SIAM Journal on Matrix Analysis and Applications
Ordering, Anisotropy, and Factored Sparse Approximate Inverses

SIAM Journal on Scientific Computing
A Priori Sparsity Patterns for Parallel Sparse Approximate Inverse Preconditioners

SIAM Journal on Scientific Computing
Orderings for Factorized Sparse Approximate Inverse Preconditioners

SIAM Journal on Scientific Computing
An Implementation of a Pseudoperipheral Node Finder

ACM Transactions on Mathematical Software (TOMS)
Reducing the bandwidth of sparse symmetric matrices

ACM '69 Proceedings of the 1969 24th national conference
Iterative Methods for Sparse Linear Systems

Iterative Methods for Sparse Linear Systems
Computer implementation of the finite element method

Computer implementation of the finite element method

A comparison of projective and direct solvers for finite elements in elastostatics

Advances in Engineering Software
New implementation of QMR-type algorithms

Computers and Structures

Quantified Score

Hi-index	0.00

Visualization

Abstract

We experimentally study how reordering techniques affect the rate of convergence of preconditioned Krylov subspace methods for nonsymmetric sparse linear systems, where the preconditioner is a sparse approximate inverse. In addition, we show how the reordering reduces the number of entries in the approximate inverse and thus, the amount of storage and computation required for a given accuracy. These properties are illustrated with several numerical experiments taken from the discretization of PDEs by a finite element method and from a standard matrix collection.