Search Results for ""

Every continuous linear functional U[f] for f in C[a,b] can be expressed as a Stieltjes integral U[f]=int_a^bf(x)dw(x), where w(x) is determined by U and is of bounded ...

Increasing a plane figure's linear dimensions by a scale factor s increases the perimeter p^'->sp and the area A^'->s^2A.

An Auslander algebra which connects the representation theories of the symmetric group of permutations and the general linear group GL(n,C). Schur algebras are ...

Also known as the total curvature. The linear element of the indicatrix ds_P=sqrt(ds_T^2+ds_B^2).

The algebra structure of linear functionals on polynomials of a single variable (Roman 1984, pp. 2-3).

Integer programming in a special case of linear programming in which all variables are required to take on integer values only. Set covering deployment is an example ...

A method of solving combinatorial problems by means of an algorithm which is allowed to run forward until a dead end is reached, at which point previous steps are retraced ...

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 ...

There are a couple of versions of this theorem. Basically, it says that any bounded linear functional T on the space of compactly supported continuous functions on X is the ...

The improvement of the convergence properties of a series, also called convergence acceleration or accelerated convergence, such that a series reaches its limit to within ...