Related papers: Rigorous justification for the space-split sensiti…
In this paper, we provide different splitting methods for solving distributionally robust optimization problems in cases where the uncertainties are described by discrete distributions. The first method involves computing the proximity…
It is a key to construct a similarity graph in graph-oriented subspace learning and clustering. In a similarity graph, each vertex denotes a data point and the edge weight represents the similarity between two points. There are two popular…
Recently there is a line of research work proposing to employ Spectral Clustering (SC) to segment (group){Throughout the paper, we use segmentation, clustering, and grouping, and their verb forms, interchangeably.} high-dimensional…
We present novel algorithmic techniques to efficiently verify the Kruskal rank of matrices that arise in sparse linear regression, tensor decomposition, and latent variable models. Our unified framework combines randomized hashing…
This paper presents a new algorithmic framework for computing sparse solutions to large-scale linear discrete ill-posed problems. The approach is motivated by recent perspectives on iteratively reweighted norm schemes, viewed through the…
In this paper we present semiclassical computations of the splitting of folded spinning strings in AdS_3, which may be of interest in the context of AdS/CFT duality. We start with a classical closed string and assume that it can split on…
Seismic attributes calculated by conventional methods are susceptible to noise. Conventional filtering reduces the noise in the cost of losing the spectral bandwidth. The challenge of having a high-resolution and robust signal processing…
Efficient trajectory optimization is essential for avoiding collisions in unstructured environments, but it remains challenging to have both speed and quality in the solutions. One reason is that second-order optimality requires calculating…
In this paper, we study the linear separability problem for stochastic geometric objects under the well-known unipoint/multipoint uncertainty models. Let $S=S_R \cup S_B$ be a given set of stochastic bichromatic points, and define $n =…
We investigate the structure of conformal manifolds around AdS$_3 \times S^3$ which lift from continuous flat directions in the scalar potential of gauged supergravity resulting from six-dimensional $\mathcal{N}=(1,1)$ supergravity. Our…
For low-dimensional data sets with a large amount of data points, standard kernel methods are usually not feasible for regression anymore. Besides simple linear models or involved heuristic deep learning models, grid-based discretizations…
This note introduces a novel numerical analysis framework for the incompressible Navier-Stokes equations based on Besov spaces. The key contribution of this note is to establish the stability and convergence of a semi-implicit time-stepping…
The high-performance scalable parallel algorithm for rigorous calculation of partition function of lattice systems with finite number Ising spins was developed. The parallel calculations run by C++ code with using of Message Passing…
In this work we study strong spectral properties of Ruelle transfer operators related to Gibbs measures for contact Anosov flows. As a consequence we establish exponential decay of correlations for H\"older observables with respect to any…
This paper presents and analyzes a fast, robust, efficient, and optimally accurate fully discrete splitting algorithm for the Uncertainty Quantification (UQ) of parameterized Stochastic Navier-Stokes Equations (SNSEs) flow problems those…
We investigate theoretically coherent detection implemented simultaneously on a set of mutually orthogonal spatial modes in the image plane as a method to characterize properties of a composite thermal source below the Rayleigh limit. A…
This paper is about partitioning in parallel and distributed simulation. That means decomposing the simulation model into a numberof components and to properly allocate them on the execution units. An adaptive solution based on…
In this article some explicit estimates on the decay of the convolutive inverse of a sequence are proved. They are derived from the functional calculus for Sobolev algebras. Applications include localization in spline-type spaces and…
We provide an algorithm to check whether two rational space curves are related by a similarity. The algorithm exploits the relationship between the curvatures and torsions of two similar curves, which is formulated in a computer algebra…
We give a sharp polynomial bound on the number of Pollicott-Ruelle resonances. These resonances, which are complex numbers in the lower half-plane, appear in expansions of correlations for Anosov contact flows. The bounds follow the…