ترغب بنشر مسار تعليمي؟ اضغط هنا

Parallel-in-time preconditioners for the Sinc-Nystr{o}m method

236   0   0.0 ( 0 )
 نشر من قبل Jun Liu
 تاريخ النشر 2021
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

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, which 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.



قيم البحث

اقرأ أيضاً

265 - Tomoaki Okayama 2013
A Sinc-collocation method has been proposed by Stenger, and he also gave theoretical analysis of the method in the case of a `scalar equation. This paper extends the theoretical results to the case of a `system of equations. Furthermore, this paper p roposes more efficient method by replacing the variable transformation employed in Stengers method. The efficiency is confirmed by both of theoretical analysis and numerical experiments. In addition to the existing and newly-proposed Sinc-collocation methods, this paper also gives similar theoretical results for Sinc-Nystr{o}m methods proposed by Nurmuhammad et al. From a viewpoint of the computational cost, it turns out that the newly-proposed Sinc-collocation method is the most efficient among those methods.
We consider the numerical algorithm for the two-dimensional time-harmonic elastic wave scattering by unbounded rough surfaces with Dirichlet boundary condition. A Nystr{o}m method is proposed for the scattering problem based on the integral equation method. Convergence of the Nystr{o}m method is established with convergence rate depending on the smoothness of the rough surfaces. In doing so, a crucial role is played by analyzing the singularities of the kernels of the relevant boundary integral operators. Numerical experiments are presented to demonstrate the effectiveness of the method.
In this paper we study the linear systems arising from discretized poroelasticity problems. We formulate one block preconditioner for the two-filed Biot model and several preconditioners for the classical three-filed Biot model under the unified rela tionship framework between well-posedness and preconditioners. By the unified theory, we show all the considered preconditioners are uniformly optimal with respect to material and discretization parameters. Numerical tests demonstrate the robustness of these preconditioners.
250 - Tomoaki Okayama 2013
A Sinc-Nystrom method for Volterra integro-differential equations was developed by Zarebnia in 2010. The method is quite efficient in the sense that exponential convergence can be obtained even if the given problem has endpoint singularity. However, its exponential convergence has not been proved theoretically. In addition, to implement the method, the regularity of the solution is required, although the solution is an unknown function in practice. This paper reinforces the method by presenting two theoretical results: 1) the regularity of the solution is analyzed, and 2) its convergence rate is rigorously analyzed. Moreover, this paper improves the method so that a much higher convergence rate can be attained, and theoretical results similar to those listed above are provided. Numerical comparisons are also provided.
166 - Tomoaki Okayama 2013
The Sinc quadrature and the Sinc indefinite integration are approximation formulas for definite integration and indefinite integration, respectively, which can be applied on any interval by using an appropriate variable transformation. Their converge nce rates have been analyzed for typical cases including finite, semi-infinite, and infinite intervals. In addition, for verified automatic integration, more explicit error bounds that are computable have been recently given on a finite interval. In this paper, such explicit error bounds are given in the remaining cases on semi-infinite and infinite intervals.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا