scispace - formally typeset
Search or ask a question

Showing papers on "Operator (computer programming) published in 2009"


Posted Content
Abstract: The proximity operator of a convex function is a natural extension of the notion of a projection operator onto a convex set. This tool, which plays a central role in the analysis and the numerical solution of convex optimization problems, has recently been introduced in the arena of signal processing, where it has become increasingly important. In this paper, we review the basic properties of proximity operators which are relevant to signal processing and present optimization methods based on these operators. These proximal splitting methods are shown to capture and extend several well-known algorithms in a unifying framework. Applications of proximal methods in signal recovery and synthesis are discussed.

2,095 citations


Posted Content
TL;DR: In this paper, the spectral graph wavelet operator is defined based on spectral decomposition of the discrete graph Laplacian, and a wavelet generating kernel and a scale parameter are used to localize this operator to an indicator function.
Abstract: We propose a novel method for constructing wavelet transforms of functions defined on the vertices of an arbitrary finite weighted graph. Our approach is based on defining scaling using the the graph analogue of the Fourier domain, namely the spectral decomposition of the discrete graph Laplacian $\L$. Given a wavelet generating kernel $g$ and a scale parameter $t$, we define the scaled wavelet operator $T_g^t = g(t\L)$. The spectral graph wavelets are then formed by localizing this operator by applying it to an indicator function. Subject to an admissibility condition on $g$, this procedure defines an invertible transform. We explore the localization properties of the wavelets in the limit of fine scales. Additionally, we present a fast Chebyshev polynomial approximation algorithm for computing the transform that avoids the need for diagonalizing $\L$. We highlight potential applications of the transform through examples of wavelets on graphs corresponding to a variety of different problem domains.

1,119 citations


Book
27 Jul 2009
TL;DR: In this paper, the authors introduce the concept of hypercyclicity everywhere and hypercyclic subspaces and the angle criterion for linear dynamics and the weak topology of the Riemann zeta function.
Abstract: Introduction 1. Hypercyclic and supercyclic operators 2. Hypercyclicity everywhere 3. Connectedness and hypercyclicity 4. Weakly mixing operators 5. Ergodic theory and linear dynamics 6. Beyond hypercyclicity 7. Common hypercyclic vectors 8. Hypercyclic subspaces 9. Supercyclicity and the angle criterion 10. Linear dynamics and the weak topology 11. Universality of the Riemann zeta function 12. About 'the' Read operator Appendices Notations Index Bibliography.

689 citations


Journal ArticleDOI
TL;DR: In this article, a multi-sublinear maximal operator that acts on the product of m Lebesgue spaces and is smaller than the m-fold product of the Hardy-Littlewood maximal function is studied.

462 citations


Journal ArticleDOI
TL;DR: The induced generalized ordered weighted averaging (IGOWA) operator is a new aggregation operator that generalizes the OWA operator, including the main characteristics of both the generalized OWA and the induced OWA operators.

405 citations


Journal ArticleDOI
TL;DR: In this paper, the general form of the fermion-fermion-gauge boson interactions generated by dimension-six gauge-invariant effective operators was simplified by using the equations of motion to remove redundant operators.

375 citations


Journal ArticleDOI
TL;DR: This paper first analyzes different discretizations of the Laplace-Beltrami operator (geometric Laplacians, linear and cubic FEM operators) in terms of the correctness of their eigenfunctions with respect to the continuous case, and presents the family of segmentations induced by the nodal sets of the eigen Functions, discussing its meaningfulness for shape understanding.

314 citations


Journal ArticleDOI
Ronald R. Yager1
TL;DR: The idea of multi-criteria aggregation functions is introduced and a number of properties desired in such functions are described, including a combined averaging and ''anding'' operator.

288 citations


Journal ArticleDOI
TL;DR: In this paper, the authors study the transport and mixing properties of flows in a variety of settings, connecting the classical geometrical approach via invariant manifolds with a probabilistic approach via transfer operators.

285 citations


Journal ArticleDOI
TL;DR: In this article, a low-rank operator is used to define smooth fields that are to be used in hadron creation operators, and the resulting space of smooth fields is small enough that all elements of the reduced quark propagator can be computed exactly at reasonable computational cost.
Abstract: A new quark-field smearing algorithm is defined which enables efficient calculations of a broad range of hadron correlation functions. The technique applies a low-rank operator to define smooth fields that are to be used in hadron creation operators. The resulting space of smooth fields is small enough that all elements of the reduced quark propagator can be computed exactly at reasonable computational cost. Correlations between arbitrary sources, including multihadron operators can be computed a posteriori without requiring new lattice Dirac operator inversions. The method is tested on realistic lattice sizes with light dynamical quarks.

