Όλο το DSpace

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

Optimal accelerated SOR-like (ASOR) method for singular symmetric saddle point problems

dc.creatorGuo X.-P., Hadjidimos A.en
dc.date.accessioned2023-01-31T08:27:22Z
dc.date.available2023-01-31T08:27:22Z
dc.date.issued2020
dc.identifier10.1016/j.cam.2019.112662
dc.identifier.issn03770427
dc.identifier.urihttp://hdl.handle.net/11615/73736
dc.description.abstractIn a recent paper a new iterative method for the solution of the nonsingular symmetric saddle point problem was proposed (Njeru and Guo, 2016). The ASOR method belongs to the family of the SOR-like methods and uses two parameters α and ω. Convergence intervals for the parameters involved were found. In the present work we analyze and study an extension of the above problem to the singular case, and determine optimal values for the two parameters as well as for the semi-convergence factor of the ASOR method. Numerical results are presented to show the efficiency of the optimal singular ASOR method. © 2019 Elsevier B.V.en
dc.language.isoenen
dc.sourceJournal of Computational and Applied Mathematicsen
dc.source.urihttps://www.scopus.com/inward/record.uri?eid=2-s2.0-85076894217&doi=10.1016%2fj.cam.2019.112662&partnerID=40&md5=0100aa3cd56f5b9ba91c51812493f3c9
dc.subjectLinear systemsen
dc.subjectNumerical methodsen
dc.subjectConvergence factoren
dc.subjectNumerical resultsen
dc.subjectOptimal parameteren
dc.subjectOptimal valuesen
dc.subjectSaddle point problemsen
dc.subjectSOR methoden
dc.subjectSOR-like methoden
dc.subjectTwo parameteren
dc.subjectIterative methodsen
dc.subjectElsevier B.V.en
dc.titleOptimal accelerated SOR-like (ASOR) method for singular symmetric saddle point problemsen
dc.typejournalArticleen


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

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

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

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

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