Global error estimation based on the tolerance proportionality for some adaptive Runge–Kutta codes

Modern codes for the numerical solution of Initial Value Problems (IVPs) in ODEs are based in adaptive methods that, for a user supplied tolerance δ$\delta$, attempt to advance the integration selecting the size of each step so that some measure of the local error is ?δ$?\delta$. Although this policy does not ensure that the global errors are under the prescribed tolerance, after the early studies of Stetter [Considerations concerning a theory for ODE-solvers, in: R. Burlisch, R.D. Grigorieff, J. Schröder (Eds.), Numerical Treatment of Differential Equations, Proceedings of Oberwolfach, 1976, Lecture Notes in Mathematics, vol. 631, Springer, Berlin, 1978, pp. 188–200; Tolerance proportionality in ODE codes, in: R. März (Ed.), Proceedings of the Second Conference on Numerical Treatment of Ordinary Differential Equations, Humbold University, Berlin, 1980, pp. 109–123] and the extensions of Higham [Global error versus tolerance for explicit Runge–Kutta methods, IMA J. Numer. Anal. 11 (1991) 457–480; The tolerance proportionality of adaptive ODE solvers, J. Comput. Appl. Math. 45 (1993) 227–236; The reliability of standard local error control algorithms for initial value ordinary differential equations, in: Proceedings: The Quality of Numerical Software: Assessment and Enhancement, IFIP Series, Springer, Berlin, 1997], it has been proved that in many existing explicit Runge–Kutta codes the global errors behave asymptotically as some rational power of δ$\delta$. This step-size policy, for a given IVP, determines at each grid point _tn$t_n$ a new step-size _hn+1=h(_tn;δ)$h_{n+1}=h(t_n;\delta )$ so that h(t;δ)$h(t;\delta )$ is a continuous function of t$t$.     

Generic attacks on the Lai–Massey scheme

In this paper we present generic attacks on the Lai–Massey scheme inspired by Patarin’s attacks on the Feistel scheme. For bijective round functions, the attacking results are better than non-bijective round functions for the 3, 4-round Lai–Massey scheme. Our results show that there are some security differences of these two schemes against known attacks. The generic attacks on the 4-round and 5-round Lai–Massey scheme require more complexity than the 4-round and 5-round Feistel scheme respectively. Through the analysis we believe the Lai–Massey scheme has some advantage than the Feistel scheme within 5 rounds.     

An Oseen scheme for the conduction–convection equations based on a stabilized nonconforming method

An Oseen iterative scheme for the stationary conduction–convection equations based on a stabilized nonconforming finite element method is given. The stability and error estimates are analyzed, which show that the presented method is stable and has good precision. Numerical results are shown to support the developed theory analysis and demonstrate the good effectiveness of the given method.     

Further improvements on the Feng–Rao bound for dual codes

Salazar, Dunn and Graham in [16] presented an improved Feng–Rao bound for the minimum distance of dual codes. In this work we take the improvement a step further. Both the original bound by Salazar et al., as well as our improvement are lifted so that they deal with generalized Hamming weights. We also demonstrate the advantage of working with one-way well-behaving pairs rather than weakly well-behaving or well-behaving pairs.     

Finite difference scheme based on proper orthogonal decomposition for the nonstationary Navier-Stokes equations

The proper orthogonal decomposition(POD)and the singular value decomposition(SVD) are used to study the finite difference scheme(FDS)for the nonstationary Navier-Stokes equations. Ensembles of data are compiled from the transient solutions computed from the discrete equation system derived from the FDS for the nonstationary Navier-Stokes equations.The optimal orthogonal bases are reconstructed by the elements of the ensemble with POD and SVD.Combining the above procedures with a Galerkin projection approach yields a new optimizing FDS model with lower dimensions and a high accuracy for the nonstationary Navier-Stokes equations.The errors between POD approximate solutions and FDS solutions are analyzed.It is shown by considering the results obtained for numerical simulations of cavity flows that the error between POD approximate solution and FDS solution is consistent with theoretical results.Moreover,it is also shown that this validates the feasibility and efficiency of POD method.     

Entropic Burgers’ equation via a minimizing movement scheme based on the Wasserstein metric

As noted by the second author in the context of unstable two-phase porous medium flow, entropy solutions of Burgers’ equation can be recovered from a minimizing movement scheme involving the Wasserstein metric in the limit of vanishing time step size (Otto, Commun Pure Appl Math, 1999). In this paper, we give a simpler proof by verifying that the anti-derivative is a viscosity solution of the associated Hamilton Jacobi equation.     

Wavelet based multiscale scheme for two-dimensional advection–dispersion equation

In this paper, wavelet based adaptive solver is developed for two dimensional advection dominating solute problem which generates sharp concentration front in the solution. In order to handle simultaneously smooth and shock-like behavior, the framework uses finite element discretization followed by wavelets for multiscale decomposition. Daubechies wavelet filter is incorporated to eliminate spurious oscillations at very high Peclet number. The developed solution is compared with the analytical solution to assess the accuracy and robustness. The advantages of the present method over the commonly used methods such as FDM and FEM for solving the problems which show non-physical oscillation in the numerical solution are demonstrated.     

An efficient and secure Diffie–Hellman key agreement protocol based on Chebyshev chaotic map

