University of Cambridge > Talks.cam > CUED Control Group Seminars > Attasi ND systems, polynomial system solving and algebraic optimization

  Browse A-Z

Log in

Googledetails Microsoftdetails

🔐 Log In

Information on

Subscribing to talksdetails Finding a talkdetails Adding a talkdetails Disseminating talksdetails Help and Documentationdetails

ℹ️ Information

Attasi ND systems, polynomial system solving and algebraic optimization

Download to your calendar using vCal

If you have a question about this talk, please contact Tim Hughes .

This talk will unify the results about the eigenvalue approach to polynomial system solving from the Attasi ND systems standpoint. In fact one needs to use autonomous Attasi ND systems which were not really defined in Attasi’s original paper. But once that is done the so-called Stetter matrices of a polynomial system with finite number of solutions (over the complex numbers) follow directly from Attasi’s realization theory.

I will then discuss the approach followed in the work with Bleylevens and Peeters on determining the solutions of systems of polynomial equations using large eigenvalue solvers, where we use recursive solution of the ND system equations to obtain the result of the action of the shift matrices on the initial state. I will also describe possibilities for computing these recursions on a FPGA chip by using the FIFO (first-in-first-out) facility.

This talk is part of the CUED Control Group Seminars series.

This talk is included in these lists:

Note that ex-directory lists are not shown.

Other lists

Gurdon Institute Talks Faculty of Education, 184 Hills Road, Cambridge, CB2 8PQ, Room GS5 Cambridge Judge Business School, Simon Sainsbury Centre, S2.01

Other talks

Talk TBC Title to be confirmed Title to be confirmed Title TBC Tea and Coffee Break The Magic of Magnetism
 

© 2006-2025 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity