Efficient Entropy Stable Gauss Collocation Methods

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stable and Convergent Unsymmetric Meshless Collocation Methods

In the theoretical part of this paper, we introduce a simplified proof technique for error bounds and convergence of a variation of E. Kansa’s well-known unsymmetric meshless collocation method. For a numerical implementation of the convergent variation, a previously proposed greedy technique is coupled with linear optimization. This algorithm allows a fully adaptive on-the-fly data-dependent m...

متن کامل

Collocation methods: More efficient procedures for applying collocation

In recent years, new and more effective procedures for applying collocation have been published. This article is devoted to present a revision of this subject and complement its developments. From the general theory two broad approaches are derived, which yield the direct and the indirect TH-collocation methods. The former approach had not been published before, and it is a dual of the indirect...

متن کامل

Efficient Embedded Formula for Chebyshev Collocation Methods

In this talk, we are concerned with embedded formulae of the Chebyshev collocation methods [1] developed recently. We introduce two Chebyshev collocation methods based on generalized Chebyshev interpolation polynomials [2], which are used to make an automatic integration method. We apply an elegant algorithm of generalized Chebyshev interpolation increasing the node points to make an error esti...

متن کامل

Aggregation methods for efficient collocation detection

In this article we propose a rank aggregation method for the task of collocations detection. It consists of applying some well-known methods (e.g. Dice method, chi-square test, z-test and likelihood ratio) and then aggregating the resulting collocations rankings by rank distance and Borda score. These two aggregation methods are especially well suited for the task, since the results of each ind...

متن کامل

An Efficient Numerical Method for a Class of Boundary Value Problems, Based on Shifted Jacobi-Gauss Collocation Scheme

We present a numerical method for a class of boundary value problems on the unit interval which feature a type of exponential and product nonlinearities. Also, we consider singular case. We construct a kind of spectral collocation method based on shifted Jacobi polynomials to implement this method. A number of specific numerical examples demonstrate the accuracy and the efficiency of the propos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Scientific Computing

سال: 2019

ISSN: 1064-8275,1095-7197

DOI: 10.1137/18m1209234