Abstract
We present a new method for computing zeros of polynomial systems using the algebraic solver and the QR-method. It is based on the theory of algebraic solvers. The unstable calculation of the determinant of the large matrix is replaced by a stable technique using the QR-method. Algorithms and numerical results are presented.
Original language | English |
---|---|
Pages (from-to) | 110-120 |
Number of pages | 11 |
Journal | International Journal of Computer Mathematics |
Volume | 88 |
Issue number | 1 |
DOIs | |
Publication status | Published - Jan 2011 |
Keywords
- QR-method
- algebraic solver
- polynomial systems
ASJC Scopus subject areas
- Computer Science Applications
- Computational Theory and Mathematics
- Applied Mathematics