**Applications of Computer Algebra
July 15-18, Athens, Greece **

Organizers

Robert M. Corless, Cheriton School of Computer Science, University of Waterloo, Canada

Mark Giesbrecht, Cheriton School of Computer Science, University of Waterloo, Canada

George Labahn, Cheriton School of Computer Science, University of Waterloo, Canada

Leili Rafiee Sevyeri, Cheriton School of Computer Science, University of Waterloo, Canada

Polynomials, together with matrices, are the natural tools used in algebraic and numeric computations. In many real-life problems the polynomial data is accessible only with noise (small perturbations in coefficients or entries) and approximation due to computing resources. Computing with these approximate polynomials and matrices form a major part of hybrid symbolic-numeric computation.

The aim of this session is to gather experts in symbolic-numeric computation to discuss and share the most recent achievements and open problems. The main focus of this meeting is on approximate polynomial and matrix algebras, and related applications.

** Topics of interest include: **

- GCD and factorization for polynomials with inexact coefficients
- Symbolic-numeric methods for solving polynomial systems
- Design and implementation of symbolic-numeric algorithms
- Applications of symbolic-numeric computation
- Sparse interpolation and exponential analysis and sparse signal processing
- Alternative bases
- Matrix polynomials (e.g low-rank approximations, normal forms,...)
- Backward-error and optimization-based algorithms and analysis