اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAnalysis of some projection method based preconditioners for models of incompressible flow
88
0
0.0
(
0
)
تأليف
Mingchao Cai
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this paper, several projection method based preconditioners for various incompressible flow models are studied. In particular, we are interested in the theoretical analysis of a pressure-correction projection method based preconditioner cite{griffith2009accurate}. For both the steady and unsteady Stokes problems, we will show that the preconditioned systems are well conditioned. Moreover, when the flow model degenerates to the mixed form of an elliptic operator, the preconditioned system is an identity no matter what type of boundary conditions are imposed; when the flow model degenerates to the steady Stokes problem, the multiplicities of the non-unitary eigenvalues of the preconditioned system are derived. These results demonstrate the effects of boundary treatments and are related to the stability of the staggered grid discretization. To further investigate the effectiveness of these projection method based preconditioners, numerical experiments are given to compare their performances. Generalizations of these preconditioners to other saddle point problems will also be discussed.
قيم البحث
اقرأ أيضاً
The Kolmogorov $n$-width of the solution manifolds of transport-dominated problems can decay slowly. As a result, it can be challenging to design efficient and accurate reduced order models (ROMs) for such problems. To address this issue, we propose
a new learning-based projection method to construct nonlinear adaptive ROMs for transport problems. The construction follows the offline-online decomposition. In the offline stage, we train a neural network to construct adaptive reduced basis dependent on time and model parameters. In the online stage, we project the solution to the learned reduced manifold. Inheriting the merits from both deep learning and the projection method, the proposed method is more efficient than the conventional linear projection-based methods, and may reduce the generalization error of a solely learning-based ROM. Unlike some learning-based projection methods, the proposed method does not need to take derivatives of the neural network in the online stage.
We propose and study an iterative substructuring method for an h-p Nitsche-type discretization, following the original approach introduced in [Bramble, Pasciack, Schatz (Math Comp. 1986)] for conforming methods. We prove quasi-optimality with respect
to the mesh size and the polynomial degree for the proposed preconditioner. Numerical experiments asses the performance of the preconditioner and verify the theory.
A novel semi-Lagrangian method is introduced to solve numerically the Euler equation for ideal incompressible flow in arbitrary space dimension. It exploits the time-analyticity of fluid particle trajectories and requires, in principle, only limited
spatial smoothness of the initial data. Efficient generation of high-order time-Taylor coefficients is made possible by a recurrence relation that follows from the Cauchy invariants formulation of the Euler equation (Zheligovsky & Frisch, J. Fluid Mech. 2014, 749, 404-430). Truncated time-Taylor series of very high order allow the use of time steps vastly exceeding the Courant-Friedrichs-Lewy limit, without compromising the accuracy of the solution. Tests performed on the two-dimensional Euler equation indicate that the Cauchy-Lagrangian method is more - and occasionally much more - efficient and less prone to instability than Eulerian Runge-Kutta methods, and less prone to rapid growth of rounding errors than the high-order Eulerian time-Taylor algorithm. We also develop tools of analysis adapted to the Cauchy-Lagrangian method, such as the monitoring of the radius of convergence of the time-Taylor series. Certain other fluid equations can be handled similarly.
Finite element methods for symmetric linear hyperbolic systems using unstructured advancing fronts (satisfying a causality condition) are considered in this work. Convergence results and error bounds are obtained for mapped tent pitching schemes made
with standard discontinuous Galerkin discretizations for spatial approximation on mapped tents. Techniques to study semidiscretization on mapped tents, design fully discrete schemes, prove local error bounds, prove stability on spacetime fronts, and bound error propagated through unstructured layers are developed.
The Sinc-Nystr{o}m method in time is a high-order spectral method for solving evolutionary differential equations and it has wide applications in scientific computation. But in this method we have to solve all the time steps implicitly at one-shot, w
hich may results in a large-scale nonsymmetric dense system that is expensive to solve. In this paper, we propose and analyze a parallel-in-time (PinT) preconditioner for solving such Sinc-Nystr{o}m systems, where both the parabolic and hyperbolic PDEs are investigated. Attributed to the special Toeplitz-like structure of the Sinc-Nystr{o}m systems, the proposed PinT preconditioner is indeed a low-rank perturbation of the system matrix and we show that the spectrum of the preconditioned system is highly clustered around one, especially when the time step size is refined. Such a clustered spectrum distribution matches very well with the numerically observed mesh-independent GMRES convergence rates in various examples. Several linear and nonlinear ODE and PDE examples are presented to illustrate the convergence performance of our proposed PinT preconditioners, where the achieved exponential order of accuracy are especially attractive to those applications in need of high accuracy.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
