An approximate orthogonal decomposition method for the solution of the generalized liouville equation

We consider an approximate integration method of the Cauchy problem for the generalized Liouville equation using symbolic and numeric computer computations. This method is based on the probability density function orthonormal series expansion in the small and initial time space domains. We are inves...

Full description

Autores:
Dulov, Eugene
Sinitsyn, Alexandre
Tipo de recurso:
Article of journal
Fecha de publicación:
2007
Institución:
Universidad Nacional de Colombia
Repositorio:
Universidad Nacional de Colombia
Idioma:
spa
OAI Identifier:
oai:repositorio.unal.edu.co:unal/73618
Acceso en línea:
https://repositorio.unal.edu.co/handle/unal/73618
http://bdigital.unal.edu.co/38094/
Palabra clave:
Liouville equation
orthonormal system
eigenfunction
strong and weak convergence
mean convergence
Camassa- Holm equation
Hermite functions.
Rights
openAccess
License
Atribución-NoComercial 4.0 Internacional
Description
Summary:We consider an approximate integration method of the Cauchy problem for the generalized Liouville equation using symbolic and numeric computer computations. This method is based on the probability density function orthonormal series expansion in the small and initial time space domains. We are investigating several expansions and determine their convergence conditions to ensure the convergence of the asymptotic expansion to the solution of the considered problem.To illustrate the applicability of the introduced asymptotic orthogonal decompositions [18] we took the describing bidimensional integrable dispersive shallow water equation developed by Roberto Camassa and Darryl D. Holm, Los Alamos National Laboratory. Since CH-equation solutionsare represented by a superposition of arbitrary number of peakons (peaked solitons) [9],[16], one can compare the coincidence of the \peakon" solutions character provided by numerical modeling along some trajectories for truncated asymptotic series expansions obtained by symbolic computations.