Efficient computational schemes of the conjugate gradient method for solving linear systems (Q1322967): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / reviewed by | |||
Property / reviewed by: Radim Blaheta / rank | |||
Property / reviewed by | |||
Property / reviewed by: Radim Blaheta / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/jcph.1994.1018 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1968602162 / rank | |||
Normal rank |
Latest revision as of 18:42, 21 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Efficient computational schemes of the conjugate gradient method for solving linear systems |
scientific article |
Statements
Efficient computational schemes of the conjugate gradient method for solving linear systems (English)
0 references
10 May 1994
0 references
The paper describes a special kind of the deflation conjugate gradient method of \textit{R. A. Nicolaides} [SIAM J. Numer. Anal. 24, 355-365 (1987; Zbl 0624.65028)] and \textit{Z. Dostál} [Int. J. Comp. Math. 23, No. 3/4, 315-323 (1988; Zbl 0668.65034)]. The described algorithm exploits an initial guess given by the projection of the solution into some subspace. The main topic of the paper is then a special technique for the construction of such subspaces which is developed for the solution of systems with five diagonal matrices. The technique was applied to semiconductor problems and some numerical experiments and comparisons are presented.
0 references
subspace projection
0 references
deflation conjugate gradient method
0 references
numerical experiments
0 references
comparisons
0 references