We present new baby steps/giant steps algorithms of asymptotically fast running time for
dense matrix problems. Our algorithms compute the determinant, characteristic polynomial …

Future Research Directions in Problem Solving Environments for Computational Science Page
1 Purdue University Purdue e-Pubs Department of Computer Science Technical Reports …

We extend a recent algorithm of Trager to a decision procedure for the indefinite integration
of elementary functions. We can express the integral as an elementary function or prove that …

Enabling Technologies for Computational Science assesses future application computing
needs, identifies research directions in problem-solving environments (PSEs), addresses …

In this paper we review the current state of the problem solving environment (PSE) field and
make projections for the future. First we describe the computing context, the definition of a …

In this paper we investigate, from an algebraic point of view, the problem of finding the
distance between two circles located in ℝ 3. We show, by combining a theorem about …

Different Engineering applications require dealing with improper integral on unbounded
domains (improper integrals of the first kind). The classical way for solving these integrals is …

We present a new rational algorithm for solving Risch differential equations in towers of
transcendental elementary extensions. In contrast to a recent algorithm of Davenport we do …

An infinite structure is a data structure which cannot be fully constructed in any fixed amount
of space. Several varieties of infinite structures are currently supported in Scratchpad II …

The Scratchpad II system is an abstract datatype programming language, a compiler for the
language, a library of packages of polymorphic functions and parametrized abstract …