相关论文: Power iteration for matrices with power series ent…

Given a large real symmetric, positive semidefinite m-by-m matrix, the goal of this paper is to show how a numerical approximation of the entropy, given by the sum of the entropies of the individual eigenvalues, can be computed in an…

Certain optimization problems in communication systems, such as limited-feedback constant-envelope beamforming or noncoherent $M$-ary phase-shift keying ($M$PSK) sequence detection, result in the maximization of a fixed-rank positive…

Consider the problem of estimating the entries of a large matrix, when the observed entries are noisy versions of a small random fraction of the original entries. This problem has received widespread attention in recent times, especially…

The QR-algorithm is one of the most important algorithms in linear algebra. Its several variants make feasible the computation of the eigenvalues and eigenvectors of a numerical real or complex matrix, even when the dimensions of the matrix…

We consider a region in the complex plane enclosed by a deltoid curve inscribed in the unit circle, and define a family of polynomials $P_n$ that satisfy the same recurrence relation as the Faber polynomials for this region. We use this…

In this work, we fully explore three refined convergence structures of the lowest-order rectangular Raviart-Thomas element in solving the Laplace eigenvalue problem. Firstly, the scheme possesses a property of supercloseness between the…

We consider the extension of the method of Gauss-Newton from complex floating-point arithmetic to the field of truncated power series with complex floating-point coefficients. With linearization we formulate a linear system where the…

We present a variant of the FEAST matrix eigensolver for solving restricted real and symmetric eigenvalue problems. The method is derived from a combination of a variant of the FEAST method, which employs two contour integrals per…

This paper proposes a power method for computing the dominant eigenvalues of a non-Hermitian dual quaternion matrix (DQM). Although the algorithmic framework parallels the Hermitian case, the theoretical analysis is substantially more…

Some near-optimal polynomial root-finders of 2024-25, based on subdivision iterations, approximate all complex roots of a polynomial or all roots in a fixed Region of Interest in the complex plane. The iterations can be applied to a black…

With the recent emergence of mixed precision hardware, there has been a renewed interest in its use for solving numerical linear algebra problems fast and accurately. The solution of total least squares problems, i.e., solving $\min_{E,r}…

Recovering matrices from compressive and grossly corrupted observations is a fundamental problem in robust statistics, with rich applications in computer vision and machine learning. In theory, under certain conditions, this problem can be…

By using the methods of Cauchy-Binet type formula and adjugate matrix respectively, a wonderful equality relating to the elements of eigenvectors, the eigenvalues and the submatrix eigenvalues is proved in arXiv:1908.03795. In the note, we…

We establish a quantitative version of the Tracy--Widom law for the largest eigenvalue of high dimensional sample covariance matrices. To be precise, we show that the fluctuations of the largest eigenvalue of a sample covariance matrix…

This work presents an approach to the inverse design of scattering systems by modifying the transmission matrix using reinforcement learning. We utilize Proximal Policy Optimization to navigate the highly non-convex landscape of the object…

We introduce the method of path-sums which is a tool for exactly evaluating a function of a discrete matrix with possibly non-commuting entries, based on the closed-form resummation of infinite families of terms in the corresponding Taylor…

Let $p_n$ be the maximal sum of the entries of $A^2$, where $A$ is a square matrix of size $n$, consisting of the numbers $1,2,\ldots,n^2$, each appearing exactly once. We prove that $m_n=\Theta(n^7)$. More precisely, we show that…

The eigenvalue problem for an irreducible non negative matrix $A=[a_{ij}]$ in the max-algebra is the form $A \otimes x = \lambda x$ where $(A \otimes x)_i = \max (a_{ij}x_j), x=(x_1,x_2, \dots, x_n)^t $ and $\lambda $ refers to maximum…

I show that the power iteration method applied to the phase retrieval problem converges under special conditions. One is given the relative phases between small non-overlapping groups of pixels of a recorded intensity pattern, but no…

We address the problem of minimizing a convex function over the space of large matrices with low rank. While this optimization problem is hard in general, we propose an efficient greedy algorithm and derive its formal approximation…