Search Results for ""

An algorithm for partitioning (or clustering) N data points into K disjoint subsets S_j containing N_j data points so as to minimize the sum-of-squares criterion ...

The expected number of real zeros E_n of a random polynomial of degree n if the coefficients are independent and distributed normally is given by E_n = ...

The so-called generalized Kadomtsev-Petviashvili-Burgers equation is the partial differential equation ...

Kakutani's fixed point theorem is a result in functional analysis which establishes the existence of a common fixed point among a collection of maps defined on certain ...

An algorithm in control theory introduced by Kalman (1960) and refined by Kalman and Bucy (1961). It is an algorithm which makes optimal use of imprecise data on a linear (or ...

Suppose x_1<x_2<...<x_n are given positive numbers. Let lambda_1, ..., lambda_n>=0 and sum_(j=1)^(n)lambda_j=1. Then ...

x_(n+1) = 2x_n (1) y_(n+1) = alphay_n+cos(4pix_n), (2) where x_n, y_n are computed mod 1 (Kaplan and Yorke 1979). The Kaplan-Yorke map with alpha=0.2 has correlation exponent ...

Consider an n-digit number k. Square it and add the right n digits to the left n or n-1 digits. If the resultant sum is k, then k is called a Kaprekar number. For example, 9 ...

A Kapteyn series is a series of the form sum_(n=0)^inftyalpha_nJ_(nu+n)[(nu+n)z], (1) where J_n(z) is a Bessel function of the first kind. Examples include Kapteyn's original ...

A katadrome is a number whose hexadecimal digits are in strict descending order. The first few are 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 32, 33, 48, 49, ... ...