Related papers: A generalized formulation for gradient schemes in …
The Gridding algorithm has shown great utility for reconstructing images from non-uniformly spaced samples in the Fourier domain in several imaging modalities. Due to the non-uniform spacing, some correction for the variable density of the…
We present a strategy for solving time-dependent problems on grids with local refinements in time using different time steps in different regions of space. We discuss and analyze two conservative approximations based on finite volume with…
Solving compressible flows containing both smooth and discontinuous flow structures remains a significant challenge for finite volume methods. Godunov-type finite volume methods are commonly used for numerical simulations of compressible…
In the article we discuss the notion of the generalized invariant manifold introduced in our previous study. In the literature the method of the differential constraints is well known as a tool for constructing particular solutions for the…
Discontinuities in spatial derivatives appear in a wide range of physical systems, from creased thin sheets to materials with sharp stiffness transitions. Accurately modeling these features is essential for simulation but remains…
Adaptive gradient methods have shown excellent performances for solving many machine learning problems. Although multiple adaptive gradient methods were recently studied, they mainly focus on either empirical or theoretical aspects and also…
In this paper, we propose a novel lower dimensional representation of a shape sequence. The proposed dimension reduction is invertible and computationally more efficient in comparison to other related works. Theoretically, the differential…
We extend the construction of so-called encapsulated global summation-by-parts operators to the general case of a mesh which is not boundary conforming. Owing to this development, energy stable discretizations of nonlinear and variable…
We develop subgradient- and gradient-based methods for minimizing strongly convex functions under a notion which generalizes the standard Euclidean strong convexity. We propose a unifying framework for subgradient methods which yields two…
Gradient compression is of growing interests for solving constrained optimization problems including compressed sensing, noisy recovery and matrix completion under limited communication resources and storage costs. Convergence analysis of…
This paper presents a geometric variational discretization of compressible fluid dynamics. The numerical scheme is obtained by discretizing, in a structure preserving way, the Lie group formulation of fluid dynamics on diffeomorphism groups…
Direct numerical simulation of microscale fluid--structure interactions in multicomponent and multiphase flows requires methods that can represent moving boundaries together with fields constrained to evolving interfaces. Diffuse-domain…
The aim of this paper is the derivation of structure preserving schemes for the solution of the EPDiff equation, with particular emphasis on the two dimensional case. We develop three different schemes based on the Discrete Variational…
We present compact semi-implicit finite difference schemes on structured grids for numerical solutions of the advection by an external velocity and by a speed in normal direction that are applicable in level set methods. The most involved…
A unified framework to derive optimized compact schemes for a uniform grid is presented. The optimal scheme coefficients are determined analytically by solving an optimization problem to minimize the spectral error subject to equality…
Many popular feature-attribution methods for interpreting deep neural networks rely on computing the gradients of a model's output with respect to its inputs. While these methods can indicate which input features may be important for the…
The paper contains generalization of the renormgroup algorithm for boundary value problems of mathematical physics and related concept of the renormgroup symmetry, formulated earlier by authors with reference to models based on differential…
This paper presents a new method, Diffusing Winding Gradients (DWG), for reconstructing watertight 3D surfaces from unoriented point clouds. Our method exploits the alignment between the gradients of the generalized winding number (GWN)…
Systems with lattice geometry can be renormalized exploiting their coordinates in metric space, which naturally define the coarse-grained nodes. By contrast, complex networks defy the usual techniques, due to their small-world character and…
Many statistical $M$-estimators are based on convex optimization problems formed by the combination of a data-dependent loss function with a norm-based regularizer. We analyze the convergence rates of projected gradient and composite…