Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Time step adaptivity”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 145 records · Page 8

Development of an unstructured solution adaptive method for the quasi-three-dimensional Euler and Navier-Stokes equations

A general solution adaptive scheme based on a remeshing technique is developed for solving the two-dimensional and quasi-three-dimensional Euler and Favre-averaged Navier-Stokes equations. The numerical scheme is formulated on an unstructured triangular mesh utilizing an edge-based pointer system which defines the edge connectivity of the mesh structure. Jameson's four-stage hybrid Runge-Kutta scheme is used to march the solution in time. The convergence rate is enhanced through the use of local time stepping and implicit residual averaging. As the solution evolves, the mesh is regenerated adaptively using flow field information. Mesh adaptation parameters are evaluated such that an estimated local numerical error is equally distributed over the whole domain. For inviscid flows, the present approach generates a complete unstructured triangular mesh using the advancing front method. For turbulent flows, the approach combines a local highly stretched structured triangular mesh in the boundary layer region with an unstructured mesh in the remaining regions to efficiently resolve the important flow features. One-equation and two-equation turbulence models are incorporated into the present unstructured approach. Results are presented for a wide range of flow problems including two-dimensional multi-element airfoils, two-dimensional cascades, and quasi-three-dimensional cascades. This approach is shown to gain flow resolution in the refined regions while achieving a great reduction in the computational effort and storage requirements since solution points are not wasted in regions where they are not required.

Jiang, Yi-Tsann↗

Development of an unstructured solution adaptive method for the quasi-three-dimensional Euler and Navier-Stokes equations

A general solution adaptive scheme-based on a remeshing technique is developed for solving the two-dimensional and quasi-three-dimensional Euler and Favre-averaged Navier-Stokes equations. The numerical scheme is formulated on an unstructured triangular mesh utilizing an edge-based pointer system which defines the edge connectivity of the mesh structure. Jameson's four-stage hybrid Runge-Kutta scheme is used to march the solution in time. The convergence rate is enhanced through the use of local time stepping and implicit residual averaging. As the solution evolves, the mesh is regenerated adaptively using flow field information. Mesh adaptation parameters are evaluated such that an estimated local numerical error is equally distributed over the whole domain. For inviscid flows, the present approach generates a complete unstructured triangular mesh using the advancing front method. For turbulent flows, the approach combines a local highly stretched structured triangular mesh in the boundary layer region with an unstructured mesh in the remaining regions to efficiently resolve the important flow features. One-equation and two-equation turbulence models are incorporated into the present unstructured approach. Results are presented for a wide range of flow problems including two-dimensional multi-element airfoils, two-dimensional cascades, and quasi-three-dimensional cascades. This approach is shown to gain flow resolution in the refined regions while achieving a great reduction in the computational effort and storage requirements since solution points are not wasted in regions where they are not required.

Jiang, Yi-Tsann↗

PHURBAS: AN ADAPTIVE, LAGRANGIAN, MESHLESS, MAGNETOHYDRODYNAMICS CODE. I. ALGORITHM

We present an algorithm for simulating the equations of ideal magnetohydrodynamics and other systems of differential equations on an unstructured set of points represented by sample particles. Local, third-order, least-squares, polynomial interpolations (Moving Least Squares interpolations) are calculated from the field values of neighboring particles to obtain field values and spatial derivatives at the particle position. Field values and particle positions are advanced in time with a second-order predictor-corrector scheme. The particles move with the fluid, so the time step is not limited by the Eulerian Courant-Friedrichs-Lewy condition. Full spatial adaptivity is implemented to ensure the particles fill the computational volume, which gives the algorithm substantial flexibility and power. A target resolution is specified for each point in space, with particles being added and deleted as needed to meet this target. Particle addition and deletion is based on a local void and clump detection algorithm. Dynamic artificial viscosity fields provide stability to the integration. The resulting algorithm provides a robust solution for modeling flows that require Lagrangian or adaptive discretizations to resolve. This paper derives and documents the Phurbas algorithm as implemented in Phurbas version 1.1. A following paper presents the implementation and test problem results.

79 ASTRONOMY AND ASTROPHYSICS↗

Adaptive primal–dual control for distributed energy resource management

