Related papers: A parametrization algorithm to compute lower dimen…
The implementation of the finite element method for linear elliptic equations requires to assemble the stiffness matrix and the load vector. In general, the entries of this matrix-vector system are not known explicitly but need to be…
Methods of parabolic geometries have been recently used to construct a class of elliptic complexes on quaternionic manifolds, the Salamon's complex being the simplest case. The purpose of this paper is to describe an algorithm how to…
Symplectic schemes are powerful methods for numerically integrating Hamiltonian systems, and their long-term accuracy and fidelity have been proved both theoretically and numerically. However direct applications of standard symplectic…
In this paper we develop a reconstruction algorithm for the solution of an inverse boundary value problem dealing with a semilinear elliptic partial differential equation of interest in cardiac electrophysiology. The goal is the detection…
Using a newly suggested algorithm of Gozzi, Reuter, and Thacker for calculating the excited states of one dimensional systems, we determine approximately the eigenvalues and eigenfunctions of the anharmonic oscillator, described by the…
The goal of this work is to fill a gap in [Yang, SIAM J. Matrix Anal. Appl, 41 (2020), 1797--1825]. In that work, an approximation procedure was proposed for orthogonal low-rank tensor approximation; however, the approximation lower bound…
We revisit the problem of introducing an a priori control for devices that can be modeled via a symplectic map in a neighborhood of an elliptic equilibrium. Using a technique based on Lie transform methods we produce a normal form algorithm…
In this paper, we propose integrable discretizations of a two-dimensional Hamiltonian system with quartic potentials. Using either the method of separation of variables or the method based on bilinear forms, we construct the corresponding…
We present a multiscale integrator for Hamiltonian systems with slowly varying quadratic stiff potentials that uses coarse timesteps (analogous to what the impulse method uses for constant quadratic stiff potentials). This method is based…
We construct on $\R^{2d}$, for any $d \geq 3$, smooth Hamiltonians having an elliptic equilibrium with an arbitrary frequency, that is not accumulated by a positive measure set of invariant tori. For $d\geq 4$, the Hamiltonians we construct…
A new algorithms for computing discrete logarithms on elliptic curves defined over finite fields is suggested. It is based on a new method to find zeroes of summation polynomials. In binary elliptic curves one is to solve a cubic system of…
It is known that all weakly conformal Hamiltonian stationary Lagrangian immersions of tori in the complex projective plane may be constructed by methods from integrable systems theory. This article describes the precise details of a…
Redundant parallel robots are normally employed in scenarios requiring good precision, high load capability, and large workspace compared to traditional parallel mechanisms. However, the elementary robotic configuration and geometric…
For a large class of toric domains in $\mathbb{R}^4$ we determine which product Lagrangian tori can be mapped into the domain by a Hamiltonian diffeomorphism. In other words, we compute the Hamiltonian shape invariant of these toric…
This paper considers the problem of robustly estimating a structured covariance matrix with an elliptical underlying distribution with known mean. In applications where the covariance matrix naturally possesses a certain structure, taking…
Exponentiation of Hamiltonians refers to a mathematical operation to a Hamiltonian operator, typically in the form e^(-i.t.H), where H is the Hamiltonian and t is a time parameter. This operation is fundamental in quantum mechanics,…
We formulate a systematic algorithm for constructing a whole class of Hermitian position-dependent-mass Hamiltonians which, to lowest order of perturbation theory, allow a description in terms of PT-symmetric Hamiltonians. The method is…
We present recursive formulas which compute the recently defined "higher symplectic capacities" for all convex toric domains. In the special case of four-dimensional ellipsoids, we apply homological perturbation theory to the associated…
A consequent approach is proposed to construct symplectic force-gradient algorithms of arbitrarily high orders in the time step for precise integration of motion in classical and quantum mechanics simulations. Within this approach the basic…
A numerical algorithm to compute the topological entropy of multimodal maps is proposed. This algorithm results from a closed formula containing the so-called min-max symbols, which are closely related to the kneading symbols. Furthermore,…