Related papers: A Geometrical Method of Decoupling
We show how some Hamiltonians may be approximated using rotating wave approximation methods. In order to achieve this we use the algebra of boson ladder operators, and transformation formulas between normal and symmetric ordering of the…
We study the decaying dynamics in the mirror-field interaction by means of the intrinsic decoherence scheme. Factorization of the mirror-field Hamiltonian with the use of displacement operators, allows us to calculate the explicit solution…
Arnold, Falk, & Winther, in "Finite element exterior calculus, homological techniques, and applications" (2006), show how to geometrically decompose the full and trimmed polynomial spaces on simplicial elements into direct sums of…
We investigate the possibility to suppress interactions between a finite dimensional system and an infinite dimensional environment through a fast sequence of unitary kicks on the finite dimensional system. This method, called dynamical…
In this work we propose a novel approach to integrate the Lane-Emden equations for relativistic anisotropic polytropes. We take advantage of the fact that Gravitational Decoupling allows to decrease the number of degrees of freedom once a…
An interesting problem in solid state physics is to compute discrete breather solutions in $\mathcal{N}$ coupled 1--dimensional Hamiltonian particle chains and investigate the richness of their interactions. One way to do this is to compute…
Several proposals to deal with the dynamics of general relativity involve gauge fixings or the introduction matter fields in terms of which the theory is deparameterized. The resulting theories have true Hamiltonians for their evolution…
We present an iterative algorithm, called the symmetric tensor eigen-rank-one iterative decomposition (STEROID), for decomposing a symmetric tensor into a real linear combination of symmetric rank-1 unit-norm outer factors using only…
This paper considers the iterative solution of linear systems arising from discretization of the anisotropic radiative transfer equation with discontinuous elements on the sphere. In order to achieve robust convergence behavior in the…
We present general reduction procedures for Courant, Dirac and generalized complex structures, in particular when a group of symmetries is acting. We do so by taking the graded symplectic viewpoint on Courant algebroids and carrying out…
Aims. To investigate the performance of a deconvolution map-making algorithm for an experiment with a circular scanning strategy, specifically in this case for the analysis of Planck data, and to quantify the effects of making maps using…
It has previously been shown that varying the numerical timestep during a symplectic orbital integration leads to a random walk in energy and angular momentum, destroying the phase space-conserving property of symplectic integrators. Here…
We perform extensive three-loop tests of the hexagon bootstrap approach for structure constants in planar $\mathcal{N}=4$ SYM theory. We focus on correlators involving two BPS operators and one non-BPS operator in the so-called $SL(2)$…
The commonly used radial distortion model for camera calibration is in fact an assumption or a restriction. In practice, camera distortion could happen in a general geometrical manner that is not limited to the radial sense. This paper…
Geometric integration theory can be employed when numerically solving ODEs or PDEs with constraints. In this paper, we present several one-step algorithms of various orders for ODEs on a collection of spheres. To demonstrate the versatility…
We study central configurations when the set of positions is symmetric. We use a theorem from representation theory of finite groups to explore the symmetry properties of equations for central configurations. This approach simplifies…
Retractions maps are used to define a discretization of the tangent bundle of the configuration manifold as two copies of the configuration manifold where the dynamics take place. Such discretization maps can be conveniently lifted to a…
While every matrix admits a singular value decomposition, in which the terms are pairwise orthogonal in a strong sense, higher-order tensors typically do not admit such an orthogonal decomposition. Those that do have attracted attention…
The Hadamard decomposition is a powerful technique for data analysis and matrix compression, which decomposes a given matrix into the element-wise product of two or more low-rank matrices. In this paper, we develop an efficient algorithm to…
We consider the numerical solution of large-scale M-matrix algebraic Riccati equations with low-rank structures. We derive a new doubling iteration, decoupling the four original iteration formulae in the alternating-directional doubling…