We consider three improvements to seed methods for Hermitian linear systems with multiple right-hand sides: only the Krylov subspace for the first system is used for seeding subsequent right-hand sides, the first right-hand side is solved past convergence, and periodic reorthogonalization is used in order to control roundoff errors associated with the Conjugate Gradient algorithm. The method is...

In this paper, we study general linear programs in which right handsides are interval numbers. This model is relevant when uncertain and inaccurate factors make di–cult the assignment of a single value to each right handside. When objective function coe–cients are interval numbers in a linear program, it is used to determine optimal solutions according to classical criteria coming from decision...

There exist two major problems in application of the conventional block BiCGSTAB method to the O(a)-improved Wilson-Dirac equation with multiple right-hand-sides: One is the deviation between the true and the recursive residuals. The other is the convergence failure observed at smaller quark masses for enlarged number of the right-hand-sides. The block BiCGGR algorithm which was recently propos...