Sparse and Parallel Matrix ComputationsThis thesis deals with four important matrix problems: the application of many variants of the conjugate gradient method for solving matrix equations, the solution of lower and upper bounds guadratic programs associated with M-matrices, the construction of a Block Lanczos method for computing the greatest singular values of a matrix, and the computation of the singular value decomposition of a matrix on the ILLIAC-IV computer. (Author). |
Common terms and phrases
African agricultural potential agro-climatic zones Algorithm 2.1 analysis assumed average Block Lanczos method CG-accelerated chapter climatic zone coefficient Compute conjugate gradient method Cotton cropping pattern cultivation practices defined distribution drought Dry Plant eigenvalues expected income factors farmers farming system hectares ILLIAC ILLIAC IV impact income levels increasing inputs iteration J-CG Kamba Katumani maize technology Kenya labor Lanczos method land Lemma linear long rains lowland Machakos M-matrix Machakos District Maize & Beans Maize & Cowpeas Makueni marginal matrix equation medium-potential areas migration moisture orthogonal orthonormal orthonormal matrix oxen cultivation oxen power Pigeon Peas Planted Maize plowing population density pre-rain planting preconditioned CG method problem production quadratic program rainfall requirements resource RS-CG method safety-first semi-arid agriculture semi-arid areas semi-arid region Short Rains simulation singular value decomposition smallholder soil solution sorghum subsistence symmetric TABLE Theorem tion tractor hire services variability vector weeding yield levels