solution of boundary value problems for integro differential equations by using differential transform method in this study we extended the differential transform method dtm to solve the integro differential equations new theorems for the transformation of integrals are introduced and prooved the commonly encountered linear and nonlinear integro differential equations that appear in literature are solved as an illustration for the efficiency of the method some numerical results are also given to demonstrate the superiority of the method to other common techniques the results we obtained by using this technique is much more accurate compared to the existing ones

the existence and uniqueness of solution to wavelet collocation the study of the numerical solutions of pdes with wavelet collocation has yielded a number of substantial results however the existence and uniqueness of solution has not been discussed yet in this paper the existence and uniqueness of solution to wavelet collocation for elliptic equations is established and discussed moreover wavelet collocation is applied to numerical example to examine its appropriateness according to numerical example and analysis it is seen that the existence and uniqueness of solution of this paper is feasible and the new theory is meaningful for developing wavelet collocation

two reliable methods for solving nonlinear evolution equations this paper aims to introduce a comparison of adomian decomposition and wavelet basis method for the numerical solution of nonlinear evolution equations test problems concerning the motion and interaction of solutions are used to compare between the two methods the comparisons shows that the adomian decomposition method in terms of accuracy is efficient and easy to use

a comparison of adomian s decomposition method and wavelet galerkin method for solving integro differential equations this paper aims to introduce a comparison of adomian decomposition method and wavelet galerkin method for the solution of integro differential equations from the computational viewpoint the comparison shows that the adomian decomposition method is efficient and easy to use

comparing numerical methods for helmholtz equation model problem in this article we implement a relatively new numerical technique adomian s decomposition method for solving the linear helmholtz partial differential equations the method in applied mathematics can be an effective procedure to obtain for the analytic and approximate solutions a new approach to a linear or nonlinear problems is particularly valuable as a tool for scientists and applied mathematicians because it provides immediate and visible symbolic terms of analytic solution as well as its numerical approximate solution to both linear and nonlinear problems without linearization solving frontier problems of physics the decomposition method kluwer academic publishers boston 1994 j math anal appl 35 1988 501 it does also not require discretization and consequently massive computation in this scheme the solution is performed in the form of a convergent power series with easily computable components this paper will present a numerical comparison with the adomian decomposition and a conventional finite difference method the numerical results demonstrate that the new method is quite accurate and readily implemented

new study of weakly singular kernel fractional fourth order partial integro differential equations based on the optimum q homotopic analysis method in this study the optimum q homotopic analysis method is employed to solve fourth order partial integro differential equations with high order non integer derivatives several specific and clear examples are also given to illustrate the simplicity and capacity of the proposed approach all of the computations were performed using mathematica

gaussian behavior of loop erased self avoiding random walk in four dimensions une marche auto evitante de longueur n sur le reseau entier z d est une suite ordonnee de points x 0 0 x 1 x n avec x i x i 1 1 et x i x j pour i j on etudie le comportement d une telle marche a d 4 quand on applique le processus de boucle effacee

numerical solution of integro differential equations of high order by wavelet basis its algorithm and convergence analysis abstract this paper presents for the first time numerical solutions for this particular type of integro differential equations according to equations which will be introduced suitable wavelet galerkin method is provided using wavelet basis in the space c r l 2 r 0 that c r is the holder space of exponent this approach has two advantages first the wavelets basis are arbitrary it means that any differentiable wavelets basis can be used second the desired orders for this equation are the reasons for involving a wide variety of these types of equations the algorithm and convergence analysis of this scheme are described numerical examples plots and tablets of errors confirm the applicability and the validity of the proposed method

improved adomian decomposition method in this paper a new treatment for the adomian decomposition method adm is introduced the new treatment is called the improved adomian decomposition method iadm which improves the results obtained from the known adomian decomposition method the improved adomian decomposition method is applied for the analytic treatment of nonlinear initial value problems the improved method accelerates the convergence of the series solution and provides the exact power series solution it solves the drawbacks in the standard adomian decomposition method

