Preprint

Asymptotic convergence of spectral inverse iterations for stochastic eigenvalue problems

Authors:
Preprints and early-stage research may not have been peer reviewed yet.
To read the file of this research, you can request a copy directly from the authors.

Abstract

We consider and analyze applying a spectral inverse iteration algorithm and its subspace iteration variant for computing eigenpairs of an elliptic operator with random coefficients. With these iterative algorithms the solution is sought from a finite dimensional space formed as the tensor product of the approximation space for the underlying stochastic function space, and the approximation space for the underlying spatial function space. Sparse polynomial approximation is employed to obtain the first one, while classical finite elements are employed to obtain the latter. An error analysis is presented for the asymptotic convergence of the spectral inverse iteration to the smallest eigenvalue and the associated eigenvector of the problem. A series of detailed numerical experiments supports the conclusions of this analysis. Numerical experiments are also presented for the spectral subspace iteration, and convergence of the algorithm is observed in an example case, where the eigenvalues cross within the parameter space. The outputs of both algorithms are verified by comparing to solutions obtained by a sparse stochastic collocation method.

No file available

Request Full-text Paper PDF

To read the file of this research,
you can request a copy directly from the authors.

ResearchGate has not been able to resolve any citations for this publication.
Article
Full-text available
We study random eigenvalue problems in the context of spectral stochastic finite elements. In particular, given a parameter-dependent, symmetric positive-definite matrix operator, we explore the performance of algorithms for computing its eigenvalues and eigenvectors represented using polynomial chaos expansions. We formulate a version of stochastic inverse subspace iteration, which is based on the stochastic Galerkin finite element method, and we compare its accuracy with that of Monte Carlo and stochastic collocation methods. The coefficients of the eigenvalue expansions are computed from a stochastic Rayleigh quotient. Our approach allows the computation of interior eigenvalues by deflation methods, and we can also compute the coefficients of multiple eigenvectors using a stochastic variant of the modified Gram-Schmidt process. The effectiveness of the methods is illustrated by numerical experiments on benchmark problems arising from vibration analysis.
Article
Full-text available
We present an explicit formula for angles between two subspaces of inner product spaces. Our formula serves as a correction for, as well as an extension of, the formula proposed by Risteski and Trenčevski [13]. As a consequence of our formula, a generalized Cauchy-Schwarz inequality is obtained.
Article
Full-text available
The basic random variables on which random uncertainties can in a given model depend can be viewed as defining a measure space with respect to which the solution to the mathematical problem can be defined. This measure space is defined on a product measure associated with the collection of basic random variables. This paper clarifies the mathematical structure of this space and its relationship to the underlying spaces associated with each of the random variables. Cases of both dependent and independent basic random variables are addressed. Bases on the product space are developed that can be viewed as generalizations of the standard polynomial chaos approximation. Moreover, two numerical constructions of approximations in this space are presented along with the associated convergence analysis.
Article
Full-text available
We propose and analyze sparse deterministic-stochastic tensor Galerkin finite element methods (sparse sGFEMs) for the numerical solution of elliptic partial differential equations (PDEs) with random coefficients in a physical domain DRdD\subset\mathbb{R}^d. In tensor product sGFEMs, the variational solution to the boundary value problem is approximated in tensor product finite element spaces VΓVDV^\Gamma\otimes V^D, where VΓV^\Gamma and VDV^D denote suitable finite dimensional subspaces of the stochastic and deterministic function spaces, respectively. These approaches lead to sGFEM algorithms of complexity O(NΓND)O(N_\Gamma N_D), where NΓ=dimVΓN_\Gamma=\dim V^\Gamma and ND=dimVDN_D=\dim V^D. In this work, we use hierarchic sequences V1ΓV2ΓV^\Gamma_1\subset V^\Gamma_2\subset\ldots and V1DV2DV^D_1\subset V^D_2\subset\ldots of finite dimensional spaces to approximate the law of the random solution. The hierarchies of approximation spaces allow us to define sparse tensor product spaces VΓ^VDV^\Gamma_\ell\hat{\otimes}V^D_\ell, =1,2,\ell=1,2,\dots, yielding algorithms of O(NΓlogND+NDlogNΓ)O(N_\Gamma\log N_D+N_D\log N_\Gamma) work and memory. We estimate the convergence rate of sGFEM for algebraic decay of the input random field Karhunen-Loève coefficients. We give an algorithm for an input adapted a-priori selection of deterministic and stochastic discretization spaces. The convergence rate in terms of the total number of degrees of freedom of the proposed method is superior to Monte Carlo approximations. Numerical examples illustrate the theoretical results and demonstrate superiority of the sparse tensor product discretization proposed here versus the full tensor product approach.
Article
Full-text available
We present a new method for solving stochastic differential equations based on Galerkin projections and extensions of Wiener's polynomial chaos. Specifically, we represent the stochastic processes with an optimum trial basis from the Askey family of orthogonal polynomials that reduces the dimensionality of the system and leads to exponential convergence of the error. Several continuous and discrete processes are treated, and numerical examples show substantial speed-up compared to Monte Carlo simulations for low dimensional stochastic inputs.
Article
Full-text available
Let tA(t)t\mapsto A(t) for tTt\in T be a CMC^M-mapping with values unbounded operators with compact resolvents and common domain of definition which are self-adjoint or normal. Here CMC^M stands for C^\om (real analytic), a quasianalytic or non-quasianalytic Denjoy-Carleman class, CC^\infty, or a H\"older continuity class C^{0,\al}. The parameter domain T is either R\mathbb R or Rn\mathbb R^n or an infinite dimensional convenient vector space. We prove and review results on CMC^M-dependence on t of the eigenvalues and eigenvectors of A(t).
Book
Problems linking the shape of a domain or the coefficients of an elliptic operator to the sequence of its eigenvalues are among the most fascinating of mathematical analysis. In this book, we focus on extremal problems. For instance, we look for a domain which minimizes or maximizes a given eigenvalue of the Laplace operator with various boundary conditions and various geometric constraints. We also consider the case of functions of eigenvalues. We investigate similar questions for other elliptic operators, such as the Schrödinger operator, non homogeneous membranes, or the bi-Laplacian, and we look at optimal composites and optimal insulation problems in terms of eigenvalues. Providing also a self-contained presentation of classical isoperimetric inequalities for eigenvalues and 30 open problems, this book will be useful for pure and applied mathematicians, particularly those interested in partial differential equations, the calculus of variations, differential geometry, or spectral theory.
Article
We consider the discretization and solution of eigenvalue problems of elliptic operators with random coefficients. For solving the resulting systems of equations we present a new and efficient spectral inverse iteration based on the stochastic Galerkin approach with respect to a polynomial chaos basis. The curse of dimensionality inherent in normalization over parameter spaces is avoided by a solution of a non-linear system of equations defining the Galerkin coefficients. For reference we also present an algorithm for adaptive stochastic collocation. Functionality of the algorithms is demonstrated by applying them on four examples of a given model problem. Convergence of the Galerkin-based method is analyzed and the results are tested against the collocated reference solutions and theoretical predictions.
Article
We design and analyze algorithms for the efficient sensitivity computa-tion of eigenpairs of parametric elliptic self-adjoint eigenvalue problems on high-dimensional parameter spaces. We quantify the analytic dependence of eigenpairs on the parameters. For the efficient approximate evaluation of parameter sensitivities of isolated eigenpairs on the entire parameter space we propose and analyze a sparse tensor spectral collocation method on an anisotropic sparse grid in the parameter domain. The stable numerical implementation of these methods is discussed and their error analysis is given. Applications to parametric elliptic eigenvalue problems with infinitely many parameters arising from elliptic differential operators with random coefficients are presented.
Article
Two computationally efficient algorithms are developed for solving the stochastic eigenvalue problem. An algorithm based on the power iteration technique is proposed for the calculation of the dominant eigenpairs. This algorithm is then extended to find other subdominant random eigenpairs. The uncertainty in the operator is represented by a polynomial chaos expansion, and a similar representation is considered for the random eigenvalues and eigenvectors. The algorithms are distinguished due to their speed in converging to the true random eigenpairs and their ability to estimate a prescribed number of subdominant eigenpairs. The algorithms are demonstrated on two examples with close agreement observed with the exact solution and a solution synthesized through MonteCarlo sampling.
Article
We discuss the finite element approximation of eigenvalue problems associated with compact operators. While the main emphasis is on symmetric problems some comments are present for non-self-adjoint operators as well. The topics covered include standard Galerkin approximations, non-conforming approximations, and approximation of eigenvalue problems in mixed form Some applications of the theory are presented and, in particular, the approximation of the Maxwell eigenvalue problem is discussed in detail. The final part tries to introduce the reader to the fascinating setting of differential forms and homological techniques with the description of the Hodge-Laplace eigenvalue problem and its mixed equivalent formulations. Several examples and numerical computations complete the paper, ranging from very basic exercises to more significant applications of the developed theory.
Article
A new algorithm for the computation of the spectral expansion of the eigenvalues and eigenvectors of a random non-symmetric matrix is proposed. The algorithm extends the deterministic inverse power method using a spectral discretization approach. The convergence and accuracy of the algorithm is studied for both symmetric and non-symmetric matrices. The method turns out to be efficient and robust compared to existing methods for the computation of the spectral expansion of random eigenvalues and eigenvectors. Copyright © 2006 John Wiley & Sons, Ltd.
Article
We describe the analysis and the implementation of two finite element (FE) algorithms for the deterministic numerical solution of elliptic boundary value problems with stochastic coefficients.They are based on separation of deterministic and stochastic parts of the input data by a Karhunen–Loève expansion, truncated after M terms. With a change of measure we convert the problem to a sequence of M-dimensional, parametric deterministic problems. Two sparse, high order polynomial approximations of the random solution’s joint pdf’s, parametrized in the input data’s Karhunen–Loève expansion coordinates, are analyzed: a sparse stochastic Galerkin FEM (sparse sGFEM) and a sparse stochastic Collocation FEM (sparse sCFEM).A priori and a posteriori error analysis is used to tailor the sparse polynomial approximations of the random solution’s joint pdf’s to the stochastic regularity of the input data. sCFEM and sGFEM yield deterministic approximations of the random solutions joint pdf’s that converge spectrally in the number of deterministic problems to be solved. Numerical examples with random inputs of small correlation length in diffusion problems are presented. High order gPC approximations of solutions with stochastic parameter spaces of dimension up to M=80 are computed on workstations.
Article
This work presents a stochastic collocation method for solving elliptic PDEs with random coefficients and forcing term which are assumed to depend on a finite number of random variables. The method consists of a hierarchic wavelet discretization in space and a sequence of hierarchic collocation operators in the probability domain to approximate the solution's statistics. The selection of collocation points is based on a Smolyak construction of zeros of orthogonal polynomials with respect to the probability density function of each random input variable. A sparse composition of levels of spatial refinements and stochastic collocation points is then proposed and analyzed, resulting in a substantial reduction of overall degrees of freedom. Like in the Monte Carlo approach, the algorithm results in solving a number of uncoupled, purely deterministic elliptic problems, which allows the integration of existing fast solvers for elliptic PDEs. Numerical examples on two-dimensional domains will then demonstrate the superiority of this sparse composite collocation finite element method compared to the "full composite" collocation finite element method and the Monte Carlo method.
Article
Deterministic models of fluid flow and the transport of chemicals in flows in heterogeneous porous media incorporate partial differential equations (PDEs) whose material parameters are assumed to be known exactly. To tackle more realistic stochastic flow problems, it is fitting to represent the permeability coefficients as random fields with prescribed statistics. Traditionally, large numbers of deterministic problems are solved in a Monte Carlo framework and the solutions are averaged to obtain statistical properties of the solution variables. Alternatively, so-called stochastic finite-element methods (SFEMs) discretize the probabilistic dimension of the PDE directly leading to a single structured linear system. The latter approach is becoming extremely popular but its computational cost is still perceived to be problematic as this system is orders of magnitude larger than for the corresponding deterministic problem. A simple block-diagonal preconditioning strategy incorporating only the mean component of the random field coefficient and based on incomplete factorizations has been employed in the literature and observed to be robust, for problems of moderate variance, but without theoretical analysis. We solve the stochastic Darcy flow problem in primal formulation via the spectral SFEM and focus on its efficient iterative solution. To achieve optimal computational complexity, we base our block-diagonal preconditioner on algebraic multigrid. In addition, we provide new theoretical eigenvalue bounds for the preconditioned system matrix. By highlighting the dependence of these bounds on all the SFEM parameters, we illustrate, in particular, why enriching the stochastic approximation space leads to indefinite system matrices when unbounded random variables are employed.