Related papers: Finite Order BFFT Method
We propose a Forward-Backward Truncated-Newton method (FBTN) for minimizing the sum of two convex functions, one of which smooth. Unlike other proximal Newton methods, our approach does not involve the employment of variable metrics, but is…
A new heuristic method for the evaluation of definite integrals is presented. This method of brackets has its origin in methods developed for the evaluation of Feynman diagrams. The operational rules are described and the method is…
Hamiltonian quantum simulation of bosons on digital quantum computers requires truncating the Hilbert space to finite dimensions. The method of truncation and the choice of basis states can significantly impact the complexity of the quantum…
In any bosonic lattice system, which is not dominated by local interactions and thus "frozen" in a Mott-type state, numerical methods have to cope with the infinite size of the corresponding Hilbert space even for finite lattice sizes.…
We present a high order, Fourier penalty method for the Maxwell's equations in the vicinity of perfect electric conductor boundary conditions. The approach relies on extending the smooth non-periodic domain of the equations to a periodic…
We show how to extend the standard functional approach to bosonisation, based on a decoupling change of path-integral variables, to the case in which a finite temperature is considered. As examples, in order to both illustrate and check the…
The BRST quantization of particle motion on the hypersurface $V_{(N-1)}$ embedded in Euclidean space $R_N$ is carried out both in Hamiltonian and Lagrangian formalism. Using Batalin-Fradkin-Fradkina-Tyutin (BFFT) formalism, the second class…
We develop the theory of Hamiltonian Truncation (HT) to systematically study RG flows that require the renormalization of coupling constants. This is a necessary step towards making HT a fully general method for QFT calculations. We apply…
We consider mechanical systems on $T^*M$ with possibly irregular and reducible first class contraints linear in the momenta, which thus correspond to singular foliations on $M$. According to a recent result, the latter ones have a…
The graph fractional Fourier transform (GFRFT) for unitary graph Fourier transform (GFT) matrices can be interpreted through the scalar function $e^{j\alpha\theta}$ on the unit circle. Under the principal branch, its Fourier-series…
In this paper we consider finite-dimensional constrained Hamiltonian systems of polynomial type. In order to compute the complete set of constraints and separate them into the first and second classes we apply the modern algorithmic methods…
Recently, a new polynomial basis over binary extension fields was proposed such that the fast Fourier transform (FFT) over such fields can be computed in the complexity of order $\mathcal{O}(n\lg(n))$, where $n$ is the number of points…
The availability of a reliable bound on an integral involving the square of the modulus of a form factor on the unitarity cut allows one to constrain the form factor at points inside the analyticity domain and its shape parameters, and also…
In contrast to lattice systems where powerful numerical techniques such as matrix product state based methods are available to study the non-equilibrium dynamics, the non-equilibrium behaviour of continuum systems is much harder to…
We explore the idea of using finite automata to implement new constraints for local search (this is already a successful technique in constraint-based global search). We show how it is possible to maintain incrementally the violations of a…
This thesis contains three main parts, which are largely independent. In the first part we deal with the boundary bootstrap in supersymmetric factorized scattering theory. We give a description of supersymmetry in the case when the space is…
This paper is devoted to a discussion of the Discrete Fourier Transform (DFT) representation of a chaotic finite-duration sequence. This representation has the advantage that is itself a finite-duration sequence corresponding to samples…
Fast Fourier transform (FFT) based methods have turned out to be an effective computational approach for numerical homogenisation. In particular, Fourier-Galerkin methods are computational methods for partial differential equations that are…
The double series approximation method of Bonnor is a means for examining the gravitational radiation from an axisymmetric isolated source that undergoes a finite period of oscillation. It involves an expansion of the metric as a double…
The Fourier extension method, also known as the Fourier continuation method, is a method for approximating non-periodic functions on an interval using truncated Fourier series with period larger than the interval on which the function is…