In this paper, the Kadomtsev-Petviashvili equation is solved by using the Adomian’s decomposition method , modified Adomian’s decomposition method , variational iteration method , modified variational iteration method, homotopy perturbation method, modified homotopy perturbation method and homotopy analysis method. The existence and uniqueness of the solution and convergence of the proposed...

in recent years, numerous approaches have been applied for finding the solutions of functional equations. one of them is the optimal homotopy asymptotic method. in current paper, this method has been applied for obtaining the approximate solution of fisher equation. the reliability of the method will be shown by solving some examples of various kinds and comparing the obtained outcomes with the ...

The reliability of polyhedral homotopy continuation methods for solving a polynomial system becomes increasingly important as the dimension of the polynomial system increases. High powers of the homotopy continuation parameter t and ill-conditioned Jacobian matrices encountered in tracing of homotopy paths affect the numerical stability. We present modified homotopy functions with a new homotop...

We compare Friedlander’s definition of étale homotopy for simplicial schemes to another definition involving homotopy colimits of pro-simplicial sets. This can be expressed as a notion of hypercover descent for étale homotopy. We use this result to construct a homotopy invariant functor from the category of simplicial presheaves on the étale site of schemes over S to the category of pro-spaces....

We examine the “homotopy coniveau tower” for a general cohomology theory on smooth k-schemes, satisfying some natural axioms, and give a new proof that the layers of this tower for K-theory agree with motivic cohomology. We show how these constructions lead to a tower of functors on the Morel-Voevodsky stable homotopy category, and identify this stable homotopy coniveau tower with Voevodsky’s s...

Probability-one homotopy algorithms have strong convergence characteristics under mild assumptions. Such algorithms for mixed complementarity problems (MCPs) have potentially wide impact because MCPs are pervasive in science and engineering. A probability-one homotopy algorithm for MCPs was developed earlier by Billups and Watson based on the default homotopy mapping. This algorithm had guarant...