Results for “EXISTENCE THEOREM” — Page 5

NASA NTRS1986

Existence of the time optimal control for robotic manipulators

Using Filipov's Theorem, it is shown that the conditions oif nonfinite escape of trajectories, reachability, and convexity of the dynamics over all admissible controls are needed for the existence of a time optimal solution for the robotic equation. With a lower bound for the finite-escape time established using a Liapunov approach, and an upper bound for the time to reach the target established using the exact linearization idea, a single inequality is found which is closely related to the coriolis and the centrifugal terms, the absence of which implies that the domain of existence of the optimal solution can be made arbitrarily large with a large torque constraint. As the work space is finite, this is essentially a global result in practical situations.

Wen, J.↗

NASA NTRS1975

Almost periodic solutions to difference equations

The theory of Massera and Schaeffer relating the existence of unique almost periodic solutions of an inhomogeneous linear equation to an exponential dichotomy for the homogeneous equation was completely extended to discretizations by a strongly stable difference scheme. In addition it is shown that the almost periodic sequence solution will converge to the differential equation solution. The preceding theory was applied to a class of exponentially stable partial differential equations to which one can apply the Hille-Yoshida theorem. It is possible to prove the existence of unique almost periodic solutions of the inhomogeneous equation (which can be approximated by almost periodic sequences) which are the solutions to appropriate discretizations. Two methods of discretizations are discussed: the strongly stable scheme and the Lax-Wendroff scheme.

Bayliss, A.↗

DOE OSTI2021

Central vortex steady states and dynamics of Bose–Einstein condensates interacting with a microwave field

Here we study central vortex steady states and dynamics of a two-dimensional (2D), two-component, Gross–Pitaevskii equation (CGPE) system for two pseudo-spinor Bose Einstein condensates (BECs) interacting with an electromagnetic field (microwave) analytically and numerically. For the central vortex steady state at any given winding number S, we prove its existence in a reduced, single component detuning limit when contact-interaction strength β < β b , and nonexistence when β > β b , respectively, where β b is a threshold value, whose value is given in Theorem 3.1 in the paper. We extend the existence and nonexistence result to the general two pseudo-spinor case and prove that a central vortex steady state exists for any given S if β ≤ β b while it does not exist when β > 2β b . We then derive dynamical equations for some observables (expectations of the matter wave function) such as the center-of-mass, position of dispersion, the linear and angular momentum of the two pseudo-spinor CGPEs. Finally, numerical computations are brought in to validate and extend the existence of vortex steady state results to β b ≤ β < 2β b for the two pseudo-spinor case and to explore transient dynamics of the observables.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

DOE OSTI2022

A non-commutative Bayes' theorem

Using a diagrammatic reformulation of Bayes' theorem, we provide a necessary and sufficient condition for the existence of Bayesian inference in the setting of finite-dimensional C* -algebras. In other words, we prove an analogue of Bayes' theorem in the joint classical and quantum context. Our analogue is justified by recent advances in categorical probability theory, which have provided an abstract formulation of the classical Bayes' theorem. In the process, we further develop non-commutative almost everywhere equivalence and illustrate its important role in non-commutative Bayesian inversion. The construction of such Bayesian inverses, when they exist, involves solving a positive semidefinite matrix completion problem for the Choi matrix. This gives a solution to the open problem of constructing Bayesian inversion for completely positive unital maps acting on density matrices that do not have full support. In conclusion, we illustrate how the procedure works for several examples relevant to quantum information theory.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1997

Quadrature, Interpolation and Observability

Methods of interpolation and quadrature have been used for over 300 years. Improvements in the techniques have been made by many, most notably by Gauss, whose technique applied to polynomials is referred to as Gaussian Quadrature. Stieltjes extended Gauss's method to certain non-polynomial functions as early as 1884. Conditions that guarantee the existence of quadrature formulas for certain collections of functions were studied by Tchebycheff, and his work was extended by others. Today, a class of functions which satisfies these conditions is called a Tchebycheff System. This thesis contains the definition of a Tchebycheff System, along with the theorems, proofs, and definitions necessary to guarantee the existence of quadrature formulas for such systems. Solutions of discretely observable linear control systems are of particular interest, and observability with respect to a given output function is defined. The output function is written as a linear combination of a collection of orthonormal functions. Orthonormal functions are defined, and their properties are discussed. The technique for evaluating the coefficients in the output function involves evaluating the definite integral of functions which can be shown to form a Tchebycheff system. Therefore, quadrature formulas for these integrals exist, and in many cases are known. The technique given is useful in cases where the method of direct calculation is unstable. The condition number of a matrix is defined and shown to be an indication of the the degree to which perturbations in data affect the accuracy of the solution. In special cases, the number of data points required for direct calculation is the same as the number required by the method presented in this thesis. But the method is shown to require more data points in other cases. A lower bound for the number of data points required is given.

