Related papers: On the bisymmetric nonnegative inverse eigenvalue …

This paper studies the problem of recovering cameras from a set of fundamental matrices. A set of fundamental matrices is said to be compatible if a set of cameras exists for which they are the fundamental matrices. We focus on the complete…

The affine inverse eigenvalue problem consists of identifying a real symmetric matrix with a prescribed set of eigenvalues in an affine space. Due to its ubiquity in applications, various instances of the problem have been widely studied in…

Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…

We consider polynomials in R[x] which map the set of nonnegative (element-wise) matrices of a given order into itself. Let n be a positive integer and define P(n)= {p in R[x] : p(A) is nonnegative (element-wise), for all A, A an n-by-n…

In this note, we present an algorithm that yields many new methods for constructing doubly stochastic and symmetric doubly stochastic matrices for the inverse eigenvalue problem. In addition, we introduce new open problems in this area that…

In this paper, the generalized eigenvalue complementarity problem for tensors (GEiCP-T) is addressed, which arises from the stability analysis of finite dimensional mechanical systems and find applications in differential dynamical systems.…

The inverse eigenvalue problem of a graph $G$ is the problem of characterizing all lists of eigenvalues of real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of $G$. The strong spectral property is a…

The inverse problem of spectral analysis for the non-self-adjoint matrix Sturm-Liouville operator on a finite interval is investigated. We study properties of the spectral characteristics for the considered operator, and provide necessary…

In 1960 R\'enyi in his Michigan State University lectures asked for the number of random queries necessary to recover a hidden bijective labeling of $n$ distinct objects. In each query one selects a random subset of labels and asks, which…

Quadratic eigenvalue problems (QEP) and more generally polynomial eigenvalue problems (PEP) are among the most common types of nonlinear eigenvalue problems. Both problems, especially the QEP, have extensive applications. A typical approach…

The main of this work is to use the unit lower triangular matrices for solving inverse eigenvalue problem of nonnegative matrices and present the easier method to solve this problem.

Consider the Jacobi operators $\cJ$ given by $(\cJ y)_n=a_ny_{n+1}+b_ny_n+a_{n-1}^*y_{n-1}$, $y_n\in \C^m$ (here $y_0=y_{p+1}=0$), where $b_n=b_n^*$ and $a_n:\det a_n\ne 0$ are the sequences of $m\ts m$ matrices, $n=1,..,p$. We study two…

SLEPc is a parallel library for the solution of various types of large-scale eigenvalue problems. In the last years we have been developing a module within SLEPc, called NEP, that is intended for solving nonlinear eigenvalue problems. These…

In this paper, we discuss approximating the eigenvalue problem of biharmonic equation. We first present an equivalent mixed formulation which admits amiable nested discretization. Then, we construct multi-level finite element schemes by…

In this paper we begin by discussing the simple bilevel programming problem (SBP) and its extension the simple mathematical programming problem under equilibrium constraints (SMPEC). Here we first define both these problems and study their…

In this work, a complete solution of the inverse spectral problem for a class of Dirac differential equations system is given by spectral data (eigenvalues and normalizing numbers). As a direct problem, the eigenvalue problem is solved: the…

The non-proper value set of a nonsingular polynomial map from $\C^2$ into itself, if non-empty, must be a curve with one point at infinity.

We establish a logarithmic stability inequality for the inverse problem of determining the non linear term, appearing in a semilinear BVP, from the corresponding Dirichlet-to-Neumann map (abbreviated to DtN map in the rest of this text).…

In this paper, we consider the inverse eigenvalue problem for the positive doubly stochastic matrices, which aims to construct a positive doubly stochastic matrix from the prescribed realizable spectral data. By using the real Schur…

Let $p \in (0,1/2)$ be fixed, and let $B_n(p)$ be an $n\times n$ random matrix with i.i.d. Bernoulli random variables with mean $p$. We show that for all $t \ge 0$, \[\mathbb{P}[s_n(B_n(p)) \le tn^{-1/2}] \le C_p t + 2n(1-p)^{n} + C_p…