The elaborate details of the schemes (REF ,REF ) can
be found in [1]}. The computed solution of
MWENO-P is compared with WENO-JS, WENO-Z, WENO-NS and WENO-P schemes.
All the numerical results are obtained on machine having an Intel(R)
core (TM) i\(7-4700\) MQ processor with 8 GB of memory. In order
to ensure fairness in the comparison, all the schemes shared the same
subroutine calls and were compiled with the same compilation options.
The only differences between the implementation of the WENO schemes
were on the subroutines for computing the corresponding weights. In
order to compare with the classical scheme, WENO-JS, we took \(\epsilon =10^{-6}\) 
and \(\epsilon =10^{-40}\)  for WENO-Z, WENO-NS, WENO-P and MWENO-P schemes
in all the following test cases. To prove the effectiveness of the
scheme we considered various examples. For convergence analysis we
first evaluated examples of scalar equation and later we have presented
results for Euler equations.
