ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

Addressing the curse of dimensionality in SSFEM using the dependence of eigenvalues in KL expansion on domain size

Pranesh, Srikara and Ghosh, Debraj (2016) Addressing the curse of dimensionality in SSFEM using the dependence of eigenvalues in KL expansion on domain size. In: COMPUTER METHODS IN APPLIED MECHANICS AND ENGINEERING, 311 . pp. 457-475.

[img] PDF
Com_Met_App_Mec_Eng_311_457_2016.pdf - Published Version
Restricted to Registered users only

Download (509kB) | Request a copy
Official URL: http://dx.doi.org/10.1016/j.cma.2016.08.023


This work is aimed at reducing the dimensionality in the spectral stochastic finite element method (SSFEM) - thus the computational cost - through a domain decomposition (DD) method. This reduction hinges on some new mathematical results on domain size dependence of the Karhunen-Loeve (KL) expansion. It has been reported in the literature that for few covariance kernels a lower domain size leads to a faster convergence of the KL eigenvalues. This observation leads to an early truncation of the KL expansion, and this reduction in stochastic dimensionality brings down the total computational cost. In this work first we mathematically show the generalization of this faster convergence, that is, for any arbitrary covariance kernel. This is achieved via developing a bound on eigenvalues as a function of the domain size. Then we prove that for a chosen number of terms in the KL expansion with any kernel for a one-dimensional process, the approximation error in the trace norm reduces with the domain size. Based on this domain size dependence, we propose an algorithm for solving a stochastic elliptic equation in a DD framework. The computational cost gain is demonstrated by a numerical study and is observed that the serial implementation of the proposed algorithm is about an order of magnitude faster compared to the existing method. The cost saving increases with the stochastic dimensionality in the global domain. The structure of this algorithm provides scope for parallelization, which would help in efficiently solving large scale problems. The sharpness of the proposed eigenvalue bounds is also tested for Gaussian and exponential kernels. The generalization opens avenues for developing further DD based SSFEM solvers. (C) 2016 Elsevier B.V. All rights reserved.

Item Type: Journal Article
Additional Information: Copy right for this article belongs to the ELSEVIER SCIENCE SA, PO BOX 564, 1001 LAUSANNE, SWITZERLAND
Department/Centre: Division of Mechanical Sciences > Civil Engineering
Depositing User: Id for Latest eprints
Date Deposited: 07 Dec 2016 05:52
Last Modified: 07 Dec 2016 05:52
URI: http://eprints.iisc.ac.in/id/eprint/55540

Actions (login required)

View Item View Item