Related papers: Riemannian Inexact Newton Method for Structured In…
Neural networks functions are supposed to be able to encode the desired solution of an inverse problem very efficiently. In this paper, we consider the problem of solving linear inverse problems with neural network coders. First we…
We use novel integral representations developed by the second author to prove certain rigorous results concerning elliptic boundary value problems in convex polygons. Central to this approach is the so-called global relation, which is a…
We study a nonlinear decomposition of a positive definite matrix into two components: the inverse of another positive definite matrix and a symmetric matrix constrained to lie in a prescribed linear subspace. Equivalently, the inverse…
We analyze convergence of the Levenberg-Marquardt method for solving nonlinear inverse problems in Hilbert spaces. Specifically, we establish local convergence and convergence rates for a class of inverse problems that satisfy H\"{o}lder…
In this paper, we propose an inexact proximal Newton-type method for nonconvex composite problems. We establish the global convergence rate of the order $\mathcal{O}(k^{-1/2})$ in terms of the minimal norm of the KKT residual mapping and…
This work deals with the interior transmission eigenvalue problem: $y'' + {k^2}\eta \left( r \right)y = 0$ with boundary conditions ${y\left( 0 \right) = 0 = y'\left( 1 \right)\frac{{\sin k}}{k} - y\left( 1 \right)\cos k},$ where the…
Finding a Z-eigenpair of a symmetric tensor is equivalent to finding a KKT point of a sphere constrained minimization problem. Based on this equivalency, in this paper, we first propose a class of iterative methods to get a Z-eigenpair of a…
Contour integral methods for nonlinear eigenvalue problems seek to compute a subset of the spectrum in a bounded region of the complex plane. We briefly survey this class of algorithms, establishing a relationship to system realization…
We study the eigenvalue problem for some special class of anti-triangular matrices. Though the eigenvalue problem is quite classical, as far as we know, almost nothing is known about properties of eigenvalues for anti-triangular matrices.…
We study the asymptotics of singular values and singular functions of a Finite Hilbert transform (FHT), which is defined on several intervals. Transforms of this kind arise in the study of the interior problem of tomography. We suggest a…
A unitarily invariant projective framework is introduced to analyze the complexity of path-following methods for the eigenvalue problem. A condition number, and its relation to the distance to ill-posedness, is given. A Newton map…
This paper introduces a method for computing eigenvalues and eigenvectors of a generalized Hermitian, matrix eigenvalue problem. The work is focused on large scale eigenvalue problems, where the application of a direct inverse is out of…
In a Wigner quantum mechanical model, with a solution in terms of the Lie superalgebra gl(1|n), one is faced with determining the eigenvalues and eigenvectors for an arbitrary self-adjoint odd element of gl(1|n) in any unitary irreducible…
We present here necessary and sufficient conditions for the invertibility of circulant and symmetric matrices that depend on three parameters and moreover, we explicitly compute the inverse. The techniques we use are related with the…
We consider the optimization problem with a generally quadratic matrix constraint of the form $X^TAX = J$, where $A$ is a given nonsingular, symmetric $n\times n$ matrix and $J$ is a given $k\times k$ symmetric matrix, with $k\leq n$,…
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 study some aspects of the invariant pair problem for matrix polynomials, as introduced by Betcke and Kressner and by Beyn and Thuemmler. Invariant pairs extend the notion of eigenvalue-eigenvector pairs, providing a counterpart of…
We consider Proximal Newton methods with an inexact computation of update steps. To this end, we introduce two inexactness criteria which characterize sufficient accuracy of these update step and with the aid of these investigate global…
We relax the regularity condition on potentials of Schr\"odinger equations in the uniqueness results in \cite{EB} and \cite{IY2} for the inverse boundary value problem of determining a potential by Dirichlet-to-Neumann map.
We revisit a classical problem in numerical linear algebra: given an $k$-dimensional subspace $\mathcal{Q}$ that approximates the leading eigenspace of an $n\times n$ positive semi-definite matrix $A$, the goal is to extract high-accuracy…