skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Adaptive h-refinement in nonlinear model reduction: capturing moving discontinuities.


Abstract not provided.

Publication Date:
Research Org.:
Sandia National Lab. (SNL-CA), Livermore, CA (United States)
Sponsoring Org.:
USDOE National Nuclear Security Administration (NNSA)
OSTI Identifier:
Report Number(s):
DOE Contract Number:
Resource Type:
Resource Relation:
Conference: Proposed for presentation at the 7th European Congress of Mathematics held July 18-22, 2016 in Berlin, Germany.
Country of Publication:
United States

Citation Formats

Carlberg, Kevin Thomas. Adaptive h-refinement in nonlinear model reduction: capturing moving discontinuities.. United States: N. p., 2016. Web.
Carlberg, Kevin Thomas. Adaptive h-refinement in nonlinear model reduction: capturing moving discontinuities.. United States.
Carlberg, Kevin Thomas. 2016. "Adaptive h-refinement in nonlinear model reduction: capturing moving discontinuities.". United States. doi:.
title = {Adaptive h-refinement in nonlinear model reduction: capturing moving discontinuities.},
author = {Carlberg, Kevin Thomas},
abstractNote = {Abstract not provided.},
doi = {},
journal = {},
number = ,
volume = ,
place = {United States},
year = 2016,
month = 7

Other availability
Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:
  • This paper describes an adaptive mesh refinement algorithm for unsteady gas dynamics. The algorithm is based on an unsplit, second-order Godunov integration scheme for logically-rectangular moving quadrilateral grids. The integration scheme is conservative and provides a robust, high resolution discretization of the equations of gas dynamics for problems with strong nonlinearities. The integration scheme is coupled to a local adaptive mesh refinement algorithm that dynamically adjusts the location of refined grid patches to preserve the accuracy of the solution, preserving conservation at interfaces between coarse and fine grids while adjusting the geometry of the fine grids so that grid linesmore » remain smooth under refinement. Numerical results are presented illustrating the performance of the algorithm. 5 refs., 3 figs.« less
  • Highly nonlinear advection-dispersion-reaction equations govern numerous transport phenomena. Robust, accurate, and efficient algorithms to solve these equations hold the key to the success of applying numerical models to field problems. This paper presents the development and verification of a computational algorithm to approximate the highly nonlinear transport equations of reactive chemical transport and multiphase flow. The algorithm was developed based on the Lagrangian-Eulerian decoupling method with an adaptive ZOOMing and Peak/valley Capture (LEZOOMPC) scheme. It consists of both backward and forward node tracking, rough element determination, peak/valley capturing, and adaptive local grid refinement. A second-order tracking was implemented to accuratelymore » and efficiently track all fictitious particles. Shanks method was introduced to deal with slowly converging case. The accuracy and efficiency of the algorithm were verified with the Burger equation for a variety of cases. The robustness of the algorithm to achieve convergent solutions was demonstrated by highly nonlinear reactive contaminant transport and multiphase flow problems.« less
  • We present adaptive multiresolution (MR) computations of the two-dimensional compressible Euler equations for a classical Riemann problem. The results are then compared with respect to accuracy and computational efficiency, in terms of CPU time and memory requirements, with the corresponding finite volume scheme on a regular grid. For the same test-case, we also perform computations using adaptive mesh refinement (AMR) imposing similar accuracy requirements. The results thus obtained are compared in terms of computational overhead and compression of the computational grid, using in addition either local or global time stepping strategies. We preliminarily conclude that the multiresolution techniques yield improvedmore » memory compression and gain in CPU time with respect to the adaptive mesh refinement method.« less
  • We present a numerical method for solving the multifluid equations of gas dynamics using an operator-split second-order Godunov method for flow in complex geometries in two and three dimensions. The multifluid system treats the fluid components as thermodynamically distinct entities and correctly models fluids with different compressibilities. This treatment allows a general equation-of-state (EOS) specification and the method is implemented so that the EOS references are minimized. The current method is complementary to volume-of-fluid (VOF) methods in the sense that a VOF representation is used, but no interface reconstruction is performed. The Godunov integrator captures the interface during the solutionmore » process. The basic multifluid integrator is coupled to a Cartesian grid algorithm that also uses a VOF representation of the fluid-body interface. This representation of the fluid-body interface allows the algorithm to easily accommodate arbitrarily complex geometries. The resulting single grid multifluid-Cartesian grid integration scheme is coupled to a local adaptive mesh refinement algorithm that dynamically refines selected regions of the computational grid to achieve a desired level of accuracy. The overall method is fully conservative with respect to the total mixture. The method will be used for a simple nozzle problem in two-dimensional axisymmetric coordinates.« less
  • We examine the performance of an adaptive mesh-moving and /or local mesh refinement procedure for the finite difference solution of one-dimensional hyperbolic systems of conservation laws. Adaptive motion of a base mesh is designed to isolate spatially distinct phenomena, and recursive local refinement of the time step and cells of the stationary or moving base mesh is performed in regions where a refinement indicator exceeds a prescribed tolerance. These adaptive procedures are incorporated into a computer code that includes a MacCormack finite difference scheme wih Davis' artificial viscosity model and a discretization error estimate based on Richardson's extrapolation. Experiments aremore » conducted on three problems in order to qualify the advantages of adaptive techniques relative to uniform mesh computations and the relative benefits of mesh moving and refinement. Key results indicate that local mesh refinement, with and without mesh moving, can provide reliable solutions at much lower computational cost than possible on uniform meshes; that mesh motion can be used to improve the results of uniform mesh solutions for a modest computational effort; that the cost of managing the tree data structure associated with refinement is small; and that a combination of mesh motion and refinement reliably produces solutions for the least cost per unit accuracy.« less