✦ LIBER ✦

An iteration method of finding the best approximation polynomial

✍ Scribed by A.A. Korneichuk; N.Yu. Shirikova

Publisher: Elsevier Science
Year: 1968
Weight: 225 KB
Volume: 8
Category: Article
ISSN: 0041-5553
DOI: 10.1016/0041-5553(68)90077-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation-iterative method of app

An approximation-iterative method of approximating the solution of Cauchy's problem for ordinary differential equations using polynomials

✍ V.K. Dzjadyk 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 755 KB

An approximate method of finding the gre

An approximate method of finding the greatest of the moduli of the roots of a polynomial

✍ S.A. Ivanov; A.Ya. Lepin; E.I. Lepina 📂 Article 📅 1976 🏛 Elsevier Science ⚖ 111 KB

Unboundedness of the Lipschitz Constants

Unboundedness of the Lipschitz Constants of Best Polynomial Approximation

✍ Wolfgang Gehlen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 221 KB

An Iterated Eigenvalue Algorithm for App

An Iterated Eigenvalue Algorithm for Approximating Roots of Univariate Polynomials

✍ Steven Fortune 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 655 KB

We discuss an iterative algorithm that approximates all roots of a univariate polynomial. The iteration is based on floating-point computation of the eigenvalues of a generalized companion matrix. With some assumptions, we show that the algorithm approximates the roots within about log ρ/ χ(P ) iter

On the Zeros of Polynomials of Best Appr

On the Zeros of Polynomials of Best Approximation

✍ Thomas Bloom; Jerzy Szczepański 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 141 KB

Derivatives of the algebraic polynomials

Derivatives of the algebraic polynomials of best approximation

✍ Maurice Hasson 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 519 KB