In this paper, a numerical Laplace transform algorithm which is based on the decomposition method is introduced for the approximate solution of a class of nonlinear differential equations. The technique is described and illustrated with some numerical examples. The results assert that this scheme is rapidly convergent and quite accurate by which it approximates the solution using only few terms of its iterative scheme.

We consider a generalized version of the standard checkerboard and discuss the difficulties of finding the corresponding field by standard numerical treatment. A new numerical method is presented which converges independently of the local conductivities.

There are well-known constructions of integrable systems that are chains of infinitely many copies of the equations of the KP hierarchy “glued” together with some additional variables, for example, the modified KP hierarchy. Another interpretation of the latter, in terms of infinite matrices, is called the $1$-Toda lattice hierarchy. One way infinite reduction of this hierarchy has all the solutions in the form of sequences of expanding Wronskians. We define another chain of the KP equations, also with solutions of the Wronsksian type, that is characterized by the property to stabilize with respect to a gradation. Under some constraints imposed, the tau functions of the chain are the tau functions associated with the Kontsevich integrals.