Related papers: New efficient algorithm for the isometric embeddin…
We investigate isometric immersions $f\colon M^n\to\R^{n+2}$, $n\geq 3$, of Riemannian manifolds into Euclidean space with codimension two that admit isometric deformations that preserve the metric of the Gauss map. In precise terms, the…
We consider a surface $M$ immersed in $\mathbb{R}^3$ with induced metric $g=\psi\delta_2$ where $\delta_2$ is the two dimensional Euclidean metric. We then construct a system of partial differential equations that constrain $M$ to lift to a…
In this paper the method of compensated compactness is applied to the problem of isometric immersion of a two dimensional Riemannian manifold with negative Gauss curvature into three dimensional Euclidean space. Previous applications of the…
We propose an immersed boundary scheme for the numerical resolution of the Complete Electrode Model in Electrical Impedance Tomography, that we use as a main ingredient in the resolution of inverse problems in medical imaging. Such method…
We present in detail three different quasi-Newton isogeometric algorithms for the treatment of free boundary problems. Two algorithms are based on standard Galerkin formulations, while the third is a fully-collocated scheme. With respect to…
A quasi-Newton method with cubic regularization is designed for solving Riemannian unconstrained nonconvex optimization problems. The proposed algorithm is fully adaptive with at most ${\cal O} (\epsilon_g^{-3/2})$ iterations to achieve a…
This work addresses the problem of simulating Gaussian random fields that are continuously indexed over a class of metric graphs, termed graphs with Euclidean edges, being more general and flexible than linear networks. We introduce three…
We prove a novel method for the embedding of a 3-fold rotationally symmetric sphere-type mesh onto a subset of the plane with 3-fold rotational symmetry. The embedding is free-boundary with the only additional constraint on the image set is…
We consider the problem of positioning a cloud of points in the Euclidean space $\mathbb{R}^d$, using noisy measurements of a subset of pairwise distances. This task has applications in various areas, such as sensor network localization and…
The Euclidean distance geometry problem arises in a wide variety of applications, from determining molecular conformations in computational chemistry to localization in sensor networks. When the distance information is incomplete, the…
In this paper, we develop an efficient and accurate procedure of electromagnetic multipole decomposition by using the Lebedev and Gaussian quadrature methods to perform the numerical integration. Firstly, we briefly review the principles of…
We propose a new randomized algorithm for solving L2-regularized least-squares problems based on sketching. We consider two of the most popular random embeddings, namely, Gaussian embeddings and the Subsampled Randomized Hadamard Transform…
Nonlinear dimensionality reduction methods have demonstrated top-notch performance in many pattern recognition and image classification tasks. Despite their popularity, they suffer from highly expensive time and memory requirements, which…
We seek discrete approximations to solutions $u:\Omega \to R$ of semilinear elliptic partial differential equations of the form $\Delta u + f_s(u) = 0$, where $f_s$ is a one-parameter family of nonlinear functions and $\Omega$ is a domain…
Methodologies for reducing the design-space dimensionality in shape optimization have been recently developed based on unsupervised machine learning methods. These methods provide reduced dimensionality representations of the design space,…
This paper is devoted to studying the global and finite convergence of the semi-smooth Newton method for solving a piecewise linear system that arises in cone-constrained quadratic programming problems and absolute value equations. We first…
The distance metric plays an important role in nearest neighbor (NN) classification. Usually the Euclidean distance metric is assumed or a Mahalanobis distance metric is optimized to improve the NN performance. In this paper, we study the…
We consider the problem of reconstructing an embedding of a compact connected Riemannian manifold in a Euclidean space up to an almost isometry, given the information on intrinsic distances between points from its ``sufficiently large''…
We describe an efficient and scalable spherical graph embedding method. The method uses a generalization of the Euclidean stress function for Multi-Dimensional Scaling adapted to spherical space, where geodesic pairwise distances are…
In this paper, we introduce the notion of generalized $\epsilon$-stationarity for a class of nonconvex and nonsmooth composite minimization problems on compact Riemannian submanifold embedded in Euclidean space. To find a generalized…