Related papers: Order O(1) algorithm for first-principles transien…
We employ neural networks to improve and speed up optical force calculations for dielectric particles. The network is first trained on a limited set of data obtained through accurate light scattering calculations, based on the Transition…
Simulation of high-order nonlinear system requires extensive computational resources, especially in modern VLSI backend design where bifurcation-induced instability and chaos-like transient behaviors pose challenges. We present S-Crescendo…
The success of deep learning over the past decade mainly relies on gradient-based optimisation and backpropagation. This paper focuses on analysing the performance of first-order gradient-based optimisation algorithms, gradient descent and…
Exploiting physical processes for fast and energy-efficient computation bears great potential in the advancement of modern hardware components. This paper explores non-linear charge tunneling in nanoparticle networks, controlled by external…
Online linear programming plays an important role in both revenue management and resource allocation, and recent research has focused on developing efficient first-order online learning algorithms. Despite the empirical success of…
A first-order linear fully discrete scheme is studied for the incompressible time-dependent Navier-Stokes equations in three-dimensional domains. This scheme, based on an incremental pressure projection method, decouples each component of…
Classically, the time complexity of a first-order method is estimated by its number of gradient computations. In this paper, we study a more refined complexity by taking into account the `lingering' of gradients: once a gradient is computed…
Gradient-based algorithms, popular strategies to optimization problems, are essential for many modern machine-learning techniques. Theoretically, extreme points of certain cost functions can be found iteratively along the directions of the…
An algorithm for a family of self-starting high-order implicit time integration schemes with controllable numerical dissipation is proposed for both linear and nonlinear transient problems. This work builds on the previous works of the…
In a classical scheduling problem, we are given a set of $n$ jobs of unit length along with precedence constraints, and the goal is to find a schedule of these jobs on $m$ identical machines that minimizes the makespan. Using the standard…
Multi-dimensional direct numerical simulation (DNS) of the Schr\"odinger equation is needed for design and analysis of quantum nanostructures that offer numerous applications in biology, medicine, materials, electronic/photonic devices,…
For the successful implementation of organic electrochemical transistors in neuromorphic computing, bioelectronics, and real-time sensing applications it is essential to understand the factors that influence device switching times. Here we…
An approach which allows to include the corrections from non-orthogonality of electron states in contacts and quantum dots is developed. Comparison of the energy levels and charge distributions of electrons in 1D quantum dot (QD) in…
We present semi-streaming algorithms for basic graph problems that have optimal per-edge processing times and therefore surpass all previous semi-streaming algorithms for these tasks. The semi-streaming model, which is appropriate when…
The origin of the non commutativity of the limits $t \to \infty$ and $N \to \infty$ in the dynamics of first order transitions is investigated. In the large-N model, i.e. $N \to \infty$ taken first, the low temperature phase is…
Compute the coarsest simulation preorder included in an initial preorder is used to reduce the resources needed to analyze a given transition system. This technique is applied on many models like Kripke structures, labeled graphs, labeled…
Let $P\subset\mathbb{R}^{2}$ be a set of $n$ points. In this paper we show two new algorithms, one to compute the number of triangulations of $P$, and one to compute the number of pseudo-triangulations of $P$. We show that our algorithms…
We present an efficient and elementary algorithm for computing the number of primes up to $N$ in $\tilde{O}(\sqrt N)$ time, improving upon the existing combinatorial methods that require $\tilde{O}(N ^ {2/3})$ time. Our method has a similar…
We present a new method for computing the Near-To-Far-Field (NTFF) transformation in FDTD simulations which has an overall scaling of $O(N^3)$ instead of the standard $O(N^4)$. By mapping the far field with a cartesian coordinate system the…
We present a study of the phase diagram of a random optimization problem in presence of quantum fluctuations. Our main result is the characterization of the nature of the phase transition, which we find to be a first-order quantum phase…