Related papers: A SBP-SAT FDTD Subgridding Method Using Staggered …

We present the second-order multidimensional Staggered Grid Hydrodynamics Residual Distribution (SGH RD) scheme for Lagrangian hydrodynamics. The SGH RD scheme is based on the staggered finite element discretizations as in [Dobrev et al.,…

This paper presents a comprehensive analysis of a broad range of variations of the stochastic proximal point method (SPPM). Proximal point methods have attracted considerable interest owing to their numerical stability and robustness…

We present an optimizer which uses Bayesian optimization to tune the system parameters of distributed stochastic gradient descent (SGD). Given a specific context, our goal is to quickly find efficient configurations which appropriately…

A novel mass-lumping strategy for a mixed finite element approximation of Maxwell's equations is proposed. On structured orthogonal grids the resulting method coincides with the spatial discretization of the Yee scheme. The proposed method,…

High-order entropy stable summation-by-parts (SBP) schemes are a class of robust and accurate numerical methods for hyperbolic conservation laws that are numerically stable at arbitrary order without the need for artificial stabilization.…

Existing approaches to increasing the effective depth of Transformers predominantly rely on parameter reuse, extending computation through recursive execution. Under this paradigm, the network structure remains static along the training…

We propose a model order reduction technique integrating the Shifted Boundary Method (SBM) with a POD-Galerkin strategy. This approach allows to treat more complex parametrized domains in an efficient and straightforward way. The impact of…

Modern state-space models (SSMs) often utilize transition matrices which enable efficient computation but pose restrictions on the model's expressivity, as measured in terms of the ability to emulate finite-state automata (FSA). While…

Sparse grids based on Lagrange polynomials have become one of the staple methods for approximating functions that are high-dimensional and expensive to evaluate, in the context e.g. of PDE-based parametric design exploration. They are…

We present a new generic approach to the condensed-matter ground-state problem which is complementary to variational techniques and works directly in the thermodynamic limit. Relaxing the ground-state problem, we obtain semidefinite…

Self-consistent field theory (SCFT) has proven to be a powerful tool for modeling equilibrium microstructures of soft materials, particularly for multiblock polymers. A very successful approach to numerically solving the SCFT set of…

In the vanishing learning rate regime, stochastic gradient descent (SGD) is now relatively well understood. In this work, we propose to study the basic properties of SGD and its variants in the non-vanishing learning rate regime. The focus…

Forward uncertainty quantification in dynamical systems is challenging due to non-smooth or locally oscillating nonlinear behaviors. Spline dimensional decomposition (SDD) addresses such nonlinearity by partitioning input coordinates via…

A generalised analytical notion of summation-by-parts (SBP) methods is proposed, extending the concept of SBP operators in the correction procedure via reconstruction (CPR), a framework of high-order methods for conservation laws. For the…

Finite-difference time-domain (FDTD) is an effective algorithm for resolving Maxwell equations directly in time domain. Although FDTD has obtained sufficient development, there still exists some improvement space for it, such as…

Structure-aware Taylor (SAT) methods are a class of timestepping schemes designed for propagating linear hyperbolic solutions within a tent-shaped spacetime region. Tents are useful to design explicit time marching schemes on unstructured…

This paper proposes a thorough theoretical analysis of Stochastic Gradient Descent (SGD) with non-increasing step sizes. First, we show that the recursion defining SGD can be provably approximated by solutions of a time inhomogeneous…

In the era of big data, optimizing large scale machine learning problems becomes a challenging task and draws significant attention. Asynchronous optimization algorithms come out as a promising solution. Recently, decoupled asynchronous…

In decentralized optimization, $m$ agents form a network and only communicate with their neighbors, which gives advantages in data ownership, privacy, and scalability. At the same time, decentralized stochastic gradient descent…

For solving finite-sum optimization problems, SGD without replacement sampling is empirically shown to outperform SGD. Denoting by $n$ the number of components in the cost and $K$ the number of epochs of the algorithm , several recent works…