Methods for increasing domains of convergence in iterative linear system solvers
<p> In this thesis, we introduce and improve various methods for increasing the domains of convergence for iterative linear system solvers. We rely on the following three approaches: making the iteration adaptive, or nesting an inner iteration inside of a previously determined outer iteration;...
Main Author: | |
---|---|
Language: | EN |
Published: |
Purdue University
2014
|
Subjects: | |
Online Access: | http://pqdtopen.proquest.com/#viewpdf?dispub=3613148 |
id |
ndltd-PROQUEST-oai-pqdtoai.proquest.com-3613148 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-PROQUEST-oai-pqdtoai.proquest.com-36131482014-04-17T04:01:47Z Methods for increasing domains of convergence in iterative linear system solvers Imberti, David M. Mathematics|Computer Science <p> In this thesis, we introduce and improve various methods for increasing the domains of convergence for iterative linear system solvers. We rely on the following three approaches: making the iteration adaptive, or nesting an inner iteration inside of a previously determined outer iteration; using deflation and projections to manipulate the spectra inherent to the iteration; and/or focusing on reordering schemes. We will analyze a specific combination of these three strategies. In particular, we propose to examine the influence of nesting a Flexible Generalized Minimum Residual algorithm together with an inner Recursive Projection Method using a banded preconditioner resulting from the Fiedler reordering.</p> Purdue University 2014-04-11 00:00:00.0 thesis http://pqdtopen.proquest.com/#viewpdf?dispub=3613148 EN |
collection |
NDLTD |
language |
EN |
sources |
NDLTD |
topic |
Mathematics|Computer Science |
spellingShingle |
Mathematics|Computer Science Imberti, David M. Methods for increasing domains of convergence in iterative linear system solvers |
description |
<p> In this thesis, we introduce and improve various methods for increasing the domains of convergence for iterative linear system solvers. We rely on the following three approaches: making the iteration adaptive, or nesting an inner iteration inside of a previously determined outer iteration; using deflation and projections to manipulate the spectra inherent to the iteration; and/or focusing on reordering schemes. We will analyze a specific combination of these three strategies. In particular, we propose to examine the influence of nesting a Flexible Generalized Minimum Residual algorithm together with an inner Recursive Projection Method using a banded preconditioner resulting from the Fiedler reordering.</p> |
author |
Imberti, David M. |
author_facet |
Imberti, David M. |
author_sort |
Imberti, David M. |
title |
Methods for increasing domains of convergence in iterative linear system solvers |
title_short |
Methods for increasing domains of convergence in iterative linear system solvers |
title_full |
Methods for increasing domains of convergence in iterative linear system solvers |
title_fullStr |
Methods for increasing domains of convergence in iterative linear system solvers |
title_full_unstemmed |
Methods for increasing domains of convergence in iterative linear system solvers |
title_sort |
methods for increasing domains of convergence in iterative linear system solvers |
publisher |
Purdue University |
publishDate |
2014 |
url |
http://pqdtopen.proquest.com/#viewpdf?dispub=3613148 |
work_keys_str_mv |
AT imbertidavidm methodsforincreasingdomainsofconvergenceiniterativelinearsystemsolvers |
_version_ |
1716665645680033792 |