Related papers: The leapfrog algorithm as nonlinear Gauss-Seidel
Graphs are ubiquitous, and learning on graphs has become a cornerstone in artificial intelligence and data mining communities. Unlike pixel grids in images or sequential structures in language, graphs exhibit a typical non-Euclidean…
We introduce a new approach to the anisotropic Calder\'on problem, based on a map called Poisson embedding that identifies the points of a Riemannian manifold with distributions on its boundary. We give a new uniqueness result for a large…
Given data, deep generative models, such as variational autoencoders (VAE) and generative adversarial networks (GAN), train a lower dimensional latent representation of the data space. The linear Euclidean geometry of data space pulls back…
In the present paper, we try to investigate the Noether symmetries and Lie point symmetries of the Vaidya-Bonner geodesics. Classification of one-dimensional subalgebras of Lie point symmetries are considered. In fact, the collection of…
Inferring time-varying graph structures from high-dimensional nodal observations is a fundamental problem arising in neuroscience, finance, climatology, and beyond. Two intrinsic challenges govern this problem: maintaining the…
It is often easier to study pseudo-Riemannian manifolds by presenting them as surfaces in some ambient space. We propose an algorithm for construction of explicit isometric embeddings of pseudo-Riemannian manifolds with symmetries into an…
This paper considers the problem of minimizing the summation of a differentiable function and a nonsmooth function on a Riemannian manifold. In recent years, proximal gradient method and its invariants have been generalized to the…
Stochastic-gradient sampling methods are often used to perform Bayesian inference on neural networks. It has been observed that the methods in which notions of differential geometry are included tend to have better performances, with the…
Some variants of the (block) Gauss--Seidel iteration for the solution of linear systems with $M$-matrices in (block) Hessenberg form are discussed. Comparison results for the asymptotic convergence rate of some regular splittings are…
The aim of this paper is to present the recently proposed fluid diffusion based algorithm in the general context of the matrix inversion problem associated to the Gauss-Seidel method. We explain the simple intuitions that are behind this…
In the present article the geometry of semi-Riemannian manifolds with nonholonomic constraints is studied. These manifolds can be considered as analogues to the sub-Riemannian manifolds, where the positively definite metric is substituted…
This paper uncovers a large class of left-invariant sub-Rie\-mannian systems on Lie groups that admit explicit solutions with certain properties, and provides geometric origins for a class of important curves on Stiefel manifolds, called…
The interpolation on Grassmann manifolds in the framework of parametric evolution partial differential equations is presented. Interpolation points on the Grassmann manifold are the subspaces spanned by the POD bases of the available…
Many interesting functions arising in applications map into Riemannian manifolds. We present an algorithm, using the manifold exponential and logarithm, for approximating such functions. Our approach extends approximation techniques for…
We extend the branching process based numerical algorithm of Bouchard et al. [3], that is dedicated to semilinear PDEs (or BSDEs) with Lipschitz nonlinearity, to the case where the nonlinearity involves the gradient of the solution. As in…
The geometric approach to optimal transport and information theory has triggered the interpretation of probability densities as an infinite-dimensional Riemannian manifold. The most studied Riemannian structures are Otto's metric, yielding…
In [7], a new iterative method for solving linear system of equations was presented which can be considered as a modification of the Gauss-Seidel method. Then in [4] a different approach, say 2D-DSPM, and more effective one was introduced.…
Over the past few years, symmetric positive definite (SPD) matrices have been receiving considerable attention from computer vision community. Though various distance measures have been proposed in the past for comparing SPD matrices, the…
We propose a Riemannian version of Nesterov's Accelerated Gradient algorithm (RAGD), and show that for geodesically smooth and strongly convex problems, within a neighborhood of the minimizer whose radius depends on the condition number as…
We use nonsmooth critical point theory and the theory of geodesics with obstacle to show a multiplicity result about orthogonal geodesic chords in a Riemannian manifold (with boundary) which is homeomorphic to an $N$-disk. This applies to…