On the convergence of Broyden's method and some accelerated schemes for singular problems

11/24/2021
by   Florian Mannel, et al.
0

We consider Broyden's method and some accelerated schemes for nonlinear equations having a strongly regular singularity of first order with a one-dimensional nullspace. Our two main results are as follows. First, we show that the use of a preceding Newton-like step ensures convergence for starting points in a starlike domain with density 1. This extends the domain of convergence of these methods significantly. Second, we establish that the matrix updates of Broyden's method converge q-linearly with the same asymptotic factor as the iterates. This contributes to the long-standing question whether the Broyden matrices converge by showing that this is indeed the case for the setting at hand. Furthermore, we prove that the Broyden directions violate uniform linear independence, which implies that existing results for convergence of the Broyden matrices cannot be applied. Numerical experiments of high precision confirm the enlarged domain of convergence, the q-linear convergence of the matrix updates, and the lack of uniform linear independence. In addition, they suggest that these results can be extended to singularities of higher order and that Broyden's method can converge r-linearly without converging q-linearly. The underlying code is freely available.

READ FULL TEXT
research
11/13/2019

Benchmarking results for the Newton-Anderson method

This paper primarily presents numerical results for the Anderson acceler...
research
03/03/2022

Certified Newton schemes for the evaluation of low-genus theta functions

Theta functions and theta constants in low genus, especially genus 1 and...
research
02/14/2022

Superlinear convergence of Anderson accelerated Newton's method for solving stationary Navier-Stokes equations

This paper studies the performance Newton's iteration applied with Ander...
research
09/03/2020

On a non-archimedean broyden method

Newton's method is an ubiquitous tool to solve equations, both in the ar...
research
09/09/2023

Linear convergence of the Collatz method for computing the Perron eigenpair of primitive dual number matrix

Very recently, Qi and Cui extended the Perron-Frobenius theory to dual n...
research
02/12/2018

Accelerated Stochastic Matrix Inversion: General Theory and Speeding up BFGS Rules for Faster Second-Order Optimization

We present the first accelerated randomized algorithm for solving linear...
research
10/27/2020

The leapfrog algorithm as nonlinear Gauss-Seidel

Several applications in optimization, image and signal processing deal w...

Please sign up or login with your details

Forgot password? Click here to reset