264 citations


Journal ArticleDOI
Guiwu Wei1
TL;DR: The ULHGM operator generalizes both the ULWGM and ULOWG operators, and reflects the importance degrees of both the given arguments and their ordered positions, in a practical method for multiple attribute group decision making with uncertain linguistic preference relations.
Abstract: In this paper, we propose an uncertain linguistic hybrid geometric mean (ULHGM) operator, which is based on the uncertain linguistic weighted geometric mean (ULWGM) operator and the uncertain linguistic ordered weighted geometric (ULOWG) operator proposed by Xu [Z. S. Xu, "An approach based on the uncertain LOWG and induced uncertain LOWG operators to group decision making with uncertain multiplicative linguistic preference relations", Decision Support Systems41 (2006) 488–499] and study some desirable properties of the ULHGM operator. We have proved both ULWGM and ULOWG operators are the special case of the ULHGM operator. The ULHGM operator generalizes both the ULWGM and ULOWG operators, and reflects the importance degrees of both the given arguments and their ordered positions. Based on the ULWGM and ULHGM operators, we propose a practical method for multiple attribute group decision making with uncertain linguistic preference relations. Finally, an illustrative example demonstrates the practicality an...

Journal ArticleDOI
TL;DR: In this paper, a projection method for the numerical evaluation of Fredholm determinants is proposed, which is derived from the classical Nystrom method for solving Fredholm equations of the second kind, using Gauss-Legendre or Clenshaw-Curtis as the underlying quadrature rule.
Abstract: Some significant quantities in mathematics and physics are most naturally expressed as the Fredholm determinant of an integral operator, most notably many of the distribution functions in random matrix theory. Though their numerical values are of interest, there is no systematic numerical treatment of Fredholm determinants to be found in the literature. Instead, the few numerical evaluations that are available rely on eigenfunction expansions of the operator, if expressible in terms of special functions, or on alternative, numerically more straightforwardly accessible analytic expressions, e.g., in terms of Painleve transcendents, that have masterfully been derived in some cases. In this paper we close the gap in the literature by studying projection methods and, above all, a simple, easily implementable, general method for the numerical evaluation of Fredholm determinants that is derived from the classical Nystrom method for the solution of Fredholm equations of the second kind. Using Gauss—Legendre or Clenshaw—Curtis as the underlying quadrature rule, we prove that the approximation error essentially behaves like the quadrature error for the sections of the kernel. In particular, we get exponential convergence for analytic kernels, which are typical in random matrix theory. The application of the method to the distribution functions of the Gaussian unitary ensemble (GUE), in the bulk scaling limit and the edge scaling limit, is discussed in detail. After extending the method to systems of integral operators, we evaluate the two-point correlation functions of the more recently studied Airy and Airy 1 processes.

Journal ArticleDOI
Hisaya Fujioka1
TL;DR: Improved stability conditions are derived for sampled-data feedback control systems with uncertainly time-varying sampling intervals by exploiting the passivity-type property of the operator arising in the input-delay approach to the system in addition to the gain of theoperator.

Journal ArticleDOI
TL;DR: An operator-oriented characterization of L- fuzzy rough sets is presented, that is, L-fuzzy approximation operators are defined by axioms, and the relationship between L-magnitude rough sets and L-topological spaces is obtained.
Abstract: Rough set theory was developed by Pawlak as a formal tool for approximate reasoning about data Various fuzzy generalizations of rough approximations have been proposed in the literature As a further generalization of the notion of rough sets, L-fuzzy rough sets were proposed by Radzikowska and Kerre In this paper, we present an operator-oriented characterization of L-fuzzy rough sets, that is, L-fuzzy approximation operators are defined by axioms The methods of axiomatization of L-fuzzy upper and L-fuzzy lower set-theoretic operators guarantee the existence of corresponding L-fuzzy relations which produce the operators Moreover, the relationship between L-fuzzy rough sets and L-topological spaces is obtained The sufficient and necessary condition for the conjecture that an L-fuzzy interior (closure) operator derived from an L-fuzzy topological space can associate with an L-fuzzy reflexive and transitive relation such that the corresponding L-fuzzy lower (upper) approximation operator is the L-fuzzy interior (closure) operator is examined

