Numerical Methods for Conservation Laws
Author | : Jan S. Hesthaven |
Publisher | : SIAM |
Total Pages | : 571 |
Release | : 2018-01-30 |
ISBN-10 | : 9781611975109 |
ISBN-13 | : 1611975107 |
Rating | : 4/5 (09 Downloads) |
Download or read book Numerical Methods for Conservation Laws written by Jan S. Hesthaven and published by SIAM. This book was released on 2018-01-30 with total page 571 pages. Available in PDF, EPUB and Kindle. Book excerpt: Conservation laws are the mathematical expression of the principles of conservation and provide effective and accurate predictive models of our physical world. Although intense research activity during the last decades has led to substantial advances in the development of powerful computational methods for conservation laws, their solution remains a challenge and many questions are left open; thus it is an active and fruitful area of research. Numerical Methods for Conservation Laws: From Analysis to Algorithms offers the first comprehensive introduction to modern computational methods and their analysis for hyperbolic conservation laws, building on intense research activities for more than four decades of development; discusses classic results on monotone and finite difference/finite volume schemes, but emphasizes the successful development of high-order accurate methods for hyperbolic conservation laws; addresses modern concepts of TVD and entropy stability, strongly stable Runge-Kutta schemes, and limiter-based methods before discussing essentially nonoscillatory schemes, discontinuous Galerkin methods, and spectral methods; explores algorithmic aspects of these methods, emphasizing one- and two-dimensional problems and the development and analysis of an extensive range of methods; includes MATLAB software with which all main methods and computational results in the book can be reproduced; and demonstrates the performance of many methods on a set of benchmark problems to allow direct comparisons. Code and other supplemental material will be available online at publication.