A method for reduction of the storage requirement by the use of some special computer facilities; application to linear systems of algebraic equations
暂无分享,去创建一个
[1] Z. Zlatev. Use of Iterative Refinement in the Solution of Sparse Linear Systems , 1982 .
[2] Zahari Zlatev,et al. Classification of the systems of ordinary differential equations and practical aspects in the numerical integration of large systems , 1980, Comput. Chem..
[3] Fred G. Gustavson,et al. Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted Transposition , 1978, TOMS.
[4] Alston S. Householder,et al. Handbook for Automatic Computation , 1960, Comput. J..
[5] Zahari Zlatev,et al. The use of sparse matrix technique in the numerical integration of stiff systems of linear ordinary differential equations , 1980, Comput. Chem..
[6] Charles L. Lawson,et al. Basic Linear Algebra Subprograms for Fortran Usage , 1979, TOMS.
[7] R. J. Clasen. Techniques for automatic tolerance control in linear programming , 1966, CACM.
[8] H. Markowitz. The Elimination form of the Inverse and its Application to Linear Programming , 1957 .
[9] Z. Zlatev. On Some Pivotal Strategies in Gaussian Elimination by Sparse Technique , 1980 .
[10] Zahari Zlatev,et al. A testing scheme for subroutines solving large linear problems , 1981, Comput. Chem..
[11] Zahari Zlatev,et al. Solution of ordinary differential equations with time dependent coefficients. Development of a semiexplicit Runge-Kutta algorithm and application to a spectroscopic problem , 1979, Comput. Chem..
[12] Jerzy Wasniewski,et al. Use of a semiexplicit Runge-Kutta integration algorithm in a spectroscopic problem , 1978, Comput. Chem..
[13] J. H. Wilkinson,et al. AN ESTIMATE FOR THE CONDITION NUMBER OF A MATRIX , 1979 .
[14] Zahari Zlatev,et al. Y12M - Solution of Large and Sparse Systems of Linear Algebraic Equations , 1981, Lecture Notes in Computer Science.