Journal ArticleDOI
TL;DR: In this article, a cut-and-join operator in Hurwitz theory for merging of two branching points of arbitrary type was defined, which can be represented as differential operators of the $W$-type acting on the time-variables in the Hurwitz-Kontsevich tau function.
Abstract: We define cut-and-join operator in Hurwitz theory for merging of two branching points of arbitrary type. These operators have two alternative descriptions:(i) they have the GL characters as eigenfunctions and the symmetric-group characters as eigenvalues; (ii) they can be represented as differential operators of the $W$-type (in particular, acting on the time-variables in the Hurwitz-Kontsevich tau-function). The operators have the simplest form if expressed in terms of the matrix Miwa-variables. They form an important commutative associative algebra, a Universal Hurwitz Algebra, generalizing all group algebra centers of particular symmetric groups which are used in description of the Universal Hurwitz numbers of particular orders. This algebra expresses arbitrary Hurwitz numbers as values of a distinguished linear form on the linear space of Young diagrams, evaluated at the product of all diagrams, which characterize particular ramification points of the covering.

Journal IssueDOI
TL;DR: This study analyzes the induced aggregation operators, focusing on the aggregation step and examine some of its main properties, including the distinction between descending and ascending orders and different families of induced operators.
Abstract: In this study, we analyze the induced aggregation operators. The analysis begins with a revision of some basic concepts such as the induced ordered weighted averaging operator and the induced ordered weighted geometric operator. We then analyze the problem of decision making with Dempster-Shafer (D-S) theory of evidence. We suggest the use of induced aggregation operators in decision making with the D-S theory. We focus on the aggregation step and examine some of its main properties, including the distinction between descending and ascending orders and different families of induced operators. Finally, we present an illustrative example in which the results obtained with different types of aggregation operators can be seen. © 2009 Wiley Periodicals, Inc.

Journal ArticleDOI
TL;DR: In this article, a new structure in the space of operators of the XXZ chain is proposed, which is based on the annhilation operators, which mutually anti-commute and kill the primary field.
Abstract: In this article we unveil a new structure in the space of operators of the XXZ chain. For each α we consider the space \({\mathcal W_\alpha}\) of all quasi-local operators, which are products of the disorder field \({q^{\alpha \sum_{j=-\infty}^0\sigma ^3_j}}\) with arbitrary local operators. In analogy with CFT the disorder operator itself is considered as primary field. In our previous paper, we have introduced the annhilation operators b(ζ), c(ζ) which mutually anti-commute and kill the “primary field”. Here we construct the creation counterpart b*(ζ), c*(ζ) and prove the canonical anti-commutation relations with the annihilation operators. We conjecture that the creation operators mutually anti-commute, thereby upgrading the Grassmann structure to the fermionic structure. The bosonic operator t*(ζ) is the generating function of the adjoint action by local integrals of motion, and commutes entirely with the fermionic creation and annihilation operators. Operators b*(ζ), c*(ζ), t*(ζ) create quasi-local operators starting from the primary field. We show that the ground state averages of quasi-local operators created in this way are given by determinants.

Journal ArticleDOI
TL;DR: A review of the polyspherical approach to the kinetic operators for polyatomic molecules is given in this article, where general and correct forms of the kinetic energy operator (KEO) expressed in terms of curvilinear coordinates are provided.

Journal ArticleDOI
TL;DR: In this paper, the authors extended the RI/SMOM scheme for bilinear operators to one with a nonexceptional, symmetric subtraction point and derived conversion factors to convert results obtained in lattice calculations into the MS? scheme.
Abstract: We extend the Rome-Southampton regularization independent momentum-subtraction renormalization scheme (RI/MOM) for bilinear operators to one with a nonexceptional, symmetric subtraction point. Two-point Green’s functions with the insertion of quark bilinear operators are computed with scalar, pseudoscalar, vector, axial-vector and tensor operators at one-loop order in perturbative QCD. We call this new scheme RI/SMOM, where the S stands for “symmetric.” Conversion factors are derived, which connect the RI/SMOM scheme and the MS? scheme and can be used to convert results obtained in lattice calculations into the MS? scheme. Such a symmetric subtraction point involves nonexceptional momenta implying a lattice calculation with substantially suppressed contamination from infrared effects. Further, we find that the size of the one-loop corrections for these infrared improved kinematics is substantially decreased in the case of the pseudoscalar and scalar operator, suggesting a much better behaved perturbative series. Therefore it should allow us to reduce the error in the determination of the quark mass appreciably.

