Search Results for ""

The number of partitions of n in which no parts are multiples of k is sometimes denoted b_k(n) (Gordon and Ono 1997). b_k(n) is also the number of partitions of n into at ...

An initial point that provides safe convergence of Newton's method (Smale 1981; Petković et al. 1997, p. 1).

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Rosenbrock methods.

A generalization of the Runge-Kutta method for solution of ordinary differential equations, also called Kaps-Rentrop methods.

There are two definitions of the supersingular primes: one group-theoretic, and the other number-theoretic. Group-theoretically, let Gamma_0(N) be the modular group Gamma0, ...

The irrational constant R = e^(pisqrt(163)) (1) = 262537412640768743.9999999999992500... (2) (OEIS A060295), which is very close to an integer. Numbers such as the Ramanujan ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

A method of stochastic optimization including techniques such as gradient search or Robbins-Monro stochastic approximation.

The word weight has many uses in mathematics. It can refer to a function w(x) (also called a weighting function or weighting function) used to normalize orthogonal functions. ...

For discrete problems in which no efficient solution method is known, it might be necessary to test each possibility sequentially in order to determine if it is the solution. ...