Results 241 to 250 of about 343,728 (300)
Some of the next articles are maybe not open access.
Adjoint translation, adjoint observable and uncertainty principles
Advances in Computational Mathematics, 2013zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Levie, R. +3 more
openaire +2 more sources
Mathematics of Operations Research, 1983
We study convex processes between topological vector spaces with particular emphasis on their adjoints. This study is then applied to produce general duality results for classes of convex programs involving processes. The use of processes allows one to exploit the symmetry of linear programming and to obtain significantly broader and stronger results.
openaire +1 more source
We study convex processes between topological vector spaces with particular emphasis on their adjoints. This study is then applied to produce general duality results for classes of convex programs involving processes. The use of processes allows one to exploit the symmetry of linear programming and to obtain significantly broader and stronger results.
openaire +1 more source
Adjoints and pluricanonical adjoints to an algebraic hypersurface
Annali di Matematica Pura ed Applicata, 2001The paper deals with the following problems connected with non-singular threefolds of general type with \(p_{g}=0\): finding a minimum \(m\) in \(\mathbb{Z}\) such that the \(m\)-canonical mapping is birational and finding \(n_{1}\) and \(n_{2}\) in \(\mathbb{Z}\), such that for the bigenus \(P_{2}\), \(n_{1}\leq P_{2}
openaire +3 more sources
Canadian Journal of Mathematics, 1960
It is shown in (6) how to represent certain sets of orthogonal Latin squares as a group together with a set of permutations of the group elements. The correspondence between 3-nets and loops is well known; for example, see (8). We shall consider a loop G together with a certain set of permutations on the elements of G and shall interpret such a ...
openaire +2 more sources
It is shown in (6) how to represent certain sets of orthogonal Latin squares as a group together with a set of permutations of the group elements. The correspondence between 3-nets and loops is well known; for example, see (8). We shall consider a loop G together with a certain set of permutations on the elements of G and shall interpret such a ...
openaire +2 more sources
Computational optimization and applications, 2016
In this work we propose a new splitting technique, namely Asymmetric Forward–Backward–Adjoint splitting, for solving monotone inclusions involving three terms, a maximally monotone, a cocoercive and a bounded linear operator.
Puya Latafat, Panagiotis Patrinos
semanticscholar +1 more source
In this work we propose a new splitting technique, namely Asymmetric Forward–Backward–Adjoint splitting, for solving monotone inclusions involving three terms, a maximally monotone, a cocoercive and a bounded linear operator.
Puya Latafat, Panagiotis Patrinos
semanticscholar +1 more source
Adjoint, Symmetric, and Self-adjoint Linear Operators
2019Here we first recall the definition of the adjoint of a linear operator and discuss some related results. Then we shall address the case of compact operators A : H → H, where H is a Hilbert space, and present the Fredholm theorem as an application. The last section is devoted to symmetric operators and self-adjoint operators.
openaire +1 more source
The Adjoint Representation and the Adjoint Action
2002The purpose of this article is to study in detail the actions of a semisimple Lie or algebraic group on its Lie algebra by the adjoint representation and on itself by the adjoint action. We will focus primarily on orbits through nilpotent elements in the Lie algebra; these are called nilpotent orbits for short.
openaire +1 more source
An aerodynamic design optimization framework using a discrete adjoint approach with OpenFOAM
, 2018P. He, C. Mader, J. Martins, K. Maki
semanticscholar +1 more source
IEEE transactions on microwave theory and techniques, 2017
F. Feng +4 more
semanticscholar +1 more source
F. Feng +4 more
semanticscholar +1 more source

