Approximate Inverse Techniques for Block-Partitioned Matrices

@article{Chow1997ApproximateIT,
  title={Approximate Inverse Techniques for Block-Partitioned Matrices},
  author={Edmond Chow and Yousef Saad},
  journal={SIAM J. Sci. Comput.},
  year={1997},
  volume={18},
  pages={1657-1675}
}
This paper proposes some preconditioning options when the system matrix is in block-partitioned form. This form may arise naturally, for example, from the incompressible Navier--Stokes equations, or may be imposed after a domain decomposition reordering. Approximate inverse techniques are used to generate sparse approximate solutions whenever these are needed in forming the preconditioner. The storage requirements for these preconditioners may be much less than for incomplete LU factorization… 

BLOCK ILU PRECONDITIONED ITERATIVE METHODS FOR REDUCED LINEAR SYSTEMS

TLDR
A block red-black coloring technique is introduced to reorder the unknowns, which is based on the standard red- black coloring, for iterative solution of a large sparse matrix when this matrix is in block-partitioned form arising from discrete elliptic Partial Differential Equations (PDEs).

A Sparse Approximate Inverse Preconditioner for Nonsymmetric Linear Systems

TLDR
A procedure for computing an incomplete factorization of the inverse of a nonsymmetric matrix is developed, and the resulting factorized sparse approximate inverse is used as an explicit preconditioner for conjugate gradient--type methods.

BLOCK APPROXIMATE INVERSE PRECONDITIONERS FOR SPARSE NONSYMMETRIC LINEAR SYSTEMS

In this paper block approximate inverse preconditioners to solve sparse nonsymmetric linear systems with iterative Krylov subspace methods are studied. The computation of the preconditioners involves

Finite-element based sparse approximate inverses for block-factorized preconditioners

TLDR
A method to construct numerically efficient and computationally cheap sparse approximations of some of the matrix blocks arising in the block-factorized preconditioners for matrices with a two-by-two block structure for scalar elliptic problems is analysed.

INCREMENTAL INCOMPLETE LU FACTORIZATIONS WITH APPLICATIONS TO TIME-DEPENDENT PDES

TLDR
This papers examines a number of techniques for computing incremental ILU factorizations based on approximate inverses as well as alternating techniques for updating the factors L and U of the factorization.

Some Preconditioners for Block Pentadiagonal Linear Systems Based on New Approximate Factorization Methods

TLDR
An high-efficiency parallel algorithm to solve sparse block pentadiagonal linear systems suitable for vectors and parallel processors, stair matrices are used to construct some parallel polynomial approximate inverse preconditioners that are appropriate when the desired target is to maximize parallelism.

Incremental incomplete LU factorizations with applications

TLDR
A number of techniques for computing incremental ILU factorizations are examined, including methods based on approximate inverses as well as alternating techniques for updating the factors L and U of the factorization.

The effect of block red-black ordering on blockILU preconditioner for sparse matrices

TLDR
A block red-black coloring is introduced to increase the degree of parallelism in the application of the blockILU preconditioner for solving sparse matrices, arising from convection-diffusion equations discretized using the finite difference scheme (five-point operator).
...

References

SHOWING 1-10 OF 22 REFERENCES

Approximate inverse preconditioners for general sparse matrices

TLDR
A number of preconditioners based on iterating on each column to get the approximate inverse of sparse-matrix by sparse-vector type operatoins are developed and compared on standard problems from the Harwell-Boeing collection.

Block Preconditioning for the Conjugate Gradient Method

TLDR
Numerical experiments on test problems for two dimensions indicate that a particularly attractive preconditioning, which uses special properties of tridiagonal matrix inverses, can be computationally more efficient for the same computer storage than other preconditionsings, including the popular point incomplete Cholesky factorization.

Incomplete Block Factorizations as Preconditioners for Sparse SPD Matrices

TLDR
Two schemes of IBF’s are considered and shown to give rise to SPD preconditioned under certain general assumptions on sparse approximations to pivot blocks, and an implementation of CG iterations preconditionsed with an IBF in inverse free form on a two-dimensional grid of processors is suggested.

A stability analysis of incomplete LU factorizations

  • H. Elman
  • Computer Science, Mathematics
  • 1986
Abstract : The combination of iterative methods with preconditionings based on incomplete LU factorizations constitutes an effective class of methods for solving the sparse linear systems arising

Fast Nonsymmetric Iterations and Preconditioning for Navier-Stokes Equations

TLDR
Preconditioning techniques for nonsymmetric systems with the property that the eigenvalues of the preconditioned matrices are bounded independently of the mesh size used in the discretization are introduced.

Multigrid and Krylov subspace methods for the discrete Stokes equations

TLDR
The results indicate that multigrid with smoothing based on incomplete factorization is more efficient than the other methods, but typically by no more than a factor of two.

Factorized sparse approximate inverse preconditionings I: theory

TLDR
This paper considers construction and properties of factorized sparse approximate inverse preconditionings well suited for implementation on modern parallel computers to preserve symmetry and/or positive definiteness of the original matrix and lead to convergent splittings.

Block-bordered diagonalization and parallel iterative solvers

TLDR
Experiments on the Sequent Symmetry shared memory machine using (mostly) power system that matrices indicate that the method is generally better than conventional ILU preconditioners and in many cases even better than partitioned inverse preconditionsers, without the initial setup disadvantages of partitioned inverted precondITIONers.

A Flexible Inner-Outer Preconditioned GMRES Algorithm

  • Y. Saad
  • Computer Science
    SIAM J. Sci. Comput.
  • 1993
TLDR
A variant of the GMRES algorithm is presented that allows changes in the preconditioning at every step, resulting in a result of the flexibility of the new variant that any iterative method can be used as a preconditionser.