Variational Characterization of Monotone Nonlinear Eigenvector Problems and Geometry of Self-Consistent Field Iteration
From MaRDI portal
Publication:6139650
Abstract: This paper concerns a class of monotone eigenvalue problems with eigenvector nonlinearities (mNEPv). The mNEPv is encountered in applications such as the computation of joint numerical radius of matrices, best rank-one approximation of third-order partial symmetric tensors, and distance to singularity for dissipative Hamiltonian differential-algebraic equations. We first present a variational characterization of the mNEPv. Based on the variational characterization, we provide a geometric interpretation of the self-consistent-field (SCF) iterations for solving the mNEPv, prove the global convergence of the SCF, and devise an accelerated SCF. Numerical examples from a variety of applications demonstrate the theoretical properties and computational efficiency of the SCF and its acceleration.
Recommendations
- Sharp estimation of convergence rate for self-consistent field iteration to solve eigenvector-dependent nonlinear eigenvalue problems
- On an Eigenvector-Dependent Nonlinear Eigenvalue Problem
- Interpolating self consistent field for eigenvector nonlinearities
- Locally unitarily invariantizable NEPv and convergence analysis of SCF
- On the Convergence of the Self-Consistent Field Iteration for a Class of Nonlinear Eigenvalue Problems
Cites work
- scientific article; zbMATH DE number 3130180 (Why is no real title available?)
- scientific article; zbMATH DE number 733664 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 967931 (Why is no real title available?)
- scientific article; zbMATH DE number 2212009 (Why is no real title available?)
- A Multilinear Singular Value Decomposition
- A Nonlinear Spectral Method for Core--Periphery Detection in Networks
- A Trust Region Direct Constrained Minimization Algorithm for the Kohn–Sham Equation
- A density matrix approach to the convergence of the self-consistent field iteration
- A survey on variational characterizations for nonlinear eigenvalue problems
- Algorithms for the computation of the pseudospectral radius and the numerical radius of a matrix
- An Extension of the Hausdorff-Toeplitz Theorem on the Numerical Range
- An Inverse Iteration Method for Eigenvalue Problems with Eigenvector Nonlinearities
- An algorithm for computing the numerical radius
- Analysis of individual differences in multidimensional scaling via an \(n\)-way generalization of ``Eckart-Young decomposition
- Approximation algorithms for homogeneous polynomial optimization with quadratic constraints
- Boundary points of joint numerical ranges
- Computation of the nearest structured matrix triplet with common null space
- Computing an Eigenvector with Inverse Iteration
- Computing the Ground State Solution of Bose--Einstein Condensates by a Normalized Gradient Flow
- Computing the numerical radius
- Convergence Rate Analysis and Improved Iterations for Numerical Radius Computation
- Convergence analysis of direct minimization and self-consistent iterations
- Convexity of the Joint Numerical Range
- Damped oscillations of linear systems. A mathematical introduction
- Distance problems for dissipative Hamiltonian systems and related matrix polynomials
- Eigenvalues of a real supersymmetric tensor
- Electronic Structure
- Elliptic preconditioner for accelerating the self-consistent field iteration in Kohn-Sham density functional theory
- Estimation of structured distances to singularity for matrix pencils with symmetry structures: a linear algebra-based approach
- Finding the global optimum of a class of quartic minimization problem
- Fixed Point Equations and Nonlinear Eigenvalue Problems in Ordered Banach Spaces
- Geometric computation of the numerical radius of a matrix
- Iterative Solution Methods
- Iterative approximation of fixed points
- Iterative methods for symmetric outer product tensor decomposition
- Linear port-Hamiltonian descriptor systems
- Maps preserving the joint numerical radius distance of operators
- Maximization of the sum of the trace ratio on the Stiefel manifold. I: Theory
- Methods of intermediate problems for eigenvalues. Theory and ramifications
- New Developments in Molecular Orbital Theory
- Nonlinear eigenvector methods for convex minimization over the numerical range
- On an Eigenvector-Dependent Nonlinear Eigenvalue Problem
- On optimizing the sum of the Rayleigh quotient and the generalized Rayleigh quotient on the unit sphere
- On the analysis of the discretized Kohn-Sham density functional theory
- On the best rank-1 approximation of higher-order supersymmetric tensors
- Port-Hamiltonian systems theory: an introductory overview
- Rank-one approximation to high order tensors
- Robust Rayleigh quotient minimization and nonlinear eigenvalue problems
- Robust convex optimization
- Sharp estimation of convergence rate for self-consistent field iteration to solve eigenvector-dependent nonlinear eigenvalue problems
- Some theorems on the generalized numerical ranges
- Templates for the Solution of Algebraic Eigenvalue Problems
- Tensor Decompositions and Applications
- Tensor eigenvalues and their applications
- The C-eigenvalue of third order tensors and its application in crystals
- The cubic spherical optimization problems
- The nonlinear eigenvalue problem
- The trace ratio optimization problem
This page was built for publication: Variational Characterization of Monotone Nonlinear Eigenvector Problems and Geometry of Self-Consistent Field Iteration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6139650)
