Two efficient inexact algorithms for a class of large sparse complex linear systems (Q305900)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6620757
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two efficient inexact algorithms for a class of large sparse complex linear systems |
scientific article; zbMATH DE number 6620757 |
Statements
Two efficient inexact algorithms for a class of large sparse complex linear systems (English)
0 references
31 August 2016
0 references
The paper is concerned with the iterative numerical solution of complex nonsingular systems of linear equations. The authors propose an inexact variant of the generalized successive overrelaxation method, in which the conjugate gradient and the preconditioned conjugate gradient methods are regarded as its inner iterations. They prove convergence of the new method and provide numerical experiments.
0 references
complex symmetric systems
0 references
real equivalent form
0 references
inexact algorithm
0 references
shift splitting
0 references
large sparse linear systems
0 references
generalized successive overrelaxation method
0 references
preconditioned conjugate gradient methods
0 references
numerical experiments
0 references
0 references
0 references
0 references
0 references
0.8288366198539734
0 references
0.8061833381652832
0 references
0.8061827421188354
0 references
0.8042628169059753
0 references
