Show simple item record

contributor authorمحمد خرسند زاکen
contributor authorفائزه توتونیان مشهدen
contributor authorMohammad Khorsandfa
contributor authorFaezeh Toutounian Mashhadfa
date accessioned2020-06-06T13:17:06Z
date available2020-06-06T13:17:06Z
date issued2013
identifier urihttp://libsearch.um.ac.ir:80/fum/handle/fum/3348976?show=full
description abstractAbstract We present a nested splitting conjugate gradient iteration method for solving

large sparse continuous Sylvester equation, in which both coefficient matrices are

(non-Hermitian) positive semi-definite, and at least one of them is positive definite.

This method is actually inner/outer iterations, which employs the Sylvester conjugate

gradient method as inner iteration to approximate each outer iterate, while each outer

iteration is induced by a convergent and Hermitian positive definite splitting of the

coefficient matrices. Convergence conditions of this method are studied and numerical

experiments show the efficiency of this method. In addition, we show that the

quasi-Hermitian splitting can induce accurate, robust and effective preconditioned

Krylov subspace methods
en
languageEnglish
titleNested splitting CG-like iterative method for solving the continuous Sylvester equation and preconditioningen
typeJournal Paper
contenttypeExternal Fulltext
subject keywordsKeywords Sylvester equation · Preconditioning · Conjugate gradient · Nested

iterations
en
journal titleAdvances in Computational Mathematicsfa
pages16-Jan
journal volume40
journal issue113
identifier linkhttps://profdoc.um.ac.ir/paper-abstract-1040042.html
identifier articleid1040042


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record