Related papers: From Memory Model to CPU Time: Exponential Integra…
A novel second order family of explicit stabilized Runge-Kutta-Chebyshev methods for advection-diffusion-reaction equations is introduced. The new methods outperform existing schemes for relatively high Peclet number due to their favorable…
Nesterov's well-known scheme for accelerating gradient descent in convex optimization problems is adapted to accelerating stationary iterative solvers for linear systems. Compared with classical Krylov subspace acceleration methods, the…
In-memory computing technology is used extensively in artificial intelligence devices due to lower power consumption and fast calculation of matrix-based functions. The development of such a device and its integration in a system takes a…
The combinatorial problem Max-Cut has become a benchmark in the evaluation of local search heuristics for both quantum and classical optimisers. In contrast to local search, which only provides average-case performance guarantees, the…
In the present paper, we propose Krylov-based methods for solving large-scale differential Sylvester matrix equations having a low rank constant term. We present two new approaches for solving such differential matrix equations. The first…
One limitation of existing Transformer-based models is that they cannot handle very long sequences as input since their self-attention operations exhibit quadratic time and space complexity. This problem becomes especially acute when…
HipMCL is a high-performance distributed memory implementation of the popular Markov Cluster Algorithm (MCL) and can cluster large-scale networks within hours using a few thousand CPU-equipped nodes. It relies on sparse matrix computations…
Simulating differential equations on classical computers becomes an intractable problem if the grid size is extremely large. Quantum computers are believed to achieve a possibly exponential speedup in the matrix operation. In this paper, we…
Several problems in machine learning, statistics, and other fields rely on computing eigenvectors. For large scale problems, the computation of these eigenvectors is typically performed via iterative schemes such as subspace iteration or…
To integrate large systems of nonlinear differential equations in time, we consider a variant of nonlinear waveform relaxation (also known as dynamic iteration or Picard-Lindel\"of iteration), where at each iteration a linear inhomogeneous…
This paper details an investigation into the computational performance of algorithms used for solving a convex formulation of the optimization problem associated with model predictive control for energy management in hybrid electric…
We introduce exponential numerical integration methods for stiff stochastic dynamical systems of the form $d\mathbf{z}_t = L(t)\mathbf{z}_tdt + \mathbf{f}(t)dt + Q(t)d\mathbf{W}_t$. We consider the setting of time-varying operators $L(t),…
In this paper, we present numerical methods suitable for solving convex quadratic Fractional Differential Equation (FDE) constrained optimization problems, with box constraints on the state and/or control variables. We develop an…
In this project, we have successfully designed, implemented, deployed and tested a novel FPGA accelerated algorithm for neural network training. The algorithm itself was developed in an independent study option. This training method is…
We introduce a new class of arbitrary-order exponential time differencing methods based on spectral deferred correction (ETDSDC) and describe a simple procedure for initializing the requisite matrix functions. We compare the stability and…
We consider the approximation of $B^T (A+sI)^{-1} B$ for large s.p.d. $A\in\mathbb{R}^{n\times n}$ with dense spectrum and $B\in\mathbb{R}^{n\times p}$, $p\ll n$. We target the computations of Multiple-Input Multiple-Output (MIMO) transfer…
The efficient compression of kernel matrices, for instance the off-diagonal blocks of discretized integral equations, is a crucial step in many algorithms. In this paper, we study the application of Skeletonized Interpolation to construct…
Randomized Krylov subspace methods that employ the sketch-and-solve paradigm to substantially reduce orthogonalization cost have recently shown great promise in speeding up computations for many core linear algebra tasks (e.g., solving…
In this paper, exponential Runge-Kutta methods of collocation type (ERKC) which were originally proposed in (Appl Numer Math 53:323-339, 2005) are extended to semilinear parabolic problems with time-dependent delay. Two classes of the ERKC…
We propose two new classes of time integrators for stiff DEs: the implicit-explicit exponential (IMEXP) and the hybrid exponential methods. In contrast to the existing exponential schemes, the new methods offer significant computational…