To iteratively solve large linear systems, many current state-of-the-art methods work by finding approximate solutions in successively larger (Krylov) subspaces. Are there similar iterative methods for solving systems of polynomial equations by finding approximate solutions on successively larger algebraic sets?


Sort of, the root finding problem is equivalent to the eigenvalue problem associated with the companion matrix. Nonsymmetric eigenvalue methods such as "Krylov-Schur" can be used here.


  • The monic polynomials are extremely ill-conditioned and thus a better conditioned polynomial basis is mandatory for moderate to high order.

  • The companion matrix is already Hessenberg.

| cite | improve this answer | |
  • 5
    $\begingroup$ I presume you didn't see the word "system"? Otherwise, could you give an explicit example of turning two equations in two unknowns into a companion matrix whose eigenvalues are the roots of the original system? $\endgroup$ – J. M. isn't a mathematician Sep 26 '11 at 0:52
  • $\begingroup$ I am very curious about companion matrices for systems of equations. Is there some place to read about them? $\endgroup$ – mathreadler Aug 7 '16 at 18:49

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.