Corpus ID: 237941012

Compound Krylov subspace methods for parametric linear systems

  title={Compound Krylov subspace methods for parametric linear systems},
  author={Antti Autio and Antti Hannukainen},
In this work, we propose a reduced basis method for efficient solution of parametric linear systems. The coefficient matrix is assumed to be a linear matrix-valued function that is symmetric and positive definite for admissible values of the parameter σ ∈ Rs. We propose a solution strategy where one first computes a basis for the appropriate compound Krylov subspace and then uses this basis to compute a subspace solution for multiple σ. Three kinds of compound Krylov subspaces are discussed… Expand

Figures and Tables from this paper


Parametric PDEs: sparse or low-rank approximations?
We consider a class of parametric operator equations where the involved parameters could either be of deterministic or stochastic nature. In both cases we focus on scenarios involving a large numberExpand
Sparse tensor discretizations of high-dimensional parametric and stochastic PDEs*
Partial differential equations with random input data, such as random loadings and coefficients, are reformulated as parametric, deterministic PDEs on parameter spaces of high, possibly infinite dimension to derive representation of the random solutions' laws on infinite-dimensional parameter spaces in terms of ‘generalized polynomial chaos’ (GPC) series. Expand
Methods of conjugate gradients for solving linear systems
An iterative algorithm is given for solving a system Ax=k of n linear equations in n unknowns. The solution is given in n steps. It is shown that this method is a special case of a very generalExpand
A Stochastic Collocation Method for Elliptic Partial Differential Equations with Random Input Data
A rigorous convergence analysis is provided and exponential convergence of the “probability error” with respect to the number of Gauss points in each direction in the probability space is demonstrated, under some regularity assumptions on the random input data. Expand
Galerkin Finite Element Approximations of Stochastic Elliptic Partial Differential Equations
A priori error estimates for the computation of the expected value of the solution are given and a comparison of the computational work required by each numerical approximation is included to suggest intuitive conditions for an optimal selection of the numerical approximation. Expand
Reduced Basis Methods for Partial Differential Equations: An Introduction
1 Introduction.- 2 Representative problems: analysis and (high-fidelity) approximation.- 3 Getting parameters into play.- 4 RB method: basic principle, basic properties.- 5 Construction of reducedExpand
The convergence and eciency of the reduced basis method used for the approximation of the solutions to a class of problems written as a parametrized PDE depends heavily on the choice of the elementsExpand
Reduced Basis Methods for Partial Differential Equations : Evaluation of multiple non-compliant flux-type output functionals for a non-affine electrostatics problem
A method for rapid evaluation of flux-type outputs of interest from solutions to partial differential equations (PDEs) is presented within the reduced basis framework for linear, elliptic PDEs. TheExpand
The Mathematical Theory of Finite Element Methods
Contents: Basic Concepts.- Sobolev Spaces.- Variational Formulation of Elliptic Boundary Value Problems.- The Construction of a Finite Element Space.- Polynomial Approximation Theory in SobolevExpand
Kolmogorov widths and low-rank approximations of parametric elliptic PDEs
In certain relevant instances where the diffusion coefficients are piecewise constant over a partition of the physical domain, the n-widths exhibit significantly faster decay, which yields a theoretical justification of the fast convergence of reduced basis or POD methods when treating such parametric PDEs. Expand