This study aims to formulate a highly accurate numerical method, specifically a seventh-order Hermite technique with an error term of sixth order, to solve the Fisher and Burgers–Fisher equations. This technique employs a combination of orthogonal collocation on the finite element method and hepta Hermite basis functions. By ensuring continuity of the dependent variable and its first three derivatives across the entire solution domain, it achieves a remarkable level of accuracy and smoothness. The space discretization is handled through the application of hepta Hermite polynomials, while the time discretization is managed by the Crank–Nicholson scheme. The stability and convergence analysis of the scheme are discussed in detail. To validate the accuracy of the proposed technique, three examples are taken. The results obtained from these examples are thoroughly analysed and compared against the exact solutions and reliable data from the existing literature. It is established that the proposed technique is easy to implement and gives better results as compared with existing ones.

We are concerned with the micro-macro Parareal algorithm for the simulation of initial-value problems. In this algorithm, a coarse (fast) solver is applied sequentially over the time domain and a fine (time-consuming) solver is applied as a corrector in parallel over smaller chunks of the time interval. Moreover, the coarse solver acts on a reduced state variable, which is coupled with the fine state variable through appropriate coupling operators. We first provide a contribution to the convergence analysis of the micro-macro Parareal method for multiscale linear ordinary differential equations. Then, we extend a variant of the micro-macro Parareal algorithm for scalar stochastic differential equations (SDEs) to higher-dimensional SDEs.

We conduct a theoretical analysis of the performance of $\beta $-encoders. The $\beta $-encoders are A/D (analogue-to-digital) encoders, the design of which is based on the expansion of real numbers with noninteger radix. For the practical use of such encoders, it is important to have theoretical upper bounds of their errors. We investigate the generating function of the Perron–Frobenius operator of the corresponding one-dimensional map and deduce the invariant measure of it. Using this, we derive an approximate value of the upper bound of the mean squared error of the quantization process of such encoders. We also discuss the results from a numerical viewpoint.