on the strichartz estimates for orthonormal systems of initial data with regularity abstract the classical strichartz estimates for the free schrodinger propagator have recently been substantially generalised to estimates of the form j j e i t f j 2 l p t l x q l for orthonormal systems f j j of initial data in l 2 firstly in work of frank lewin lieb seiringer and later by frank sabin the primary objective is identifying the largest possible as a function of p and q and in contrast to the classical case for such estimates the critical case turns out to be p q d 1 d d 1 d 1 we consider the case of orthonormal systems f j j in the homogeneous sobolev spaces h s for s 0 d 2 and we establish the sharp value of as a function of p q and s except possibly an endpoint in certain cases furthermore at the critical case p q d 1 d 2 s d d 1 d 1 d 2 s for general s we show the veracity of the desired estimates when p if we consider frequency localised estimates and the failure of the non localised estimates when p this exhibits the difficulty of upgrading from frequency localised estimates in this context again in contrast to the classical setting

infinite volume limit for the stationary distribution of abelian sandpile models we study the stationary distribution of the standard abelian sandpile model in the box n n n d d for d 2 we show that as n the finite volume stationary distributions weakly converge to a translation invariant measure on allowed sandpile configurations in d this allows us to define infinite volume versions of the avalanche size distribution and related quantities the proof is based on a mapping of the sandpile model to the uniform spanning tree due to majumdar and dhar and the existence of the wired uniform spanning forest measure on d in the case d 4 we also make use of wilson s method

entropy for translation invariant random cluster measures we study translation invariant random cluster measures with techniques from large deviation theory and convex analysis in particular we prove a large deviation principle with rate function given by a specific entropy and a dobrushinlanfordruelle variational principle that characterizes translation invariant random cluster measures as the solutions of the variational equation for free energy consequences of these theorems include inequalities for edge and cluster densities of translationinvariant random cluster measures 1 introduction the random cluster model was introduced around 1972 by fortuin and kasteleyn 18 as a family of models that contains the bernoulli bond percolation model the ising model and the q state potts models as special cases it has developed into an important and very successful tool for studying the ising and potts models our paper focuses on the properties of the random cluster measures themselves our starting point is grimmett s 23 development of elements of a thermodynamic formalism for this model beginning with a definition of infinite volume random cluster measures in terms of a dlr dobrushinlanfordruelle equation just as for gibbsian systems natural next questions concern the validity of large deviation principles and variational characterizations of infinite volume measures these questions we answer in the present paper and derive some consequences here is a brief overview of the dlr approach of 23 the random cluster measures of interest live on the graph formed by putting edges between nearest neighbor vertices of the d dimensional hypercubic lattice d the edge that connects two vertices x and y that are l 1 distance one apart is

strichartz inequalities and the nonlinear schrodinger equation on compact manifolds kklwe prove strichartz estimates with fractional loss of derivatives for the schrodinger equation on any riemannian compact manifold as a consequence we infer low regularity local well posedness results in any dimension as well as global existence results for the cauchy problem of nonlinear schrodinger equations on surfaces in the case of defocusing polynomial nonlinearities and on three manifolds in the case of cubic defocusing nonlinearities we also discuss the optimality of these strichartz estimates on spheres

a novel semi analytical approach for solving nonlinear volterra integro differential equations in this work we present an efficient semi analytical method based on the taylor series for solving nonlinear volterra integro differential equations namely the differential transform method dtm the dtm provides a recursive relation for the coefficients of the taylor series that is derived from the given equations we provide a new recursive relation for the nonlinear volterra integro differential equations with complex nonlinear kernels since the dtm is based on the taylor series it is difficult to obtain accurate approximate solutions in a large domain to overcome this difficulty the standard dtm is applied in each subdomain called the multistage differential transform method msdtm we also present an convergence analysis for the proposed method to demonstrate the efficiency of the proposed method several numerical examples are performed and support the results in our analysis

