Related papers: Inflationary dynamics for matrix eigenvalue proble…
Intertwining analysis, algebra, numerical analysis and optimization, computing conjugate co-gradients of real-valued quotients gives rise to eigenvalue problems. In the linear Hermitian case, by inspecting optimal quotients in terms of…
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…
Nonlinear eigenvalue problems with eigenvector nonlinearities (NEPv) are algebraic eigenvalue problems whose matrix depends on the eigenvector. Applications range from computational quantum mechanics to machine learning. Due to its…
The parallel orbital-updating approach is an orbital/eigenfunction iteration based approach for solving eigenvalue problems when many eigenpairs are required. It has been proven to be efficient, for instance, in electronic structure…
We have recently presented an extension of the standard variational calculus to include the presence of deformed derivatives in the Lagrangian of a system of particles and in the Lagrangian density of field-theoretic models. Classical…
Interior point methods for solving linearly constrained convex programming involve a variable projection matrix at each iteration to deal with the linear constraints. This matrix often becomes ill-conditioned near the boundary of the…
We study the perturbative power-series expansions of the eigenvalues and eigenvectors of a general tridiagonal (Jacobi) matrix of dimension d. The(small) expansion parameters are being the entries of the two diagonals of length d-1…
The domain wall problem and the isocurvature problem restrict possible combinations of axion models and inflation models. In this paper, we considered a new mechanism which solves those problems by dynamics of multiple scalar fields…
We develop a new inexact interior-point Lagrangian decomposition method to solve a wide range class of constrained composite convex optimization problems. Our method relies on four techniques: Lagrangian dual decomposition, self-concordant…
We report a new analytical method for solution of a wide class of second-order differential equations with eigenvalues replaced by arbitrary functions. Such classes of problems occur frequently in Quantum Mechanics and Optics. This approach…
We investigate how the theory of self-adjoint differential equations alone can be used to provide a satisfactory solution of the inverse vatiational problem. For the discrete system, the self-adjoint form of the Newtonian equation allows…
Eigenvector continuation is a computational method that finds the extremal eigenvalues and eigenvectors of a Hamiltonian matrix with one or more control parameters. It does this by projection onto a subspace of eigenvectors corresponding to…
The class of three-diagonal Jacobi matrix with exponentially increasing elements is considered. Under some assumptions the matrix corresponds to unbounded self-adjoint operator in the weighted space. The weight depends on elements of the…
We propose a gradient-based Jacobi algorithm for a class of maximization problems on the unitary group, with a focus on approximate diagonalization of complex matrices and tensors by unitary transformations. We provide weak convergence…
A simple and efficient variational method is introduced to accelerate the convergence of the eigenenergy computations for a Hamiltonian H with singular potentials. Closed-form analytic expressions in N dimensions are obtained for the matrix…
A type of adaptive finite element method for the eigenvalue problems is proposed based on the multilevel correction scheme. In this method, adaptive finite element method to solve eigenvalue problems involves solving associated boundary…
The non-Hermitian Bethe-Salpeter eigenvalue problem, in the definite case, is a structured eigenproblem, with real eigenvalues coming in pairs $\{\lambda,-\lambda\}$ where the corresponding pair of eigenvectors are closely related, and…
We consider the solution of large-scale nonlinear algebraic Hermitian eigenproblems of the form $T(\lambda)v=0$ that admit a variational characterization of eigenvalues. These problems arise in a variety of applications and are…
We present a novel deep learning approach to approximate the solution of large, sparse, symmetric, positive-definite linear systems of equations. These systems arise from many problems in applied science, e.g., in numerical methods for…
We study efficient solution methods for stochastic eigenvalue problems arising from discretization of self-adjoint partial differential equations with random data. With the stochastic Galerkin approach, the solutions are represented as…