Related papers: Centrosymmetric Matrices in the Sinc Collocation M…
Inverse spectral problems for Sturm-Liouville operators on a finite interval with non-separated boundary conditions are studied in the central symmetric case, when the potential is symmetric with respect to the middle of the interval. We…
In this paper, further to the point interaction method for inverse Sturm-Liouville problems on finite intervals firstly proposed in our previous work, we will continue to generalize this method to the inverse eigenvalue problems for…
This paper shows that the weighting coefficient matrices of the differential quadrature method (DQM) are centrosymmetric or skew-centrosymmetric if the grid spacings are symmetric irrespective of whether they are equal or unequal. A new…
We prove that few largest (and most important) eigenvalues of random symmetric matrices of various kinds are very strongly concentrated. This strong concentration enables us to compute the means of these eigenvalues with high precision. Our…
A new symbolic algorithmic implementation of the general scheme of the exponentially convergent functional-discrete (FD-) method is developed and justified for the Sturm-Liouville problem on a finite interval for the Schr\"odinger equation…
We have devised a variational sinc collocation method (VSCM) which can be used to obtain accurate numerical solutions to many strong-coupling problems. Sinc functions with an optimal grid spacing are used to solve the linear and non-linear…
We present a variational algorithm for solving the classical inverse Sturm-Liouville problem in one dimension when two spectra are given. All critical points of the least squares functional are at global minima, which which suggests…
The goal of the paper is to investigate the dynamics of the eigenvalues of the Sturm-Liouville operator with summable PT-symmetric potential on the finite interval. It turns out that the case of a complex Airy operator presents an exactly…
In this paper, we further Meirong Zhang, et al.'s work by computing the number of weighted eigenvalues for Sturm-Liouville equations, equipped with general integrable potentials and Dirac weights, under Dirichlet boundary condition. We show…
In this paper, we propose a decomposition approach for eigenvalue problems with spatial symmetries, including the formulation, discretization as well as implementation. This approach can handle eigenvalue problems with either Abelian or…
It is well known that a family of $n\times n$ commuting matrices can be simultaneously triangularized by a unitary similarity transformation. The diagonal entries of the triangular matrices define the $n$ joint eigenvalues of the family. In…
The numerical solution of eigenvalue problems is essential in various application areas of scientific and engineering domains. In many problem classes, the practical interest is only a small subset of eigenvalues so it is unnecessary to…
A method for approximate solution of spectral problems for Sturm-Liouville equations based on the construction of the Delsarte transmutation operators is presented. In fact the problem of numerical approximation of solutions and eigenvalues…
We study Sturm--Liouville differential operators on the time scales consisting of a finite number of isolated points and segments. In a previous paper it was established that such operators are uniquely determined by their spectral…
Solving the generalized eigenvalue problem is a useful method for finding energy eigenstates of large quantum systems. It uses projection onto a set of basis states which are typically not orthogonal. One needs to invert a matrix whose…
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…
Sinc-collocation methods are known to be efficient for Fredholm integral equations of the second kind, even if functions in the equations have endpoint singularity. However, existing methods have the disadvantage of inconsistent collocation…
In this paper, two accelerated divide-and-conquer algorithms are proposed for the symmetric tridiagonal eigenvalue problem, which cost $O(N^2r)$ {flops} in the worst case, where $N$ is the dimension of the matrix and $r$ is a modest number…
This paper is concerned with computations of a few smaller eigenvalues (in absolute value) of a large extremely ill-conditioned matrix. It is shown that smaller eigenvalues can be accurately computed for a diagonally dominant matrix or a…
A powerful method for calculating the eigenvalues of a Hamiltonian operator consists of converting the energy eigenvalue equation into a matrix equation by means of an appropriate basis set of functions. The convergence of the method can be…