Abstract
A method based on a time dependent coordinate transformation has been applied to solve Burgers' equation. The numerical solution has been compared to the analytical solution of Lighthill [1]. The numerical results agree completely with the analytical ones. They have been obtained with very large time steps because a fast implicit non-iterative algorithm has been employed for the time discretization. The number of grid points in the space discretization is very low because the coordinate transformation gives a steady shock in the “new” coordinate.
Sign-in/Register to access full text options 
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.
