This paper develops an algorithm to solve certain quadratic set-covering problems where the constraint set is of the inequality type. It extends one of Bellmore and Ratliff for linear set-covering ...

We provide a theory for the analysis of multigrid algorithms for symmetric positive definite problems with nonnested spaces and noninherited quadratic forms. By this we mean that the form on the ...

The quadratic formula learned by generations of math students is difficult to remember, but it can be used to solve quadratic equations where y = 0.