Two e cient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The rst one is a generalization of the Bartels{Stewart method...
If and are nonnegative integers and F is a field, then a polynomial collection {p1, . . . , p} Z[1, . . . , ] is said to be solvable over F if there exist 1, . . . , F such t...
Randall Dougherty, Christopher F. Freiling, Kennet...
We present some recent results from our research on methods for finding the minimal solutions to linear Diophantine equations over the naturals. We give an overview of a family of...
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
: The STI CELL processor introduces pioneering solutions in processor architecture. At the same time it presents new challenges for the development of numerical algorithms. One is ...