Related papers: The Difficulty of Symplectic Analysis with Second …
The classical Dirichlet problem for a second-order strongly elliptic system with constant coefficients in a Jordan domain is considered. We show that the solution of the problem can be represented as a functional series in powers of the…
We propose here a new symplectic quantization scheme, where quantum fluctuations of a scalar field theory stem from two main assumptions: relativistic invariance and equiprobability of the field configurations with identical value of the…
The aim of this work is the study of symplectic structures on 2-step nilmanifolds. We concentrate in the closeness condition, proving that the existence of a closed 2-form of type II is necessary to get a symplectic structure. In low…
In this work we apply Dirac's Constraint Analysis (DCA) to solve Superconducting Quantum Circuits (SQC). The Lagrangian of a SQC reveals the constraints, that are classified in a Hamiltonian framework, such that redundant variables can be…
In these notes, we present an alternative version of discrete Dirac mechanics using Dirac structures. We first establish a notion of 'continuous Dirac system' and then propose a definition of discrete Dirac system, proving that it is…
The Dirac constraint formalism is applied to the d(d>2) dimensional Einstein-Hilbert action when written in first order form, using the metric density and affine connection as independent fields. Field equations not involving time…
In the recent years, considerable attention has been paid to preserving structures and invariants in reduced basis methods, in order to enhance the stability and robustness of the reduced system. In the context of Hamiltonian systems,…
In the present work we establish a simple relation between the Dirac equation with a scalar and an electromagnetic potentials in a two-dimensional case and a pair of decoupled Vekua equations. In general these Vekua equations are bicomplex.…
We document a connection between constraint reasoning and probabilistic reasoning. We present an algorithm, called {em probabilistic arc consistency}, which is both a generalization of a well known algorithm for arc consistency used in…
We develop the symplectic elimnation algorithm. This algorithm using simple row operations reduce a symplectic matrix to a diagonal matrix. This algorithm gives rise to a decomposition of an arbitrary matrix into a product of a symplectic…
This paper develops a distributed model predictive control (DMPC) strategy for a class of discrete-time linear systems with consideration of globally coupled constraints. The DMPC under study is based on the dual problem concerning all…
A canonical analysis of the Einstein-Hilbert action S_d (d>2) is considered, using the first order form with the metric and affine connection as independent fields. We adopt a conservative approach to using the Dirac constraint formalism;…
Symplectic integrators are widely used for the study of planetary dynamics and other $N$-body problems. In a study of the outer Solar system, we demonstrate that individual symplectic integrations can yield biased errors in the semi-major…
We propose a definition of symplectic 2-groupoid which includes integrations of Courant algebroids that have been recently constructed. We study in detail the simple but illustrative case of constant symplectic 2-groupoids. We show that the…
It is well-known that coupling constraints in linear bilevel optimization can lead to disconnected feasible sets, which is not possible without coupling constraints. However, there is no difference between linear bilevel problems with and…
We rederive the results of our companion paper, for matching spacetime and internal signature, by applying in detail the Dirac algorithm to the Palatini action. While the constraint set of the Palatini action contains second class…
Infinitesimal contraction analysis, wherein global asymptotic convergence results are obtained from local dynamical properties, has proven to be a powerful tool for applications in biological, mechanical, and transportation systems. Thus…
The procedure of Dirac reduction of Poisson operators on submanifolds is discussed within a particularly useful special realization of the general Marsden-Ratiu reduction procedure. The Dirac classification of constraints on 'first-class'…
Hierarchical clustering is a popular unsupervised data analysis method. For many real-world applications, we would like to exploit prior information about the data that imposes constraints on the clustering hierarchy, and is not captured by…
Self-consistent Hamiltonian formulation of scalar theory on the null plane is constructed following Dirac method. The theory contains also {\it constraint equations}. They would give, if solved, to a nonlinear and nonlocal Hamiltonian. The…