Binary weighted essentially non-oscillatory (BWENO) approximation

Citations of this article
Mendeley users who have this article in their library.


Weighted essentially non-oscillatory (WENO) schemes have been mainly used for solving hyperbolic partial differential equations (PDEs). Such schemes are capable of high order approximation in smooth regions and non-oscillatory sharp resolution of discontinuities. The base of the WENO schemes is a non-oscillatory WENO approximation procedure, which is not necessarily related to PDEs. The typical WENO procedures are WENO interpolation and WENO reconstruction. The WENO algorithm has gained much popularity but the basic idea of approximation did not change much over the years. In this paper, we first briefly review the idea of WENO interpolation and propose a modification of the basic algorithm. New approximation should improve basic characteristics of the approximation and provide a more flexible framework for future applications. New WENO procedure involves a binary tree weighted construction that is based on key ideas of WENO algorithm and we refer to it as the binary weighted essentially non-oscillatory (BWENO) approximation. New algorithm comes in a rational and a polynomial version. Furthermore, we describe the WENO reconstruction procedure, which is usually involved in the numerical schemes for hyperbolic PDEs, and propose the new reconstruction procedure based on the described BWENO interpolation. The obtained numerical results show that the newly proposed procedures perform very well on the considered test examples. © 2011 Elsevier B.V. All rights reserved.




Crnković, B., & Çrnjarić-Žic, N. (2012). Binary weighted essentially non-oscillatory (BWENO) approximation. Journal of Computational and Applied Mathematics, 236(9), 2431–2451.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free