Operator (computer programming)

About: Operator (computer programming) is a research topic. Over the lifetime, 40896 publications have been published within this topic receiving 671452 citations. The topic is also known as: operator symbol & operator name.

Factorization problems and operator identities

Abstract: CONTENTS Introduction Chapter I. Factorization of the transfer operator-valued function § 1. Realization of operator-valued functions § 2. A factorization method § 3. Factorization of rational operator-valued functions Chapter II. Operator identities and S-nodes § 1. Simplest properties of an S-node § 2. Symmetric S-nodes § 3. The operator Bezoutiant Chapter III. Continual factorizations and inverse problems § 1. The continual factorization of W(z) § 2. The inverse problem for bounded operator-valued functions § 3. The direct and the inverse spectral problems Chapter IV. Applications and examples § 1. An effective solution of the inverse problem § 2. Examples § 3. Interpolation problems § 4. On a class of extremal problems References

On the spectrum of the linear transport operator

Abstract: In this paper, spectral properties of the time‐independent linear transport operator A are studied. This operator is defined in its natural Banach space L 1(D × V), where D is the bounded space domain and V is the velocity domain. The collision operator K accounts for elastic and inelastic slowing down, fission, and low energy elastic and inelastic scattering. The various cross sections in K and the total cross section are piecewise continuous functions of position and speed. The two cases ν0>0 and ν0=0 are treated, where ν0 is the minimum neutron speed. For ν0=0, it is shown that σ(A) consists of a full half‐plane plus, in an adjoining strip, point eigenvalues and curves. For ν0>0, σ(A) consists just of point eigenvalues and curves in a certain half‐space. In both cases, the curves are due to purely elastic ``Bragg'' scattering and are absent if this scattering does not occur. Finally the spectral differences between the two cases ν0>0 and ν0=0 are discussed briefly, and it is proved that A is the infinitesimal generator of a strongly continuous semigroup of operators.

Fuzzy Set-Theoretic Operators and Quantifiers

Abstract: This chapter summarizes main ways to extend classical set-theoretic operations (complementation, intersection, union, set-difference) and related concepts (inclusion, quantifiers) for fuzzy sets Since these extensions are mainly pointwisely defined, we review basic results on the underlying unary or binary operations on the unit interval such as negations, t-norms, t-conorms, implications, coimplications and equivalences Some strongly related connectives (means, OWA, weighted, and prioritized operations) are also considered, emphasizing the essential differences between these and the formerly investigated operator classes We also show other operations which have no counterpart in the classical theory but play some important role in fuzzy sets (like symmetric sums, weak t-norms and conorms, compensatory AND)