|
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
AXELSSON, O. Solution of linear systems of equations' Iterat~ve methods. In Sparse Matrix Techniques. V.A. Barker (Ed.). Lecture Notes in Mathematws 572, Springer-Verhg, New York, 1977.
|
| |
2
|
AXELSSON, O., AND MUNKSGAARD, N. A class~f precondlhoned conjugate gradient methods for the solution of a mixed finite-element chscretlzation of the biharmonic operator. Int. J. Numer. Meth. Eng. 14 (1979), 1001-1019.
|
| |
3
|
DUFF, I.S. MA28--A set of Fortran subroutines for sparse unsynunetrm linear equations AERE Rep. R.8730, HMSO, London, 1977
|
| |
4
|
EISENSTAT, S.C., GURSKY, M.C., SCHULTZ, M.H., AND SHERMAN, A.H. Yale sparse matrtx package, the symmetric codes. Res. Rep. 112, Dep. Comput. Scl., Yale Univ., New Haven, Conn., 1977.
|
| |
5
|
GEORGE, A. An automatic one-way dissection algorithm for n'regular fimte element problems. In Numerical Analysis Proc., Biennial Conf, Dundee, G.A. Watson (Ed). Lecture Notes ~n Mathematics 630, Sprlnger-Verlag, New York, 1977.
|
| |
6
|
GUSTAFSSON, i. A class of first order factorlzation methods. BIT 18 (1978), 142-156.
|
| |
7
|
GUSTAVSON, F.G. Some basic techmques for solving sparse symmetric linear equations. In Sparse Matrtces and Thetr Appltcatlons, D.J. Rose and R A Willoughby (Eds.), Plenum Press, New York, 1972
|
| |
8
|
HESTENES, M.R., AND STIEFEL, E. Methods of conjugate gradients for solving linear systems. Nat Bur Stand. J. Res. 49 (1952), 409-436.
|
| |
9
|
JENNINGS, A., AND MALIK, G.A. Partial elimination. J. Inst. Maths. Applzc. 20 (1977), 307-316.
|
| |
10
|
KERSHAW, D.S The mcornplete Cholesky-conjugate gradient method for the iterative solution of systems of linear equations. J. Comput Phys. 26 (1978), 43-65.
|
| |
11
|
MEIJERINK, J.A, AND VAN DER VORST, H.A. An iterative solution method for linear systems of which the coefficient matrix is a symmetric M-matrix. Math. Comput. 31 (1977}, 148-162.
|
| |
12
|
MUNKSGAARD, N New factor~zation codes for sparse symmetric and positive defimte matrices. BIT 19 (1979), 43-65.
|
| |
13
|
STIEFEL, E. The self adjomt boundary value problems m refined iterative methods for computation of the solution and the elgenvalues of self adjomt boundary value problem. Der Eidgenosmschen Technischen Hochschule, Zurich, 1959.
|
|