<p>This paper proposes, analyzes, and demonstrates an efficient low-rank solver for the stochastic Stokes-Darcy interface model with a random hydraulic conductivity both in the porous media domain and on the interface. We consider three interface conditions with randomness, including the Beavers–Joseph interface condition with the random hydraulic conductivity, on the interface between the free flow and the porous media flow. Our solver employs a novel generalized low-rank approximation of the large-scale stiffness matrices, which can significantly cut down the computational costs and memory requirements associated with matrix inversion without losing accuracy. Therefore, by adopting a suitable data compression ratio, the low-rank solver can maintain a high numerical precision with relatively low computational and space complexities. We also propose a strategy to determine the best choice of data compression ratios. Furthermore, we carry out the error analysis of the generalized low-rank matrix approximation algorithm and the low-rank solver. Finally, numerical experiments are conducted to validate the proposed algorithms and the theoretical conclusions.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

A Low-Rank Solver for the Stokes–Darcy Model with Random Hydraulic Conductivity and Beavers–Joseph Condition

  • Yujun Zhu,
  • Yulan Ning,
  • Zhipeng Yang,
  • Xiaoming He,
  • Ju Ming

摘要

This paper proposes, analyzes, and demonstrates an efficient low-rank solver for the stochastic Stokes-Darcy interface model with a random hydraulic conductivity both in the porous media domain and on the interface. We consider three interface conditions with randomness, including the Beavers–Joseph interface condition with the random hydraulic conductivity, on the interface between the free flow and the porous media flow. Our solver employs a novel generalized low-rank approximation of the large-scale stiffness matrices, which can significantly cut down the computational costs and memory requirements associated with matrix inversion without losing accuracy. Therefore, by adopting a suitable data compression ratio, the low-rank solver can maintain a high numerical precision with relatively low computational and space complexities. We also propose a strategy to determine the best choice of data compression ratios. Furthermore, we carry out the error analysis of the generalized low-rank matrix approximation algorithm and the low-rank solver. Finally, numerical experiments are conducted to validate the proposed algorithms and the theoretical conclusions.