With the increased adoption of distributed energy resources (DERs) in distribution networks, their coordinated control with a DER management system (DERMS) that provides grid services (e.g., voltage regulation, virtual power plant) is becoming more necessary. One particular type of DERMS using primal–dual control has recently been found to be very effective at providing multiple grid services among an aggregation of DERs; however, the main parameter, the primal–dual step size, must be manually tuned for the DERMS to be effective, which can take a considerable amount of engineering time and labor. To this end, we design a simple method that self-tunes the step size(s) and adapts it to changing system conditions. Additionally, it gives the DER management operator the ability to prioritize among possibly competing grid services. Here we evaluate the automatic tuning method on a simulation model of a real-world feeder in Colorado with data obtained from an electric utility. Through a variety of scenarios, we demonstrate that the DERMS with automatically and adaptively tuned step sizes provides higher-quality grid services than a DERMS with a manually tuned step size.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Recent developments in FEM-CFD

The current status of CFD with regard to unstructured grids employing finite element methods and Eulerian frames is reviewed. Algorithms suitable for the computation of large three-dimensional problems involving flow past arbitrary geometries are developed. Adaptive mesh refinement strategy is reviewed, and domain splitting or local time-stepping are briefly addressed. The development of search algorithms of optimal order, variable time-stepping Jacobi smoothers for elliptic problems, and transport concepts for hyperbolics to help achieve good performance for unstructured multigrid processes is discussed. As examples, transient supersonic flow in a channel, regular shock reflection of a wall, viscous flow past a protruberance, potential flow past a cylinder, and Burgers equation are considered.

Loehner, R.↗

Finite element methods of analysis for high speed viscous flows

Over the past three years a finite element based procedure for the solution of high speed viscous compressible flows was developed. The approach followed was to compute steady state solutions via a false transient, using an explicit time stepping scheme, and to attempt to improve the solution quality by incorporating adaptive mesh procedures. The main thrust of the work was to continue on the extension of the approach to the solution of some realistic compressible viscous flows. When flows at high Reynolds number are investigated, is soon becomes apparent that explicit techniwues have to be supplemented if they are to deal effectively with the large variations in element size and aspect ratio which characterize the computational grids necessary for adequate resolutin of the primary flow features. For this reason, the Taylor-Galerkin solution algorithm was rewritten in an explicit/implicit form. Solutions were computed for the problems of a flow past a flat plate, M-3, Re-100; shock/boundary layer interaction, M-2, Re-296000; flow over a compression corner, M-11.68, Re246000; and unifrom flow past a circular cylinder, M-6.34, Re-39770. A summary of the results is included and demonstrates the numerical performance of the scheme.

Source record↗

Discrete-Time Model-Reference Adaptive Control

Paper discusses stability of digital model-reference adaptive control (MRAC) of robotic system or plant that operates at discrete time steps. Command-generator tracker (CGT) concept, originally proposed for continuous-time systems, is applied in discrete-time setting, enabling relaxation of some restrictive assumptions that guarantee stability of system controlled according to resulting algorithm. Likely applications include systems in which sensors and actuators not placed together.

Wen, John T.↗

Reactive Collision Avoidance Algorithm

The reactive collision avoidance (RCA) algorithm allows a spacecraft to find a fuel-optimal trajectory for avoiding an arbitrary number of colliding spacecraft in real time while accounting for acceleration limits. In addition to spacecraft, the technology can be used for vehicles that can accelerate in any direction, such as helicopters and submersibles. In contrast to existing, passive algorithms that simultaneously design trajectories for a cluster of vehicles working to achieve a common goal, RCA is implemented onboard spacecraft only when an imminent collision is detected, and then plans a collision avoidance maneuver for only that host vehicle, thus preventing a collision in an off-nominal situation for which passive algorithms cannot. An example scenario for such a situation might be when a spacecraft in the cluster is approaching another one, but enters safe mode and begins to drift. Functionally, the RCA detects colliding spacecraft, plans an evasion trajectory by solving the Evasion Trajectory Problem (ETP), and then recovers after the collision is avoided. A direct optimization approach was used to develop the algorithm so it can run in real time. In this innovation, a parameterized class of avoidance trajectories is specified, and then the optimal trajectory is found by searching over the parameters. The class of trajectories is selected as bang-off-bang as motivated by optimal control theory. That is, an avoiding spacecraft first applies full acceleration in a constant direction, then coasts, and finally applies full acceleration to stop. The parameter optimization problem can be solved offline and stored as a look-up table of values. Using a look-up table allows the algorithm to run in real time. Given a colliding spacecraft, the properties of the collision geometry serve as indices of the look-up table that gives the optimal trajectory. For multiple colliding spacecraft, the set of trajectories that avoid all spacecraft is rapidly searched on-line. The optimal avoidance trajectory is implemented as a receding-horizon model predictive control law. Therefore, at each time step, the optimal avoidance trajectory is found and the first time step of its acceleration is applied. At the next time step of the control computer, the problem is re-solved and the new first time step is again applied. This continual updating allows the RCA algorithm to adapt to a colliding spacecraft that is making erratic course changes.

