相关论文: Streamline integration as a method for structured …
We prove rigidity of any properly immersed noncompact Lagrangian shrinker with single valued Lagrangian angle for Lagrangian mean curvature flows. Our pointwise approach also provides an ele- mentary proof to the known rigidity results for…
This paper focuses on devising graph signal processing tools for the treatment of data defined on the edges of a graph. We first show that conventional tools from graph signal processing may not be suitable for the analysis of such signals.…
Accurate early congestion prediction can prevent unpleasant surprises at the routing stage, playing a crucial character in assisting designers to iterate faster in VLSI design cycles. In this paper, we introduce a novel strategy to fully…
This report describes a new magnetohydrodynamic numerical model based on a hexagonal spherical geodesic grid. The model is designed to simulate astrophysical flows of partially ionized plasmas around a central compact object, such as a star…
Most of deterministic solvers for rarefied gas dynamics use discrete velocity (or discrete ordinate) approximations of the distribution function on a Cartesian grid. This grid must be sufficiently large and fine to describe the distribution…
Fluid deformation and strain history are central to wide range of fluid mechanical phenomena ranging from fluid mixing and particle transport to stress development in complex fluids and the formation of Lagrangian coherent structures…
Our main interest in this paper is to study some approximation problems for classes of functions with mixed smoothness. We use technique, based on a combination of results from hyperbolic cross approximation, which were obtained in 1980s --…
The interfacial diffusion associated with finite volume method (FVM) discretizations of multiphase flows creates the need for an interface sharpening mechanism. Such solutions for structured quadrilateral grids are well documented, but…
A new efficient orthogonalization of the B-spline basis is proposed and contrasted with some previous orthogonalized methods. The resulting orthogonal basis of splines is best visualized as a net of functions rather than a sequence of them.…
In simulation technology, computationally expensive objective functions are often replaced by cheap surrogates, which can be obtained by interpolation. Full grid interpolation methods suffer from the so-called curse of dimensionality,…
The accuracy of Lagrangian point-particle models for simulation of particle-laden flows may degrade when the particle and fluid momentum equations are two-way coupled. In these cases the fluid velocity at the location of the particle, which…
We present SymPix, a special-purpose spherical grid optimized for efficient sampling of rotationally invariant linear operators. This grid is conceptually similar to the Gauss-Legendre (GL) grid, aligning sample points with iso-latitude…
Networks with a prescribed power-law scaling in the spectrum of the graph Laplacian can be generated by evolutionary optimization. The Laplacian spectrum encodes the dynamical behavior of many important processes. Here, the networks are…
We propose two related unsupervised clustering algorithms which, for input, take data assumed to be sampled from a uniform distribution supported on a metric space $X$, and output a clustering of the data based on the selection of a…
Decentralized optimization is a powerful paradigm that finds applications in engineering and learning design. This work studies decentralized composite optimization problems with non-smooth regularization terms. Most existing gradient-based…
We design and analyze an iterative two-grid algorithm for the finite element discretizations of strongly nonlinear elliptic boundary value problems in this paper. We propose an iterative two-grid algorithm, in which a nonlinear problem is…
Consider an $s$-dimensional function being evaluated at $n$ points of a low discrepancy sequence (LDS), where the objective is to approximate the one-dimensional functions that result from integrating out $(s-1)$ variables. Here, the…
Motivated by recent progress of structural optimization problems, the paper presents a new method for constructing the distance function to the boundary of given sets of interest, which simplifies the optimization procedure. We extend the…
We introduce a geometric stencil selection algorithm for Laplacian in 3D that significantly improves octant-based selection considered earlier. The goal of the algorithm is to choose a small subset from a set of irregular points surrounding…
Laplacian matrices of graphs arise in large-scale computational applications such as semi-supervised machine learning; spectral clustering of images, genetic data and web pages; transportation network flows; electrical resistor circuits;…