A sparse approximate inverse for triangular matrices based on Jacobi iteration

06/24/2021
by   Zhongjie Lu, et al.
0

In this paper, we propose a sparse approximate inverse for triangular matrices (SAIT) based on Jacobi iteration. The main operation of the algorithm is matrix-matrix multiplication. We apply the SAIT to iterative methods with ILU preconditioners. Then the two triangular solvers in the ILU preconditioning procedure are replaced by two matrix-vector multiplications, which can be fine-grained parallelized. We test the new algorithm by solving some linear systems and eigenvalue problems.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

12/29/2020

A fast iterative algorithm for near-diagonal eigenvalue problems

We introduce a novel iterative eigenvalue algorithm for near-diagonal ma...
06/24/2021

Optimal Fine-grained Hardness of Approximation of Linear Equations

The problem of solving linear systems is one of the most fundamental pro...
09/22/2021

Simple exponential acceleration of the power iteration algorithm

Many real-world problems rely on finding eigenvalues and eigenvectors of...
01/13/2021

Robust level-3 BLAS Inverse Iteration from the Hessenberg Matrix

Inverse iteration is known to be an effective method for computing eigen...
06/11/2020

Fast Coherent Point Drift

Nonrigid point set registration is widely applied in the tasks of comput...
09/15/2020

A two-level iterative scheme for general sparse linear systems based on approximate skew-symmetrizers

We propose a two-level iterative scheme for solving general sparse linea...
02/12/2021

Smoothed-adaptive perturbed inverse iteration for elliptic eigenvalue problems

We present a perturbed subspace iteration algorithm to approximate the l...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.