Challenges of Symbolic Computation: My Favorite Open Problems

  title={Challenges of Symbolic Computation: My Favorite Open Problems},
  author={Erich L. Kaltofen},
  journal={J. Symb. Comput.},
  • E. Kaltofen
  • Published 1 June 2000
  • Computer Science
  • J. Symb. Comput.
The success of the symbolic mathematical computation discipline is striking. The theoretical advances have been continuous and significant: Grobner bases, the Risch integration algorithm, integer lattice basis reduction, hypergeometric summation algorithms, etc. From the beginning in the early 1960s, it has been the tradition of our discipline to create software that makes our ideas readily available to scientists, engineers, and educators: SAC-1, Reduce, Macsyma, etc. The commercial viability… 

Figures and Tables from this paper

Numerical algebraic geometry and symbolic computation

In a recent joint work with Andrew Sommese and Charles Wampler, numerical homotopy continuation methods have been developed to deal with positive dimensional solution sets of polynomial systems and a "membership test" is used to determine whether a point lies on apositive dimensional solution component.

A framework for Symbolic and Numeric Computations

A framework for symbolic and numeric computations, called ALP, is described, which can be used to validate these new developments and to build devoted applications or solvers and this environment allows us to define parameterised but efficient classes of basic algebraic objects such as vectors, matrices, monomials and polynomials, ... which could be used easily in the construction of more elaborated algorithms.

An environment for Symbolic and Numeric Computation

The design choices of the kernel and their impact on the development of generic and efficient codes for the treatment of algebraic objects, such as vectors, matrices, univariate and multivariate polynomials are explained.

Parallel systems in symbolic and algebraic computation

This thesis describes techniques that exploit the distributed memory in massively parallel processors to satisfy the peak memory requirements of some very large computer algebra problems and demonstrates that careful attention to memory management aids solution of very large problems even without the benefit of advanced algorithms.

An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility

This paper proposes a new method that allows us to include constraints on the coefficients of the polynomials and is more robust to the initial approximation than the Newton-type optimization methods available in the literature.

Generic Reductions for In-place Polynomial Multiplication

This work provides a series of reductions starting with any linear-space multiplication algorithm, which yield in-place versions with the same asymptotic time complexity as the out-of-place version.

Fast Algorithms for Zero-Dimensional Polynomial Systems using Duality

This work addresses the question of speeding up the linear algebra phase for the computation of minimal polynomials and rational parametrizations in A using the A-module structure of the dual space $\widehat{A}$.

Implementation of Recursive Structural Parser for Symbolic Computation using Mathematical Pseudo Language and Features of Java

A strong yet simple way to solve mathematical problems by representing expressions using Symbols and characters with the concept of pseudo language is represented.

Difficulties in Complex Multiplication and Exponentiation

During my study of the iteration of functions of the form $f(z)=z^{\alpha}+c$, where $z,c \in \mathbbC$, and $\alpha$ is a rational non-integer larger than 2 (\cite{s1}), I encountered a fundamental

Computational Exploration of the Degree Sequence of the Malyshev Polynomials

The degree sequence of F and G via symbolic computation up to degree 16 is investigated and general patterns in the sequence are sought and a recursive method for computing the degree sequence without the explicit knowledge of the coefficients of the Malyshev polynomials is sketched.



Special Issue on Symbolic Numeric Algebra forPolynomials: Foreword of the Guest Editors

  • Mathematics, Computer Science
To conquer the largely unexplored area between computer algebra and numerical analysis, the two cultures must move towards each other and acknowledge each other's existence and particular traits, and they must learn each other’s language.

Computer Algebra and its Applications: Where are we Going?

In conclusion, I continue to be a great fan of computer algebra and mathematical software in general, which have created an entire environment in which one can work much more productively on a variety of mathematical, scientific, and engineering tasks.

Modern computer algebra

This highly successful textbook, widely regarded as the “bible of computer algebra”, gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems.

Modern Computer Algebra

This highly successful textbook, widely regarded as the 'bible of computer algebra', gives a thorough introduction to the algorithmic basis of the mathematical engine in computer algebra systems.

On Euclid's Algorithm and the Theory of Subresultants

An elementary treatment of the theory of subresultants is presented, and the relationship of the sub resultants of a given pair of polynomials to their polynomial remainder sequence as determined by Euclid's algorithm is examined.

FOXBOX: a system for manipulating symbolic objects in black box representation

A software package that puts in practice the black box representation of symbolic objects and provides algorithms for performing the symbolic calculus with such representations is introduced and the results of several challenge problems are presented, representing the first symbolic solutions of such problems.

Polynomial Factorization 1987-1991

This article discusses important developments of the past five years in factorization and discusses the “classical univariate problems” of factoring a polynomial.

Gauss: A Parameterized Domain of Computation System with Support for Signature Functions

The goal of this work was to design an AXIOM like system in which these signature functions can be constructed automatically, hence better exploited, and secondly, to exploit them in new ways.

The problem of integration in finite terms

This paper deals with the problem of telling whether a given elementary function, in the sense of analysis, has an elementary indefinite integral. In ?1 of this work, we give a precise definition of

Algebraic Complexity Theory

  • V. Strassen
  • Computer Science
    Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity
  • 1990