Related papers: tRecX -- an environment for solving time-dependent…
We present the IAMReX, an adaptive and parallel solver for particle-resolved simulations on the multi-level grid. The fluid equations are solved using a finite-volume scheme on the block-structured semi-staggered grids with both subcycling…
We present and analyse a space-time discontinuous Galerkin method for wave propagation problems. The special feature of the scheme is that it is a Trefftz method, namely that trial and test functions are solution of the partial differential…
Explaining deep learning models operating on time series data is crucial in various applications of interest which require interpretable and transparent insights from time series signals. In this work, we investigate this problem from an…
Radiative transfer is a key bottleneck in computational astrophysics: it is nonlocal, stiff, and tightly coupled to hydrodynamics. We introduce Ray-trax, a GPU-oriented, fully differentiable 3D ray tracer written in JAX that solves the…
CVXR is an R package that provides an object-oriented modeling language for convex optimization, similar to CVX, CVXPY, YALMIP, and Convex.jl. It allows the user to formulate convex optimization problems in a natural mathematical syntax…
We present AsterX, a novel open-source, modular, GPU-accelerated, fully general relativistic magnetohydrodynamic (GRMHD) code designed for dynamic spacetimes in 3D Cartesian coordinates, and tailored for exascale computing. We utilize…
We present ATC, a C++ library for advanced Tucker-based lossy compression of dense multidimensional numerical data in a shared-memory parallel setting, based on the sequentially truncated higher-order singular value decomposition (ST-HOSVD)…
We study the fine-grained complexity of graph connectivity problems in unweighted undirected graphs. Recent development shows that all variants of edge connectivity problems, including single-source-single-sink, global, Steiner,…
Hypergraphs are a popular paradigm to represent complex real-world networks exhibiting multi-way relationships of varying sizes. Mining centrality in hypergraphs via symmetric adjacency tensors has only recently become computationally…
A method of solving the time-dependent Schr\"odinger equation is presented, in which a finite region of space is treated explicitly, with the boundary conditions for matching the wave-functions on to the rest of the system replaced by an…
An alternative method is proposed for deriving the time dependent Schroedinger equation from the pictures of wave and matrix mechanics. The derivation is of a mixed classical quantum character, since time is treated as a classical variable,…
The first order by time partial differential equations are used as models in applications such as fluid flow, heat transfer, solid deformation, electromagnetic waves, and others. In this paper we propose the new numerical method to solve a…
In this paper, a non-uniform time-stepping convex-splitting numerical algorithm for solving the widely used time-fractional Cahn-Hilliard equation is introduced. The proposed numerical scheme employs the $L1^+$ formula for discretizing the…
We develop a high accuracy power series method for solving partial differential equations with emphasis on the nonlinear Schr\"odinger equations. The accuracy and computing speed can be systematically and arbitrarily increased to orders of…
Variational formulations of time-dependent PDEs in space and time yield $(d+1)$-dimensional problems to be solved numerically. This increases the number of unknowns as well as the storage amount. On the other hand, this approach enables…
Dedicated tensor accelerators demonstrate the importance of linear algebra in modern applications. Such accelerators have the potential for impressive performance gains, but require programmers to rewrite code using vendor APIs - a barrier…
Numerical solutions of hyperbolic partial differential equations(PDEs) are ubiquitous in science and engineering. Method of lines is a popular approach to discretize PDEs defined in spacetime, where space and time are discretized…
The task assignment problem is fundamental in combinatorial optimisation, aiming at allocating one or more tasks to a number of agents while minimizing the total cost or maximizing the overall assignment benefit. This problem is known to be…
Gradient-related first-order methods have become the workhorse of large-scale numerical optimization problems. Many of these problems involve nonconvex objective functions with multiple saddle points, which necessitates an understanding of…
We present a numerical implementation of the time-dependent surface flux (tSURFF) method [New J. Phys. 14, 013021 (2012)], an efficient computational scheme to extract photoelectron energy spectra, to the time-dependent multiconfiguration…