A low-rank solver for the stochastic unsteady Navier-Stokes problem

From MaRDI portal
Publication:2180469

DOI10.1016/J.CMA.2020.112948zbMATH Open1442.76065arXiv1906.06785OpenAlexW3009271674MaRDI QIDQ2180469FDOQ2180469


Authors: Howard C. Elman, Tengfei Su Edit this on Wikidata


Publication date: 14 May 2020

Published in: Computer Methods in Applied Mechanics and Engineering (Search for Journal in Brave)

Abstract: We study a low-rank iterative solver for the unsteady Navier-Stokes equations for incompressible flows with a stochastic viscosity. The equations are discretized using the stochastic Galerkin method, and we consider an all-at-once formulation where the algebraic systems at all the time steps are collected and solved simultaneously. The problem is linearized with Picard's method. To efficiently solve the linear systems at each step, we use low-rank tensor representations within the Krylov subspace method, which leads to significant reductions in storage requirements and computational costs. Combined with effective mean-based preconditioners and the idea of inexact solve, we show that only a small number of linear iterations are needed at each Picard step. The proposed algorithm is tested with a model of flow in a two-dimensional symmetric step domain with different settings to demonstrate the computational efficiency.


Full work available at URL: https://arxiv.org/abs/1906.06785




Recommendations




Cites Work


Cited In (7)

Uses Software





This page was built for publication: A low-rank solver for the stochastic unsteady Navier-Stokes problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2180469)