A natural generalization of random choice finite difference scheme of Harten and Lax for Courant number larger than 1 is obtained. We handle interactions between neighboring Riemann solvers by linear superposition of ...A natural generalization of random choice finite difference scheme of Harten and Lax for Courant number larger than 1 is obtained. We handle interactions between neighboring Riemann solvers by linear superposition of their conserved quantities. We show consistency of the scheme for arbitrarily large Courant numbers. For scalar problems the scheme is total variation diminishing.A brief discussion is given for entropy condition.展开更多
The Newcomb-Benford law, which describes the uneven distribution of the frequencies of digits in data sets, is by its nature probabilistic. Therefore, the main goal of this work was to derive formulas for the permissi...The Newcomb-Benford law, which describes the uneven distribution of the frequencies of digits in data sets, is by its nature probabilistic. Therefore, the main goal of this work was to derive formulas for the permissible deviations of the above frequencies (confidence intervals). For this, a previously developed method was used, which represents an alternative to the traditional approach. The alternative formula expressing the Newcomb-Benford law is re-derived. As shown in general form, it is numerically equivalent to the original Benford formula. The obtained formulas for confidence intervals for Benford’s law are shown to be useful for checking arrays of numerical data. Consequences for numeral systems with different bases are analyzed. The alternative expression for the frequencies of digits at the second decimal place is deduced together with the corresponding deviation intervals. In general, in this approach, all the presented results are a consequence of the positionality property of digital systems such as decimal, binary, etc.展开更多
基金The Project Supported by National Natural Science Foundation of China.
文摘A natural generalization of random choice finite difference scheme of Harten and Lax for Courant number larger than 1 is obtained. We handle interactions between neighboring Riemann solvers by linear superposition of their conserved quantities. We show consistency of the scheme for arbitrarily large Courant numbers. For scalar problems the scheme is total variation diminishing.A brief discussion is given for entropy condition.
文摘The Newcomb-Benford law, which describes the uneven distribution of the frequencies of digits in data sets, is by its nature probabilistic. Therefore, the main goal of this work was to derive formulas for the permissible deviations of the above frequencies (confidence intervals). For this, a previously developed method was used, which represents an alternative to the traditional approach. The alternative formula expressing the Newcomb-Benford law is re-derived. As shown in general form, it is numerically equivalent to the original Benford formula. The obtained formulas for confidence intervals for Benford’s law are shown to be useful for checking arrays of numerical data. Consequences for numeral systems with different bases are analyzed. The alternative expression for the frequencies of digits at the second decimal place is deduced together with the corresponding deviation intervals. In general, in this approach, all the presented results are a consequence of the positionality property of digital systems such as decimal, binary, etc.
