Infinite GMRES for parameterized linear systems

by   Elias Jarlebring, et al.

We consider linear parameter-dependent systems A(μ) x(μ) = b for many different μ, where A is large and sparse, and depends nonlinearly on μ. Solving such systems individually for each μ would require great computational effort. In this work we propose to compute a partial parameterization x̃≈ x(μ) where x̃(μ) is cheap to compute for many different μ. Our methods are based on the observation that a companion linearization can be formed where the dependence on μ is only linear. In particular, we develop methods which combine the well-established Krylov subspace method for linear systems, GMRES, with algorithms for nonlinear eigenvalue problems (NEPs) to generate a basis for the Krylov subspace. Within this new approach, the basis matrix is constructed in three different ways. We show convergence factor bounds obtained similarly to those for the method GMRES for linear systems. More specifically, a bound is obtained based on the magnitude of the parameter μ and the spectrum of the linear companion matrix, which corresponds to the reciprocal solutions to the corresponding NEP. Numerical experiments illustrate the competitiveness of our methods for large-scale problems.



There are no comments yet.


page 18


Compound Krylov subspace methods for parametric linear systems

In this work, we propose a reduced basis method for efficient solution o...

Fast Accurate Randomized Algorithms for Linear Systems and Eigenvalue Problems

This paper develops a new class of algorithms for general linear systems...

Preconditioning Kaczmarz method by sketching

We propose a new method for preconditioning Kaczmarz method by sketching...

Matrix functions via linear systems built from continued fractions

A widely used approach to compute the action f(A)v of a matrix function ...

A Theory of Quantum Subspace Diagonalization

Quantum subspace diagonalization methods are an exciting new class of al...

A structure preserving shift-invert infinite Arnoldi algorithm for a class of delay eigenvalue problems with Hamiltonian symmetry

In this work we consider a class of non-linear eigenvalue problems that ...

Using monodromy to statistically estimate the number of solutions

Synthesis problems for linkages in kinematics often yield large structur...
This week in AI

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