Comparison if the convergence behaviour of three linear solvers for large, sparse unsymmetric matrices

Show simple item record

dc.creator Shaw, Scott
dc.date 1995
dc.date 2005-11-23T12:21:34Z
dc.date 2005-11-23T12:21:34Z
dc.date 1995
dc.date.accessioned 2022-05-09T10:17:10Z
dc.date.available 2022-05-09T10:17:10Z
dc.identifier http://hdl.handle.net/1826/194
dc.identifier.uri https://reports.aerade.cranfield.ac.uk/handle/1826/194
dc.description Implicit methods for the calculation of unsteady flows require the solution of large, sparse non-symmetric systems of linear equations. The size of such systems makes their solution by direct methods impractical and consequently iterative techniques are often used. A popular class of such methods are those based upon the conjugate gradient method. In this paper we examine three such methods, CGS, restarted GMRES and restarted GMRESR and compare their convergence properties.
dc.description The University
dc.format 1963 bytes
dc.format 895587 bytes
dc.format text/plain
dc.format application/pdf
dc.language en_UK
dc.relation College of Aeronautics Report;9504
dc.relation CU/CoA/R;9504
dc.title Comparison if the convergence behaviour of three linear solvers for large, sparse unsymmetric matrices
dc.type Technical Report


Files in this item

Files Size Format View
coareport9504.pdf 895.5Kb application/pdf View/Open
license.txt 1.963Kb text/plain View/Open

This item appears in the following Collection(s)

Show simple item record

Search AERADE


Browse

My Account