Linearizable eigenvector nonlinearities
From MaRDI portal
Abstract: We present a method to linearize, without approximation, a specific class of eigenvalue problems with eigenvector nonlinearities (NEPv), where the nonlinearities are expressed by scalar functions that are defined by a quotient of linear functions of the eigenvector. The exact linearization relies on an equivalent multiparameter problem (MEP) that contains the exact solutions of the NEPv. Due to the characterization of MEPs in terms of a generalized eigenvalue problem this provides a direct way to compute all NEPv solutions for small problems, and it opens up the possibility to develop locally convergent iterative methods for larger problems. Moreover, the linear formulation allows us to easily determine the number of solutions of the NEPv. We propose two numerical schemes that exploit the structure of the linearization: inverse iteration and residual inverse iteration. We show how symmetry in the MEP can be used to improve reliability and reduce computational cost of both methods. Two numerical examples verify the theoretical results and a third example shows the potential of a hybrid scheme that is based on a combination of the two proposed methods.
Recommendations
Cites work
- A density matrix approach to the convergence of the self-consistent field iteration
- A Jacobi--Davidson Type Method for a Right Definite Two-Parameter Eigenvalue Problem
- A Jacobi--Davidson Type Method for the Two-Parameter Eigenvalue Problem
- A Nonlinear Spectral Method for Core--Periphery Detection in Networks
- A projection method and Kronecker product preconditioner for solving Sylvester tensor equations
- A Sylvester–Arnoldi type method for the generalized eigenvalue problem with two‐by‐two operator determinants
- Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4]
- An analysis for the DIIS acceleration method used in quantum chemistry calculations
- An Inverse Iteration Method for Eigenvalue Problems with Eigenvector Nonlinearities
- An iterative algorithm to solve the generalized Sylvester tensor equations
- Basic algebraic geometry 1. Varieties in projective space. Translated from the Russian by Miles Reid
- Computing the Ground State Solution of Bose--Einstein Condensates by a Normalized Gradient Flow
- Convergence of gradient-based algorithms for the Hartree-Fock equations
- Finite-dimensional multiparameter spectral theory: The nonderogatory case
- Krylov subspace methods for linear systems with tensor product structure
- Multiparameter eigenvalue problems. Volume I: Matrices and compact operators
- Numerical methods for electronic structure calculations of materials
- Numerical methods for nonlinear two-parameter eigenvalue problems
- On an Eigenvector-Dependent Nonlinear Eigenvalue Problem
- On the analysis of the discretized Kohn-Sham density functional theory
- On the convergence of SCF algorithms for the Hartree-Fock equations
- On the Convergence of the Self-Consistent Field Iteration for a Class of Nonlinear Eigenvalue Problems
- On the convergence of the self-consistent field iteration in Kohn-Sham density functional theory
- On the Krylov subspace methods based on tensor format for positive definite Sylvester tensor equations.
- Residual Inverse Iteration for the Nonlinear Eigenvalue Problem
- Robust Rayleigh quotient minimization and nonlinear eigenvalue problems
- Structured Polynomial Eigenvalue Problems: Good Vibrations from Good Linearizations
- Subspace methods for three‐parameter eigenvalue problems
- Tensor Decompositions and Applications
Cited in
(11)- Eigenvectors for nonlinear maps
- Implicit algorithms for eigenvector nonlinearities
- Principal vectors of a nonlinear finite-dimensional eigenvalue problem
- NLEVP, a collection of nonlinear eigenvalue problems
- A linear eigenvalue algorithm for the nonlinear eigenvalue problem
- Nonlinear eigenvector methods for convex minimization over the numerical range
- Contour Integration for Eigenvector Nonlinearities
- Locally unitarily invariantizable NEPv and convergence analysis of SCF
- The Gross-Pitaevskii equation and eigenvector nonlinearities: numerical methods and algorithms
- Solving the parametric eigenvalue problem by Taylor series and Chebyshev expansion
- From eigenvector nonlinearities with quadratic structure to eigenvalue nonlinearities with algebraic structure
This page was built for publication: Linearizable eigenvector nonlinearities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5863877)