abelian sandpiles and the harmonic model we present a construction of an entropy preserving equivariant surjective map from the d dimensional critical sandpile model to a certain closed shift invariant subgroup of mathbb t mathbb z d the harmonic model a similar map is constructed for the dissipative abelian sandpile model and is used to prove uniqueness and the bernoulli property of the measure of maximal entropy for that model

on the adomian decomposition method and comparisons with picard s method abstract this paper shows that the adomian decomposition method stochastic systems academic press new york 1983 is not to be identified with any of the earlier methods since it solves a wide class of nonlinear and stochastic equations without the often unphysical assumptions which have become customary similarities between the picard method and the decomposition method are purely superficial

strichartz estimates for schrodinger equations on irrational tori in this paper we prove new strichartz estimates for linear schrodinger equations posed on d dimensional irrational tori then we use these estimates to prove subcritical and critical local well posedness results for nonlinear schrodinger equations on irrational tori

theory of minimum spanning trees i mean field theory and strongly disordered spin glass model the minimum spanning tree mst is a combinatorial optimization problem given a connected graph with a real weight cost on each edge find the spanning tree that minimizes the sum of the total cost of the occupied edges we consider the random mst in which the edge costs are quenched independent random variables there is a strongly disordered spin glass model due to newman and stein phys rev lett 72 2286 1994 which maps precisely onto the random mst we study scaling properties of random msts using a relation between kruskal s greedy algorithm for finding the mst and bond percolation we solve the random mst problem on the bethe lattice bl with appropriate wired boundary conditions and calculate the fractal dimension d 6 of the connected components viewed as a mean field theory the result implies that on a lattice in euclidean space of dimension d there are of order w d ensuremath d large connected components of the random mst inside a window of size w and that d d c d 6 is a critical dimension this differs from the value 8 suggested by newman and stein we also critique the original argument for 8 and provide an improved scaling argument that again yields d c 6 the result implies that the strongly disordered spin glass model has many ground states for dg6 and only of order one below six the results for msts also apply on the poisson weighted infinite tree which is a mean field approach to the continuum model of msts in euclidean space and is a limit of the bl in a companion paper we develop an ensuremath epsilon 6 ensuremath d expansion for the random mst on critical percolation clusters

endpoint strichartz estimates we prove an abstract strichartz estimate which implies previously unknown endpoint strichartz estimates for the wave equation in dimension n 4 and the schrodinger equation in dimension n 3 three other applications are discussed local existence for a nonlinear wave equation and strichartz type estimates for more general dispersive equations and for the kinetic transport equation

a method for the numerical solution of the integro differential equations in this note the differential transformation is applied to solve the linear first order ordinary fredholm integro differential equations we will give an applicable relation between the one and two dimensional differential transformation in order to solve integro differential equations also we extend this method for searching the numerical solutions of linear higher order ordinary fredholm integro differential equations numerical examples are used to illustrate the preciseness and effectiveness of the proposed method

solution of bvps for fourth order integro differential equations by using homotopy perturbation method in this study the homotopy perturbation method proposed by ji huan he is applied to solve both linear and nonlinear boundary value problems for fourth order integro differential equations the analysis is accompanied by numerical examples the results show that the homotopy perturbation method is of high accuracy more convenient and efficient for solving integro differential equations

a new modification of the adomian decomposition method for linear and nonlinear operators in this paper we present an efficient modification of the adomian decomposition method that will facilitate the calculations we then conduct a comparative study between the new modification and the modified decomposition method the study is conducted through illustrative examples the new modification introduces a promising tool for many linear and nonlinear models

