1993
DOI: 10.1080/12506559.1993.10511091
|View full text |Cite
|
Sign up to set email alerts
|

On the iterative methods for solving linear systems of equations

Abstract: The solution of large systems of linear equations is a problem frequently met in numerical calculations, for example, from finite difference or finite element approximations to partial differential equations. The use of direct methods for solving linear systems of equations is limited by both storage requirement and computing time, and in practice, the only alternative is to use iterative algorithms. This paper presents some basic iterative methods, and also a short survey of recent research on this subject, w… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

1997
1997
2004
2004

Publication Types

Select...
4
1

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 54 publications
0
3
0
Order By: Relevance
“…A compressed sparse row storage scheme is used, where only the nonzero entries of the matrix are stored row by row. The matrix A is time dependent, due to the time-varying normal components at the boundary, and an iterative method is appropriate for solving (52): see Dutto (1993) for a survey of such solution methods for linear systems. Since the global matrix A is nonsymmetric due to the Coriolis terms, a generalized minimal residual (GMRES) iterative method has been adopted.…”
Section: K Equationmentioning
confidence: 99%
“…A compressed sparse row storage scheme is used, where only the nonzero entries of the matrix are stored row by row. The matrix A is time dependent, due to the time-varying normal components at the boundary, and an iterative method is appropriate for solving (52): see Dutto (1993) for a survey of such solution methods for linear systems. Since the global matrix A is nonsymmetric due to the Coriolis terms, a generalized minimal residual (GMRES) iterative method has been adopted.…”
Section: K Equationmentioning
confidence: 99%
“…However, the use of direct methods is limited by both storage requirements and computing time, which prevent their use in large problems. This drawback has been countered by recent developments in non-stationary iterative solution algorithms [5,4] such as Krylov subspace methods. Besides requiring fewer computer resources, using an iterative solver provides exibility in controlling the extent to which the linear system is solved, contrary to direct methods, which yield the exact solutions.…”
Section: Introductionmentioning
confidence: 98%
“…This aspect becomes dominant as the number of grid points increases. Rapid advances in computer speed and available memory combined with recent developments in non-stationary iterative solvers and preconditioners [3][4][5] for non-symmetric matrices have enabled the development of fully coupled algorithms for the solution of the Navier-Stokes equations. Although research in the ÿnite volume community has been ambivalent on the eciency of fully coupled methods compared to the more common segregated solution procedures [6,7], there is common agreement on the added robustness of fully coupled methods.…”
Section: Introductionmentioning
confidence: 99%