- quadratic convergence
- мат. квадратическая сходимость
Большой англо-русский и русско-английский словарь. 2001.
quadratic convergence
Смотреть что такое "quadratic convergence" в других словарях:
Quadratic — In mathematics, the term quadratic describes something that pertains to squares, to the operation of squaring, to terms of the second degree, or equations or formulas that involve such terms. Quadratus is Latin for square . Mathematics Algebra… … Wikipedia
Quadratic variation — In mathematics, quadratic variation is used in the analysis of stochastic processes such as Brownian motion and martingales. Quadratic variation is just one kind of variation of a process. Definition Suppose that X t is a real valued stochastic… … Wikipedia
Convergence problem — In the analytic theory of continued fractions, the convergence problem is the determination of conditions on the partial numerators ai and partial denominators bi that are sufficient to guarantee the convergence of the continued fraction This… … Wikipedia
Rate of convergence — In numerical analysis, the speed at which a convergent sequence approaches its limit is called the rate of convergence. Although strictly speaking, a limit does not give information about any finite first part of the sequence, this concept is of… … Wikipedia
Solving quadratic equations with continued fractions — In mathematics, a quadratic equation is a polynomial equation of the second degree. The general form is:ax^2+bx+c=0,,!where a ne; 0.Students and teachers all over the world are familiar with the quadratic formula that can be derived by completing … Wikipedia
Newton's method — In numerical analysis, Newton s method (also known as the Newton–Raphson method), named after Isaac Newton and Joseph Raphson, is a method for finding successively better approximations to the roots (or zeroes) of a real valued function. The… … Wikipedia
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
Limit (mathematics) — This is an overview of the idea of a limit in mathematics. For specific uses of a limit, see limit of a sequence and limit of a function. In mathematics, the concept of a limit is used to describe the value that a function or sequence approaches… … Wikipedia
Bairstow's method — In numerical analysis, Bairstow s method is an efficient algorithm for finding the roots of a real polynomial of arbitrary degree. The algorithm first appeared in the appendix of the 1920 book Applied Aerodynamics by Leonard Bairstow. The… … Wikipedia
Jenkins-Traub algorithm — The Jenkins Traub algorithm for polynomial zeros is a fast globally convergent iterative method. It has been described as practically a standard in black box polynomial root finders .Given a polynomial P ,:P(z)=sum {i=0}^na iz^{n i}, quad a… … Wikipedia