the proof of the l 2 decoupling conjecture we prove the l 2 decoupling conjecture for compact hypersurfaces with positive denite second fundamental form and also for the cone this has a wide range of important consequences one of them is the validity of the discrete restriction conjecture which implies the full range of expected l p strichartz estimates for both the rational and up to n losses the irrational torus another one is an improvement in the range for the discrete restriction theorem for lattice points on the sphere various applications to additive combinatorics incidence geometry and number theory are also discussed our argument relies on the interplay between linear and multilinear restriction theory

a comparison between the sinc galerkin and the modified decomposition methods for solving two point boundary value problems one of the new techniques used in solving boundary value problems involving ordinary differential equations is the sinc galerkin method this method has been shown to be a powerful numerical tool for finding fast and accurate solutions a less known technique that has been around for almost two decades is the decomposition method in this paper we solve boundary value problems of higher order using these two methods and then compare the results it is shown that the sinc galerkin method in many instances gives better results

local characteristics entropy and limit theorems for spanning trees and domino tilings via transfer impedances let g be a finite graph or an infinite graph on which mathbb z d acts with finite fundamental domain if g is finite let mathbf t be a random spanning tree chosen uniformly from all spanning trees of g if g is infinite methods from pemantle show that this still makes sense producing a random essential spanning forest of g a method for calculating local characteristics i e finite dimensional marginals of mathbf t from the transfer impedance matrix is presented this differs from the classical matrix tree theorem in that only small pieces of the matrix n dimensional minors are needed to compute small n dimensional marginals calculation of the matrix entries relies on the calculation of the green s function for g which is not a local calculation however it is shown how the calculation of the green s function may be reduced to a finite computation in the case when g is an infinite graph admitting a z d action with finite quotient the same computation also gives the entropy of the law of mathbf t these results are applied to the problem of tiling certain lattices by dominos the so called dimer problem another application of these results is to prove modified versions of conjectures of aldous on the limiting distribution of degrees of a vertex and on the local structure near a vertex of a uniform random spanning tree in a lattice whose dimension is going to infinity included is a generalization of moments to tree valued random variables and criteria for these generalized moments to determine a distribution

haar wavelet method for nonlinear integro differential equations abstract a numerical method for solving nonlinear integral equations based on the haar wavelets is presented the method is applicable for volterra integral equations and integro differential equations it can be used also for solving boundary value problems of ordinary differential equations the efficiency of the proposed method is tested with the aid of four examples high accuracy even for a small number of collocation points is stated

restriction theorems for orthonormal functions strichartz inequalities and uniform sobolev estimates we generalize the theorems of stein tomas and strichartz about surface restrictions of fourier transforms to systems of orthonormal functions with an optimal dependence on the number of functions we deduce the corresponding strichartz bounds for solutions to schr odinger equations up to the endpoint thereby solving an open problem of frank lewin lieb and seiringer we also prove uniform sobolev estimates in schatten spaces extending the results of kenig ruiz and sogge we finally provide applications of these results to a limiting absorption principle in schatten spaces to the well posedness of the hartree equation in schatten spaces to lieb thirring bounds for eigenvalues of schr odinger operators with complex potentials and to schatten properties of the scattering matrix

dimers and amoebae we study random surfaces which arise as height functions of random perfect matchings a k a dimer configurations on a weighted bipartite doubly periodic graph g embedded in the plane we derive explicit formulas for the surface tension and local gibbs measure probabilities of these models the answers involve a certain plane algebraic curve which is the spectral curve of the kasteleyn operator of the graph for example the surface tension is the legendre dual of the ronkin function of the spectral curve the amoeba of the spectral curve represents the phase diagram of the dimer model further we prove that the spectral curve of a dimer model is always a real curve of special type namely it is a harnack curve this implies many qualitative and quantitative statement about the behavior of the dimer model such as existence of smooth phases decay rate of correlations growth rate of height function fluctuations etc

