Εμφάνιση απλής εγγραφής

dc.creatorHadjidimos A.en
dc.date.accessioned2023-01-31T08:27:24Z
dc.date.available2023-01-31T08:27:24Z
dc.date.issued2016
dc.identifier10.1007/s10543-016-0617-x
dc.identifier.issn00063835
dc.identifier.urihttp://hdl.handle.net/11615/73753
dc.description.abstractIn the last two decades, the augmented linear systems and the saddle point problems have been solved by many researchers who have used the conjugate gradient method or the generalized SOR iterative method and variants of them. In the latter class of methods, when the block A∈IRm×m of the matrix coefficient A=[AB-BT0]∈IR(m+n)×(m+n), m≥ n, of the linear system to be solved, is symmetric positive definite and rank (B) = r≤ n, convergence regions and optimal values of the parameters involved have been determined. In this work, we consider the block A to be nonsymmetric positive definite, rank (B) = r< n, and use a two-level stationary iterative method whose main step is the linear second-order stationary iterative method for the solution of this class of problems. This method leads to the singular Manteuffel algorithm and the determination of its optimal parameters. As a byproduct, the optimal parameters of the Generalized Modified SSOR method in a particular case are also determined. Numerical examples verify our theoretical findings. © 2016, Springer Science+Business Media Dordrecht.en
dc.language.isoenen
dc.sourceBIT Numerical Mathematicsen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-84962711122&doi=10.1007%2fs10543-016-0617-x&partnerID=40&md5=f78e4674d113aac418cb9af65a3957bc
dc.subjectSpringer Netherlandsen
dc.titleThe saddle point problem and the Manteuffel algorithmen
dc.typejournalArticleen


Αρχεία σε αυτό το τεκμήριο

ΑρχείαΜέγεθοςΤύποςΠροβολή

Δεν υπάρχουν αρχεία που να σχετίζονται με αυτό το τεκμήριο.

Αυτό το τεκμήριο εμφανίζεται στις ακόλουθες συλλογές

Εμφάνιση απλής εγγραφής