Searcharxiv⌕ Search

arXiv subjects

Tom Werner

Publications and source records attributed to Tom Werner.

4 recordsLinked to original sources

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.

math.NA↗

nlKrylov: A Unified Framework for Nonlinear GCR-type Krylov Subspace Methods

In this paper, we introduce a unified framework for nonlinear Krylov subspace methods (\textit{nlKrylov}) to solve systems of nonlinear equations. Building on classical GCR-like/type linear Krylov solvers such as GMRESR, we generalize these approaches to nonlinear problems via nested algorithmic structures. We present rigorous convergence results for problems, relying on relaxed assumptions that avoid the need for exact line searches. The framework is further extended to matrix-valued root finding problems using global nonlinear Krylov approaches. Extensive numerical experiments validate the theoretical insights and demonstrate the robustness and efficiency of our proposed algorithms.

math.NA↗

An inexact Matrix-Newton method for solving NEPv

In this paper, an inexact Newton method for solving real-valued nonlinear eigenvalue problems with eigenvector dependency (NEPv) is introduced that is able to solve the problem on a matrix level. Our main contribution is to derive a variant of Newton's method that uses global Krylov methods such as global GMRES to solve the linear operator equation necessary to compute the Newton correction in a matrix-free way. The advantages that this second order method has over the well-established SCF algorithm are explained and visualized by a variety of numerical experiments.

math.NA↗

On using the complex step method for the approximation of Fréchet derivatives of matrix functions in automorphism groups

We show, that the Complex Step approximation to the Fréchet derivative of real matrix functions is applicable to the matrix sign, square root and polar mapping using iterative schemes. While this property was already discovered for the matrix sign using Newton's method, we extend the research to the family of Padé iterations, that allows us to introduce iterative schemes for finding function and derivative values while approximately preserving automorphism group structure.

math.NA↗