smoothing properties and retarded estimates for some dispersive evolution equations smoothing properties in the form of space time integrability properties play an important role in the study of dispersive evolution equations a number of them follow from a combination of general arguments and specific estimates we present a general formulation which makes the separation between the two types of ingredients as clear as possible and we illustrate it with the examples of the schrodinger equation of the wave equation and of a class of 1 1 dimensional equations related to the benjamin ono equation of special interest for the cauchy problem are retarded estimates expressed in terms of those properties we derive a number of such estimates associated with the last example and we mention briefly an application of those estimates to the cauchy problem for the generalized benjamin ono equation

numerical study of modified adomian s method applied to burgers equation the application of adomian s decomposition method to partial differential equations when the exact solution is not reached demands the use of truncated series but the solution s series may have small convergence radius and the truncated series may be inaccurate in many regions in order to enlarge the convergence domain of the truncated series pade approximants pas to the adomian s series solution have been tested and applied to partial and ordinary differential equations with good results in this paper pas both in x and t directions applied to the truncated series solution given by adomian s decomposition technique for burgers equation are tested numerical and graphical illustrations show that this technique can improve the accuracy and enlarge the domain of convergence of the solution it is also shown in this paper that the application of adomian s method to the ordinary differential equations set arising from the discretization of the spatial derivatives by finite differences the so called method of lines may reduce the convergence domain of the solution s series

density and uniqueness in percolation two results on site percolation on thed dimensional lattice d 1 arbitrary are presented in the first theorem we show that for stationary underlying probability measures each infinite cluster has a well defined density with probability one the second theorem states that if in addition the probability measure satisfies the finite energy condition of newman and schulman then there can be at most one infinite cluster with probability one the simple arguments extend to a broad class of finite dimensional models including bond percolation and regular lattices

equality of partial solutions in the decomposition method for linear or nonlinear partial differential equations abstract we consider the solution of partial differential equations for initial boundary conditions using the decomposition method the partial solutions obtained from the seperate equations for the highest ordered linear operator terms are shown to be identical when the boundary conditions are general and asymptotically equal when the boundary conditions in one independent variable are independet of other variables

a comparison between adomian decomposition method and taylor series method in the series solutions in this work we will compare the performance of the adomian decomposition method and the taylor series method applied to the solution of linear and nonlinear ordinary differential equations the comparison shows that the decomposition method is reliable efficient and easy to use from a computational viewpoint although the two methods provide the solution in an infinite series the decomposition method provides a fast convergent series of easily computable components and eliminates cumbersome computational work needed by taylor series method

choosing a spanning tree for the integer lattice uniformly consider the nearest neighbor graph for the integer lattice zd in d dimensions for a large finite piece of it consider choosing a spanning tree for that piece uniformly among all possible subgraphs that are spanning trees as the piece gets larger this approaches a limiting measure on the set of spanning graphs for zd this is shown to be a tree if and only if d 4 in this case the tree has only one topological end that is there are no doubly infinite paths when d 2 5 the spanning forest has infinitely many components almost surely with each component having one or two topological ends

uniqueness of maximal entropy measure on essential spanning forests an essential spanning forest of an infinite graph g is a spanning forest of g in which all trees have infinitely many vertices let gn be an increasing sequence of finite connected subgraphs of g for which gn g pemantle s arguments imply that the uniform measures on spanning trees of gn converge weakly to an aut g invariant measure g on essential spanning forests of g we show that if g is a connected amenable graph and aut g acts quasitransitively on g then g is the unique invariant measure on essential spanning forests of g for which the specific entropy is maximal this result originated with burton and pemantle who gave a short but incorrect proof in the case d lyons discovered the error and asked about the more general statement that we prove

