Abstract
In this paper, we investigate the computability of the solution operator of the generalized KdV–Burgers equation with initial-boundary value problem. Here, the solution operator is a nonlinear map H 3m� 1 .R C / � H m .0,T/ ! C.Œ0,T� ;H 3m� 1 .R C //, from the initial-boundary value data to the solution of the equation. By a technique that is widely used for the study of nonlinear dispersive equation, and using the type 2 theory of effectivity as computable model, we prove that the solution map is Turing computable, for any integerm � 2, and computable real numberT > 0. Copyright © 2014 John Wiley & Sons, Ltd.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
