Richardson's iteration for nonsymmetric matrices

By G. Opfer, G. Schober. 1984

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

A Tight and Unified Analysis of Extragradient for a Whole Spectrum of Differentiable Games (2019, methodology): “- extrapolation methods with different step sizes for each extrapolation: - cyclic Richardson iterations (Opfer and Schober, 1984): methods whose update is composed of successive gradient steps with possibly different step sizes for each and any combination of with at most k composed gradient…”
Last Iterate is Slower than Averaged Iterate in Smooth Convex-Concave Saddle Point Problems (2020, background): “• Cyclic Richardson iterations (Opfer and Schober (1984)), in which a single update from z ( t ) to z ( t +1) consists of a sequence of k gradient updates with different step-sizes η 1 , . . . , η k (so that the step sizes cycle between η 1 , . . . , η k ).”
A Tight and Unified Analysis of Gradient-Based Methods for a Whole Spectrum of Differentiable Games (2020, methodology): “- extrapolation methods with diﬀerent step sizes for each extrapolation: - cyclic Richardson iterations (Opfer and Schober, 1984): methods whose update is composed of successive gradient steps with possibly diﬀerent step sizes for each and any combination of these with at most k composed gradient…”