A reliable technique for solving the wave equation in an infinite one-dimensional medium. (English) Zbl 0942.65107

Summary: The initial value problem of the one-dimensional wave equation, where the domain of the space variable is unbounded, will be handled by using the reliable decomposition method. The solution is obtained in the form of a rapid convergent power series with elegantly computable terms. Comparing the decomposition method we used with several other methods that have been advanced for solving this model, shows that the new technique is reliable, powerful and promising.


65M55 Multigrid methods; domain decomposition for initial value and initial-boundary value problems involving PDEs
35L05 Wave equation
65M12 Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs
65M70 Spectral, collocation and related methods for initial value and initial-boundary value problems involving PDEs
Full Text: DOI


[1] Boyce, W.; DiPrima, R., Elementary Differential Equations (1991), Wiley: Wiley New York · Zbl 0178.09001
[2] Adomian, G., Solving Frontier Problems of Physics: The Decomposition Method (1994), Kluwer Academic Publishers: Kluwer Academic Publishers Dordrecht · Zbl 0802.65122
[3] Cherrault, Y.; Saccomandi, G.; Some, B., New results for convergence of Adomian’s method applied to integral equations, Math. Comput. Modelling, 16, 2, 85-93 (1992) · Zbl 0756.65083
[4] Wazwaz, A. M., A new approach to the nonlinear advection problem: An application of the decomposition method, Appl. Math. Comput., 72, 175-181 (1995) · Zbl 0838.65092
[5] Wazwaz, A. M., The decomposition method for approximate solution of the Goursat problem, Appl. Math. Comput., 69, 299-311 (1995) · Zbl 0826.65077
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.