Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
We consider the bilinear complexity of certain sets of bilinear forms. We study a class of direct sums of bilinear forms. For this class of problems we show that the bilinear complexity of one direct sum is the sum of the bilinear complexities of the summands and that every minimal bilinear algorithm for computing the direct sums is a direct-sum algorithm. We also exhibit some sets of bilinear forms which belong to this class. © 1981.
Paul J. Steinhardt, P. Chaudhari
Journal of Computational Physics
W.F. Cody, H.M. Gladney, et al.
SPIE Medical Imaging 1994
I.K. Pour, D.J. Krajnovich, et al.
SPIE Optical Materials for High Average Power Lasers 1992
Ligang Lu, Jack L. Kouloheris
IS&T/SPIE Electronic Imaging 2002