SearcharxivSearch

arXiv subjects

Yulan Ning

Publications and source records attributed to Yulan Ning.

2 recordsLinked to original sources

An efficient solver based on low-rank approximation and Neumann matrix series for unsteady diffusion-type partial differential equations with random coefficients

In this paper, we develop an efficient numerical solver for unsteady diffusion-type partial differential equations with random coefficients. A major computational challenge in such problems lies in repeatedly handling large-scale linear systems arising from spatial and temporal discretizations under uncertainty. To address this issue, we propose a novel generalized low-rank matrix approximation to represent the stochastic stiffness matrices, and approximate their inverses using the Neumann matrix series expansion. This approach transforms high-dimensional matrix inversion into a sequence of low-dimensional matrix multiplications. Therefore, the solver significantly reduces the computational cost and storage requirements while maintaining high numerical accuracy. The error analysis of the proposed solver is also provided. Finally, we apply the method to two classic uncertainty quantification problems: unsteady stochastic diffusion equations and the associated distributed optimal control problems. Numerical results demonstrate the feasibility and effectiveness of the proposed solver.

math.NA

A low-rank solver for the Stokes-Darcy model with random hydraulic conductivity and Beavers-Joseph condition

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.

math.NA