Please use this identifier to cite or link to this item: https://olympias.lib.uoi.gr/jspui/handle/123456789/13312
Full metadata record
DC FieldValueLanguage
dc.contributor.authorGalanis, S.en
dc.date.accessioned2015-11-24T17:27:07Z-
dc.date.available2015-11-24T17:27:07Z-
dc.identifier.issn0020-7160-
dc.identifier.urihttps://olympias.lib.uoi.gr/jspui/handle/123456789/13312-
dc.rightsDefault Licence-
dc.subjectsor-kappa methoden
dc.subjectkappa-step iterative methoden
dc.subjectkappa-cyclic matrix and complex spectraen
dc.subjectp-cyclic matricesen
dc.subjectiterative euler methodsen
dc.subjectlinear-systemsen
dc.subjectoverrelaxationen
dc.titleOptimum Sor Convergence for Complex Spectraen
heal.typejournalArticle-
heal.type.enJournal articleen
heal.type.elΆρθρο Περιοδικούel
heal.identifier.secondary<Go to ISI>://A1992MX32700009-
heal.languageen-
heal.accesscampus-
heal.recordProviderΠανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικώνel
heal.publicationDate1992-
heal.abstractIn this paper it is assumed that the point (or block) Jacobi matrix J(k) associated with the matrix A is weakly k-cyclic consistently ordered with complex, in general, eigenvalue spectrum sigma(J(k)). It is then our objective to begin a study in order to extend the Young-Eidson algorithm for the determination of the real optimum relaxation factor in the monoparametric k-step iterative method or equivalently in the case of the Successive Overelaxation (SOR-k) method when sigma(J(k)) lies in a cusped hypocycloid region. In addition a number of concluding remarks are made and numerical examples are given, that support the theory developed in this paper.en
heal.publisherTaylor & Francisen
heal.journalNameInternational Journal of Computer Mathematicsen
heal.journalTypepeer reviewed-
heal.fullTextAvailabilityTRUE-
Appears in Collections:Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ

Files in This Item:
File Description SizeFormat 
galanis-1992-Optimum Sor Convergence for Complex Spectra.pdf330.19 kBAdobe PDFView/Open    Request a copy


This item is licensed under a Creative Commons License Creative Commons