Chebyshev varieties
Chebyshev varieties are algebraic varieties parametrized by Chebyshev polynomials. They arise naturally when solving polynomial equations expressed in the Chebyshev basis. More precisely, when passing from monomials to Chebyshev polynomials, Chebyshev varieties replace toric varieties. I will introduce these objects, discuss their defining equations and present key properties. Via examples, I will motivate their use in practical computations. This is joint work with Zaïneb Bel-Afia and Chiara Meroni.
Practical information:
Georganiseerd door:
Teacher / speaker
Max Planck Institute for Mathematics in the Sciences, Leipzig, Germany
Back to the Roots Seminar Series
The ERC research project "Back to the roots of data-driven dynamical system identification", led by Prof. Dr. Bart De Moor (KU Leuven, ESAT-STADIUS), focuses on system identification, where mathematical models are derived from observed data generated by systems such as medical monitoring, electricity consumption and industrial processes. Utilizing optimization algorithms, one seeks to identify the best model in a chosen model class. This methodology finds widespread application across thousands of use cases within the AI community. However, there is no guarantee that optimization algorithms will find the best model. Present-day optimization practices are heuristic in nature, yielding results that may not be reproducible and consequently difficult to interpret.
The main objective of the Back to the Roots project is to develop a theoretical framework that combines model classes and optimization algorithms, enabling the calculation of the optimal model within the specified model class with 100% certainty.
