A posteriori superlinear convergence bounds for block conjugate gradient

DOI10.1553/ETNA_VOL58S115zbMATH Open1512.65053arXiv2107.10320OpenAlexW3184897884MaRDI QIDQ6163322FDOQ6163322

Authors: Christian E. Schaerer, Daniel B. Szyld, Pedro J. Torres 

Publication date: 9 June 2023

Published in: ETNA - Electronic Transactions on Numerical Analysis (Search for Journal in Brave)

Abstract: In this paper, we extend to the block case, the a posteriori bound showing superlinear convergence of Conjugate Gradients developed in [J. Comput. Applied Math., 48 (1993), pp. 327-341]; that is, we obtain similar bounds, but now for block Conjugate Gradients. We also present a series of computational experiments illustrating the validity of the bound developed here, as well as the bound from [SIAM Review, 47 (2005), pp. 247-272] using angles between subspaces. Using these bounds, we make some observations on the onset of superlinearity, and how this onset depends on the eigenvalue distribution and the block size.

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

Recommendations

• Superlinear convergence of conjugate gradients
• On the sublinear and superlinear rate of convergence of conjugate gradient methods
• Reaching the superlinear convergence phase of the CG method
• The rate of convergence of conjugate gradients
• On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods

zbMATH Keywords

superlinear convergencea posteriori analysisblock conjugate gradient method

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Computational methods for sparse matrices (65F50) Iterative numerical methods for linear systems (65F10) Methods of reduced gradient type (90C52)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Methods of conjugate gradients for solving linear systems
• Perturbation theory for linear operators.
• Title not available (Why is that?)
• Performance and analysis of saddle point preconditioners for the discrete steady-state Navier-Stokes equations
• The rate of convergence of conjugate gradients
• Recent computational developments in Krylov subspace methods for linear systems
• The block conjugate gradient algorithm and related methods
• The superlinear convergence behaviour of GMRES
• On the real convergence rate of the conjugate gradient method
• On the Rates of Convergence of the Lanczos and the Block-Lanczos Methods
• On the Occurrence of Superlinear Convergence of Exact and Inexact Krylov Subspace Methods
• GMRES and the minimal polynomial
• The block Lanczos method for linear systems with multiple right-hand sides
• Composite convergence bounds based on Chebyshev polynomials and finite precision conjugate gradient computations
• Superlinear CG convergence for special right-hand sides
• Some Superlinear Convergence Results for the Conjugate Gradient Method
• The block grade of a block Krylov space
• ON THE RATE OF CONVERGENCE OF THE CONJUGATE GRADIENT METHOD FOR LINEAR OPERATORS IN HILBERT SPACE
• Block Krylov subspace methods for functions of matrices
• Block Krylov subspace methods for functions of matrices. II: Modified block FOM
• Further results on the convergence behavior of conjugate-gradients and Ritz values
• The convergence behavior of Ritz values in the presence of close eigenvalues
• Ritz and pseudo-Ritz values using matrix polynomials
• Admissible and attainable convergence behavior of block Arnoldi and GMRES
• Numerical Mathematics and Advanced Applications 2011

This page was built for publication: A posteriori superlinear convergence bounds for block conjugate gradient

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