A comparison of conventional acceleration schemes to the method of residual expansion functions
| dc.contributor.advisor | Filippone, William | en_US |
| dc.contributor.author | Rustaey, Abid, 1961- | |
| dc.creator | Rustaey, Abid, 1961- | en_US |
| dc.date.accessioned | 2013-03-28T10:31:35Z | en |
| dc.date.available | 2013-03-28T10:31:35Z | en |
| dc.date.issued | 1989 | en_US |
| dc.identifier.uri | http://hdl.handle.net/10150/277176 | en |
| dc.description.abstract | The algebraic equations resulting from a finite difference approximation may be solved numerically. A new scheme that appears quite promising is the method of residual expansion functions. In addition to speedy convergence, it is also independent of the number of algebraic equations under consideration, hence enabling us to analyze larger systems with higher accuracies. A factor which plays an important role in convergence of some numerical schemes is the concept of diagonal dominance. Matrices that converge at high rates are indeed the ones that possess a high degree of diagonal dominance. Another attractive feature of the method of residual expansion functions is its accurate convergence with minimal degree of diagonal dominance. Methods such as simultaneous and successive displacements, Chebyshev and projection are also discussed, but unlike the method of residual expansion functions, their convergence rates are strongly dependent on the degree of diagonal dominance. | |
| dc.language.iso | en_US | en_US |
| dc.publisher | The University of Arizona. | en_US |
| dc.rights | Copyright © is held by the author. Digital access to this material is made possible by the University Libraries, University of Arizona. Further transmission, reproduction or presentation (such as public display or performance) of protected items is prohibited except with permission of the author. | en_US |
| dc.subject | Differential equations. | en_US |
| dc.subject | Functions. | en_US |
| dc.title | A comparison of conventional acceleration schemes to the method of residual expansion functions | en_US |
| dc.type | text | en_US |
| dc.type | Thesis-Reproduction (electronic) | en_US |
| dc.identifier.oclc | 23379160 | en_US |
| thesis.degree.grantor | University of Arizona | en_US |
| thesis.degree.level | masters | en_US |
| dc.identifier.proquest | 1339057 | en_US |
| thesis.degree.discipline | Graduate College | en_US |
| thesis.degree.discipline | Nuclear and Energy Engineering | en_US |
| thesis.degree.name | M.S. | en_US |
| dc.identifier.bibrecord | .b17622475 | en_US |
| refterms.dateFOA | 2018-08-14T03:44:03Z | |
| html.description.abstract | The algebraic equations resulting from a finite difference approximation may be solved numerically. A new scheme that appears quite promising is the method of residual expansion functions. In addition to speedy convergence, it is also independent of the number of algebraic equations under consideration, hence enabling us to analyze larger systems with higher accuracies. A factor which plays an important role in convergence of some numerical schemes is the concept of diagonal dominance. Matrices that converge at high rates are indeed the ones that possess a high degree of diagonal dominance. Another attractive feature of the method of residual expansion functions is its accurate convergence with minimal degree of diagonal dominance. Methods such as simultaneous and successive displacements, Chebyshev and projection are also discussed, but unlike the method of residual expansion functions, their convergence rates are strongly dependent on the degree of diagonal dominance. |