Scharf, Daniel↗

Construction of Low Dissipative High Order Well-Balanced Filter Schemes for Non-Equilibrium Flows

The goal of this paper is to generalize the well-balanced approach for non-equilibrium flow studied by Wang et al. [26] to a class of low dissipative high order shock-capturing filter schemes and to explore more advantages of well-balanced schemes in reacting flows. The class of filter schemes developed by Yee et al. [30], Sjoegreen & Yee [24] and Yee & Sjoegreen [35] consist of two steps, a full time step of spatially high order non-dissipative base scheme and an adaptive nonlinear filter containing shock-capturing dissipation. A good property of the filter scheme is that the base scheme and the filter are stand alone modules in designing. Therefore, the idea of designing a well-balanced filter scheme is straightforward, i.e., choosing a well-balanced base scheme with a well-balanced filter (both with high order). A typical class of these schemes shown in this paper is the high order central difference schemes/predictor-corrector (PC) schemes with a high order well-balanced WENO filter. The new filter scheme with the well-balanced property will gather the features of both filter methods and well-balanced properties: it can preserve certain steady state solutions exactly; it is able to capture small perturbations, e.g., turbulence fluctuations; it adaptively controls numerical dissipation. Thus it shows high accuracy, efficiency and stability in shock/turbulence interactions. Numerical examples containing 1D and 2D smooth problems, 1D stationary contact discontinuity problem and 1D turbulence/shock interactions are included to verify the improved accuracy, in addition to the well-balanced behavior.

Wang, Wei↗

High-Order Methods in NASA’s Next Generation of Computational Fluid Dynamics Tools

The missions of the National Aeronautics and Space Administration (NASA) routinely produce unique requirements and challenges for development and application of Computational Fluid Dynamics (CFD) methods. NASA presently embodies four distinct Mission Directorates: Aeronautics Research, Exploration Systems, Science, and Space Operations. These missions generate requirements for systems that operate in a wide variety of environments. They range from the high-speed flight of aerodynamically optimized vehicles operating in the earth’s atmosphere to spacecraft designed for missions that don’t favor aerodynamic optimization, some operating in the atmosphere of planets and planetary moons such as Mars and Venus or Saturn’s moon Titan. Systems supporting these vehicles, such as rocket and jet propulsion, reaction control systems, fluid and thermal transfer systems, etc. can also generate their own unique set of flow phenomena that challenge today’s CFD methodology. Through the NASA Engineering and Safety Center (NESC), NASA annually conducts state-of-the-discipline assessments in fifteen distinct engineering disciplines. These assessments are performed by the NASA Technical Fellows that lead Technical Discipline Teams (TDT) of recognized experts in these fifteen areas. In the Aerosciences discipline, three topics have been identified as the top challenges for the discipline: aero-plume interaction prediction, unsteady separated flows, and aerothermodynamic prediction. These challenge areas are defined by the Agency’s high-risk projects and problems on which the NESC is requested to perform independent testing, analysis, and assessments. When viewed as a whole, these tests, analyses, and assessments provide a clear view of the recurring technical challenges facing Agency engineers and researchers and can be used to guide future research and technology development. The present state-of-the-art in the application of CFD at NASA is the use of Reynolds-Averaged Navier- Stokes (RANS) solvers, primarily executed in a steady-state mode of operation. In isolated cases, Unsteady RANS (URANS) solvers have been employed when steady RANS solutions produce poorly converging or oscillating results or in cases, such as aeroelastic analysis, which require unsteady aerodynamic simulation. For most traditional external and internal aerodynamic flows, structured overset grids or unstructured grids are employed to minimize geometric modeling and grid generation times. Grid adaptation, primarily as a series of coarse-grain intermediate processing steps is also seeing use on particularly complex flow problems and configurations. In the case of aerothermodynamic flows, engineers have been forced to continue to employ structured grid techniques as the present unstructured grid methodology has proven inadequate in the prediction of surface heating. In the area of aero-plume interaction modeling, two-gas, frozen chemistry simulation is generally the state-of-the- art, with some production solvers capable of predicting flows with only a single gas component. Prediction of flows falling into the afore-mentioned top Aerosciences technical challenges have severely stressed the present state-of-the-art in CFD prediction and for some problems, such as unsteady separated flows and aero-plume interaction cases, engineers have begun employing Large Eddy Simulation (LES) and Hybrid RANS/LES techniques. In some isolated aero-propulsion interaction cases, chemically reacting flow simulations have been applied. These methods are highly evolutionary and engineers have little experience in their application, so they cannot be heavily relied upon in today’s application environment. Therefore, this leads one to muse over which numerical technologies will be included in the CFD tools that will be employed 30 years in the future. This presentation will describe specific technical problems that have stressed NASA’s traditional CFD methods to their breaking point and will link these issues to the Agency’s top Aerosciences technical challenges. The discussion will then shift to the characteristics of future CFD solvers that will be required to attack these challenges and how these characteristics differ from the present state-of-the- art. High-order methods certainly appear to have a place in the development of future CFD tools and some of the physical characteristics of our most challenging problems suggest that high-order methods are the only way to effectively solve them. But there are some relatively severe implementation issues that face these methods, particularly in the area of general applicability and robust operation as an engineering tool. Desired characteristics of next-generation CFD solvers will be discussed and the author’s view of which emerging numerical technologies might be employed to address these attributes will also be presented

