Abstract
A generalization of the classical conjugate gradient method to nonsymmetric matrix problems is described. The algorithm has a quasioptimal rate of convergence over the corresponding Krylov set. The application of the algorithm on a class of discretizations of singularly perturbed equations is discussed.
Keywords
- Bilinear Form
- Search Direction
- Conjugate Gradient Method
- Symmetric Part
- Singular Perturbation Problem
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Andersson, L., SSOR preconditioning of Toeplitz matrices, Report 76.02R (Ph.D. thesis), Department of Computer Sciences, Chalmers University of Technology, Göteborg, Sweden (1976).
Axelsson, O., Notes on the numerical solution of the biharmonic equations, J.Inst.Maths. Applics. 11(1973), 213–226.
Axelsson, O., A class of iterative methods for finite element equations, Computer Methods in Applied Mathematics and Engineering 9(1976), 123–137.
Axelsson,O., Conjugate gradient type methods for unsymmetric and inconsistent systems of linear equations, to appear Linear Algebra and its Applications.
Axelsson, O., and Gustafsson, I., A modified upwind scheme for convective transport equations and the use of a conjugate gradient method for the solution of non-symmetric systems of equations, J.Inst. Maths. Applics. 23(1979), 321–337.
Axelsson,O., and Gustafsson,I., An iterative solver for a mixed variable variational formulation of the (first) biharmonic problem, to appear in Comp. Math.Appl.Mech.Eng.
Concus, P., and Golub, G.H., A generalized conjugate gradient method for non-symmetric systems of linear equations, Proc.Second Internat.Symp. on Computing Methods in Applied Sciences and Engineering, IRIA (Paris, Dec.1975), Lecture Notes in Economics and Mathematical Systems, vol.134, R. Glowinski and J.-L. Lions, eds., Springer-Verlag, Berlin 1976.
Gustafsson, I., Stability and rate of convergence of modified incomplete Cholesky factorization methods, Report 79.02R (Ph.D. thesis), Department of Computer Sciences, Chalmers University of Technology, Göteborg, Sweden (1979).
Hestenes,M.R., and Stiefel,E., Method of conjugate gradients for solving linear systems, J.Res.Nat.Bur. Standards, No.49, 409–436, 1952.
Lanczos,C., Solutions of the systems of linear equations by minimized operations, J.Res.Nar.Bur. Standards, No.49, 33–53, 1952.
Widlund, O., A Lanczos’ method for a class of nonsymmetric systems of linear equations, SIAM J.Num.Anal. 15(1978), 801–812.
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1980 Springer-Verlag
About this paper
Cite this paper
Axelsson, O. (1980). A generalized conjugate direction method and its application on a singular perturbation problem. In: Watson, G.A. (eds) Numerical Analysis. Lecture Notes in Mathematics, vol 773. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0094159
Download citation
DOI: https://doi.org/10.1007/BFb0094159
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-09740-2
Online ISBN: 978-3-540-38562-2
eBook Packages: Springer Book Archive
