Related papers: Optimal separator for an ellipse; Application to l…
Let $S(A)$ denote the orbit of a complex or real matrix $A$ under a certain equivalence relation such as unitary similarity, unitary equivalence, unitary congruences etc. Efficient gradient-flow algorithms are constructed to determine the…
This letter presents a new spectral-clustering-based approach to the subspace clustering problem. Underpinning the proposed method is a convex program for optimal direction search, which for each data point d finds an optimal direction in…
The localization phenomena due to the random potential scattering is widely discussed in the electron and photon systems, where the theoretical approach is the nonlinear $\sigma$ model with the replica method or with the supersymmetry. In…
The theory of modular forms and spherical harmonic analysis are applied to establish new best bounds towards the counting and equidistribution of rational points on spheres and other higher dimensional ellipsoids, in what may be viewed as a…
In this paper we introduce a new type of symmetrization, which preserves the anisotropic perimeter of the level sets of a suitable concave smooth function, in order to prove sharp comparison results for solutions of a class of homogeneous…
We prove uniform $L^p$ estimates for resolvents of higher order elliptic self-adjoint differential operators on compact manifolds without boundary, generalizing a corresponding resul of [3] in the case of Laplace-- Beltrami operators on…
The paper contains a survey of the results obtained during the last ten years in the theory of elliptic boundary problems in H\"ormander function spaces, developed by the authors, and other related results of modern analysis. The basics of…
multiplication operator on a Hilbert space may be approximated with finite sections by choosing an orthonormal basis of the Hilbert space. Nonzero multiplication operators on $L^2$ spaces of functions are never compact and then such…
We define two transforms between minimal surfaces with non-circular ellipse of curvature in the 5-sphere, and show how this enables us to construct, from one such surface, a sequence of such surfaces. We also use the transforms to show how…
Based on the Fourier extension, we propose an oversampling collocation method for solving the elliptic partial differential equations with variable coefficients over arbitrary irregular domains. This method only uses the function values on…
Two approximation algorithms are proposed for $\ell_1$-regularized sparse rank-1 approximation to higher-order tensors. The algorithms are based on multilinear relaxation and sparsification, which are easily implemented and well scalable.…
Prehensile object rearrangement in cluttered and confined spaces has broad applications but is also challenging. For instance, rearranging products in a grocery shelf means that the robot cannot directly access all objects and has limited…
We consider Arnoldi like processes to obtain symplectic subspaces for Hamiltonian systems. Large systems are locally approximated by ones living in low dimensional subspaces; we especially consider Krylov subspaces and some extensions. This…
We present a new type of basis set which is local, compact, and orthogonal. The basis functions, called orthlets, are centered at the sites of a lattice and are specifically adapted to represent the system being studied. The adaptability…
This work provides a theoretical analysis for optimally solving the pose estimation problem using total least squares for vector observations from landmark features, which is central to applications involving simultaneous localization and…
Two averaging algorithms are considered which are intended for choosing an optimal plane and an optimal circle approximating a group of points in three-dimensional Euclidean space.
For several tasks, ranging from manipulation to inspection, it is beneficial for robots to localize a target object in their surroundings. In this paper, we propose an approach that utilizes coarse point clouds obtained from miniaturized…
A mechanism is described to symmetrize the ultraspherical spectral method for self-adjoint problems. The resulting discretizations are symmetric and banded. An algorithm is presented for an adaptive spectral decomposition of self-adjoint…
We present an approach to minimization under constraint. We explore the connections of this technique with the general method of Compactness by Concentration of P.L. Lions and present applications to some constrained semi-linear and…
We present a non-conforming least squares method for approximating solutions of second order elliptic problems with discontinuous coefficients. The method is based on a general Saddle Point Least Squares (SPLS) method introduced in previous…