Related papers: Infinite Hankel Block Matrices, Extremal Problems
We develop a formalism to treat higher order (nonlinear) metric perturbations of the Kerr spacetime in a Teukolsky framework. We first show that solutions to the linearized Einstein equation with nonvanishing stress tensor can be decomposed…
The paper is devoted to the approximate solutions of the Fredholm integral equations of the second kind with the weak singular kernel that can have additional singularity in the numerator. We describe two problems that lead to such…
We develop computational methods for approximating the solution of a linear multi-term matrix equation in low rank. We follow an alternating minimization framework, where the solution is represented as a product of two matrices, and…
We present a proximal quasi-Newton method in which the approximation of the Hessian has the special format of "identity minus rank one" (IMRO) in each iteration. The proposed structure enables us to effectively recover the proximal point.…
We propose a numerical method for computing all eigenvalues (and the corresponding eigenvectors) of a nonlinear holomorphic eigenvalue problem that lie within a given contour in the complex plane. The method uses complex integrals of the…
We propose a verified computation method for partial eigenvalues of a Hermitian generalized eigenproblem. The block Sakurai-Sugiura Hankel method, a contour integral-type eigensolver, can reduce a given eigenproblem into a generalized…
The inverse eigenvalue problem for real symmetric matrices of the form 0 0 0 . 0 0 * 0 0 0 . 0 * * 0 0 0 . * * 0 . . . . . . . 0 0 * . 0 0 0 0 * * . 0 0 0 * * 0 . 0 0 0 is solved. The solution is shown to be unique. The problem is also…
We study the problem of determining whether a prescribed eigenpair $(\lambda,x)$ can be made an exact eigenpair of a nonnegative Hankel matrix through the smallest possible structured perturbation. The task reduces to check the feasibility…
We derive the double scaling limit of eigenvalue correlations in the random matrix model at critical points and we relate the limiting correlation functions to a nonlinear hierarchy of ordinary differential equations.
For all sufficiently large complex $\rho$, and for arbitrary matrix dimension $n$, it is shown that the Kac--Murdock--Szeg\H{o} matrix $K_n(\rho)=\left[\rho^{|j-k|}\right]_{j,k=1}^{n}$ possesses exactly two eigenvalues whose magnitude is…
In this paper we obtain a Hadamard type formula for simple eigenvalues and an analog to the Rayleigh-Faber-Krahn inequality for a class of nonlocal eigenvalue problems. Such class of equations include among others, the classical nonlocal…
We consider a nonlinear eigenvalue problem under Robin boundary conditions in a domain with (possibly noncompact) smooth boundary. The problem involves a weighted p-Laplacian operator and subcritical nonlinearities satisfying…
An algebraic multilevel iteration method for solving system of linear algebraic equations arising in $H(\mathrm{curl})$ and $H(\mathrm{div})$ spaces are presented. The algorithm is developed for the discrete problem obtained by using the…
Eigenvalue transformations, which include solving time-dependent differential equations as a special case, have a wide range of applications in scientific and engineering computation. While quantum algorithms for singular value…
In this paper, we develop algorithms for computing the recurrence coefficients corresponding to multiple orthogonal polynomials on the step-line. We reformulate the problem as an inverse eigenvalue problem, which can be solved using…
We present a hierarchy of tractable relaxations to obtain lower bounds on the minimum value of a polynomial over a constraint set defined by polynomial equations. In contrast to previous convex relaxation techniques for this problem, our…
The low-rank matrix approximation problem with respect to the entry-wise $\ell_{\infty}$-norm is the following: given a matrix $M$ and a factorization rank $r$, find a matrix $X$ whose rank is at most $r$ and that minimizes $\max_{i,j}…
We give a qualitative description of extremals for Morrey's inequality. Our theory is based on exploiting the invariances of this inequality, studying the equation satisfied by extremals and the observation that extremals are optimal for a…
We present an algorithm for the solution of Sylvester equations with right-hand side of low rank. The method is based on projection onto a block rational Krylov subspace, with two key contributions with respect to the state-of-the-art.…
We consider the numerical construction of minimal Lagrangian graphs, which is related to recent applications in materials science, molecular engineering, and theoretical physics. It is known that this problem can be formulated as an…