High Order Nonlinear Numerical Schemes for Evolutionary PDEs

Proceedings of the European Workshop HONOM 2013, Bordeaux, France, March 18-22, 2013

Inbunden, Engelska, 2014

AvRémi Abgrall,Héloïse Beaugendre,Pietro Marco Congedo,Cécile Dobrzynski,Vincent Perrier,Mario Ricchiuto,Remi Abgrall,Heloise Beaugendre,Cecile Dobrzynski

1 369 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

This book collects papers presented during the European Workshop on High Order Nonlinear Numerical Methods for Evolutionary PDEs (HONOM 2013) that was held at INRIA Bordeaux Sud-Ouest, Talence, France in March, 2013.

Produktinformation

Utgivningsdatum2014-06-03
Mått155 x 235 x 18 mm
Vikt512 g
FormatInbunden
SpråkEngelska
SerieLecture Notes in Computational Science and Engineering
Antal sidor208
Upplaga2014
FörlagSpringer International Publishing AG
ISBN9783319054544

Tillhör följande kategorier

High–order Asymptotic–Preserving methods for nonlinear relaxation from hyperbolic systems to convection–diffusion equations.- A hybrid finite difference-WENO scheme for large eddy simulation of compressible flows.- Finite volume formulation of a third-order residual-based compact scheme for unsteady flow computations.- Parallel implementation of k-exact Finite Volume Reconstruction on Unstructured Grids.- 3D Application of Higher Order Multigrid Algorithms for a RANS-kw DG-Solver.- Taylor expansion method for linear lattice Boltzmann schemes with an external force. Application to boundary conditions.- High order SFV and mixed SDG/FV methods for the uncertainty quantification in multidimensional conservation laws.- High-order Discontinuous Galerkin solution of unsteady flows by using an advanced implicit method.- Detecting edges in high order methods for hyperbolic conservation laws.- A comparison of analytical solutions of a high-order RBC scheme and its equivalent differential equation for a steady shock problem.- Discontinuous Galerkin method and applications to fluid-structure interaction problems.