Designing and Exploiting Fast Algorithms for Polynomial Matrices - Lecture 2
Centre International de Rencontres Mathématiques via YouTube
Learn AI, Data Science & Business — Earn Certificates That Get You Hired
Live Online Classes in Design, Coding & AI — Small Classes, Free Retakes
Overview
AI, Data Science & Cloud Certificates from Google, IBM & Meta — 40% Off
One plan covers every Professional Certificate on Coursera. 40% off Coursera Plus Annual.
Unlock All Certificates
Explore advanced concepts in polynomial matrix algorithms in this lecture from the "Francophone Computer Algebra Days" conference. Delve into Vincent Neiger's second presentation on designing and exploiting fast algorithms for polynomial matrices. Gain insights into cutting-edge mathematical techniques and their applications in computer algebra. Benefit from chapter markers and keywords to navigate specific topics of interest within the 1-hour 28-minute talk. Access additional resources including abstracts, bibliographies, and Mathematics Subject Classification. Utilize the multi-criteria search functionality to explore related content by author, title, tags, or mathematical area in CIRM's Audiovisual Mathematics Library.
Syllabus
Vincent Neiger : Designing and exploiting fast algorithms for polynomial matrices - lecture 2
Taught by
Centre International de Rencontres Mathématiques