Matrices that arise from a large range of problems in mathematics, physics, engineering etc. typically display a characteristic structure, such as sparsity patterns or a rank structure (e.g., quasi/semi-separable, Toeplitz-like etc.). Exploiting this structure is the key to the design of more efficient algorithms.
The study of structured matrices is an interdisciplinary field that places itself at a crossroads between symbolic computation (uni- and multivariate polynomial computation, matrix polynomials...), numerical linear algebra (solution of linear systems, classical and generalized eigenvalue problems, functions of matrices...), and more generally all applications that involve structured problems.
This event aims at providing an opportunity for researchers from several fields to present their results, exchange ideas, develop and strengthen collaborations.
Limited financial support is available to cover the travel expenses of a few participants. If your situation requires such a support, please write an email to the organizers to express your demand.
- Stefano Massei (École Polytechnique Fédérale Lausanne)
- José Henrique de Morais Goulart (GIPSA-lab, CNRS, Grenoble)
- Bernard Mourrain (Inria Sophia-Antipolis)
- Françoise Tisseur (University of Manchester)
- Lloyd N. Trefethen (University of Oxford and LIP - ENS de Lyon)
- April 13: proposition of abstracts for contributed talks,
- April 16: confirmation of acceptance,
- April 20: registration deadline (to facilitate logistics).
Please write to firstname.lastname@example.org if you have any question, or if you would like to propose a talk.
- Paola Boito (Università di Pisa)
- Claude-Pierre Jeannerod (Inria Rhône-Alpes, LIP - ENS de Lyon)
- Simone Naldi (Université de Limoges)
- Vincent Neiger (Université de Limoges)
- Tristan Vaccon (Université de Limoges)
- Gilles Villard (CNRS, LIP - ENS de Lyon)