We present an iterative method for solving linear systems, which has the property of minimizing at every step the norm of the residual vector over a Krylov subspace. The algorithm is derived from the… (More)
Overton, who showed us how the ideal Arnoldi and GMRES problems relate to more general problems of minimization of singular values of functions of matrices 17]. gmres and arnoldi as matrix… (More)
We consider a class of iterative algorithms for solving systems of linear equations where the coefficient matrix is nonsymmetric with positive-definite symmetric part. The algorithms are modelled… (More)
We consider the following general problem modeling load balancing in a variety of distributed settings. Given an arbitrary undirected connected graph G=(V,E) and a weight distribution w 0 on the… (More)
ABSTRACT A comprehensive classification framework was developed that refines the current Xanthomonas classification scheme and provides a detailed assessment of Xanthomonas diversity at the species,… (More)
Linda a’s a coordination language invented by David Gelernter at Yale University [7], which, when combined wdh a computation language (like C) yieids a high-level paratlel programming language for… (More)