iterated

SearchAdvancedHelp

(0.001 seconds)

11—20 of 20 matching pages

11: Bibliography J

… ►

Memoire sur l’itération des fonctions rationnelles. J. Math. Pures Appl. 8 (1), pp. 47–245 (French).

ⓘ

External Links:

FullText, ZentralBlatt

Referenced by:

§3.8(viii).

Encodings:

BibTeX

12: Bibliography O

… ►

Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, New York.

ⓘ

Notes:

Reprinted in 2000 by the Society for Industrial and Applied Mathematics (SIAM), Philadelphia, Pennsylvania

External Links:

MathReview (J. F. Traub), ZentralBlatt (Nelli Dimitrova (Sofia))

Referenced by:

§3.8(vii).

Encodings:

BibTeX

…

13: Bibliography T

… ►

Iterative Methods for the Solution of Equations. Prentice-Hall Series in Automatic Computation, Prentice-Hall Inc., Englewood Cliffs, N.J..

ⓘ

External Links:

MathReview (W. C. Rheinboldt), ZentralBlatt

Referenced by:

§3.8(iii).

Encodings:

BibTeX

…

14: Bibliography S

… ►

Time propagation of partial differential equations using the short iterative Lanczos method and finite-element discrete variable representation. Adv. Quantum Chem. 72, pp. 95–127.

ⓘ

Referenced by:

§18.38(i).

Encodings:

BibTeX

… ►

The accuracy of iterated JWBK approximations for Coulomb radial functions. Comput. Phys. Comm. 32 (2), pp. 115–119.

ⓘ

External Links:

Document

Referenced by:

§33.23(vii).

Encodings:

BibTeX

… ►

Bounds on differences of adjacent zeros of Bessel functions and iterative relations between consecutive zeros. Math. Comp. 70 (235), pp. 1205–1220.

ⓘ

External Links:

ISSN 0025-5718, Document, MathReview (Boro Döring), ZentralBlatt

Referenced by:

§10.74(vi).

Encodings:

BibTeX

…

15: 19.36 Methods of Computation

… ►When the differences are moderately small, the iteration is stopped, the elementary symmetric functions of certain differences are calculated, and a polynomial consisting of a fixed number of terms of the sum in (19.19.7) is evaluated. … ►If the iteration of (19.36.6) and (19.36.12) is stopped when ($M$ and $T$ being approximated by $a_s$ and $t_s$, and the infinite series being truncated), then the relative error in $R_F$ and $R_G$ is less than $r$ if we neglect terms of order $r^2$. …

16: 3.10 Continued Fractions

… ►To compute the $C_n$ of (3.10.2) we perform the iterated divisions …

17: 19.5 Maclaurin and Related Expansions

…

18: 3.11 Approximation Techniques

… ►to $f(x)$, then the coefficients $a_k$ can be computed iteratively. … ►The iterative process converges locally and quadratically (§3.8(i)). …

19: Bibliography G

… ►

Evaluation of $q$-gamma function and $q$-analogues by iterative algorithms. Numer. Algorithms 49 (1-4), pp. 159–168.

ⓘ

External Links:

ISSN 1017-1398, Document, FullText, MathReview (Necdet Batir), ZentralBlatt

Referenced by:

§17.18, §17.18, §5.21, §5.21.

Encodings:

BibTeX

…

20: 17.6 ${}_2{}^{}\varphi _1^{}$ Function

… ►

Iterations of $𝒟$

…