Anderson Acceleration of SCF Iteration and Newton's Method for Solving Nonlinear Eigenvector Problems

The self-consistent field (SCF) iteration is a gateway method for solving nonlinear eigenvector problems, also known as nonlinear eigenvalue problems with eigenvector dependency (NEPv). However, the convergence of SCF can be slow in practice. In this paper, we study two local acceleration techniques for SCF applied to unitarily invariant NEPv: Anderson acceleration and Newton acceleration. A central difficulty in developing these techniques is the non-uniqueness of the eigenvector basis, which complicates direct application of standard Anderson acceleration and introduces singularity into the correction equation of the standard Newton formulation. For Anderson acceleration, we present three formulations based on unitarily invariant parameterization, basis alignment, and Grassmannian geometry, and establish regularity properties of the associated SCF maps. For Newton acceleration, we introduce basis-aligned updates and derive a correction equation whose operator is nonsingular under suitable assumptions, and prove local quadratic convergence. Numerical experiments on NEPv arising from computational physics and data analysis confirm the theoretical findings and demonstrate the effectiveness of the proposed acceleration techniques.

Authors

Publication Details

Journal
arXiv (Cornell University)
Published
2026-11-17
DOI
https://doi.org/10.48550/arxiv.2611.22819
Primary Topic
Matrix Theory and Algorithms
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Anderson Acceleration of SCF Iteration and Newton's Method for Solving Nonlinear Eigenvector Problems

Zhaojun Bai, Ding Lu, Tom Werner
arXiv (Cornell University)
Matrix Theory and Algorithms
preprint

Anderson Acceleration of SCF Iteration and Newton's Method for Solving Nonlinear Eigenvector Problems

Zhaojun Bai, Ding Lu, Tom Werner
preprint en

Abstract

The self-consistent field (SCF) iteration is a gateway method for solving nonlinear eigenvector problems, also known as nonlinear eigenvalue problems with eigenvector dependency (NEPv). However, the convergence of SCF can be slow in practice. In this paper, we study two local acceleration techniques for SCF applied to unitarily invariant NEPv: Anderson acceleration and Newton acceleration. A central difficulty in developing these techniques is the non-uniqueness of the eigenvector basis, which complicates direct application of standard Anderson acceleration and introduces singularity into the correction equation of the standard Newton formulation. For Anderson acceleration, we present three formulations based on unitarily invariant parameterization, basis alignment, and Grassmannian geometry, and establish regularity properties of the associated SCF maps. For Newton acceleration, we introduce basis-aligned updates and derive a correction equation whose operator is nonsingular under suitable assumptions, and prove local quadratic convergence. Numerical experiments on NEPv arising from computational physics and data analysis confirm the theoretical findings and demonstrate the effectiveness of the proposed acceleration techniques.

arXiv (Cornell University)
Matrix Theory and Algorithms
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon