Designing and Exploiting Fast Algorithms for Polynomial Matrices - Lecture 1

Explore a comprehensive lecture on designing and exploiting fast algorithms for polynomial matrices in this 1 hour 28 minute conference talk by Vincent Neiger. Delivered during the "Francophone Computer Algebra Days" thematic meeting at the Centre International de Rencontres Mathématiques in Marseille, France, on March 04, 2024. Delve into advanced mathematical concepts and algorithmic techniques for handling polynomial matrices efficiently. Access this recording and other talks by renowned mathematicians through CIRM's Audiovisual Mathematics Library, featuring chapter markers, keywords, enriched content with abstracts and bibliographies, and a multi-criteria search function for easy navigation. Gain valuable insights into cutting-edge research in computer algebra and matrix algorithms from this expert presentation.