Please use this identifier to cite or link to this item:
https://olympias.lib.uoi.gr/jspui/handle/123456789/13294Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Galanis, S. | en |
| dc.contributor.author | Hadjidimos, A. | en |
| dc.contributor.author | Noutsos, D. | en |
| dc.date.accessioned | 2015-11-24T17:26:59Z | - |
| dc.date.available | 2015-11-24T17:26:59Z | - |
| dc.identifier.issn | 0024-3795 | - |
| dc.identifier.uri | https://olympias.lib.uoi.gr/jspui/handle/123456789/13294 | - |
| dc.rights | Default Licence | - |
| dc.subject | iterative methods | en |
| dc.subject | p-cyclic matrices | en |
| dc.subject | successive overrelaxation | en |
| dc.subject | hypocycloidal curves | en |
| dc.subject | least-squares problems | en |
| dc.subject | iterative methods | en |
| dc.subject | linear-systems | en |
| dc.subject | overrelaxation | en |
| dc.subject | convergence | en |
| dc.subject | matrices | en |
| dc.title | A Young-Eidson's type algorithm for complex p-cyclic SOR spectra | en |
| heal.type | journalArticle | - |
| heal.type.en | Journal article | en |
| heal.type.el | Άρθρο Περιοδικού | el |
| heal.identifier.secondary | <Go to ISI>://000077665300006 | - |
| heal.language | en | - |
| heal.access | campus | - |
| heal.recordProvider | Πανεπιστήμιο Ιωαννίνων. Σχολή Θετικών Επιστημών. Τμήμα Μαθηματικών | el |
| heal.publicationDate | 1999 | - |
| heal.abstract | In a recent work of ours we have solved the problem of the minimization of the spectral radius of the iteration matrix of a p-cyclic successive overrelaxation (SOR) method for the solution of the linear system Ax = b, when the matrix A is block p-cyclic consistently ordered, for what is known as the "one-point" problem, for any p greater than or equal to 3. Particular cases of the "one-point" problem were solved by Young, Varga, Kjellberg, Kredell, Russell and others. In the present work we develop a theory using the results of our previous one and solve first the "two-point" problem special cases of which were solved by Wrigley, Eiermann, Niethammer, Ruttan, Noutsos and others. Secondly, we generalize and extend our theory to cover the "many-point" problem and develop a Young-Eidson's type algorithm for its solution. As possible application areas we mention among others the best block p-cyclic repartitioning for the SOR method and the solution of large scale systems arising in queueing network problems in Markov analysis. (C) 1999 Elsevier Science Inc. All rights reserved. | en |
| heal.publisher | Elsevier | en |
| heal.journalName | Linear Algebra and Its Applications | en |
| heal.journalType | peer reviewed | - |
| heal.fullTextAvailability | TRUE | - |
| Appears in Collections: | Άρθρα σε επιστημονικά περιοδικά ( Ανοικτά). ΜΑΘ | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| noutsos-1999-A Young-Eidson's.pdf | 835.48 kB | Adobe PDF | View/Open Request a copy |
This item is licensed under a Creative Commons License
