Broyden's Method for Nonlinear Eigenproblems

DOI10.1137/18M1173150zbMATH Open1434.65077arXiv1802.07322WikidataQ128108428 ScholiaQ128108428MaRDI QIDQ4632004FDOQ4632004

Elias Jarlebring

Publication date: 25 April 2019

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Abstract: Broyden's method is a general method commonly used for nonlinear systems of equations, when very little information is available about the problem. We develop an approach based on Broyden's method for nonlinear eigenvalue problems. Our approach is designed for problems where the evaluation of a matrix vector product is computationally expensive, essentially as expensive as solving the corresponding linear system of equations. We show how the structure of the Jacobian matrix can be incorporated into the algorithm to improve convergence. The algorithm exhibits local superlinear convergence for simple eigenvalues, and we characterize the convergence. We show how deflation can be integrated and combined such that the method can be used to compute several eigenvalues. A specific problem in machine tool milling, coupled with a PDE is used to illustrate the approach. The simulations are done in the julia programming language, and are provided as publicly available module for reproducability.

Full work available at URL: https://arxiv.org/abs/1802.07322

zbMATH Keywords

eigenvalue problemstime-delay systemsNewton methodsBroyden methodsnonlinear eigenproblems

Mathematics Subject Classification ID

Numerical computation of eigenvalues and eigenvectors of matrices (65F15) Numerical solution of nonlinear eigenvalue and eigenvector problems (65H17) Numerical solutions to inverse eigenvalue problems (65F18)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• NLEVP
• Julia: A Fresh Approach to Numerical Computing
• Matrix computations.
• On the Local and Superlinear Convergence of Quasi-Newton Methods
• A Class of Methods for Solving Nonlinear Simultaneous Equations
• Residual Inverse Iteration for the Nonlinear Eigenvalue Problem
• Nonlinear eigenvalue problems: a challenge for modern eigenvalue methods
• Algorithms for the Nonlinear Eigenvalue Problem
• An Arnoldi method for nonlinear eigenvalue problems
• Stability chart for the delayed Mathieu equation
• Updated semi‐discretization method for periodic delay‐differential equations with discrete delay
• Some Convergence Properties of Broyden’s Method
• Inverse Iteration, Ill-Conditioned Equations and Newton’s Method
• A block Newton method for nonlinear eigenvalue problems
• On an Approach to the Solution of the Generalized Latent Value Problem for $\lambda $-Matrices
• On the perturbation of analytic matrix functions
• The Quadratic Arnoldi Method for the Solution of the Quadratic Eigenvalue Problem
• Convergence factors of Newton methods for nonlinear eigenvalue problems
• Nichtlineare Behandlung von Eigenwertaufgaben
• Invariance properties in the root sensitivity of time-delay systems with double imaginary roots
• Efficient Preconditioned Inner Solves For Inexact Rayleigh Quotient Iteration And Their Connections To The Single-Vector Jacobi–Davidson Method
• Local convergence analysis of several inexact Newton-type algorithms for general nonlinear eigenvalue problems
• Locking and restarting quadratic eigenvalue solvers
• Robust successive computation of eigenpairs for nonlinear eigenvalue problems
• Continuation of Invariant Subspaces for Parameterized Quadratic Eigenvalue Problems
• Broyden’s Method for a Class of Problems Having Singular Jacobian at the Root
• Error Bounds for Approximate Eigenvalues of Periodic-Coefficient Linear Delay Differential Equations
• Analyzing the convergence factor of residual inverse iteration
• Continuation of Bifurcations in Periodic Delay‐Differential Equations Using Characteristic Matrices
• Broyden's quasi-Newton methods for a nonlinear system of equations and unconstrained optimization: a review and open problems
• The nonlinear eigenvalue problem
• Local convergence of Newton-like methods for degenerate eigenvalues of nonlinear eigenproblems: II. Accelerated algorithms
• A Nonlinear QR Algorithm for Banded Nonlinear Eigenvalue Problems
• Local convergence of Newton-like methods for degenerate eigenvalues of nonlinear eigenproblems. I. Classical algorithms
• A memory-efficient Broyden method to compute fixed points of non-linear maps arising in periodically forced processes
• Disguised and new quasi-Newton methods for nonlinear eigenvalue problems
• The Infinite Bi-Lanczos Method for Nonlinear Eigenvalue Problems

Cited In (2)

• Spectrum-based Stability Analysis and Stabilization of Time-periodic Time-delay Systems
• Title not available (Why is that?)

Uses Software

• NLEVP
• NewtonLib
• Julia
• NEP-PACK

This page was built for publication: Broyden's Method for Nonlinear Eigenproblems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4632004)