Resultants method for approximating real fixed points of polynomials

Research output: Contribution to journalArticlepeer-review

6 Citations (Scopus)


We present a new method for computing the real fixed points of polynomials using the resultants method. It is based on the theory of multi-resultants. The unstable calculation of the determinant of the large sparse matrix is replaced by a stable minimization problem using the Lanczos method. This technique will be able to take advantage of the sparseness of the resultant matrix. Algorithms and numerical results are presented.

Original languageEnglish
Pages (from-to)879-891
Number of pages13
JournalComputers and Mathematics with Applications
Issue number7-8
Publication statusPublished - Apr 2001
Externally publishedYes

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computational Theory and Mathematics
  • Computational Mathematics


Dive into the research topics of 'Resultants method for approximating real fixed points of polynomials'. Together they form a unique fingerprint.

Cite this