| dc.contributor.author | Ozban, AY | |
| dc.date.accessioned | 2020-06-25T17:35:02Z | |
| dc.date.available | 2020-06-25T17:35:02Z | |
| dc.date.issued | 2002 | |
| dc.identifier.issn | 0020-7160 | |
| dc.identifier.issn | 1029-0265 | |
| dc.identifier.uri | https://doi.org/10.1080/00207160211290 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12587/2997 | |
| dc.description | WOS: 000176035700009 | en_US |
| dc.description.abstract | In literature, it has been reported that the convergence of some preconditioned stationary iterative methods using certain type upper triangular matrices as preconditioners are faster than the basic iterative methods. In this paper, a new preconditioned iterative method for the numerical solution of linear systems has been introduced, and the convergence analysis of the proposed method and an existing one have been done. Some numerical examples have also been given, which show the effectiveness of both of the methods. | en_US |
| dc.language.iso | eng | en_US |
| dc.publisher | Taylor & Francis Ltd | en_US |
| dc.relation.isversionof | 10.1080/00207160211290 | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.subject | nonnegative matrices | en_US |
| dc.subject | irreducible matrices | en_US |
| dc.subject | stationary iterative methods | en_US |
| dc.subject | convergence | en_US |
| dc.title | On accelerated iterative methods for the solution of systems of linear equations | en_US |
| dc.type | article | en_US |
| dc.contributor.department | Kırıkkale Üniversitesi | en_US |
| dc.identifier.volume | 79 | en_US |
| dc.identifier.issue | 6 | en_US |
| dc.identifier.startpage | 765 | en_US |
| dc.identifier.endpage | 773 | en_US |
| dc.relation.journal | International Journal Of Computer Mathematics | en_US |
| dc.relation.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
