Toward robust algebraic multigrid methods for nonsymmetric problems
<p>When analyzing symmetric problems and the methods for solving them, multigrid and algebraic multigrid in particular, one of the primary tools at the analyst's disposal is the energy norm associated with the problem. The lack of this tool is one of the many reasons analysis of nonsymmet...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | English |
| Published: |
2015
|
| Subjects: |
| _version_ | 1826306058135535616 |
|---|---|
| author | Lottes, J |
| author2 | Wathen, A |
| author_facet | Wathen, A Lottes, J |
| author_sort | Lottes, J |
| collection | OXFORD |
| description | <p>When analyzing symmetric problems and the methods for solving them, multigrid and algebraic multigrid in particular, one of the primary tools at the analyst's disposal is the energy norm associated with the problem. The lack of this tool is one of the many reasons analysis of nonsymmetric problems and methods for solving them is substantially more difficult than in the symmetric case. We show that there is an analog to the energy norm for a nonsymmetric matrix <em>A</em>, associated with a new absolute value we term the "form" absolute value. This new absolute value can be described as a symmetric positive definite solution to the matrix equation <em>A</em>&ast;&verbar;<em>A</em>&verbar;<sup>-1</sup><em>A</em> = &verbar;<em>A</em>&verbar;; it exists and is unique in particular whenever <em>A</em> has positive symmetric part. We then develop a novel convergence theory for a general two-level multigrid iteration for any such <em>A</em>, making use of the form absolute value. In particular, we derive a convergence bound in terms of a smoothing property and separate approximation properties for the interpolation and restriction (a novel feature). Finally, we present new algebraic multigrid heuristics designed specifically targeting this new theory, which we evaluate with numerical tests.</p> |
| first_indexed | 2024-03-07T06:42:10Z |
| format | Thesis |
| id | oxford-uuid:f9ac1d47-6d6a-41a9-99b9-2559981a9ba3 |
| institution | University of Oxford |
| language | English |
| last_indexed | 2024-03-07T06:42:10Z |
| publishDate | 2015 |
| record_format | dspace |
| spelling | oxford-uuid:f9ac1d47-6d6a-41a9-99b9-2559981a9ba32022-03-27T12:59:37ZToward robust algebraic multigrid methods for nonsymmetric problemsThesishttp://purl.org/coar/resource_type/c_db06uuid:f9ac1d47-6d6a-41a9-99b9-2559981a9ba3Multigrid methods (Numerical analysis)EnglishORA Deposit2015Lottes, JWathen, A<p>When analyzing symmetric problems and the methods for solving them, multigrid and algebraic multigrid in particular, one of the primary tools at the analyst's disposal is the energy norm associated with the problem. The lack of this tool is one of the many reasons analysis of nonsymmetric problems and methods for solving them is substantially more difficult than in the symmetric case. We show that there is an analog to the energy norm for a nonsymmetric matrix <em>A</em>, associated with a new absolute value we term the "form" absolute value. This new absolute value can be described as a symmetric positive definite solution to the matrix equation <em>A</em>&ast;&verbar;<em>A</em>&verbar;<sup>-1</sup><em>A</em> = &verbar;<em>A</em>&verbar;; it exists and is unique in particular whenever <em>A</em> has positive symmetric part. We then develop a novel convergence theory for a general two-level multigrid iteration for any such <em>A</em>, making use of the form absolute value. In particular, we derive a convergence bound in terms of a smoothing property and separate approximation properties for the interpolation and restriction (a novel feature). Finally, we present new algebraic multigrid heuristics designed specifically targeting this new theory, which we evaluate with numerical tests.</p> |
| spellingShingle | Multigrid methods (Numerical analysis) Lottes, J Toward robust algebraic multigrid methods for nonsymmetric problems |
| title | Toward robust algebraic multigrid methods for nonsymmetric problems |
| title_full | Toward robust algebraic multigrid methods for nonsymmetric problems |
| title_fullStr | Toward robust algebraic multigrid methods for nonsymmetric problems |
| title_full_unstemmed | Toward robust algebraic multigrid methods for nonsymmetric problems |
| title_short | Toward robust algebraic multigrid methods for nonsymmetric problems |
| title_sort | toward robust algebraic multigrid methods for nonsymmetric problems |
| topic | Multigrid methods (Numerical analysis) |
| work_keys_str_mv | AT lottesj towardrobustalgebraicmultigridmethodsfornonsymmetricproblems |