uniform spanning forests we study uniform spanning forest measures on infinite graphs which are weak limits of uniform spanning tree measures from finite subgraphs these limits can be taken with free fsf or wired wsf boundary conditions pemantle proved that the free and wired spanning forests coincide in z d and that they give a single tree iff d 4 in the present work we extend pemantle s alternative to general graphs and exhibit further connections of uniform spanning forests to random walks potential theory invariant percolation and amenability the uniform spanning forest model is related to random cluster models in statistical physics but because of the preceding connections its analysis can be carried further among our results are the following the fsf and wsf in a graph g coincide iff all harmonic dirichlet functions on g are constant the tail fields of the wsf and the fsf are trivial on any graph on any cayley graph that is not a finite extension of z all component trees of the wsf have one end this is new in z d for d 5 on any tree as well as on any graph with spectral radius less than 1 a s all components of the wsf are recurrent the basic topology of the free and the wired uniform spanning forest measures on lattices in hyperbolic space h d is analyzed a cayley graph is amenable iff for all e 0 the union of the wsf and bernoulli percolation with parameter e is connected harmonic measure from infinity is shown to exist on any recurrent proper planar graph with finite codegrees we also present numerous open problems and conjectures

minimal spanning forests minimal spanning forests on infinite graphs are weak limits of minimal spanning trees from finite subgraphs these limits can be taken with free or wired boundary conditions and are denoted fmsf free minimal spanning forest and wmsf wired minimal spanning forest respectively the wmsf is also the union of the trees that arise from invasion percolation started at all vertices we show that on any cayley graph where critical percolation has no infinite clusters all the component trees in the wmsf have one end a s in z d this was proved by alexander ann probab 23 1995 87 104 but a different method is needed for the nonamenable case we also prove that the wmsf components are thin in a different sense namely on any graph each component tree in the wmsf has p c 1 a s where p c denotes the critical probability for having an infinite cluster in bernoulli percolation on the other hand the fmsf is shown to be thick on any connected graph the union of the fmsf and independent bernoulli percolation with arbitrarily small parameter is a s connected in conjunction with a recent result of gaboriau this implies that in any cayley graph the expected degree of the fmsf is at least the expected degree of the fsf the weak limit of uniform spanning trees we also show that the number of infinite clusters for bernoulli p u percolation is at most the number of components of the fmsf where p u denotes the critical probability for having a unique infinite cluster finally an example is given to show that the minimal spanning tree measure does not have negative associations

long range properties of spanning trees we compute some large scale properties of the uniform spanning tree process on bounded regions in z2 in particular we compute the distribution of the meeting point of the branches of the tree issued from three boundary points we also compute the crossing probabilities of branches of the tree on rectangular and annular regions as well as the winding number of the branches of the tree

percolation beyond ℤd the contributions of oded schramm oded schramm 1961 2008 influenced greatly the development of percolation theory beyond the usual d setting in particular the case of nonamenable lattices here we review some of his work in this field

bilinear eigenfunction estimates and the nonlinear schrodinger equation on surfaces we study the cubic non linear schrodinger equation nls on compact surfaces on the sphere mathbb s 2 and more generally on zoll surfaces we prove that for s 1 4 nls is uniformly well posed in hs which is sharp on the sphere the main ingredient in our proof is a sharp bilinear estimate for laplace spectral projectors on compact surfaces

indistinguishability of the components of random spanning forests we prove that the infinite components of the free uniform spanning forest fusf of a cayley graph are indistinguishable by any invariant property given that the forest is different from its wired counterpart similar result is obtained for the free minimal spanning forest fmsf we also show that with the above assumptions there can only be 0 1 or infinitely many components which solves the problem for the fusf of caylay graphs completely these answer questions by benjamini lyons peres and schramm for cayley graphs which have been open up to now our methods apply to a more general class of percolations those satisfying weak insertion tolerance and work beyond cayley graphs in the more general setting of unimodular random graphs

