slovo | definícia |
iteration (encz) | iteration,iterace n: Zdeněk Brož |
iteration (encz) | iteration,opakování n: Zdeněk Brož |
Iteration (gcide) | Iteration \It`er*a"tion\, n. [L. iteratio.]
1. Recital or performance a second time; repetition. --Bacon.
[1913 Webster]
What needs this iteration, woman? --Shak.
[1913 Webster]
2. (Computers) The execution of a statement or series of
statements in a loop which is repeated in a computer
program; as, at each iteration, the counter is incremented
by 2.
[PJC] |
iteration (wn) | iteration
n 1: (computer science) a single execution of a set of
instructions that are to be repeated; "the solution took
hundreds of iterations" [syn: iteration, loop]
2: (computer science) executing the same set of instructions a
given number of times or until a specified result is
obtained; "the solution is obtained by iteration" [syn:
iteration, looping]
3: doing or saying again; a repeated performance |
iteration (foldoc) | iteration
Repetition of a sequence of instructions. A
fundamental part of many algorithms. Iteration is
characterised by a set of initial conditions, an iterative
step and a termination condition.
A well known example of iteration in mathematics is Newton-Raphson
iteration. Iteration in programs is expressed using a loop,
e.g. in C:
new_x = n/2;
do
{
x = new_x;
new_x = 0.5 * (x + n/x);
} while (abs(new_x-x) > epsilon);
Iteration can be expressed in functional languages using
recursion:
solve x n = if abs(new_x-x) > epsilon
then solve new_x n
else new_x
where new_x = 0.5 * (x + n/x)
solve n/2 n
(1998-04-04)
|
| podobné slovo | definícia |
alliteration (encz) | alliteration,aliterace n: Zdeněk Brož |
iteration (encz) | iteration,iterace n: Zdeněk Brožiteration,opakování n: Zdeněk Brož |
iterations (encz) | iterations,iterace pl. Zdeněk Brožiterations,průchody n: pl. Zdeněk Brož |
obliteration (encz) | obliteration,vyhlazení n: Zdeněk Brožobliteration,vymazání n: Zdeněk Brož |
reiteration (encz) | reiteration,opakování n: Zdeněk Brožreiteration,zopakování n: Zdeněk Brož |
transliteration (encz) | transliteration,přepis n: Zdeněk Brožtransliteration,transliterace n: Zdeněk Brož |
Alliteration (gcide) | Alliteration \Al*lit`er*a"tion\, n. [L. ad + litera letter. See
Letter.]
The repetition of the same letter at the beginning of two or
more words immediately succeeding each other, or at short
intervals; as in the following lines:
[1913 Webster]
Behemoth, biggest born of earth, upheaved
His vastness. --Milton.
[1913 Webster]
Fly o'er waste fens and windy fields. --Tennyson.
[1913 Webster]
Note: The recurrence of the same letter in accented parts of
words is also called alliteration. Anglo-Saxon poetry
is characterized by alliterative meter of this sort.
Later poets also employed it.
[1913 Webster]
In a somer seson whan soft was the sonne,
I shope me in shroudes as I a shepe were. --P.
Plowman.
[1913 Webster] |
Literation (gcide) | Literation \Lit`er*a"tion\ (l[i^]t`[~e]r*[=a]"sh[u^]n), n. [L.
littera, litera, letter.]
The act or process of representing by letters.
[1913 Webster] |
Obliteration (gcide) | Obliteration \Ob*lit`er*a"tion\, n. [L. obliteratio: cf. F.
oblit['e]ration.]
The act of obliterating, or the state of being obliterated;
extinction. --Sir. M. Hale.
[1913 Webster] |
Reiteration (gcide) | Reiteration \Re*it`er*a"tion\ (-?"sh?n), n. [Cf. F.
r['e]it['e]ration.]
The act of reiterating; that which is reiterated.
[1913 Webster] |
Transliteration (gcide) | Transliteration \Trans*lit`er*a"tion\, n.
The act or product of transliterating, or of expressing words
of a language by means of the characters of another alphabet.
[1913 Webster] |
alliteration (wn) | alliteration
n 1: use of the same consonant at the beginning of each stressed
syllable in a line of verse; "around the rock the ragged
rascal ran" [syn: alliteration, initial rhyme,
beginning rhyme, head rhyme] |
iteration (wn) | iteration
n 1: (computer science) a single execution of a set of
instructions that are to be repeated; "the solution took
hundreds of iterations" [syn: iteration, loop]
2: (computer science) executing the same set of instructions a
given number of times or until a specified result is
obtained; "the solution is obtained by iteration" [syn:
iteration, looping]
3: doing or saying again; a repeated performance |
obliteration (wn) | obliteration
n 1: destruction by annihilating something [syn: annihilation,
obliteration]
2: the complete destruction of every trace of something [syn:
eradication, obliteration] |
reiteration (wn) | reiteration
n 1: the act of repeating over and again (or an instance
thereof) [syn: reduplication, reiteration] |
transliteration (wn) | transliteration
n 1: a transcription from one alphabet to another |
conversion to iteration (foldoc) | conversion to iteration
A transformation applied to
functional programs that replaces recursion with
iteration. A tail-recursive function can be compiled to
an iterative loop such that the recursive call becomes a
jump back to the start and the parameters are held in
registers which are updated with new values each time around
the loop.
This is closely related to tail recursion optimisation.
(2019-11-21)
|
iteration (foldoc) | iteration
Repetition of a sequence of instructions. A
fundamental part of many algorithms. Iteration is
characterised by a set of initial conditions, an iterative
step and a termination condition.
A well known example of iteration in mathematics is Newton-Raphson
iteration. Iteration in programs is expressed using a loop,
e.g. in C:
new_x = n/2;
do
{
x = new_x;
new_x = 0.5 * (x + n/x);
} while (abs(new_x-x) > epsilon);
Iteration can be expressed in functional languages using
recursion:
solve x n = if abs(new_x-x) > epsilon
then solve new_x n
else new_x
where new_x = 0.5 * (x + n/x)
solve n/2 n
(1998-04-04)
|
newton-raphson iteration (foldoc) | Newton-Raphson iteration
An iterative algorithm for solving equations.
Given an equation,
f x = 0
and an initial approximation, x(0), a better approximation is
given by:
x(i+1) = x(i) - f(x(i)) / f'(x(i))
where f'(x) is the first derivative of f, df/dx.
Newton-Raphson iteration is an example of an {anytime
algorithm} in that each approximation is no worse than the
previous one.
(2007-06-19)
|
|