相关论文: Zero Assignment, Pole Placement and Matrix Extensi…

A matrix $P$ is said to be a nontrivial generalized reflection matrix over the real quaternion algebra $\mathbb{H}$ if $P^{\ast }=P\neq I$ and $P^{2}=I$ where $\ast$ means conjugate and transpose. We say that $A\in\mathbb{H}^{n\times n}$ is…

Pose estimation refers to tracking a human's full body posture, including their head, torso, arms, and legs. The problem is challenging in practical settings where the number of body sensors are limited. Past work has shown promising…

The following inverse problem is discussed. A static electromagnetic field generated by a limited system of charges and currents is supposed to be known with its first derivatives at a point somewhere far from the system. This allows to…

In the space of holomorphic functions in a convex domain it is studied the interpolation problem by means of sums of the series of exponentials converging uniformly on all compact sets of the domain. The discrete set of the interpolation…

In this paper, we will present a generalization for a minimization problem from I. Daubechies, M. Defrise, and C. Demol [3]. This generalization is useful for solving many practical problems in which more than one constraint are involved.…

We discuss a recent line of research investigating inverse theorems with respect to general k-wise correlations, and explain how such correlations arise in different contexts in mathematics. We outline some of the results that were…

The longstanding nonnegative inverse eigenvalue problem (NIEP) is to determine which multisets of complex numbers occur as the spectrum of an entry-wise nonnegative matrix. Although there are some well-known necessary conditions, a solution…

Object pose estimation is an important component of most vision pipelines for embodied agents, as well as in 3D vision more generally. In this paper we tackle the problem of estimating the pose of novel object categories in a zero-shot…

The history of research on eigenvalue problems is rich with many outstanding contributions. Nonetheless, the rapidly increasing size of data sets requires new algorithms for old problems in the context of extremely large matrix dimensions.…

We study properties of eigenvalues of a matrix associated with a randomly chosen partial automorphism of a regular rooted tree. We show that asymptotically, as the numbers of levels goes to infinity, the fraction of non-zero eigenvalues…

The paper studies the generic complex 1-dimensional polynomial vector fields of the form $iP(z)\frac{\partial}{\partial z}$, where $P$ is a polynomial with real coefficients, under topological orbital equivalence preserving the separatrices…

In this paper, we study the convergence of Alternating Projection (AP) algorithm for the matrix completion and compressed sensing problems. We also present computational evidence for the excellent performance of the algorithm. Also, in the…

We present two algorithms for constructing orthonormal bases of rational function vectors with respect to a discrete inner product, and discuss how to use them for a rational approximation problem. Building on the pencil-based formulation…

In this article, we propose two kinds of neural networks inspired by power method and inverse power method to solve linear eigenvalue problems. These neural networks share similar ideas with traditional methods, in which the differential…

In this work, we study the numerical solution of inverse eigenvalue problems from a machine learning perspective. Two different problems are considered: the inverse Strum-Liouville eigenvalue problem for symmetric potentials and the inverse…

We study multivariate normal models that are described by linear constraints on the inverse of the covariance matrix. Maximum likelihood estimation for such models leads to the problem of maximizing the determinant function over a…

We study ill-conditioned positive definite matrices that are disturbed by the sum of $m$ rank-one matrices of a specific form. We provide estimates for the eigenvalues and eigenvectors. When the condition number of the initial matrix tends…

This paper presents a method for computing eigenvalues and eigenvectors for some types of nonlinear eigenvalue problems. The main idea is to approximate the functions involved in the eigenvalue problem by rational functions and then apply a…

A generalization of the Bethe ansatz equations is studied, where a scalar two-particle S-matrix has several zeroes and poles in the complex plane, as opposed to the ordinary single pole/zero case. For the repulsive case (no complex roots),…

We prove that the inverse of a positive-definite matrix can be approximated by a weighted-sum of a small number of matrix exponentials. Combining this with a previous result [OSV12], we establish an equivalence between matrix inversion and…