English
Related papers

Related papers: An Exact Formulation of the Time-Ordered Exponenti…

200 papers

We consider the long-time behavior of an explicit tamed exponential Euler scheme applied to a class of parabolic semilinear stochastic partial differential equations driven by additive noise, under a one-sided Lipschitz continuity…

Numerical Analysis · Mathematics 2020-10-02 Charles-Edouard Bréhier

In this work, we study the trade-off between the running time of approximation algorithms and their approximation guarantees. By leveraging a structure of the `hard' instances of the Arora-Rao-Vazirani lemma [JACM'09], we show that the…

Data Structures and Algorithms · Computer Science 2018-07-27 Pasin Manurangsi , Luca Trevisan

Exponential time differencing methods is a power tool for high-performance numerical simulation of computationally challenging problems in condensed matter physics, fluid dynamics, chemical and biological physics, where mathematical models…

Numerical Analysis · Mathematics 2024-10-15 Evelina V. Permyakova , Denis S. Goldobin

We examine the time dependent amplitude $ \phi_{j}\left( t\right)$ at each vertex $j$ of a continuous-time quantum walk on the cycle $C_{n}$. In many cases the Lissajous curve of the real vs. imaginary parts of each $ \phi_{j}\left(…

Quantum Physics · Physics 2015-11-03 Phillip Dukes

We consider the problem of evaluating certain exponential sums. These sums take the form $\sum_{x_1,...,x_n \in Z_N} e^{f(x_1,...,x_n) {2 \pi i / N}} $, where each x_i is summed over a ring Z_N, and f(x_1,...,x_n) is a multivariate…

Computational Complexity · Computer Science 2015-05-19 Jin-Yi Cai , Xi Chen , Richard Lipton , Pinyan Lu

Given a m-dimensional Gaussian process and polynomial m variables with real coefficients, we calculate the induced path odered exponenial in two different ways: one is purely algebraic in spirit and the other one is diagrammatic in spirit…

Probability · Mathematics 2026-01-27 Sergio Cacciatori , Batu Güneysu , Sebastian Wündsch

There exists the well known approximate expression describing the large time behaviour of matrix elements of the evolution operator in quantum theory: <U(t)>=exp(at)+... This expression plays the crucial role in considerations of problems…

Quantum Physics · Physics 2007-05-23 I. Ya. Aref'eva , I. V. Volovich

In this manuscript, we propose newly-derived exponential quadrature rules for stiff linear differential equations with time-dependent fractional sources in the form $h(t^r)$, with $0<r<1$ and $h$ a sufficiently smooth function. To construct…

Numerical Analysis · Mathematics 2025-06-26 Marco Caliari , Fabio Cassini

Hamiltonian matrices appear in a variety or problems in physics and engineering, mostly related to the time evolution of linear dynamical systems as for instance in ion beam optics. The time evolution is given by symplectic transfer…

General Physics · Physics 2018-02-20 C. Baumgarten

This work presents a new algorithm to compute the matrix exponential within a given tolerance. Combined with the scaling and squaring procedure, the algorithm incorporates Taylor, partitioned and classical Pad\'e methods shown to be…

Numerical Analysis · Mathematics 2024-04-22 Sergio Blanes , Nikita Kopylov , Muaz Seydaoğlu

This work examines the time complexity of quantum search algorithms on combinatorial $t$-designs with multiple marked elements using the continuous-time quantum walk. Through a detailed exploration of $t$-designs and their incidence…

Quantum Physics · Physics 2025-04-08 Pedro H. G. Lugão , Renato Portugal

Assuming the Exponential Time Hypothesis (ETH), a result of Marx (ToC'10) implies that there is no $f(k)\cdot n^{o(k/\log k)}$ time algorithm that can solve 2-CSPs with $k$ constraints (over a domain of arbitrary large size $n$) for any…

Computational Complexity · Computer Science 2024-04-18 Karthik C. S. , Dániel Marx , Marcin Pilipczuk , Uéverton Souza

We study prescribed-time extremum seeking (PT-ES) for scalar maps in the presence of time delays. The PT-ES problem has been studied by Yilmaz and Krstic in 2023 using chirpy probing and time-varying gains that grow unbounded. To alleviate…

Systems and Control · Electrical Eng. & Systems 2025-11-13 Nicolas Espitia , Jorge I. Poveda , Miroslav Krstic

A transient magneto-quasistatic vector potential formulation involving nonlinear material is spatially discretized using the finite element method of first and second polynomial order. By applying a generalized Schur complement the…

Computational Engineering, Finance, and Science · Computer Science 2020-11-09 Bernhard Kähne , Markus Clemens , Sebastian Schöps

In the present article, we review a continual effort on generalization of the Trotter formula to higher-order exponential product formulas. The exponential product formula is a good and useful approximant, particularly because it conserves…

Mathematical Physics · Physics 2011-11-10 Naomichi Hatano , Masuo Suzuki

A new approach for the parallel forward modeling of transient electromagnetic (TEM) fields is presented. It is based on a family of uniform-in-time rational approximants to the matrix exponential that share a common denominator independent…

Numerical Analysis · Mathematics 2025-06-16 Ralph-Uwe Börner , Stefan Güttel

The continuous time random walk model has been widely applied in various fields, including physics, biology, chemistry, finance, social phenomena, etc. In this work, we present an algorithm that utilizes a subordinate formula to generate…

Statistical Mechanics · Physics 2024-09-10 Danhua Jiang , Yuanze Hong , Wanli Wang

Exponential integrators based on contour integral representations lead to powerful numerical solvers for a variety of ODEs, PDEs, and other time-evolution equations. They are embarrassingly parallelizable and lead to global-in-time…

Numerical Analysis · Mathematics 2024-11-15 Andrew Horning , Adam R. Gerlach

Let $G=(V,E)$ be a simple and connected graph. A $h$-order invariant of $G$ based on the path sequence is defined from a set of real numbers ${f(x_{0},x_{1},\cdots,x_{h})}$ as $^{h}I_f(G)=\sum\limits_{v_{0}v_{1}v_{2}\cdots…

Combinatorics · Mathematics 2024-12-10 Yirong Cai , Zikai Tang , Hanyuan Deng

We present a Monte Carlo algorithm for Hamiltonicity detection in an $n$-vertex undirected graph running in $O^*(1.657^{n})$ time. To the best of our knowledge, this is the first superpolynomial improvement on the worst case runtime for the…

Data Structures and Algorithms · Computer Science 2010-08-04 Andreas Björklund