Search Results for ""

Stationary iterative methods are methods for solving a linear system of equations Ax=b, where A is a given matrix and b is a given vector. Stationary iterative methods can be ...

Let sopfr(n) be the sum of prime factors (with repetition) of a number n. For example, 20=2^2·5, so sopfr(20)=2+2+5=9. Then sopfr(n) for n=1, 2, ... is given by 0, 2, 3, 4, ...

Let f(z) be a transcendental meromorphic function, and let D_1, D_2, ..., D_5 be five simply connected domains in C with disjoint closures (Ahlfors 1932). Then there exists j ...

Successive application of Archimedes' recurrence formula gives the Archimedes algorithm, which can be used to provide successive approximations to pi (pi). The algorithm is ...

Bisection is the division of a given curve, figure, or interval into two equal parts (halves). A simple bisection procedure for iteratively converging on a solution which is ...

The box fractal is a fractal also called the anticross-stitch curve which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 0 ...

Using a Tschirnhausen transformation, the principal quintic form can be transformed to the one-parameter form w^5-10cw^3+45c^2w-c^2=0 (1) named after Francesco Brioschi ...

Let p_n/q_n be the sequence of convergents of the continued fraction of a number alpha. Then a Brjuno number is an irrational number such that ...

A fractal which can be constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[0 1 0; 1 1 1; 0 1 0],1->[1 1 1; 1 1 1; 1 1 1]}. (1) The size ...

Any computable function can be incorporated into a program using while-loops (i.e., "while something is true, do something else"). For-loops (which have a fixed iteration ...