Results 1 
4 of
4
Preliminary Experiences with the Fortran D Compiler
 IN PROCEEDINGS OF SUPERCOMPUTING '93
, 1993
"... Fortran D is a version of Fortran enhanced with data decomposition specifications. Case studies illustrate strengths and weaknesses of the prototype Fortran D comprier when compiling hnear algebra codes and whole programs. Statement groups, execution conditions, interloop communication optimization ..."
Abstract

Cited by 55 (18 self)
 Add to MetaCart
Fortran D is a version of Fortran enhanced with data decomposition specifications. Case studies illustrate strengths and weaknesses of the prototype Fortran D comprier when compiling hnear algebra codes and whole programs. Statement groups, execution conditions, interloop communication
Squeezing the most out of an algorithm . . .
, 1984
"... This paper describes a technique for achieving supervector performance on a CRAY1 in a purely FORTRAN environment {i.e., without resorting to assembler language). The technique can be applied to a wide variety of algorithms m hnear algebra, and is beneficial m other architectural settings. ..."
Abstract

Cited by 7 (3 self)
 Add to MetaCart
This paper describes a technique for achieving supervector performance on a CRAY1 in a purely FORTRAN environment {i.e., without resorting to assembler language). The technique can be applied to a wide variety of algorithms m hnear algebra, and is beneficial m other architectural settings.
© NorthHolland Pubhslung Company INFINITE CONFORMAL SYMMETRY IN TWODIMENSIONAL QUANTUM FIELD THEORY
, 1983
"... We present an mvestlgaUon of the massless, twodimensional, interacting field theories Their basic property is their invanance under an lnfimtedlmenslonal group of conformal (analytic) transformations It is shown that the local fields forlmng the operator algebra can be classified according to the ..."
Abstract
 Add to MetaCart
We present an mvestlgaUon of the massless, twodimensional, interacting field theories Their basic property is their invanance under an lnfimtedlmenslonal group of conformal (analytic) transformations It is shown that the local fields forlmng the operator algebra can be classified according
The Subresultant
"... Two earlier papers described the generalization of Euclid's algorithm to deal with the problem of computing the greatest common divisor (GCD) or the resultant of a pair of polynomials. A sequel to those two papers IS presented here In attempting such a generalization one easily arrives at the c ..."
Abstract
 Add to MetaCart
. By arranging for the constants of proportionahty to be unity, one obtams the subresultant PRS algorithm, in which the coefficient growth is essentmlly hnear. A corollary of the fundamental theorem is given here, which leads to a simple derivation and deeper understanding of the subresultant PRS algorithm