Journal ArticleDOI
TL;DR: In this article, a set of key properties for an ideal dissipation scheme in gyrokinetic simulations is proposed, and implementation of a model collision operator satisfying these properties is described.
Abstract: A set of key properties for an ideal dissipation scheme in gyrokinetic simulations is proposed, and implementation of a model collision operator satisfying these properties is described. This operator is based on the exact linearized test-particle collision operator, with approximations to the field-particle terms that preserve conservation laws and an H-theorem. It includes energy diffusion, pitch-angle scattering, and finite Larmor radius effects corresponding to classical real-space diffusion. The numerical implementation in the continuum gyrokinetic code GS2 Kotschenreuther et al., Comput. Phys. Comm. 88, 128 1995 is fully implicit and guarantees exact satisfaction of conservation properties. Numerical results are presented showing that the correct physics is captured over the entire range of collisionalities, from the collisionless to the strongly collisional regimes, without recourse to artificial dissipation. © 2009 American Institute of Physics. DOI: 10.1063/1.3155085

Journal ArticleDOI
TL;DR: In this article, the mediator analysis of nonstandard neutrino interactions is used as a guide for model building, and it is shown that the new couplings must obey general cancellation conditions both at the dimension six and dimension eight levels, which result from expressing the operators obtained from the mediators in terms of a complete basis of operators.
Abstract: Theories beyond the standard model must necessarily respect its gauge symmetry. This implies strict constraints on the possible models of nonstandard neutrino interactions, which we analyze. The focus is set on the effective low-energy dimension six and eight operators involving four leptons, decomposing them according to all possible tree-level mediators, as a guide for model building. The new couplings are required to have sizable strength, while processes involving four charged leptons are required to be suppressed. For nonstandard interactions in matter, only diagonal tau-neutrino interactions can escape these requirements and can be allowed to result from dimension six operators. Large nonstandard neutrino interactions from dimension eight operators alone are phenomenologically allowed in all flavor channels and are shown to require at least two new mediator particles. The new couplings must obey general cancellation conditions both at the dimension six and dimension eight levels, which result from expressing the operators obtained from the mediator analysis in terms of a complete basis of operators. We illustrate with one example how to apply this information to model building.

Proceedings ArticleDOI
Scott Schneider1, Henrique Andrade2, Bugra Gedik2, Alain Biem2, Kun-Lung Wu2 
23 May 2009
TL;DR: An approach to elastically scale the performance of a data analytics operator that is part of a streaming application that focuses on dynamically adjusting the amount of computation an operator can carry out in response to changes in incoming workload and the availability of processing cycles is described.
Abstract: We describe an approach to elastically scale the performance of a data analytics operator that is part of a streaming application. Our techniques focus on dynamically adjusting the amount of computation an operator can carry out in response to changes in incoming workload and the availability of processing cycles. We show that our elastic approach is beneficial in light of the dynamic aspects of streaming workloads and stream processing environments. Addressing another recent trend, we show the importance of our approach as a means to providing computational elasticity in multicore processor-based environments such that operators can automatically find their best operating point. Finally, we present experiments driven by synthetic workloads, showing the space where the optimizing efforts are most beneficial and a radioastronomy imaging application, where we observe substantial improvements in its performance-critical section.

Journal ArticleDOI
TL;DR: Connected operators as mentioned in this paper are filtering tools that act by merging elementary regions called flat zones, and they have very good contour preservation properties and are capable of both low-level filtering and higher-level object recognition.
Abstract: Connected operators are filtering tools that act by merging elementary regions called flat zones. Connecting operators cannot create new contours nor modify their position. Therefore, they have very good contour preservation properties and are capable of both low-level filtering and higher-level object recognition. This article gives an overview on connected operators and their application to image and video filtering. There are two popular techniques used to create connected operators. The first one relies on a reconstruction process. The operator involves first a simplification step based on a "classical" filter and then a reconstruction process. In fact, the reconstruction can be seen as a way to create a connected version of an arbitrary operator. The simplification effect is defined and limited by the first step. The examples we show include simplification in terms of size or contrast. The second strategy to define connected operators relies on a hierarchical region-based representation of the input image, i.e., a tree, computed in an initial step. Then, the simplification is obtained by pruning the tree, and, third, the output image is constructed from the pruned tree. This article presents the most important trees that have been used to create connected operators and also discusses important families of simplification or pruning criteria. We also give a brief overview on efficient implementations of the reconstruction process and of tree construction. Finally, the possibility to define and to use nonclassical notions of connectivity is discussed and Illustrated.

