Related papers: The NIEP
For a q by q matrix x=(x_{i,j}) we let J(x)=(x_{i,j}^{-1}) be the Hadamard inverse, which takes the reciprocal of the elements of x . We let I(x)=(x_{i,j})^{-1} denote the matrix inverse, and we define K=I\circ J to be the birational map…
Let D be the distance matrix of a connected graph G and let nn(G), np(G) be the number of strictly negative and positive eigenvalues of D respectively. It was remarked in [1] that it is not known whether there is a graph for which np(G) >…
We describe algorithms for computing eigenpairs (eigenvalue-eigenvector pairs) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time). We do not…
Many important problems are characterized by the eigenvalues of a large matrix. For example, the difficulty of many optimization problems, such as those arising from the fitting of large models in statistics and machine learning, can be…
We apply the method of inverse iteration to the Laplace eigenvalue problem with Robin and mixed Dirichlet-Neumann boundary conditions, respectively. For each problem, we prove convergence of the iterates to a non-trivial principal…
The area of inverse problems in mathematics is highly interdisciplinary. In various fields of science, engineering, medicine, and industry, there arises a need to reconstruct information about unknown entities that cannot be directly…
A celebrated theorem of Lind states that a positive real number is equal to the spectral radius of some integral primitive matrix, if and only if, it is a Perron algebraic integer. Given a Perron number $p$, we prove that there is an…
This survey reviews variational and iterative methods for reconstructing non-negative solutions of ill-posed problems in infinite-dimensional spaces. We focus on two classes of methods: variational methods based on entropy-minimization or…
This work is concerned with the existence and uniqueness of boundary value problems defined on semi-infinite intervals. These kinds of problems seldom admit exactly known solutions and, therefore, the theoretical information on their…
We consider a certain variation of the 'isoperimetric problem' adopted for subsets of nonnegative integers. More specifically, we explore the sequence P(n) as described in OEIS A186053. We provide the first exact formulas for P(n) including…
Given a polynomial $x \in {\mathbb R}^n \mapsto p(x)$ in $n=2$ variables, a symbolic-numerical algorithm is first described for detecting whether the connected component of the plane sublevel set ${\mathcal P} = \{x : p(x) \geq 0\}$…
We present a randomized approximation scheme for the permanent of a matrix with nonnegative entries. Our scheme extends a recursive rejection sampling method of Huber and Law (SODA 2008) by replacing the upper bound for the permanent with a…
We consider inverse problems for non-linear hyperbolic and elliptic equations and give an introduction to the method based on the multiple linearization, or on the construction of artificial sources, to solve these problems. The method is…
Nearly linear recurrences are a generalisation of linear recurrences and are instances of linear time-invariant systems in control theory and linear constraint loops in program analysis. In this paper we formulate the Positivity Problem for…
This paper shows that, if we could examine the entire history of a hidden variable, then we could efficiently solve problems that are believed to be intractable even for quantum computers. In particular, under any hidden-variable theory…
The inversion problem for rational B\'ezier curves is addressed by using resultant matrices for polynomials expressed in the Bernstein basis. The aim of the work is not to construct an inversion formula but finding the corresponding value…
The structure of a solvable Lie groups admitting an Einstein left-invariant metric is, in a sense, completely determined by the nilradical of its Lie algebra. We give an easy-to-check necessary and sufficient condition for a nilpotent…
For the principal eigenvalue of discrete weighted $p$-Laplacian on the set of nonnegative integers, the convergence of an approximation procedure and the inverse iteration is proved. Meanwhile, in the proof of the convergence, the…
Many scientific and engineering applications are formulated as inverse problems associated with stochastic models. In such cases the unknown quantities are distributions. The applicability of traditional methods is limited because of their…
A tensor $\mathcal T\in \mathbb T(\mathbb C^n,m+1)$, the space of tensors of order $m+1$ and dimension $n$ with complex entries, has $nm^{n-1}$ eigenvalues (counted with algebraic multiplicities). The inverse eigenvalue problem for tensors…