Hodges, Lucille McDaniel↗

DOE OSTI2020

An efficient method to integrate polynomials over polytopes and curved solids

Here in this paper, we present an efficient approach to compute the integral of monomials and polynomials over polyhedra and regions defined by parametric curved boundary surfaces. We use Euler's theorem for homogeneous functions in combination with Stokes's theorem to reduce the integration of a monomial over a three-dimensional solid to its boundary. If the solid is a polytope, through a recursive application of these theorems, the integral is further reduced to just the evaluation of the monomial and its derivatives at the vertices of the polytope. The present approach is simpler than existing techniques that rely on repeated use of the divergence theorem, which require the antiderivative of the monomials and the projection of these functions onto hyperplanes. For convex and nonconvex polytopes, our approach does not introduce any approximation for the integration of monomials. For curved solid regions bounded by surfaces that admit a parameterization, the same approach yields simplified formulas to compute the integral of any homogeneous function, including monomials. For surfaces parameterized by polynomial surfaces (such as Bezier surface triangles and B-spline patches), the method yields machine-precision accuracy for the volumetric integration of monomials with an appropriate quadrature rule. Numerical examples over regions bounded by polynomial surfaces and rational surfaces are presented to establish the accuracy and efficiency of the method.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2026

Quantum Routing and Entanglement Dynamics Through Bottlenecks

To implement arbitrary quantum circuits in architectures with restricted interactions, one may effectively simulate all-to-all connectivity by routing quantum information. We consider the entanglement dynamics and routing between two regions only connected through an intermediate “bottleneck” region with few qubits. In such systems, where the entanglement rate is restricted by a vertex boundary rather than an edge boundary of the underlying interaction graph, existing results such as the small incremental entangling theorem give only a trivial constant lower bound on the routing time (the minimum time to perform an arbitrary permutation). We significantly improve the lower bound on the routing time in systems with a vertex bottleneck. Specifically, for any system with two regions 𝐿,𝑅 with 𝑁 𝐿 ,𝑁 𝑅 qubits, respectively, coupled only through an intermediate region 𝐶 with 𝑁 𝐶 qubits, for any 𝛿 > 0 we show a lower bound of Ω⁢(𝑁$^{1−𝛿}_{𝑅}$/√𝑁 𝐿⁢ 𝑁 𝐶 ) on the Hamiltonian quantum routing time when using piecewise time-independent Hamiltonians, or time-dependent Hamiltonians subject to a smoothness condition. We also prove an upper bound on the average amount of bipartite entanglement between 𝐿 and 𝐶,𝑅 that can be generated in time 𝑡 by such architecture-respecting Hamiltonians in systems constrained by vertex bottlenecks, improving the scaling in the system size from 𝑂⁡(𝑁 𝐿⁢ 𝑡) to 𝑂⁡(√𝑁 𝐿⁢ 𝑡). As a special case, when applied to the star graph (i.e., one vertex connected to 𝑁 leaves), we obtain an Ω⁡(√𝑁 1−𝛿 ) lower bound on the routing time and on the time to prepare 𝑁/2 Bell pairs between the vertices. We also show that, in systems of free particles, we can route optimally on the star graph in time Θ⁡(√𝑁) using Hamiltonian quantum routing, obtaining a speedup over gate-based routing, which takes time Θ⁡(𝑁).

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1973

Fixed point theorems and dissipative processes.

Operators of the type considered by Hale et al. (1972) are used to show that under certain conditions there is a fixed point in a dissipative map within a Banach space. The conditions required for the existence of this fixed point are discussed in detail. Several fixed point theorems are formulated and proved.

Hale, J. K.↗

DOE OSTI2022