David M Schuster↗

Adaptive Dynamic Simulations for Distribution Systems Using Multistate Load Models

Running electromechanical simulations with a small time-step for a long period of time is computationally challenging, especially when large system models are used. Typically, simulations with a small time-step, 1 millisecond or less, are only run for a few seconds or a couple of minutes. While this trade-off has allowed for short duration simulations of large systems, it has prevented the complete analysis of power system phenomena that span minutes to hours, such as fault induced delayed voltage recovery. As power system operations become more complex with the deployment of new technologies, it will become more important to model dynamic behavior over greater time scales. This will include the ability to model system dynamics at the distribution level, including the end-use loads. This paper will present a computationally efficient method of adaptive dynamic simulations that enable transitions between time-series and dynamic modes, as necessary to capture system dynamics, while also being able to run for extended periods of time. This capability can support the direct analysis of dynamic events, co-simulation of transmission and distribution systems, and the development of reduced-order models.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A novel digital pulse processing architecture for nuclear instrumentation

The field of nuclear instrumentation covers a wide range of applications, including counting, spectrometry, pulse shape discrimination and multi-channel coincidence. These applications are the topic of many researches, new algorithms and implementations are constantly proposed thanks to advances in digital signal processing. However, these improvements are not yet implemented in instrumentation devices. This is especially true for neutron-gamma discrimination applications which traditionally use charge comparison method while literature proposes other algorithms based on frequency domain or wavelet theory which show better performances. Another example is pileups which are generally rejected while pileup correction algorithms also exist. These processes are traditionally performed offline due to two issues. The first is the Poissonian characteristic of the signal, composed of random arrival pulses which requires to current architectures to work in data flow. The second is the real-time requirement, which implies losing pulses when the pulse rate is too high. Despite the possibility of treating the pulses independently from each other, current architectures paralyze the acquisition of the signal during the processing of a pulse. This loss is called dead-time. These two issues have led current architectures to use dedicated solutions based on re-configurable components like Field Programmable Gate Arrays (FPGAs) to overcome the need of performance necessary to deal with dead-time. However, dedicated hardware algorithm implementations on re-configurable technologies are complex and time-consuming. For all these reasons, a programmable Digital pulse Processing (DPP) architecture in a high level language such as Cor C++ which can reduce dead-time would be worthwhile for nuclear instrumentation. This would reduce prototyping and test duration by reducing the level of hardware expertise to implement new algorithms. However, today's programmable solutions do not meet the need of performance to operate online and not allow scaling with the increase in the number of measurement channel. That is why an innovative DPP architecture is proposed in this paper. This architecture is able to overcome dead-time while being programmable and is flexible with the number of measurement channel. Proposed architecture is based on an innovative execution model for pulse processing applications which can be summarized as follow. The signal is not composed of pulses only, consequently, pulses processing does not have to operate on the entire signal. Therefore, the first step of our proposal is pulse extraction by the use of dedicated components named pulse extractors. The triggering step can be achieved after the analog-to-digital conversion without any signal shaping or filtering stages. Pileup detection and accurate pulse time stamping are done at this stage. Any application downstream this step can work on adaptive variable-sized array of samples simplifying pulse processing methods. Then, once the data flow is broken, it is possible to distribute pulses on Functional Units (FUs) which perform processing. As the date of each pulse is known, they can be processed individually out-of-order to provide the results. To manage the pulses distribution, a scheduler and an interconnection network are used. pulses are distributed on the first FU which is not busy without congesting the interconnection network. For this reason, the process duration does not result anymore in dead-time if there are enough FUs. FUs are designed to be standalone and to comprises at least a programmable general purpose processor (ARM, Microblaze) allowing the implementation of complex algorithms without any modification of the hardware. An acquisition chain is composed of a succession of algorithms which lead to organize our FUs as a software macro-pipeline, A simple approach consists in assigning one algorithm per FU. Consequently, the global latency becomes the worst latency of algorithms execution on FU. Moreover, as algorithms are executed locally - i.e. on a FU - this approach limits shared memory requirement. To handle multichannel, we propose FUs sharing, this approach maximize the chance to find a non-busy FU to process an incoming pulse. This is possible since each channel receive random event independently, the pulse extractors associated to them do not necessarily need to access simultaneously to all Computing resources at the same time to distribute their pulses. The major contribution of this paper is the proposition of an execution model and its associated hardware programmable architecture for digital pulse processing that can handle multiple acquisition channels while maintaining the scalability thanks to the use of shared resources. This execution model and associated architecture are validated by simulation of a cycle accurate architecture SystemC model. Proposed architecture shows promising results in terms of scalability while maintaining zero dead-time. This work also permit the sizing of hardware resources requirement required for a predefined set of applications. Future work will focus on the interconnection network and a scheduling policy that can exploit the variable-length of pulses. Then, the hardware implementation of this architecture will be performed and tested for a representative set of application.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Cardinal: Seismic and Geoacoustic Array Processing

