Resultants method for approximating real fixed points of polynomials

M. I. Syam

doi:10.1016/S0898-1221(00)00326-6

Resultants method for approximating real fixed points of polynomials

M. I. Syam

Research output: Contribution to journal › Article › peer-review

6 Citations (Scopus)

Abstract

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 language	English
Pages (from-to)	879-891
Number of pages	13
Journal	Computers and Mathematics with Applications
Volume	41
Issue number	7-8
DOIs	https://doi.org/10.1016/S0898-1221(00)00326-6
Publication status	Published - Apr 2001
Externally published	Yes

ASJC Scopus subject areas

Modelling and Simulation
Computational Theory and Mathematics
Computational Mathematics

Access to Document

10.1016/S0898-1221(00)00326-6

Cite this

@article{a4360e4ba5d747bdb874acd84b293fec,

title = "Resultants method for approximating real fixed points of polynomials",

abstract = "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.",

author = "Syam, \{M. I.\}",

year = "2001",

month = apr,

doi = "10.1016/S0898-1221(00)00326-6",

language = "English",

volume = "41",

pages = "879--891",

journal = "Computers and Mathematics with Applications",

issn = "0898-1221",

publisher = "Elsevier Ltd",

number = "7-8",

}

TY - JOUR

T1 - Resultants method for approximating real fixed points of polynomials

AU - Syam, M. I.

PY - 2001/4

Y1 - 2001/4

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0035313118

UR - https://www.scopus.com/pages/publications/0035313118#tab=citedBy

U2 - 10.1016/S0898-1221(00)00326-6

DO - 10.1016/S0898-1221(00)00326-6

M3 - Article

AN - SCOPUS:0035313118

SN - 0898-1221

VL - 41

SP - 879

EP - 891

JO - Computers and Mathematics with Applications

JF - Computers and Mathematics with Applications

IS - 7-8

ER -

Resultants method for approximating real fixed points of polynomials

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this