On the Forsythe conjecture

09/29/2022
by   Vance Faber, et al.
0

Forsythe formulated a conjecture about the asymptotic behavior of the restarted conjugate gradient method in 1968. We translate several of his results into modern terms, and generalize the conjecture (originally formulated only for symmetric positive definite matrices) to symmetric and nonsymmetric matrices. Our generalization is based on a two-sided or cross iteration with the given matrix and its transpose, which is based on the projection process used in the Arnoldi (or for symmetric matrices the Lanczos) algorithm. We prove several new results about the limiting behavior of this iteration, but the conjecture still remains largely open.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/21/2023

Crouzeix's conjecture for new classes of matrices

For a matrix A which satisfies Crouzeix's conjecture, we construct sever...
research
08/30/2019

The antitriangular factorization of skew-symmetric matrices

In this paper we develop algorithms for similarity transformations of sk...
research
01/27/2023

Proof of a conjecture of Krawchuk and Rampersad

We prove a 2018 conjecture of Krawchuk and Rampersad on the extremal beh...
research
12/26/2021

Proof of a conjecture on a special class of matrices over commutative rings of characteristic 2

In this note, we prove the conjecture posed by Keller and Rosemarin at E...
research
03/03/2023

GMRES, pseudospectra, and Crouzeix's conjecture for shifted and scaled Ginibre matrices

We study the GMRES algorithm applied to linear systems of equations invo...
research
09/12/2022

Rook Theory of the Etzion-Silberstein Conjecture

In 2009, Etzion and Siberstein proposed a conjecture on the largest dime...
research
11/17/2020

Complete quadrics: Schubert calculus for Gaussian models and semidefinite programming

We establish connections between: the maximum likelihood degree (ML-degr...

Please sign up or login with your details

Forgot password? Click here to reset