Related papers: On the Efficient Implementation of an Implicit Dis…
Gradient temporal difference (Gradient TD) algorithms are a popular class of stochastic approximation (SA) algorithms used for policy evaluation in reinforcement learning. Here, we consider Gradient TD algorithms with an additional heavy…
In this work, we introduce the time filtering technique to develop several innovative semi-discrete schemes in time for the Cahn-Hilliard-Navier-Stokes (CHNS) system. These schemes achieve second-order temporal accuracy while maintaining…
We propose a continuous-time second-order optimization algorithm for solving unconstrained convex optimization problems with bounded Hessian. We show that this alternative algorithm has a comparable convergence rate to that of the…
The Riemann problem for first-order hyperbolic systems of partial differential equations is of fundamental importance for both theoretical and numerical purposes. Many approximate solvers have been developed for such systems; exact solution…
Time integration of Fourier pseudo-spectral DNS is usually performed using the classical fourth-order accurate Runge--Kutta method, or other methods of second or third order, with a fixed step size. We investigate the use of higher-order…
A single-step high-order implicit time integration scheme for the solution of transient and wave propagation problems is presented. It is constructed from the Pad\'e expansions of the matrix exponential solution of a system of first-order…
In this paper, we will present advanced discretization methods for solving retarded potential integral equations. We employ a $C^{\infty}$-partition of unity method in time and a conventional boundary element method for the spatial…
This paper addresses the problem of efficiently computing higher-order variational integrators in simulation and trajectory optimization of mechanical systems as those often found in robotic applications. We develop $O(n)$ algorithms to…
In this paper we study a single machine scheduling problem with the objective of minimizing the sum of completion times. Each of the given jobs is either short or long. However the processing times are initially hidden to the algorithm, but…
High-order numerical methods enhance Transformer performance in tasks like NLP and CV, but introduce a performance-efficiency trade-off due to increased computational overhead. Our analysis reveals that conventional efficiency techniques,…
Chau et al. [New J. Phys. 20, 073003 (2018)] presented a new and straight-forward derivation of a fourth-order approximation '$U_7$' of the time-evolution operator and hinted at its potential value as a symplectic integrator. $U_7$ is based…
This paper is concerned about the implicit-explicit (IMEX) methods for a class of dissipative wave systems with time-varying velocity feedbacks and nonlinear potential energies, equipped with different boundary conditions. Firstly, we…
In this work, we extend the fractional linear multistep methods in [C. Lubich, SIAM J. Math. Anal., 17 (1986), pp.704--719] to the tempered fractional integral and derivative operators in the sense that the tempered fractional derivative…
We construct new, efficient, and accurate high-order finite differencing operators which satisfy summation by parts. Since these operators are not uniquely defined, we consider several optimization criteria: minimizing the bandwidth, the…
Finding the optimal hyperparameters of a model can be cast as a bilevel optimization problem, typically solved using zero-order techniques. In this work we study first-order methods when the inner optimization problem is convex but…
Many interesting applications of hyperbolic systems of equations are stiff, and require the time step to satisfy restrictive stability conditions. One way to avoid small time steps is to use implicit time integration. Implicit integration…
Currently, public-key compression of supersingular isogeny Diffie-Hellman (SIDH) and its variant, supersingular isogeny key encapsulation (SIKE) involve pairing computation and discrete logarithm computation. In this paper, we propose novel…
In this paper we consider the numerical approximation of a semilinear reaction-diffusion model problem (PDEs) by means of reduced order methods (ROMs) based on proper orthogonal decomposition (POD). We focus on the time integration of the…
This paper studies a fundamental problem in convex optimization, which is to solve semidefinite programming (SDP) with high accuracy. This paper follows from the existing robust SDP-based interior point method analysis due to [Huang, Jiang,…
The most widely used algorithm for floating point complex division, known as Smith's method, may fail more often than expected. This document presents two improved complex division algorithms. We present a proof of the robustness of the…