Krylov type methods exploiting the quadratic numerical range

by   Andreas Frommer, et al.

The quadratic numerical range W^2(A) is a subset of the standard numerical range of a linear operator which still contains its spectrum. It arises naturally in operators which have a 2 × 2 block structure, and it consists of at most two connected components, none of which necessarily convex. The quadratic numerical range can thus reveal spectral gaps, and it can in particular indicate that the spectrum of an operator is bounded away from 0. We exploit this property in the finite-dimensional setting to derive Krylov subspace type methods to solve the system Ax = b, in which the iterates arise as solutions of low-dimensional models of the operator whose quadratic numerical ranges is contained in W^2(A). This implies that the iterates are always well-defined and that, as opposed to standard FOM, large variations in the approximation quality of consecutive iterates are avoided, although 0 lies within the convex hull of the spectrum. We also consider GMRES variants which are obtained in a similar spirit. We derive theoretical results on basic properties of these methods, review methods on how to compute the required bases in a stable manner and present results of several numerical experiments illustrating improvements over standard FOM and GMRES.



There are no comments yet.


page 1

page 2

page 3

page 4


An octagon containing the numerical range of a bounded linear operator

A polygon is derived that contains the numerical range of a bounded line...

A Gaussian method for the operator square root

We consider the approximation of the inverse square root of regularly ac...

Source Conditions for non-quadratic Tikhonov Regularisation

In this paper we consider convex Tikhonov regularisation for the solutio...

On the spectrum of an operator associated with least-squares finite elements for linear elasticity

In this paper we provide some more details on the numerical analysis and...

Numerical approximation of the spectrum of self-adjoint continuously invertible operators

This paper deals with the generalized spectrum of continuously invertibl...

Vectorized Hankel Lift: A Convex Approach for Blind Super-Resolution of Point Sources

We consider the problem of resolving r point sources from n samples at t...

Minimizing convex quadratic with variable precision Krylov methods

Iterative algorithms for the solution of convex quadratic optimization p...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.