InClass nets: independent classifier networks for nonparametric estimation of conditional independence mixture models and unsupervised classification

Abstract Conditional independence mixture models (CIMMs) are an important class of statistical models used in many fields of science. We introduce a novel unsupervised machine learning technique called the independent classifier networks (InClass nets) technique for the nonparameteric estimation of CIMMs. InClass nets consist of multiple independent classifier neural networks (NNs), which are trained simultaneously using suitable cost functions. Leveraging the ability of NNs to handle high-dimensional data, the conditionally independent variates of the model are allowed to be individually high-dimensional, which is the main advantage of the proposed technique over existing non-machine-learning-based approaches. Two new theorems on the nonparametric identifiability of bivariate CIMMs are derived in the form of a necessary and a (different) sufficient condition for a bivariate CIMM to be identifiable. We use the InClass nets technique to perform CIMM estimation successfully for several examples. We provide a public implementation as a Python package called RainDancesVI.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

NASA NTRS1976

Optimal insensitive-controller synthesis

Proof of two theorems is included in report: local sufficiency condition for existence of insensitive controllers in the case of sufficiently small parameter variations; and necessary condition for optimal controller corresponding to point in boundary of domain of admissible parameter variations to be optimal insensitive controller.

Harvey, C. A.↗

NASA NTRS1980

Towards sub-optimal stochastic control of partially observable stochastic systems

A class of multidimensional stochastic control problems with noisy data and bounded controls encountered in aerospace design is examined. The emphasis is on suboptimal design, the optimality being taken in quadratic mean sense. To that effect the problem is viewed as a stochastic version of the Lurie problem known from nonlinear control theory. The main result is a separation theorem (involving a nonlinear Kalman-like filter) suitable for Lurie-type approximations. The theorem allows for discontinuous characteristics. As a byproduct the existence of strong solutions to a class of non-Lipschitzian stochastic differential equations in dimensions is proven.

Ruzicka, G. J.↗

NASA NTRS1980

Towards sub-optimal stochastic control of partially observable stochastic systems

The paper deals with a class of multidimensional stochastic control problems with noisy data and bounded controls encountered in aerospace design. The emphasis is on suboptimal design, the optimality being taken in quadratic mean sense. To that effect the problem is viewed as a stochastic version of the Lurie problem known from nonlinear control theory. The main result is a separation theorem (involving a nonlinear Kalman-like filter) suitable for Lurie-type approximations. The theorem allows for discontinuous characteristics. As a byproduct the existence of strong solutions to a class of non-Lipschitzian stochastic differential equations in n dimensions is proved.

Ruzicka, G. J.↗

NASA NTRS1991

Magnetic bearings-state of the art

Magnetic bearings have existed for many years, at least in theory. Earnshaw's theorem, formulated in 1842, concerns stability of magnetic suspensions, and states that not all axes of a bearing can be stable without some means of active control. In Beam's widely referenced experiments, a tiny (1/64 in diameter) rotor was rotated to the astonishing speed of 800,000 rps while it was suspended in a magnetic field. Despite a long history, magnetic bearings have only begun to see practical application since about 1980. The development that finally made magnetic bearings practical was solid state electronics, enabling power supplies and controls to be reduced in size to where they are now comparable in volume to the bearings themselves. An attempt is made to document the current (1991) state of the art of magnetic bearings. The referenced papers are large drawn from two conferences publications published in 1988 and 1990 respectively.

Fleming, David P.↗

NASA NTRS1993

Magnetic bearings - State of the art

Magnetic bearings have existed for many years, at least in theory. Earnshaw's theorem, formulated in 1842, concerns stability of magnetic suspensions, and states that not all axes of a bearing can be stable without some means of active control. In Beam's widely referenced experiments, a tiny (1/64 in diameter) rotor was rotated to the astonishing speed of 800,000 rps while it was suspended in a magnetic field. Despite a long history, magnetic bearings have only begun to see practical application since about 1980. The development that finally made magnetic bearings practical was solid state electronics, enabling power supplies and controls to be reduced in size to where they are now comparable in volume to the bearings themselves. An attempt is made to document the current (1991) state of the art of magnetic bearings. The referenced papers are large drawn from two conferences publications published in 1988 and 1990 respectively.

Fleming, David P.↗

