- finite combination
- мат. конечная комбинация
Большой англо-русский и русско-английский словарь. 2001.
finite combination
Смотреть что такое "finite combination" в других словарях:
Finite-state machine — State machine redirects here. For infinite state machines, see State transition system. For fault tolerance methodology, see State machine replication. SFSM redirects here. For the Italian railway company, see Circumvesuviana. A finite state… … Wikipedia
Finite state machine — A finite state machine (FSM) or finite state automaton (plural: automata ) or simply a state machine, is a model of behavior composed of a finite number of states, transitions between those states, and actions. A finite state machine is an… … Wikipedia
Finite difference — A finite difference is a mathematical expression of the form f(x + b) − f(x + a). If a finite difference is divided by b − a, one gets a difference quotient. The approximation of derivatives by finite differences… … Wikipedia
Conical combination — Given a finite number of vectors in a real vector space, a conical combination or a conical sum [1] [2] of these vectors is a vector of the form where the real numbers satisfy … Wikipedia
Engineering treatment of the finite element method — This is a draft of a new explanation as suggested on . The finite element method (FEM) is a technique for finding approximate solutions to differential equations that is particularly useful in engineering. As of 2005, FEM is the primary analysis… … Wikipedia
Two-way deterministic finite automaton — In computer science, a two way deterministic finite automaton (2DFA) is an abstract machine, a generalized version of the deterministic finite automaton (DFA) which can revisit characters already processed. As in a DFA, there are a finite number… … Wikipedia
Convex combination — Given three points x1,x2,x3 in a plane as shown in the figure, the point P is a convex combination of the three points, while Q is not. (Q is however an affine combination of the three poin … Wikipedia
Block Lanczos algorithm for nullspace of a matrix over a finite field — The Block Lanczos algorithm for nullspace of a matrix over a finite field is a procedure for finding the nullspace of a matrix using only multiplication of the matrix by long, thin matrices. These long, thin matrices are considered as vectors of… … Wikipedia
Free Boolean algebra — In abstract algebra, a branch of mathematics, a free Boolean algebra is a Boolean algebra 〈 B , F 〉, such that the set B (called the carrier ) has a subset whose elements are called generators. The generators satisfy the following properties:… … Wikipedia
Abel–Ruffini theorem — The Abel–Ruffini theorem (also known as Abel s impossibility theorem) states that there is no general solution in radicals to polynomial equations of degree five or higher.MisinterpretationThe content of this theorem is frequently misunderstood.… … Wikipedia
Expression (mathematics) — In mathematics, an expression is a finite combination of symbols that is well formed according to rules that depend on the context. Symbols can designate numbers (constants), variables, operations, functions, and other mathematical symbols, as… … Wikipedia