Data collected via seismic and infrasound array deployments are leveraged in the geosciences to detect and characterize a myriad of natural and anthropogenic sources. These deployments consist of numerous sensors placed in a predetermined configuration to amplify signal strength and improve the efficacy of array processing techniques used to measure signal directionality and waveform coherence. High‐fidelity feature extraction is often predicated on interstation distance as well as the frequency content and wavelength of an incident signal. Numerous array processing softwares analyze data in sequential frequency bands to obtain a more detailed characterization of a signal. However, current algorithms are limited in their ability to determine optimal array configuration for each band. We introduce an open‐source Python code, called Cardinal, to process seismic and infrasound array data in discretized time–frequency space with the option of applying an adaptive array design to determine optimal subarray configuration for each frequency band. To reduce computational time, the array processing step can be run in parallel using multithreading. Furthermore, the software has the capability to aggregate array processing results from different time–frequency pixels to produce separate sets of detections, or families, with added utility via the application of an adaptive semblance threshold, which aids in isolating signals‐of‐interest from coherent background noise. Upon appropriate configuration, Cardinal exhibits the potential to combine distinct seismic and infrasound phases into separate families.

Adaptive Array↗

Intelligent Triggers for Rare Event Detection in Liquid Argon Detectors

Next-generation neutrino experiments like SBND and DUNE rely on Liquid Argon Time Projection Chambers (LArTPCs), which produce exceptionally detailed data at high volume. Capturing rare or unexpected events in real-time is a major challenge. Our project explores the use of machine learning, specifically autoencoder-based anomaly detection, to identify unusual activity directly from raw detector signals. Inspired by successes at the CMS experiment, we demonstrate that such methods can be adapted to LArTPCs and show promising results in both simulated studies and early steps toward real-time hardware deployment. This approach could open new avenues for detecting signals from physics beyond the Standard Model.

Chung, Seokju [Columbia U. (main)]↗

Parallel adaptive fluid-structure interaction simulation of explosions impacting on building structures

We pursue a level set approach to couple an Eulerian shock-capturing fluid solver with space-time refinement to an explicit solid dynamics solver for large deformations and fracture. The coupling algorithms considering recursively finer fluid time steps as well as overlapping solver updates are discussed in detail. Our ideas are implemented in the AMROC adaptive fluid solver framework and are used for effective fluid-structure coupling to the general purpose solid dynamics code DYNA3D. Beside simulations verifying the coupled fluid-structure solver and assessing its parallel scalability, the detailed structural analysis of a reinforced concrete column under blast loading and the simulation of a prototypical blast explosion in a realistic multistory building are presented.

Deiterding, Ralf↗

A fourth-order adaptive mesh refinement algorithm for the multicomponent, reacting compressible Navier–Stokes equations

