TOPICS
Search

Search Results for ""


31 - 40 of 1392 for Linear programmingSearch Results
A linear recurrence equation is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a first-degree polynomial in x_k with k<n. For example ...
A method for generating random (pseudorandom) numbers using the linear recurrence relation X_(n+1)=aX_n+c (mod m), where a and c must assume certain fixed values, m is some ...
The projective special linear group PSL_n(q) is the group obtained from the special linear group SL_n(q) on factoring by the scalar matrices contained in that group. It is ...
The sum of the reciprocals of roots of an equation equals the negative coefficient of the linear term in the Maclaurin series.
Given an m×n matrix A, the fundamental theorem of linear algebra is a collection of results relating various properties of the four fundamental matrix subspaces of A. In ...
An inhomogeneous linear ordinary differential equation with constant coefficients is an ordinary differential equation in which coefficients are constants (i.e., not ...
A homogeneous linear ordinary differential equation with constant coefficients is an ordinary differential equation in which coefficients are constants (i.e., not functions), ...
Consider the general system of two first-order ordinary differential equations x^. = f(x,y) (1) y^. = g(x,y). (2) Let x_0 and y_0 denote fixed points with x^.=y^.=0, so ...
Denoted sl_n.
A precise sequence of instructions designed to accomplish a given task. The implementation of an algorithm on a computer using a programming language is an example of a ...
1|2|3|4|5|6|7 ... 140 Previous Next

...