Toward a new fully algebraic preconditioner for symmetric positive definite problems

06/22/2021
by   Nicole Spillane, et al.
0

A new domain decomposition preconditioner is introduced for efficiently solving linear systems Ax = b with a symmetric positive definite matrix A. The particularity of the new preconditioner is that it is not necessary to have access to the so-called Neumann matrices (i.e.: the matrices that result from assembling the variational problem underlying A restricted to each subdomain). All the components in the preconditioner can be computed with the knowledge only of A (and this is the meaning given here to the word algebraic). The new preconditioner relies on the GenEO coarse space for a matrix that is a low-rank modification of A and on the Woodbury matrix identity. The idea underlying the new preconditioner is introduced here for the first time with a first version of the preconditioner. Some numerical illustrations are presented. A more extensive presentation including some improved variants of the new preconditioner can be found in [7] (https://hal.archives-ouvertes.fr/hal-03258644).

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

06/21/2021

Fully algebraic domain decomposition preconditioners with adaptive spectral bounds

In this article a new family of preconditioners is introduced for symmet...
09/13/2021

A Robust Algebraic Multilevel Domain Decomposition Preconditioner For Sparse Symmetric Positive Definite Matrices

Domain decomposition (DD) methods are widely used as preconditioner tech...
01/28/2021

Two-level Nyström–Schur preconditioner for sparse symmetric positive definite matrices

Randomized methods are becoming increasingly popular in numerical linear...
11/05/2019

Adaptive Domain Decomposition method for Saddle Point problem in Matrix Form

We introduce an adaptive domain decomposition (DD) method for solving sa...
02/04/2019

Constructing the Matrix Multilayer Perceptron and its Application to the VAE

Like most learning algorithms, the multilayer perceptrons (MLP) is desig...
06/17/2019

Deep Learning of Preconditioners for Conjugate Gradient Solvers in Urban Water Related Problems

Solving systems of linear equations is a problem occuring frequently in ...
07/01/2017

Geometry-Oblivious FMM for Compressing Dense SPD Matrices

We present GOFMM (geometry-oblivious FMM), a novel method that creates a...
This week in AI

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