This paper proposes a new efficient and secure Diffie–Hellman key agreement protocol based on Chebyshev chaotic map. The proposed key agreement protocol uses the semi-group property of Chebyshev polynomials to agree Diffie–Hellman based session key. The proposed protocol provides strong security compared with the previous related protocols. In addition, the proposed protocol does not require any timestamp information and greatly reduces computational costs between communication parties. As a result, the proposed protocol is more practical and provides computational/communicational efficiency compare with several previously proposed key agreement protocols based on Chebyshev chaotic map.     

A new mixed finite element method based on the Crank-Nicolson scheme for Burgers’ equation

In this paper, a new mixed finite element method is used to approximate the solution as well as the flux of the 2D Burgers’ equation. Based on this new formulation, we give the corresponding stable conforming finite element approximation for the P₀² ? P₁ pair by using the Crank-Nicolson time-discretization scheme. Optimal error estimates are obtained. Finally, numerical experiments show the efficiency of the new mixed method and justify the theoretical results.     

A memetic algorithm based on a NSGAII scheme for the flexible job-shop scheduling problem

The Flexible Job-Shop Scheduling Problem is concerned with the determination of a sequence of jobs, consisting of many operations, on different machines, satisfying several parallel goals. We introduce a Memetic Algorithm, based on the NSGAII (Non-Dominated Sorting Genetic Algorithm II) acting on two chromosomes, to solve this problem. The algorithm adds, to the genetic stage, a local search procedure (Simulated Annealing). We have assessed its efficiency by running the algorithm on multiple objective instances of the problem. We draw statistics from those runs, which indicate that this Memetic Algorithm yields good and low-cost solutions.     

Computing the longest common prefix array based on the Burrows–Wheeler transform

Many sequence analysis tasks can be accomplished with a suffix array, and several of them additionally need the longest common prefix array. In large scale applications, suffix arrays are being replaced with full-text indexes that are based on the Burrows–Wheeler transform. In this paper, we present the first algorithm that computes the longest common prefix array directly on the wavelet tree of the Burrows–Wheeler transformed string. It runs in linear time and a practical implementation requires approximately 2.2 bytes per character.     

A conserved phase-field system based on the Maxwell–Cattaneo law

Our aim in this paper is to study a generalization of the conserved Caginalp phase-field system based on the Maxwell–Cattaneo law for heat conduction and endowed with Neumann boundary conditions. In particular, we obtain well-posedness results and study the dissipativity of the associated solution operators.     

Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes

Because of their interesting algebraic properties, several authors promote the use of generalized Reed–Solomon codes in cryptography. Niederreiter was the first to suggest an instantiation of his cryptosystem with them but Sidelnikov and Shestakov showed that this choice is insecure. Wieschebrink proposed a variant of the McEliece cryptosystem which consists in concatenating a few random columns to a generator matrix of a secretly chosen generalized Reed–Solomon code. More recently, new schemes appeared which are the homomorphic encryption scheme proposed by Bogdanov and Lee, and a variation of the McEliece cryptosystem proposed by Baldi et al. which hides the generalized Reed–Solomon code by means of matrices of very low rank. In this work, we show how to mount key-recovery attacks against these public-key encryption schemes. We use the concept of distinguisher which aims at detecting a behavior different from the one that one would expect from a random code. All the distinguishers we have built are based on the notion of component-wise product of codes. It results in a powerful tool that is able to recover the secret structure of codes when they are derived from generalized Reed–Solomon codes. Lastly, we give an alternative to Sidelnikov and Shestakov attack by building a filtration which enables to completely recover the support and the non-zero scalars defining the secret generalized Reed–Solomon code.     

Projective Reed–Muller type codes on rational normal scrolls

In this paper we study an instance of projective Reed–Muller type codes, i.e., codes obtained by the evaluation of homogeneous polynomials of a fixed degree in the points of a projective variety. In our case the variety is an important example of a determinantal variety, namely the projective surface known as rational normal scroll, defined over a finite field, which is the basic underlining algebraic structure of this work. We determine the dimension and a lower bound for the minimum distance of the codes, and in many cases we also find the exact value of the minimum distance. To obtain the results we use some methods from Gröbner bases theory.     

Two-step discretization method for 2D/3D Allen–Cahn equation based on RBF-FD scheme

In this article, a two-step discretization method based on multi-quadrics (MQ) radial basis function (RBF) is presented for solving Allen–Cahn (AC) equation with integer derivative for time and space. In the first step, backward Euler formula with Newton iterative method is used to discrete the time direction of AC equation. And RBF method is applied in space for solving semi-discrete linearized problem on a coarse mesh. In the second step, finite difference (FD) and radial basis function-finite difference (RBF-FD) methods are used to solve the problem on a fine mesh, respectively. Numerical tests for the equation are obtained to verify the feasibility and computational efficiency of the considered process. In addition, the comparison between FD and RBF-FD shows that solutions obtained by RBF-FD are higher accuracy.     

Optimal error estimates of a decoupled scheme based on two-grid finite element for mixed Stokes–Darcy model

Although the numerical results suggest the optimal convergence order of the two-grid finite element decoupled scheme for mixed Stokes–Darcy model with Beavers–Joseph–Saffman interface condition in literatures, the numerical analysis only gets the optimal error order for porous media flow and a non-optimal error order that is half order lower than the optimal one in fluid flow. The purpose of this paper is to fill in the gap between the numerical results and the theoretical analysis.