Related papers: The Jacobi matrices approach to Nevanlinna-Pick pr…
An analytical-numerical analysis of the singular self-adjoint spectral problem for a system of three linear ordinary second-order differential equations defined on the entire real exis is presented. This problem comes to existence in the…
We consider a nonlinear Dirichlet problem driven by a nonhomogeneous differential operator with a growth of order $(p-1)$ near $+\infty$ and with a reaction which has the competing effects of a parametric singular term and a…
Motivated by recent results in random matrix theory we will study the distributions arising from products of complex Gaussian random matrices and truncations of Haar distributed unitary matrices. We introduce an appropriately general class…
Eigensolvers involving complex moments can determine all the eigenvalues in a given region in the complex plane and the corresponding eigenvectors of a regular linear matrix pencil. The complex moment acts as a filter for extracting…
We consider the Hamburger, Stieltjes and Hausdorff moment problems, that are problems of the construction of a Borel measure supported on a real line, on a half-line or on an interval $(0,1)$, from a prescribed set of moments. We propose a…
The proximal point algorithm is a widely used tool for solving a variety of convex optimization problems such as finding zeros of maximally monotone operators, fixed points of nonexpansive mappings, as well as minimizing convex functions.…
Let $T$ be a self-adjoint operator on a complex Hilbert space $\mathcal{H}$. We give a sufficient and necessary condition for $T$ to be the pencil $\lambda P+Q$ of a pair $( P, Q)$ of projections at some point…
We introduce a canonical operator-theoretic construction associated to a finite geometric lattice, in which a simple nonassociative ``diamond product'' on the lattice basis gives rise to a family of creation operators indexed by atoms and a…
Nevanlinna-Pick interpolation and moment problems use the analytic structures provided by causality in order to provide rigorous bounds on smeared spectral functions. This proceedings discusses Nevanlinna-Pick interpolation and moment…
Recently, various high-order methods have been developed to solve the convex optimization problem. The auxiliary problem of these methods shares the general form that is the same as the high-order proximal operator proposed by Nesterov. In…
We study the solution theory of the whole-space static (elliptic) Hamilton-Jacobi-Bellman (HJB) equation in spectral Barron spaces. We prove that under the assumption that the coefficients involved are spectral Barron functions and the…
We generalize the Donsker-Varadhan minimax formula for the principal eigenvalue of a uniformly elliptic operator in nondivergence form to the first principal half-eigenvalue of a fully nonlinear operator which is concave (or convex) and…
The purpose of this paper is to propose and analyze a multi-step iterative algorithm to solve a convex optimization problem and a fixed point problem posed on a Hadamard space. The convergence properties of the proposed algorithm are…
We establish new analytic and numerical results on a general class of rational operator Nevanlinna functions that arise e.g. in modelling photonic crystals. The capability of these dielectric nano-structured materials to control the flow of…
This article is about a problem in the numerical analysis of random operators. We study a version of the finite section method for the approximate solution of equations $Ax=b$ in infinitely many variables, where $A$ is a random Jacobi…
Consider a homogenized spectral pencil of exactly solvable linear differential operators $T_{\la}=\sum_{i=0}^k Q_{i}(z)\la^{k-i}\frac {d^i}{dz^i}$, where each $Q_{i}(z)$ is a polynomial of degree at most $i$ and $\la$ is the spectral…
First-order optimization algorithms are widely used today. Two standard building blocks in these algorithms are proximal operators (proximals) and gradients. Although gradients can be computed for a wide array of functions, explicit…
We clarify how close a second order fully nonlinear equation can come to uniform ellipticity, through counting large eigenvalues of the linearized operator. This suggests an effective and novel way to understand the structure of fully…
A unified theory of orthogonal polynomials of a discrete variable is presented through the eigenvalue problem of hermitian matrices of finite or infinite dimensions. It can be considered as a matrix version of exactly solvable Schr\"odinger…
This paper aims at solving the Hermitian SDC problem, i.e., that of \textit{simultaneously diagonalizing via $*$-congruence} a collection of finitely many (not need pairwise commute) Hermitian matrices. Theoretically, we provide some…