相关论文: GPU Optimizations for the Hierarchical Poincar\'e-…

The singular value decomposition (SVD) is a powerful tool in modern numerical linear algebra, which underpins computational methods such as principal component analysis (PCA), low-rank approximations, and randomized algorithms. Many…

Solving partial differential equations (PDEs) within the framework of probabilistic numerics offers a principled approach to quantifying epistemic uncertainty arising from discretization. By leveraging Gaussian process regression and…

In this paper, we consider an efficient iterative approach to the solution of the discrete Helmholtz equation with Dirichlet, Neumann and Sommerfeld-like boundary conditions based on a compact sixth order approximation scheme and…

The relaxation in the calculus of variation motivates the numerical analysis of a class of degenerate convex minimization problems with non-strictly convex energy densities with some convexity control and two-sided $p$-growth. The…

In this paper two new families of arbitrary high order accurate spectral DG finite element methods are derived on staggered Cartesian grids for the solution of the inc.NS equations in two and three space dimensions. Pressure and velocity…

We develop a high-order, explicit method for acoustic scattering in three space dimensions based on a combined-field time-domain integral equation. The spatial discretization, of Nystr\"om type, uses Gaussian quadrature on panels combined…

We consider probabilistic amplitude shaping (PAS) as a means of increasing the spectral efficiency of fiber-optic communication systems. In contrast to previous works in the literature, we consider probabilistic shaping with hard decision…

Dense image matching is a fundamental low-level problem in Computer Vision, which has received tremendous attention from both discrete and continuous optimization communities. The goal of this paper is to combine the advantages of discrete…

In this paper, we address a way to reduce the total computational cost of meshless approximation by reducing the required stencil size through spatially varying computational node regularity. Rather than covering the entire domain with…

In this paper, we design a novel algorithm based on Least-Squares Monte Carlo (LSMC) in order to approximate the solution of discrete time Backward Stochastic Differential Equations (BSDEs). Our algorithm allows massive parallelization of…

This paper presents a scalable multigrid preconditioner targeting large-scale systems arising from discontinuous Petrov-Galerkin (DPG) discretizations of high-frequency wave operators. This work is built on previously developed multigrid…

We present a scheme implementing an a posteriori refinement strategy in the context of a high-order meshless method for problems involving point singularities and fluid-solid interfaces. The generalized moving least squares (GMLS)…

We present a comparison between hybridized and non-hybridized discontinuous Galerkin methods in the context of target-based hp-adaptation for compressible flow problems. The aim is to provide a critical assessment of the computational…

Joint diagonalization, the process of finding a shared set of approximate eigenvectors for a collection of matrices, arises in diverse applications such as multidimensional harmonic analysis or quantum information theory. This task is…

We introduce a novel spectral element method based on the ultraspherical spectral method and the hierarchical Poincar\'{e}-Steklov scheme for solving second-order linear partial differential equations on polygonal domains with unstructured…

The space mapping technique is used to efficiently solve complex optimization problems. It combines the accuracy of fine model simulations with the speed of coarse model optimizations to approximate the solution of the fine model…

In this paper, we propose and analyze an explicit time-stepping scheme for a spatial discretization of stochastic Cahn--Hilliard equation with additive noise. The fully discrete approximation combines a spectral Galerkin method in space…

We propose a $p$-multilevel preconditioner for Hybrid High-Order discretizations (HHO) of the Stokes equation, numerically assess its performance on two variants of the method, and compare with a classical Discontinuous Galerkin scheme. We…

Dynamic programming (DP) is a cornerstone of combinatorial optimization, yet its inherently sequential structure has long limited its scalability in scenario-based stochastic programming (SP). This paper introduces a GPU-accelerated…

The generalized Dryja--Smith--Widlund (GDSW) preconditioner is a two-level overlapping Schwarz domain decomposition (DD) preconditioner that couples a classical one-level overlapping Schwarz preconditioner with an energy-minimizing coarse…