subsequential scaling limits of simple random walk on the two dimensional uniform spanning tree the first main result of this paper is that the law of the rescaled two dimensional uniform spanning tree is tight in a space whose elements are measured rooted real trees continuously embedded into euclidean space various properties of the intrinsic metrics measures and embeddings of the subsequential limits in this space are obtained with it being proved in particular that the hausdorff dimension of any limit in its intrinsic metric is almost surely equal to 8 5 in addition the tightness result is applied to deduce that the annealed law of the simple random walk on the two dimensional uniform spanning tree is tight under a suitable rescaling for the limiting processes which are diffusions on random real trees embedded into euclidean space detailed transition density estimates are derived

a comparison between adomian s decomposition methods and perturbation techniques for nonlinear random differential equations abstract comparison of the adomian decomposition method and regular perturbation techniques applied to the solution of nonlinear vector random differential equations shows that the decomposition method is superior and generally applicable even for the cases where perturbation is applicable the comparison shows that the decomposition method is easier to compute and supplies quantitatively reliable results

harmonic models and spanning forests of residually finite groups abstract we prove a number of identities relating the sofic entropy of a certain class of non expansive algebraic dynamical systems the sofic entropy of the wired spanning forest and the tree entropy of cayley graphs of residually finite groups we also show that homoclinic points and periodic points in harmonic models are dense under general conditions

an efficient algorithm for solving volterra integro differential equations based on alpert s multi wavelets galerkin method abstract this paper is concerned with the application of the multi wavelets galerkin method to linear and nonlinear second order volterra integro differential equations using the operational matrices of integration and wavelet transform matrix we reduce the problem to a set of algebraic equations for linear type we use thresholding to reduce the computational effort we demonstrate that our solutions may be efficiently represented in a multi wavelets basis due to flexible vanishing moments property of this type of multi wavelets the l 2 convergence of the scheme for the proposed equation has been investigated a series of numerical tests is provided to demonstrate the validity and applicability of the technique

transfer current and pattern fields in spanning trees when a simply connected domain d subset mathbb r d d ge 2 is approximated in a good way by embedded connected weighted graphs we prove that the transfer current matrix defined on the edges of the graph viewed as an electrical network converges up to a local weight factor to the differential of green s function on d this observation implies that properly rescaled correlations of the spanning tree model and correlations of minimal subconfigurations in the abelian sandpile model have a universal and conformally covariant limit we further show that on a periodic approximation of the domain all pattern fields of the spanning tree model as well as the minimal pattern e g zero height fields of the sandpile converge weakly in distribution to gaussian white noise

a new algorithm for calculating adomian polynomials for nonlinear operators in this paper a reliable technique for calculating adomian polynomials for nonlinear operators will be developed the new algorithm offers a promising approach for calculating adomian polynomials for all forms of nonlinearity the algorithm will be illustrated by studying suitable forms of nonlinearity a nonlinear evolution model will be investigated

the modified decomposition method for solving nonlinear algebraic equations in this paper an algorithm based on adomian s decomposition method is developed to approximate the solution of nonlinear algebraic equations the conditions of the convergence which depend on the coefficients of the equation are found the truncation error of the method is obtained special cases of the nonlinear algebraic equation are solved using the modified algorithm the presented work shows that the modified approach gives improvements over existing techniques

existence of solutions for schrodinger evolution equations we study the existence uniqueness and regularity of the solution of the initial value problem for the time dependent schrodinger equationi u t 1 2 u v t x u u 0 u0 we provide sufficient conditions onv t x such that the equation generates a unique unitary propagatoru t s and such thatu t s u0ec1 l2 c0 h2 n foru0eh2 n the conditions are general enough to accommodate moving singularities of type x 2 n 4 or x n 2 n 3

the modified decomposition method and pade approximants for solving the thomas fermi equation in this paper we propose a new approach to develop a nonperturbative approximate solution for the thomas fermi equation this approach rests on the recently developed modification of the adomian decomposition method the initial slope of the thomas fermi potential y 0 is computed by converting the obtained series solution into several diagonal pade approximants the proposed scheme is presented in a general way so that it can be used in applied sciences