Search Results for ""

The nth-order Sierpiński carpet graph is the connectivity graph of black squares in the nth iteration of the Sierpiński carpet fractal. The first three iterations are shown ...

The nth-order Sierpiński tetrahedron graph is the connectivity graph of black triangles in the nth iteration of the tetrix fractal. The first three iterations are shown ...

The Blancmange function, also called the Takagi fractal curve (Peitgen and Saupe 1988), is a pathological continuous function which is nowhere differentiable. Its name ...

The Menger sponge is a fractal which is the three-dimensional analog of the Sierpiński carpet. The nth iteration of the Menger sponge is implemented in the Wolfram Language ...

The Sierpiński carpet is the fractal illustrated above which may be constructed analogously to the Sierpiński sieve, but using squares instead of triangles. It can be ...

The symmetric successive overrelaxation (SSOR) method combines two successive overrelaxation method (SOR) sweeps together in such a way that the resulting iteration matrix is ...

The tetrix is the three-dimensional analog of the Sierpiński sieve illustrated above, also called the Sierpiński sponge or Sierpiński tetrahedron. The nth iteration of the ...

Wolfram (2002, p. 123) considered the sequence related to the Collatz problem obtained by iterating w_n={3/2w_(n-1) for w_(n-1) even; 3/2(w_(n-1)+1) for w_(n-1) odd (1) ...

A square root of x is a number r such that r^2=x. When written in the form x^(1/2) or especially sqrt(x), the square root of x may also be called the radical or surd. The ...

The theory of classifying problems based on how difficult they are to solve. A problem is assigned to the P-problem (polynomial-time) class if the number of steps needed to ...