2000 character limit reached
A new reduced order model of imcompressible Stokes equations
Published 27 Sep 2022 in math.NA and cs.NA | (2209.13709v1)
Abstract: In this paper we propose a new reduced order model (ROM) to the imcompressible Stokes equations. Numerical experiments show that our ROM is accurate and efficient. Under some assumptions on the problem data, we prove that the convergence rates of the new ROM is the same with standard solvers.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.