The algorithms of inverse iteration and Rayleigh quotient iteration for approximating an eigenpair of a matrix contain a step in which a matrix-vector equation must be solved.The behaviour of these algorithms is analysed if this equation is solved only approximately with a known tolerance.

In this and a sequel paper [10] we study combinatorial designs whose incidence matrix has two distinct singular values.These generalize 2-(v, k, É) designs, and include partial geometric designs and uniform multiplicative designs.Here we study the latter, which are precisely the nonsingular...

Suppose one looks for a square integral matrixN, for which NN has a prescribed form.Then the Hasse-Minkowski invariants and the determinant of NN lead to necessary conditions for existence.The Bruck-Ryser-Chowla theorem gives a famous example of such conditions in case N is the incidence matrix...

In this and an earlier paper [17] we study combinatorial designs whose incidence matrix has two distinct singular values.These generalize (v, k, ë) designs, and include uniform multiplicative designs and partial geometric designs.Here we study the latter, which are precisely the designs with...