finite trace
Смотреть что такое "finite trace" в других словарях:
Finite-difference time-domain method — Finite difference time domain (FDTD) is a popular computational electrodynamics modeling technique. It is considered easy to understand and easy to implement in software. Since it is a time domain method, solutions can cover a wide frequency… … Wikipedia
Trace class — In mathematics, a trace class operator is a compact operator for which a trace may be defined, such that the trace is finite and independent of the choice of basis. Trace class operators are essentially the same as nuclear operators, though many… … Wikipedia
Trace Zero Cryptography — In the year 1998 Gerhard Frey firstly purposed using trace zero varieties for cryptographic purpose. These varieties are subgroups of the divisor class group on a low genus hyperelliptic curve defined over a finite field. These groups can be used … Wikipedia
Finite rank operator — In functional analysis, a finite rank operator is a bounded linear operator between Banach spaces whose range is finite dimensional. Finite rank operators on a Hilbert space A canonical form Finite rank operators are matrices (of finite size)… … Wikipedia
Trace (linear algebra) — In linear algebra, the trace of an n by n square matrix A is defined to be the sum of the elements on the main diagonal (the diagonal from the upper left to the lower right) of A, i.e., where aii represents the entry on the ith row and ith column … Wikipedia
Trace monoid — In mathematics and computer science, a trace is a set of strings, wherein certain letters in the string are allowed to commute, but others are not. It generalizes the concept of a string, by not forcing the letters to always be in a fixed order,… … Wikipedia
Partial trace — In linear algebra and functional analysis, the partial trace is a generalization of the trace. Whereas the trace is a scalar valued function on operators, the partial trace is an operator valued function. The partial trace has applications in… … Wikipedia
Representation theory of finite groups — In mathematics, representation theory is a technique for analyzing abstract groups in terms of groups of linear transformations. See the article on group representations for an introduction. This article discusses the representation theory of… … Wikipedia
Field trace — In mathematics, the field trace is a linear mapping defined for certain field extensions. If L / K is a finite Galois extension, it is defined for α in L as the sum of all the conjugates: g (α)of α, for g in the Galois group G of L over K . It is … Wikipedia
Nondeterministic finite-state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
Nondeterministic finite state machine — In the theory of computation, a nondeterministic finite state machine or nondeterministic finite automaton (NFA) is a finite state machine where for each pair of state and input symbol there may be several possible next states. This distinguishes … Wikipedia
