Search Results for ""

A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...

Newton's method, also called the Newton-Raphson method, is a root-finding algorithm that uses the first few terms of the Taylor series of a function f(x) in the vicinity of a ...

A polynomial is a mathematical expression involving a sum of powers in one or more variables multiplied by coefficients. A polynomial in one variable (i.e., a univariate ...

The power tower of order k is defined as a^^k=a^(a^(·^(·^(·^a))))_()_(k), (1) where ^ is Knuth up-arrow notation (Knuth 1976), which in turn is defined by ...

The tower of Hanoi (commonly also known as the "towers of Hanoi"), is a puzzle invented by E. Lucas in 1883. It is also known as the Tower of Brahma puzzle and appeared as an ...

Let n be a positive nonsquare integer. Then Artin conjectured that the set S(n) of all primes for which n is a primitive root is infinite. Under the assumption of the ...

The Balaban 11-cage is the unique 11-cage graph, derived via a tree excision from the 12-cage graph by Balaban (1973) and proven unique by McKay and Myrvold in 2003. It is ...

The conjugate gradient method is not suitable for nonsymmetric systems because the residual vectors cannot be made orthogonal with short recurrences, as proved in Voevodin ...

Chebyshev iteration is a method for solving nonsymmetric problems (Golub and van Loan 1996, §10.1.5; Varga, 1962, Ch. 5). Chebyshev iteration avoids the computation of inner ...