Efficient computational schemes of the conjugate gradient method for solving linear systems (Q1322967)

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 566298
Language Label Description Also known as
default for all languages
No label defined
    English
    Efficient computational schemes of the conjugate gradient method for solving linear systems
    scientific article; zbMATH DE number 566298

      Statements

      Efficient computational schemes of the conjugate gradient method for solving linear systems (English)
      0 references
      0 references
      0 references
      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
      0 references

      Identifiers