Related papers: A geometric method for eigenvalue problems with lo…
In this paper, we propose algorithms for the graph isomorphism (GI) problem that are based on the eigendecompositions of the adjacency matrices. The eigenvalues of isomorphic graphs are identical. However, two graphs $ G_A $ and $ G_B $ can…
The matrix completion problem consists of finding or approximating a low-rank matrix based on a few samples of this matrix. We propose a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over…
A wide range of problems in computational science and engineering require estimation of sparse eigenvectors for high dimensional systems. Here, we propose two variants of the Truncated Orthogonal Iteration to compute multiple leading…
A class of n-dimensional Poisson systems reducible to an unperturbed harmonic oscillator shall be considered. In such case, perturbations leaving invariant a given symplectic leaf shall be investigated. Our purpose will be to analyze the…
Random matrix theory allows one to deduce the eigenvalue spectrum of a large matrix given only statistical information about its elements. Such results provide insight into what factors contribute to the stability of complex dynamical…
We study the spectra for a class of differential operators with asymptotically constant coefficients.These operators widely arise as the linearizations of nonlinear partial differential equations about patterns or nonlinear waves. We…
Consider the massless Dirac operator on a 3-torus equipped with Euclidean metric and standard spin structure. It is known that the eigenvalues can be calculated explicitly: the spectrum is symmetric about zero and zero itself is a double…
Gradients of neural networks can be computed efficiently for any architecture, but some applications require differential operators with higher time complexity. We describe a family of restricted neural network architectures that allow…
We consider a non-compact Riemannian periodic manifold such that the corresponding Laplacian has a spectral gap. By continuously perturbing the periodic metric locally we can prove the existence of eigenvalues in a gap. A lower bound on the…
Conventionally while we talk about geometry associated with a simple harmonic oscillator, we draw a circle with a radius equal to the amplitude of Oscillator and imagine a particle moving along the perimeter with a frequency same as that of…
The method is proposed for the study of many-point boundary value problems for systems of nonlinear ODE, by reducing them to special equivalent integral equations, and allows us [in contrast with the known method [1]] to consider boundary…
The harmonic oscillator is the paragon of physical models; conceptually and computationally simple, yet rich enough to teach us about physics on scales that span classical mechanics to quantum field theory. This multifaceted nature extends…
Exploring the relationship between geometry and the resonant frequencies of a shape is of interest to pure and applied mathematicians. These resonant frequencies are related to the spectrum of the Laplacian, a partial differential operator.…
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…
We consider nonsymmetric rank one singular perturbations of a selfadjoint operator, i.e., an expression of the form $\tilde A = A + \alpha\left\langle\cdot, \omega_1\right\rangle\omega_2$, $\omega_1\not = \omega_2$, $\alpha\in{\mathbb C}$,…
Rank estimation is a classical model order selection problem that arises in a variety of important statistical signal and array processing systems, yet is addressed relatively infrequently in the extant literature. Here we present sample…
In two and three dimensions, we analyze a finite element method to approximate the solutions of an eigenvalue problem arising from neutron transport. We derive the eigenvalue problem of interest, which results to be non-symmetric. Under a…
We analyze the behavior of a quantum system described by a one-dimensional asymmetric potential consisting of a step plus a harmonic barrier. We solve the eigenvalue equation by the integral representation method, which allows us to…
This paper explores variants of the subspace iteration algorithm for computing approximate invariant subspaces. The standard subspace iteration approach is revisited and new variants that exploit gradient-type techniques combined with a…
We study the Laplace operator subject to Dirichlet boundary conditions in a two-dimensional domain that is one-to-one mapped onto a cylinder (rectangle or infinite strip). As a result of this transformation the original eigenvalue problem…