NASA NTRS2003

Applicability of Markets to Global Scheduling in Grids: Critical Examination of General Equilibrium Theory and Market Folklore

Markets are often considered superior to other global scheduling mechanisms for distributed computing systems. This claim is supported by: a casual observation from our every-day life that markets successfully equilibrate supply and demand, and the features of markets which originate in the general equilibrium theory, e.g., efficiency and the lack of necessity of 2 central controller. This paper describes why such beliefs in markets are not warranted. It does so by examining the general equilibrium theory, in terms of scope, abstraction, and interpretation. Not only does the general equilibrium theory fail to provide a satisfactory explanation of actual economies, including a computing-resource economy, it also falls short of supplying theoretical foundations for commonly held views of market desirability. This paper also points out that the argument for the desirability of markets involves circular reasoning and that the desirability can be established only vis-a-vis a scheduling goal. Finally, recasting the conclusion of Arrow's Impossibility Theorem as that for global scheduling, we conclude that there exists no market-based scheduler that is rational (in the sense defined in microeconomic theory), takes into account utility of more than one user, and yet yields a Pareto-optimal outcome for arbitrary user utility functions.

Nakai, Junko↗

NASA NTRS1974

An implicit sampling theorem for bounded bandlimited functions

A rigorous proof of the 'strong bias tone' scheme is embodied in the implicit sampling theorem. The representation of signals that are sample functions of possible nonstationary random processes being of principal interest, the proof could not directly invoke results from classical analysis, which depend on the existence of the Fourier transform of the function under consideration; rather, it is based on Zakai's (1965) theorem on the series expansion of functions, band-limited under a suitably extended definition. A practical circuit that restores an approximate version of the signal from its sine-wave-crossings is presented and possible improvements to it are discussed.

Bar-David, I.↗

DOE OSTI2024

Flavor fragmentation function factorization

A definition of partonic jet flavor that is both theoretically well-defined and experimentally robust would have profound implications for measurements and predictions especially for heavy flavor applications. Recently, a definition of jet flavor was introduced as the net flavor flowing along the direction of the Winner-Take-All axis of a jet which is soft safe to all orders, but not collinear safe. Here, we exploit the lack of collinear safety and propose a factorization theorem of perturbative flavor fragmentation functions that resum collinear divergences and describe the evolution of flavor from the short distance of jet production to the long distance at which hadronization occurs. Collinear flavor evolution is governed by a small modification of the DGLAP equations. We present a detailed all-orders analysis and identify exact relations that must hold amongst the various anomalous dimensions by probability conservation and the existence of fixed points of the renormalization group flow. We explicitly validate the factorization theorem at one-loop order, and demonstrate its consistency at two loops in particular flavor channels. Starting at two-loops, constraints on phase space imposed by flavor measurements potentially allow for non-trivial soft contributions, but we demonstrate that they are scaleless and so explicitly vanish, ensuring that soft particles are summed inclusively and all divergences are exclusively collinear in nature. This factorization theorem opens the door to precision calculations with identified flavor in the infrared.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2024

Flavor Fragmentation Function Factorization

A definition of partonic jet flavor that is both theoretically well-defined and experimentally robust would have profound implications for measurements and predictions especially for heavy flavor applications. Recently, a definition of jet flavor was introduced as the net flavor flowing along the direction of the Winner-Take-All axis of a jet which is soft safe to all orders, but not collinear safe. Here, we exploit the lack of collinear safety and propose a factorization theorem of perturbative flavor fragmentation functions that resum collinear divergences and describe the evolution of flavor from the short distance of jet production to the long distance at which hadronization occurs. Collinear flavor evolution is governed by a small modification of the DGLAP equations. We present a detailed all-orders analysis and identify exact relations that must hold amongst the various anomalous dimensions by probability conservation and the existence of fixed points of the renormalization group flow. We explicitly validate the factorization theorem at one-loop order, and demonstrate its consistency at two loops in particular flavor channels. Starting at two-loops, constraints on phase space imposed by flavor measurements potentially allow for non-trivial soft contributions, but we demonstrate that they are scaleless and so explicitly vanish, ensuring that soft particles are summed inclusively and all divergences are exclusively collinear in nature. This factorization theorem opens the door to precision calculations with identified flavor in the infrared.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