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. We aim to provide an opportunity for researchers from several fields to present their results, exchange ideas, develop and improve collaborations.
The workshop will include five invited talks and several contributed talks. We encourage all participants to propose a talk in order to share their results, research problems and goals.
- Matías R. Bender (LIP6 - Sorbonne Universités, Inria, CNRS)
- Claude-Pierre Jeannerod (Inria, ENS Lyon)
- Ana C. Matos (Laboratoire Paul Painlevé, Université des Sciences et Technologies de Lille)
- Jean-Claude Yakoubsohn (IMT, Université Paul Sabatier, Toulouse)
- Fatmanur Yildirim (Inria Sophia Antipolis Méditerranée)
April 21EXTENDED to April 28: deadline for abstract submission, April 28EXTENDED to May 5: notification of acceptance, May 5EXTENDED to May 12: deadline for registration.
Please contact the organisers at email@example.com if you have any question.