2007•Unpublished venueRequires access

Numerical study of uncertainty quantification techniques for implicit stiff systems

Haiyan Cheng, Adrian Sandu

Open publisher page 10 citations

Abstract

Galerkin polynomial chaos and collocation methods have been widely adopted for uncertainty quantification purpose. However, when the stiff system is involved, the computational cost can be prohibitive, since stiff numerical integration requires the solution of a nonlinear system of equations at every time step. Applying the Galerkin polynomial chaos to stiff system will cause a computational cost increase from O(n3) to O(S3n3). This paper explores uncertainty quantification techniques for stiff chemical systems using Galerkin polynomial chaos, collocation and collocation least-square approaches. We propose a modification in the implicit time stepping process. The numerical test results show that with the modified approach, the run time of the Galerkin polynomial chaos is reduced. We also explore different methods of choosing collocation points in collocation implementations and propose a collocation least-square approach. We conclude that the collocation least-square for uncertainty quantification is at least as accurate as the Galerkin approach, and is more efficient with a well-chosen set of collocation points.

About this research paper

What this paper is about

Galerkin polynomial chaos and collocation methods have been widely adopted for uncertainty quantification purpose. However, when the stiff system is involved, the computational cost can be prohibitive, since stiff numerical integration requires the solution of a nonlinear system of equations at every time step. Applying the Galerkin polynomial chaos to stiff system will cause a computational cost increase from O(n3) to O(S3n3). This paper explores uncertainty quantification techniques for stiff chemical systems using Galerkin polynomial chaos, collocation and collocation least-square approaches. We propose a modification in the implicit time stepping process. The numerical test results show that with the modified approach, the run time of the Galerkin polynomial chaos is reduced. We also explore different methods of choosing collocation points in collocation implementations and propose a collocation least-square approach. We conclude that the collocation least-square for uncertainty quantification is at least as accurate as the Galerkin approach, and is more efficient with a well-chosen set of collocation points.

Why it matters

OpenAlex reports 10 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Galerkin polynomial chaos and collocation methods have been widely adopted for uncertainty quantification purpose. However, when the stiff system is involved, the computational cost can be prohibitive, since stiff numerical integration requires the solution of a nonlinear system of equations at every time step. Applying the Galerkin polynomial chaos to stiff system will cause a computational cost increase from O(n3) to O(S3n3). This paper explores uncertainty quantification techniques for stiff chemical systems using Galerkin polynomial chaos, collocation and collocation least-square approaches. We propose a modification in the implicit time stepping process. The numerical test results show that with the modified approach, the run time of the Galerkin polynomial chaos is reduced. We also explore different methods of choosing collocation points in collocation implementations and propose a collocation least-square approach. We conclude that the collocation least-square for uncertainty quantification is at least as accurate as the Galerkin approach, and is more efficient with a well-chosen set of collocation points.

Key concepts: Polynomial chaos, Collocation (remote sensing), Galerkin method, Orthogonal collocation, Collocation method, Polynomial, Uncertainty quantification, Applied mathematics

Related papers

Back to paper searchBrowse research topicsOriginal source
Numerical study of uncertainty quantification techniques for implicit stiff systems — Research Paper | ScholarLens