An algebraic hierarchical basis preconditioner (Q1184720): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q587229 |
Changed an Item |
||
Property / reviewed by | |||
Property / reviewed by: Willy Govaerts / rank | |||
Normal rank |
Revision as of 18:45, 19 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An algebraic hierarchical basis preconditioner |
scientific article |
Statements
An algebraic hierarchical basis preconditioner (English)
0 references
28 June 1992
0 references
Consider the solution of linear systems of equations \(Ax=b\) where the coefficient matrix \(A\) satisfies \(A^ T=A\), \(a_{ij}\leq 0\) if \(i\neq j\) and \(\sum_ ja_{ij}=0\) for all \(i\). Such systems arise naturally in electrical resistance networks but also from discretizing partial differential equations. The electrical resistance network interpretation suggests a new algebraic hierarchical basis preconditioner. Numerical experiments with conjugate gradient acceleration demonstrate rapid convergence, though less than the optimal rate of an algebraic multigrid solver.
0 references
multilevel method
0 references
electrical resistance network
0 references
algebraic hierarchical basis preconditioner
0 references
Numerical experiments
0 references
conjugate gradient acceleration
0 references
convergence
0 references
algebraic multigrid solver
0 references