Related papers: Gradient Symplectic Algorithms for Solving the Sch…
In this paper, the single machine scheduling problem with deteriorating jobs and learning effects are considered, which is shown in the previous research that the SDR method no longer provides an optimal solution for the problem. In order…
This paper describes a fourth-order integration algorithm for the gravitational N-body problem based on discrete Lagrangian mechanics. When used with shared timesteps, the algorithm is momentum conserving and symplectic. We generalize the…
Tensor decompositions, which represent an $N$-order tensor using approximately $N$ factors of much smaller dimensions, can significantly reduce the number of parameters. This is particularly beneficial for high-order tensors, as the number…
The aim of this work is to apply a semi-implicit (SI) strategy within a Rosenbrock-type and IMEX linear multistep (LM) framework to a sequence of 1D time-dependent partial differential equations (PDEs) with high order spatial derivatives.…
In this paper we propose a primal-dual proximal extragradient algorithm to solve the generalized Dantzig selector (GDS) estimation problem, based on a new convex-concave saddle-point (SP) reformulation. Our new formulation makes it possible…
We consider the linear time-dependent Schr\"odinger equation with a time-dependent smooth potential on an unbounded domain. A Galerkin spectral method with a tensor-product Hermite basis is used as a discretization in space. Discretizing…
In this work we study first-order linear parabolic evolution PDEs over $\mathbb{R}^{d}\times\mathbb{R}$ and $\mathbb{R}^{d}\times\mathbb{R}^{+}$ comprising a spatial operator defined through a symbol function and a source term such that its…
A variationally improved Sturmian approximation for solving time-independent Schr\"odinger equation is developed. This approximation is used to obtain the energy levels of a quartic anharmonic oscillator, a quartic potential, and a Gaussian…
The stationary Schroedinger equation of the harmonic oscillator is deformed by a Darboux transformation to construct time-dependent potentials with the oscillator profile. The Darboux (supersymmetric or factorization) method is usually…
We consider the continuous-time Linear-Quadratic-Regulator (LQR) problem in terms of optimizing a real-valued matrix function over the set of feedback gains. The results developed are in parallel to those in Bu et al. [1] for discrete-time…
We study the factor model problem, which aims to uncover low-dimensional structures in high-dimensional datasets. Adopting a robust data-driven approach, we formulate the problem as a saddle-point optimization. Our primary contribution is a…
We present a quantum algorithm to achieve higher-order transformations of Hamiltonian dynamics. Namely, the algorithm takes as input a finite number of queries to a black-box seed Hamiltonian dynamics to simulate a desired Hamiltonian. Our…
We introduce a new iterative method to recover a real compact supported potential of the Schr\"odinger operator from their fixed angle scattering data. The method combines a fixed point argument with a suitable approximation of the…
This article is devoted to the construction of new numerical methods for the semiclassical Schr\"odinger equation. A phase-amplitude reformulation of the equation is described where the Planck constant epsilon is not a singular parameter.…
We present a program to simulate the dynamics of a wave packet interacting with a time-dependent potential. The time-dependent Schr\"odinger equation is solved on a one-, two-, or three-dimensional spatial grid using the split operator…
It has been shown that for a certain special type of quantum graphs the random-matrix form factor can be recovered to at least third order in the scaled time \tau using periodic-orbit theory. Two types of contributing pairs of orbits were…
We consider quadrature formulas of high order in time based on Radau-type, L-stable implicit Runge-Kutta schemes to solve time dependent stiff PDEs. Instead of solving a large nonlinear system of equations, we develop a method that performs…
We present and discuss the development of an unconditionally stable algorithm used to solve the evolution equations of the Phase Field Crystal (PFC) model. This algorithm allows for an arbitrarily large algorithmic time step. As the basis…
Conditional Gradient algorithms (aka Frank-Wolfe algorithms) form a classical set of methods for constrained smooth convex minimization due to their simplicity, the absence of projection steps, and competitive numerical performance. While…
We present the construction of an exponentially accurate time-dependent Born-Oppenheimer approximation for molecular quantum mechanics. We study molecular systems whose electron masses are held fixed and whose nuclear masses are…