In this study, we present a fourth-order in space and time block-structured adaptive mesh refinement algorithm for the compressible multicomponent reacting Navier–Stokes equations. The algorithm uses a finite-volume approach that incorporates a fourth-order discretisation of the convective terms. The time-stepping algorithm is based on a multi-level spectral deferred corrections method that enables explicit treatment of advection and diffusion coupled with an implicit treatment of reactions. The temporal scheme is embedded in a block-structured adaptive mesh refinement algorithm that includes subcycling in time with spectral deferred correction sweeps applied on levels. Here we present the details of the multi-level scheme paying particular attention to the treatment of coarse–fine boundaries required to maintain fourth-order accuracy in time. We then demonstrate the convergence properties of the algorithm on several test cases including both non-reacting and reacting flows. Finally we present simulations of a vitiated dimethyl ether jet in 2D and a turbulent hydrogen jet in 3D, both with detailed kinetics and transport.

97 MATHEMATICS AND COMPUTING↗

Analysis of High Order Difference Methods for Multiscale Complex Compressible Flows

Accurate numerical simulations of complex multiscale compressible viscous flows, especially high speed turbulence combustion and acoustics, demand high order schemes with adaptive numerical dissipation controls. Standard high resolution shock-capturing methods are too dissipative to capture the small scales and/or long-time wave propagations without extreme grid refinements and small time steps. An integrated approach for the control of numerical dissipation in high order schemes with incremental studies was initiated. Here we further refine the analysis on, and improve the understanding of the adaptive numerical dissipation control strategy. Basically, the development of these schemes focuses on high order nondissipative schemes and takes advantage of the progress that has been made for the last 30 years in numerical methods for conservation laws, such as techniques for imposing boundary conditions, techniques for stability at shock waves, and techniques for stable and accurate long-time integration. We concentrate on high order centered spatial discretizations and a fourth-order Runge-Kutta temporal discretizations as the base scheme. Near the bound-aries, the base scheme has stable boundary difference operators. To further enhance stability, the split form of the inviscid flux derivatives is frequently used for smooth flow problems. To enhance nonlinear stability, linear high order numerical dissipations are employed away from discontinuities, and nonlinear filters are employed after each time step in order to suppress spurious oscillations near discontinuities to minimize the smearing of turbulent fluctuations. Although these schemes are built from many components, each of which is well-known, it is not entirely obvious how the different components be best connected. For example, the nonlinear filter could instead have been built into the spatial discretization, so that it would have been activated at each stage in the Runge-Kutta time stepping. We could think of a mechanism that activates the split form of the equations only at some parts of the domain. Another issue is how to define good sensors for determining in which parts of the computational domain a certain feature should be filtered by the appropriate numerical dissipation. For the present study we employ a wavelet technique introduced in as sensors. Here, the method is briefly described with selected numerical experiments.

Sjoegreen, Bjoern↗

Construction of low dissipative high-order well-balanced filter schemes for non-equilibrium flows

The goal of this paper is to generalize the well-balanced approach for non-equilibrium flow studied by Wang et al. (2009) to a class of low dissipative high-order shock-capturing filter schemes and to explore more advantages of well-balanced schemes in reacting flows. More general 1D and 2D reacting flow models and new examples of shock turbulence interactions are provided to demonstrate the advantage of well-balanced schemes. The class of filter schemes developed by Yee et al. (1999) , Sjoegreen and Yee (2004) and Yee and Sjoegreen (2007) consist of two steps, a full time step of spatially high-order non-dissipative base scheme and an adaptive non-linear filter containing shock-capturing dissipation. A good property of the filter scheme is that the base scheme and the filter are stand-alone modules in designing. Therefore, the idea of designing a well-balanced filter scheme is straightforward, i.e. choosing a well-balanced base scheme with a well-balanced filter (both with high-order accuracy). A typical class of these schemes shown in this paper is the high-order central difference schemes/predictor-corrector (PC) schemes with a high-order well-balanced WENO filter. The new filter scheme with the well-balanced property will gather the features of both filter methods and well-balanced properties: it can preserve certain steady-state solutions exactly; it is able to capture small perturbations, e.g. turbulence fluctuations; and it adaptively controls numerical dissipation. Thus it shows high accuracy, efficiency and stability in shock/turbulence interactions. Numerical examples containing 1D and 2D smooth problems, 1D stationary contact discontinuity problem and 1D turbulence/shock interactions are included to verify the improved accuracy, in addition to the well-balanced behavior.

97 MATHEMATICS AND COMPUTING↗