- Graeffe method
-
/gref"euh, graf"euh/, Math.a method, involving the squaring of roots, for approximating the solutions to algebraic equations.
* * *
Universalium. 2010.
Graeffe method
Look at other dictionaries:
Graeffe method — /gref euh, graf euh/, Math. a method, involving the squaring of roots, for approximating the solutions to algebraic equations … Useful english dictionary
Graeffe's method — In mathematics, Graeffe s method or Dandelin–Graeffe method is an algorithm for finding all of the roots of a polynomial. It was developed independently by Germinal Pierre Dandelin in 1826 and Karl Heinrich Gräffe in 1837. Lobachevsky in 1834… … Wikipedia
Splitting circle method — In mathematics, the splitting circle method is a numerical algorithm for the numerical factorization of a polynomial and, ultimately, for finding its complex roots. It was introduced by Arnold Schönhage in his 1982 paper The fundamental theorem… … Wikipedia
Théorie des équations (mathématiques) — Pour les articles homonymes, voir Théorie des équations. La théorie des équations est la partie des mathématiques qui traite des problèmes posés par les équations polynomiales de tous les degrés. Se trouvent ainsi rassemblés les problèmes de… … Wikipédia en Français
List of numerical analysis topics — This is a list of numerical analysis topics, by Wikipedia page. Contents 1 General 2 Error 3 Elementary and special functions 4 Numerical linear algebra … Wikipedia
Root-finding algorithm — A root finding algorithm is a numerical method, or algorithm, for finding a value x such that f(x) = 0, for a given function f. Such an x is called a root of the function f. This article is concerned with finding scalar, real or complex roots,… … Wikipedia
List of mathematics articles (G) — NOTOC G G₂ G delta space G networks Gδ set G structure G test G127 G2 manifold G2 structure Gabor atom Gabor filter Gabor transform Gabor Wigner transform Gabow s algorithm Gabriel graph Gabriel s Horn Gain graph Gain group Galerkin method… … Wikipedia
Algorithme de recherche d'un zéro d'une fonction — Un algorithme de recherche d un zéro d’une fonction est une méthode numérique ou un algorithme de recherche d’une valeur approchée d’un x vérifiant f(x) = 0, pour une fonction donnée f. Ici, x est un nombre réel appelé zéro de f ou lorsque f est… … Wikipédia en Français
Germinal Pierre Dandelin — Nacimiento 12 de abril de 1794 París, Francia … Wikipedia Español
Properties of polynomial roots — In mathematics, a polynomial is a function of the form: p(x) = a 0 + a 1 x + cdots a n x^n, quad xin mathbb{C}where the coefficients a 0, ldots, a n are complex numbers. The fundamental theorem of algebrastates that polynomial p has n roots. The… … Wikipedia
