Related papers: Inverse Eigenvalue Problem of Cell Matrices

We discuss permutation representations which are obtained by the natural action of $S_n \times S_n$ on some special sets of invertible matrices, defined by simple combinatorial attributes. We decompose these representations into…

This article investigates the unique determination of a radial refractive index n from spectral data. First, we demonstrate that for piecewise twice continuously differentiable functions, n is not uniquely determined by the special…

We study the inverse problem of recovering a vector field in $\mathbb{R}^2$ from a set of new generalized $V$-line transforms in three different ways. First, we introduce the longitudinal and transverse $V$-line transforms for vector fields…

Bernstein polynomials, long a staple of approximation theory and computational geometry, have also increasingly become of interest in finite element methods. Many fundamental problems in interpolation and approximation give rise to…

We examine holographic renormalization by the singular value decomposition (SVD) of matrix data generated by the Monte Carlo snapshot of the 2D classical Ising model at criticality. To take the continuous limit of the SVD enables us to find…

In (relativistic) electronic structure methods, the quaternion matrix eigenvalue problem and the linear response (Bethe-Salpeter) eigenvalue problem for excitation energies are two frequently encountered structured eigenvalue problems.…

A g-circulant matrix of order n is defined as a matrix of order n where each row is a right cyclic shift in g-places to the preceding row. Using number theory, certain nonnegative g-circulant real matrices are constructed. In particular, it…

This work provides a complete characterization of the solutions of a linear interpolation problem for vector polynomials. The interpolation problem consists in finding n scalar polynomials such that an equation involving a linear…

An $n\times n$ matrix $C$ is said to be {\it centrosymmetric} if it satisfies the relation $JCJ=C$, where $J$ is the $n\times n$ counteridentity matrix. Centrosymmetric matrices have a rich eigenstructure that has been studied extensively…

The present article deals with differential equations with spectral parameter from the point of view of formal power series. The treatment does not make use of the notion of eigenvalue, but introduces a new idea: the spectral residue. The…

We study the inverse problem for a semilinear wave equation on metric tree graphs. From the Dirichlet-to-Neumann map defined at all but one of the boundary vertices, we recover unknown connectivity of the graph, lengths of the edges, the…

We study the inverse spectral problem of reconstructing energy-dependent Sturm-Liouville equations from their Dirichlet spectra and sequences of the norming constants. For the class of problems under consideration, we give a complete…

We introduce two equations expressing the inverse determinant of a full rank matrix $\mathbf{A} \in \mathbb{R}^{n \times n}$ in terms of expectations over matrix-vector products. The first relationship is $|\mathrm{det} (\mathbf{A})|^{-1} =…

Permutation Matrices are a well known class of matrices which encode the elements of the symmetric group on $d$ elements as a square $d\times d$ matrix. Motivated by [4], we define a similar class of matrices which are a generalization of…

Let $n \geq 4$ be an even integer and $W_n$ be the wheel graph with $n$ vertices. The distance $d_{ij}$ between any two distinct vertices $i$ and $j$ of $W_n$ is the length of the shortest path connecting $i$ and $j$. Let $D$ be the $n…

Let $W_n$ denote the wheel graph having $n$-vertices. If $i$ and $j$ are any two vertices of $W_n$, define \[d_{ij}:= \begin{cases} 0 & \mbox{if}~i=j \\ 1 & \mbox{if}~i~ \mbox{and} ~j~ \mbox{are adjacent} \\ 2 & \mbox{else}. \end{cases}\]…

This note considers the unstructured sparse recovery problems in a general form. Examples include rational approximation, spectral function estimation, Fourier inversion, Laplace inversion, and sparse deconvolution. The main challenges are…

We solve two inverse spectral problems for star graphs of Stieltjes strings with Dirichlet and Neumann boundary conditions, respectively, at a selected vertex called root. The root is either the central vertex or, in the more challenging…

We give formulae for first and second derivatives of generalized eigenvalues/eigenvectors of symmetric matrices and generalized singular values/singular vectors of rectangular matrices when the matrices are linear or nonlinear functions of…

Let $\mathbb{F}$ be an infinite field with characteristic different from two. For a graph $G=(V,E)$ with $V={1,...,n}$, let $S(G;\mathbb{F})$ be the set of all symmetric $n\times n$ matrices $A=[a_{i,j}]$ over $\mathbb{F}$ with…