Skip to main content

Adaptive Multiscale Schemes for Conservation Laws

  • Book
  • © 2003

Overview

Part of the book series: Lecture Notes in Computational Science and Engineering (LNCSE, volume 27)

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (7 chapters)

Keywords

About this book

During the last decade enormous progress has been achieved in the field of computational fluid dynamics. This became possible by the development of robust and high-order accurate numerical algorithms as well as the construc­ tion of enhanced computer hardware, e. g. , parallel and vector architectures, workstation clusters. All these improvements allow the numerical simulation of real world problems arising for instance in automotive and aviation indus­ try. Nowadays numerical simulations may be considered as an indispensable tool in the design of engineering devices complementing or avoiding expen­ sive experiments. In order to obtain qualitatively as well as quantitatively reliable results the complexity of the applications continuously increases due to the demand of resolving more details of the real world configuration as well as taking better physical models into account, e. g. , turbulence, real gas or aeroelasticity. Although the speed and memory of computer hardware are currently doubled approximately every 18 months according to Moore's law, this will not be sufficient to cope with the increasing complexity required by uniform discretizations. The future task will be to optimize the utilization of the available re­ sources. Therefore new numerical algorithms have to be developed with a computational complexity that can be termed nearly optimal in the sense that storage and computational expense remain proportional to the "inher­ ent complexity" (a term that will be made clearer later) problem. This leads to adaptive concepts which correspond in a natural way to unstructured grids.

Authors and Affiliations

  • Institut für Geometrie und Praktische Mathematik RWTH Aachen, Aachen, Germany

    Siegfried Müller

Bibliographic Information

Publish with us