Related papers: Inverse problems for symmetric doubly stochastic m…
With the example of the spherically symmetric scalar wave equation on Minkowski space-time we demonstrate that a fully pseudospectral scheme (i.e. spectral with respect to both spatial and time directions) can be applied for solving…
A Laplacian matrix is a square real matrix with nonpositive off-diagonal entries and zero row sums. As a matrix associated with a weighted directed graph, it generalizes the Laplacian matrix of an ordinary graph. A standardized Laplacian…
We clarify the discussion of N=2 supersymmetric boundary conditions for the classical d=2, N=(2,2) Non-Linear Sigma Model on an infinite strip. Our conclusions about the supersymmetric cycles match the results found in the literature.…
We consider the inhomogeneous biharmonic nonlinear Schr\"odinger equation $$ i u_t +\Delta^2 u+\lambda|x|^{-b}|u|^\alpha u = 0, $$ where $\lambda=\pm 1$ and $\alpha$, $b>0$. In the subctritical case, we improve the global well-posedness…
Let $\Omega =\omega\times\mathbb R$ where $\omega\subset \mathbb R^2$ be a bounded domain, and $V : \Omega \to\mathbb R$ a bounded potential which is $2\pi$-periodic in the variable $x_{3}\in \mathbb R$. We study the inverse problem…
In this paper we study the problem -\Delta u =\left(\frac{2+\alpha}{2}\right)^2\abs{x}^{\alpha}f(\lambda,u), & \hbox{in}B_1 \\ u > 0, & \hbox{in}B_1 u = 0, & \hbox{on} \partial B_1 where $B_1$ is the unit ball of $\R^2$, $f$ is a smooth…
We present a technique for reconstructing a semi-infinite Jacobi operator in the limit circle case from the spectra of two different self-adjoint extensions. Moreover, we give necessary and sufficient conditions for two real sequences to be…
This paper is concerned with the study of constrained statistical learning problems, the unconstrained version of which are at the core of virtually all of modern information processing. Accounting for constraints, however, is paramount to…
We develop a methodology for closing duality gap and guaranteeing strong duality in infinite convex optimization. Specifically, we examine two new Lagrangian-type dual formulations involving infinitely many dual variables and infinite sums…
We establish necessary and sufficient conditions on simultaneous symplectic spectral decomposition of a family of $2n \times 2n$ real positive semidefinite matrices with symplectic kernels. We also provide a precise algebraic condition on a…
The inverse eigenvalue problem studies the possible spectra among matrices whose off-diagonal entries have their zero-nonzero patterns described by the adjacency of a graph $G$. In this paper, we refer to the $i$-nullity pair of a matrix…
The following hypothesis was put forward by Goreinov, Tyrtyshnikov and Zamarashkin in \cite{GTZ1997}. For arbitrary real $n \times k$ matrix with orthonormal columns a sufficiently "good" $k \times k$ submatrix exists. "Good" in the sense…
It is shown by Karp reduction that deciding the singularity of $(2^n - 1) \times (2^n - 1)$ sparse circulant matrices (SC problem) is NP-complete. We can write them only implicitly, by indicating values of the $2 + n(n + 1)/2$ eventually…
Motivated by inverse problems with a single passive measurement, we introduce and analyze a new class of inverse spectral problems on closed Riemannian manifolds. Specifically, we establish two general uniqueness results for the recovery of…
In the first part of this paper we give an elementary proof of the fact that if an infinite matrix $A$, which is invertible as a bounded operator on $\ell^2$, can be uniformly approximated by banded matrices then so can the inverse of $A$.…
A conference matrix of order $n$ is an $n\times n$ matrix $C$ with diagonal entries $0$ and off-diagonal entries $\pm 1$ satisfying $CC^\top=(n-1)I$. If $C$ is symmetric, then $C$ has a symmetric spectrum $\Sigma$ (that is,…
In this work, we study the inverse spectral problem, using the Weyl matrix as the input data, for the matrix Schrodinger operator on the half-line with the boundary condition being the form of the most general self-adjoint. We prove the…
For many applications, it is convenient to have good upper bounds for the norm of the inverse of a given matrix. In this paper, we obtain such bounds when A is a Nekrasov matrix, by means of a scaling matrix transforming A into a strictly…
If a graph has a non-singular adjacency matrix, then one may use the inverse matrix to define a (labeled) graph that may be considered to be the inverse graph to the original one. It has been known that an adjacency matrix of a tree is…
The spectrum of a real and symmetric $N\times N$ matrix determines the matrix up to unitary equivalence. More spectral data is needed together with some sign indicators to remove the unitary ambiguities. In the first part of this work we…