QR-algebraic method for approximating zeros of system of polynomials

Hani Khashan, Muhammed I. Syam

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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 languageEnglish
Pages (from-to)110-120
Number of pages11
JournalInternational Journal of Computer Mathematics
Issue number1
Publication statusPublished - Jan 2011


  • QR-method
  • algebraic solver
  • polynomial systems

ASJC Scopus subject areas

  • Computer Science Applications
  • Computational Theory and Mathematics
  • Applied Mathematics


Dive into the research topics of 'QR-algebraic method for approximating zeros of system of polynomials'. Together they form a unique fingerprint.

Cite this