Related papers: Centrosymmetric Matrices in the Sinc Collocation M…
This paper examines the properties of real symmetric square matrices with a constant value for the main diagonal elements and another constant value for all off-diagonal elements. This matrix form is a simple subclass of circulant matrices,…
Extracting structured subgraphs inside large graphs - often known as the planted subgraph problem - is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant…
Let $\{C_1, C_2, \ldots, C_m\},~m\ge2$ be a collection of $n\times n$ real symmetric matrices. The objective of the paper is to offer an algorithm that finds a common congruence matrix $R$ such that $R^TC_iR$ is real diagonal for every…
Exact diagonalization and other numerical studies of quantum spin systems are notoriously limited by the exponential growth of the Hilbert space dimension with system size. A common and well-known practice to reduce this increasing…
This paper is devoted to the computation of transmission eigenvalues in the inverse acoustic scattering theory. This problem is first reformulated as a two by two boundary system of boundary integral equations. Next, utilizing the Schur…
The history of research on eigenvalue problems is rich with many outstanding contributions. Nonetheless, the rapidly increasing size of data sets requires new algorithms for old problems in the context of extremely large matrix dimensions.…
Given two real symmetric matrices, their eigenvalue configuration is the relative arrangement of their eigenvalues on the real line. In this paper, we consider the following problem: given two parametric real symmetric matrices and an…
Quartic eigenvalue problem $(\lambda^4 A + \lambda^3 B + \lambda^2C + \lambda D + E)x = \mathbf{0}$ naturally arises e.g. when solving the Orr-Sommerfeld equation in the analysis of the stability of the {Poiseuille} flow, in theoretical…
The Schr\"odinger equation is solved numerically for charmonium using the discrete variable representation (DVR) method. The Hamiltonian matrix is constructed and diagonalized to obtain the eigenvalues and eigenfunctions. Using these…
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…
In this paper, we develop a new approach to investigation of the uniform stability for inverse spectral problems. We consider the non-self-adjoint Sturm-Liouville problem that consists in the recovery of the potential and the parameters of…
We show how a number of NP-complete as well as NP-hard problems can be reduced to the Sturm-Liouville eigenvalue problem in the quantum setting with queries. We consider power queries which are derived from the propagator of a system…
We present a new algorithm which is named the Dynamical Functional Particle Method, DFPM. It is based on the idea of formulating a finite dimensional damped dynamical system whose stationary points are the solution to the original…
Horn's problem, i.e., the study of the eigenvalues of the sum $C=A+B$ of two matrices, given the spectrum of $A$ and of $B$, is re-examined, comparing the case of real symmetric, complex Hermitian and self-dual quaternionic $3\times 3$…
In this paper, we investigate the sampling analysis for a new Sturm-Liouville problem with symmetrically located discontinuities which are defined to depending on a neighborhood of a midpoint of the interval. Also the problem has…
Many problems in physics, chemistry and other fields are perturbative in nature, i.e. differ only slightly from related problems with known solutions. Prominent among these is the eigenvalue perturbation problem, wherein one seeks the…
Similarity matrix serves as a fundamental tool at the core of numerous downstream machine-learning tasks. However, missing data is inevitable and often results in an inaccurate similarity matrix. To address this issue, Similarity Matrix…
This paper proposes a Newton-type method to solve numerically the eigenproblem of several diagonalizable matrices, which pairwise commute. A classical result states that these matrices are simultaneously diagonalizable. From a suitable…
We present a novel recursive algorithm for reducing a symmetric matrix to a triangular factorization which reveals the rank profile matrix. That is, the algorithm computes a factorization $\mathbf{P}^T\mathbf{A}\mathbf{P} =…
We study the real algebraic variety of real symmetric matrices with eigenvalue multiplicities determined by a partition. We present formulas for the dimension and Euclidean distance degree. We give a parametrization by rational functions.…