Symbolic and Numerical Computation Session
ETS, Montreal, Quebec, Canada
June 25-28, 2009
Session Abstract
Hybrid Symbolic and Numeric Computation or Approximate
Algebraic Computation, is one of the main streams of current computer
algebra. Even so, only relatively few fundamental algebraic operations
have been studied so far, and many applications have been left
untouched. Researchers continue to study many more algebraic
operations from the viewpoint of approximate computation, to take
advantage of the fusion of symbolic and numeric computations, and to
apply approximate algebraic algorithms to science and technology.
Research contributions as well as expository papers are welcomed. For
more information please contact the session organizers by email.
This session covers the following topics, but is not restricted to these.
- Approximate GCD and approximate factorization.
- Approximate computation of Groebner bases.
- Algebraic computation using floating-point numbers and numeric algorithms.
- Approximate computation by series expansion.
- Error analysis and stabilization of algorithms.
- Validation of approximate algebraic computation.
- Computation of bounds for roots of polynomials.
- Isolation of polynomial roots Software for solving
hyperbolic polynomials.
- Symbolic-numerical methods of finding roots of polynomial systems.
- Improved software for solving polynomial systems.
- Algorithms and software for Approximate Radicals.
- New algorithms suited to approximate algebraic computation.
- Model construction by approximate algebraic algorithms.
- Applications to science and technology.
- New or improved theory and algorithm inspired by particular applications.
- Application of existing theory and algorithm to challenging problem.
ACA2009 top page Symbolic and Numeric Computation
Session, ACA2009, ETS, Montreal, Quebec, Canada, June 25-28, 2009