Journal ArticleDOI
TL;DR: In this paper, the phenomenology of the most general effective Lagrangian up to operators of dimension five, built with standard model fields and interactions including right-handed neutrinos, is discussed.
Abstract: We discuss the phenomenology of the most general effective Lagrangian, up to operators of dimension five, built with standard model fields and interactions including right-handed neutrinos. In particular, we find there is a dimension five electroweak moment operator of right-handed neutrinos, not discussed previously in the literature, which could have interesting phenomenological consequences.

Book
16 Aug 2009
TL;DR: In this paper, the Paneitz operator and paneitz curvature are used to represent the Laplacian and Q-curvature, respectively, in the context of Conformally Covariant Families.
Abstract: Spaces, Actions, Representations and Curvature.- Conformally Covariant Powers of the Laplacian, Q-curvature and Scattering Theory.- Paneitz Operator and Paneitz Curvature.- Intertwining Families.- Conformally Covariant Families.

Journal ArticleDOI
TL;DR: The aim of this paper is to develop some induced continuous ordered weighted geometric (ICOWG) operators that apply the ordering of the argument values based upon the reliability of the information sources; and the relative consensus degree induced COWG (RCD-ICowG) operator.

Journal ArticleDOI
TL;DR: In this paper, the authors studied the deformed statistics and oscillator algebras of quantum fields defined in Minkowski spacetime and showed that the twisted flip operator obtained from the twist associated with the star product requires an enlargement of the Poincar\'e algebra to include the dilatation generators.
Abstract: In this paper, we study the deformed statistics and oscillator algebras of quantum fields defined in $\ensuremath{\kappa}$-Minkowski spacetime. The twisted flip operator obtained from the twist associated with the star product requires an enlargement of the Poincar\'e algebra to include the dilatation generators. Here we propose a novel notion of a fully covariant flip operator and show that to the first order in the deformation parameter it can be expressed completely in terms of the Poincar\'e generators alone. The $R$ matrices corresponding to the twisted and the covariant flip operators are compared up to first order in the deformation parameter and they are shown to be different. We also construct the deformed algebra of the creation and annihilation operators that arise in the mode expansion of a scalar field in $\ensuremath{\kappa}$-Minkowski spacetime. We obtain a large class of such new deformed algebras which, for certain choice of realizations, reduce to results known in the literature.

Journal ArticleDOI
TL;DR: This paper proposes a new systematic way of dealing with the numerical approximation of the scattering of acoustic waves in two or three dimensions by penetrable non-homogeneous obstacles using convolution quadrature techniques for the time variable and coupled boundary element method/finite element method for the space variable.
Abstract: In this paper we address several theoretical questions related to the numerical approximation of the scattering of acoustic waves in two or three dimensions by penetrable non-homogeneous obstacles using convolution quadrature (CQ) techniques for the time variable and coupled boundary element method/finite element method for the space variable. The applicability of CQ to waves requires polynomial type bounds for operators related to the operator Δ − s 2 in the right half complex plane. We propose a new systematic way of dealing with this problem, both at the continuous and semidiscrete-in-space cases. We apply the technique to three different situations: scattering by a group of sound-soft and -hard obstacles, by homogeneous and non-homogeneous obstacles.

Journal ArticleDOI
TL;DR: A general projective framework for finding a zero of the sum of $n$ maximal monotone operators over a real Hilbert space is described, which gives rise to a family of splitting methods of unprecedented flexibility.
Abstract: We describe a general projective framework for finding a zero of the sum of $n$ maximal monotone operators over a real Hilbert space Unlike prior methods for this problem, we neither assume $n=2$ nor first reduce the problem to the case $n=2$ Our analysis defines a closed convex extended solution set for which we can construct a separating hyperplane by individually evaluating the resolvent of each operator At the cost of a single, computationally simple projection step, this framework gives rise to a family of splitting methods of unprecedented flexibility: numerous parameters, including the proximal stepsize, may vary by iteration and by operator The order of operator evaluation may vary by iteration and may be either serial or parallel The analysis essentially generalizes our prior results for the case $n=2$ We also include a relative error criterion for approximately evaluating resolvents, which was not present in our earlier work

Journal ArticleDOI
TL;DR: In this paper, the spectral properties of boundary value problems are examined for both ODE and PDE examples where it is possible for the operator to possess spectral points that cannot be detected by the M -function.
Abstract: In this paper, we combine results on extensions of operators with recent results on the relation between the M -function and the spectrum, to examine the spectral behaviour of boundary value problems. M -functions are defined for general closed extensions, and associated with realisations of elliptic operators. In particular, we consider both ODE and PDE examples where it is possible for the operator to possess spectral points that cannot be detected by the M -function.