✦ LIBER ✦

Structured matrix methods for the computation of multiple roots of a polynomial

✍ Scribed by Winkler, Joab R.

Book ID: 123208346
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 524 KB
Volume: 272
Category: Article
ISSN: 0377-0427
DOI: 10.1016/j.cam.2013.08.032

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The computation of multiple roots of a p

The computation of multiple roots of a polynomial

✍ Joab R. Winkler; Xin Lao; Madina Hasan 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 476 KB

A study of accelerated Newton methods fo

A study of accelerated Newton methods for multiple polynomial roots

✍ Aurél Galántai; Csaba J. Hegedűs 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 446 KB

Method for finding multiple roots of pol

Method for finding multiple roots of polynomials

✍ Chang-Dau Yan; Wei-Hua Chieng 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 851 KB

Conventional numerical methods for finding multiple roots of polynomials are inaccurate. The accuracy is unsatisfactory because the derivatives of the polynomial in the intermediate steps of the associated root-finding procedures are eliminated. Engineering applications require that this problem be

Matrix methods for computing the values

Matrix methods for computing the values of a multivariable polynomial

✍ G.S. Ganshin 📂 Article 📅 1989 🏛 Elsevier Science ⚖ 333 KB

Generalization of Obreshkoff's method fo

Generalization of Obreshkoff's method for multiple roots of polynomials

✍ Iliev A.I. 📂 Library 📅 2001 🌐 English ⚖ 35 KB

A Method for the Computation of the Grea

A Method for the Computation of the Greatest Root of a Positive Matrix

✍ Brauer, Alfred 📂 Article 📅 1957 🏛 Society for Industrial and Applied Mathematics ⚖ 337 KB