On the complexity of computing determinants
E Kaltofen, G Villard - Computational complexity, 2005 - Springer
We present new baby steps/giant steps algorithms of asymptotically fast running time for
dense matrix problems. Our algorithms compute the determinant, characteristic polynomial …
dense matrix problems. Our algorithms compute the determinant, characteristic polynomial …
[PDF][PDF] Future research directions in problem solving environments for computational science
S Gallopoulos, EN Houstis, JR Rice - 1992 - docs.lib.purdue.edu
Future Research Directions in Problem Solving Environments for Computational Science Page
1 Purdue University Purdue e-Pubs Department of Computer Science Technical Reports …
1 Purdue University Purdue e-Pubs Department of Computer Science Technical Reports …
Integration of elementary functions
M Bronstein - Journal of Symbolic Computation, 1990 - Elsevier
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 …
of elementary functions. We can express the integral as an elementary function or prove that …
[图书][B] Enabling Technologies for Computational Science: Frameworks, Middleware and Environments
EN Houstis, JR Rice, E Gallopoulos, R Bramley - 2000 - books.google.com
Enabling Technologies for Computational Science assesses future application computing
needs, identifies research directions in problem-solving environments (PSEs), addresses …
needs, identifies research directions in problem-solving environments (PSEs), addresses …
Future problem solving environments for computational science
EN Houstis, JR Rice - Mathematics and Computers in Simulation, 2000 - Elsevier
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 …
make projections for the future. First we describe the computing context, the definition of a …
Finding the distance between two circles in three-dimensional space
CA Neff - IBM journal of research and development, 1990 - ieeexplore.ieee.org
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 …
distance between two circles located in ℝ 3. We show, by combining a theorem about …
Improving CAS capabilities: New rules for computing improper integrals
JL Galán-García, G Aguilera-Venegas… - Applied Mathematics …, 2018 - Elsevier
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 …
domains (improper integrals of the first kind). The classical way for solving these integrals is …
[PDF][PDF] The transcendental Risch differential equation
M Bronstein - Journal of Symbolic Computation, 1990 - core.ac.uk
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 …
transcendental elementary extensions. In contrast to a recent algorithm of Davenport we do …
Infinite structures in Scratchpad II
WH Burge, SM Watt - European Conference on Computer Algebra, 1987 - Springer
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 …
of space. Several varieties of infinite structures are currently supported in Scratchpad II …
The type inference and coercion facilities in the Scratchpad II interpreter
RS Sutor, RD Jenks - ACM SIGPLAN Notices, 1987 - dl.acm.org
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 …
language, a library of packages of polymorphic functions and parametrized abstract …