Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Marching Methods”

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 55 records · Page 3

Development of iterative techniques for the solution of unsteady compressible viscous flows

Efficient iterative solution methods are being developed for the numerical solution of two- and three-dimensional compressible Navier-Stokes equations. Iterative time marching methods have several advantages over classical multi-step explicit time marching schemes, and non-iterative implicit time marching schemes. Iterative schemes have better stability characteristics than non-iterative explicit and implicit schemes. Thus, the extra work required by iterative schemes can also be designed to perform efficiently on current and future generation scalable, missively parallel machines. An obvious candidate for iteratively solving the system of coupled nonlinear algebraic equations arising in CFD applications is the Newton method. Newton's method was implemented in existing finite difference and finite volume methods. Depending on the complexity of the problem, the number of Newton iterations needed per step to solve the discretized system of equations can, however, vary dramatically from a few to several hundred. Another popular approach based on the classical conjugate gradient method, known as the GMRES (Generalized Minimum Residual) algorithm is investigated. The GMRES algorithm was used in the past by a number of researchers for solving steady viscous and inviscid flow problems with considerable success. Here, the suitability of this algorithm is investigated for solving the system of nonlinear equations that arise in unsteady Navier-Stokes solvers at each time step. Unlike the Newton method which attempts to drive the error in the solution at each and every node down to zero, the GMRES algorithm only seeks to minimize the L2 norm of the error. In the GMRES algorithm the changes in the flow properties from one time step to the next are assumed to be the sum of a set of orthogonal vectors. By choosing the number of vectors to a reasonably small value N (between 5 and 20) the work required for advancing the solution from one time step to the next may be kept to (N+1) times that of a noniterative scheme. Many of the operations required by the GMRES algorithm such as matrix-vector multiplies, matrix additions and subtractions can all be vectorized and parallelized efficiently.

Sankar, Lakshmi N.↗

Harmonic Balance Computations of Fan Aeroelastic Stability

A harmonic balance (HB) aeroelastic analysis, which has been recently developed, was used to determine the aeroelastic stability (flutter) characteristics of an experimental fan. To assess the numerical accuracy of this HB aeroelastic analysis, a time-domain aeroelastic analysis was also used to determine the aeroelastic stability characteristics of the same fan. Both of these three-dimensional analysis codes model the unsteady flowfield due to blade vibrations using the Reynolds-averaged Navier-Stokes (RANS) equations. In the HB analysis, the unsteady flow equations are converted to a HB form and solved using a pseudo-time marching method. In the time-domain analysis, the unsteady flow equations are solved using an implicit time-marching approach. Steady and unsteady computations for two vibration modes were carried out at two rotational speeds: 100 percent (design) and 70 percent (part-speed). The steady and unsteady results obtained from the two analysis methods compare well, thus verifying the recently developed HB aeroelastic analysis. Based on the results, the experimental fan was found to have no aeroelastic instability (flutter) at the conditions examined in this study.

Bakhle, Milind A.↗

Convergence acceleration of an aeroelastic Navier-Stokes solver

New capabilities have been added to a Navier-Stokes solver to perform steady-state simulations more efficiently. The flow solver for solving the Navier-Stokes equations is completely rewritten with a combination of the LU-SGS (Lower-Upper factored Symmetric Gauss-Seidel) implicit method and the modified HLLE (Harten-Lax-van Leer-Einfeldt) upwind scheme. A pseudo-time marching method is used for the directly coupled structural equations to improve overall convergence rates for static aeroelastic analysis. Results are demonstrated for transonic flows over rigid and flexible wings.

Obayashi, S.↗

Convergence Acceleration of a Navier-Stokes Solver for Efficient Static Aeroelastic Computations

New capabilities have been developed for a Navier-Stokes solver to perform steady-state simulations more efficiently. The flow solver for solving the Navier-Stokes equations is based on a combination of the lower-upper factored symmetric Gauss-Seidel implicit method and the modified Harten-Lax-van Leer-Einfeldt upwind scheme. A numerically stable and efficient pseudo-time-marching method is also developed for computing steady flows over flexible wings. Results are demonstrated for transonic flows over rigid and flexible wings.

Obayashi, Shigeru↗

A linearized Euler analysis of unsteady flows in turbomachinery

A method for calculating unsteady flows in cascades is presented. The model, which is based on the linearized unsteady Euler equations, accounts for blade loading shock motion, wake motion, and blade geometry. The mean flow through the cascade is determined by solving the full nonlinear Euler equations. Assuming the unsteadiness in the flow is small, then the Euler equations are linearized about the mean flow to obtain a set of linear variable coefficient equations which describe the small amplitude, harmonic motion of the flow. These equations are discretized on a computational grid via a finite volume operator and solved directly subject to an appropriate set of linearized boundary conditions. The steady flow, which is calculated prior to the unsteady flow, is found via a Newton iteration procedure. An important feature of the analysis is the use of shock fitting to model steady and unsteady shocks. Use of the Euler equations with the unsteady Rankine-Hugoniot shock jump conditions correctly models the generation of steady and unsteady entropy and vorticity at shocks. In particular, the low frequency shock displacement is correctly predicted. Results of this method are presented for a variety of test cases. Predicted unsteady transonic flows in channels are compared to full nonlinear Euler solutions obtained using time-accurate, time-marching methods. The agreement between the two methods is excellent for small to moderate levels of flow unsteadiness. The method is also used to predict unsteady flows in cascades due to blade motion (flutter problem) and incoming disturbances (gust response problem).

Hall, Kenneth C.↗

Calculation of unsteady flows in turbomachinery using the linearized Euler equations

A method for calculating unsteady flows in cascades is presented. The model, which is based on the linearized unsteady Euler equations, accounts for blade loading shock motion, wake motion, and blade geometry. The mean flow through the cascade is determined by solving the full nonlinear Euler equations. Assuming the unsteadiness in the flow is small, then the Euler equations are linearized about the mean flow to obtain a set of linear variable coefficient equations which describe the small amplitude, harmonic motion of the flow. These equations are discretized on a computational grid via a finite volume operator and solved directly subject to an appropriate set of linearized boundary conditions. The steady flow, which is calculated prior to the unsteady flow, is found via a Newton iteration procedure. An important feature of the analysis is the use of shock fitting to model steady and unsteady shocks. Use of the Euler equations with the unsteady Rankine-Hugoniot shock jump conditions correctly models the generation of steady and unsteady entropy and vorticity at shocks. In particular, the low frequency shock displacement is correctly predicted. Results of this method are presented for a variety of test cases. Predicted unsteady transonic flows in channels are compared to full nonlinear Euler solutions obtained using time-accurate, time-marching methods. The agreement between the two methods is excellent for small to moderate levels of flow unsteadiness. The method is also used to predict unsteady flows in cascades due to blade motion (flutter problem) and incoming disturbances (gust response problem).

Hall, Kenneth C.↗

A parallel adaptive numerical method with generalized curvilinear coordinate transformation for compressible Navier–Stokes equations

A fourth-order finite-volume method for solving the Navier–Stokes equations on a mapped grid with adaptive mesh refinement is proposed, implemented, and demonstrated for the prediction of unsteady compressible viscous flows. The method employs fourth-order quadrature rules for evaluating face-averaged fluxes. Our approach is freestream preserving, guaranteed by the way of computing the averages of the metric terms on the faces of cells. The standard Runge–Kutta marching method is used for time discretization. Solutions of a smooth flow are obtained in order to verify that the method is formally fourth-order accurate when applying the nonlinear viscous operators on mapped grids. Solutions of a shock tube problem are obtained to demonstrate the effectiveness of adaptive mesh refinement in resolving discontinuities. A Mach reflection problem is solved to demonstrate the mapped algorithm on a non-rectangular physical domain. The simulation is compared against experimental results. Future work will consider mapped multiblock grids for practical engineering geometries.

97 MATHEMATICS AND COMPUTING↗

A Review of High-Order and Optimized Finite-Difference Methods for Simulating Linear Wave Phenomena

This paper presents a review of high-order and optimized finite-difference methods for numerically simulating the propagation and scattering of linear waves, such as electromagnetic, acoustic, or elastic waves. The spatial operators reviewed include compact schemes, non-compact schemes, schemes on staggered grids, and schemes which are optimized to produce specific characteristics. The time-marching methods discussed include Runge-Kutta methods, Adams-Bashforth methods, and the leapfrog method. In addition, the following fourth-order fully-discrete finite-difference methods are considered: a one-step implicit scheme with a three-point spatial stencil, a one-step explicit scheme with a five-point spatial stencil, and a two-step explicit scheme with a five-point spatial stencil. For each method studied, the number of grid points per wavelength required for accurate simulation of wave propagation over large distances is presented. Recommendations are made with respect to the suitability of the methods for specific problems and practical aspects of their use, such as appropriate Courant numbers and grid densities. Avenues for future research are suggested.

Zingg, David W.↗

Development of Computational Aeroacoustics Code for Jet Noise and Flow Prediction

Accurate prediction of jet fan and exhaust plume flow and noise generation and propagation is very important in developing advanced aircraft engines that will pass current and future noise regulations. In jet fan flows as well as exhaust plumes, two major sources of noise are present: large-scale, coherent instabilities and small-scale turbulent eddies. In previous work for the NASA Glenn Research Center, three strategies have been explored in an effort to computationally predict the noise radiation from supersonic jet exhaust plumes. In order from the least expensive computationally to the most expensive computationally, these are: 1) Linearized Euler equations (LEE). 2) Very Large Eddy Simulations (VLES). 3) Large Eddy Simulations (LES). The first method solves the linearized Euler equations (LEE). These equations are obtained by linearizing about a given mean flow and the neglecting viscous effects. In this way, the noise from large-scale instabilities can be found for a given mean flow. The linearized Euler equations are computationally inexpensive, and have produced good noise results for supersonic jets where the large-scale instability noise dominates, as well as for the tone noise from a jet engine blade row. However, these linear equations do not predict the absolute magnitude of the noise; instead, only the relative magnitude is predicted. Also, the predicted disturbances do not modify the mean flow, removing a physical mechanism by which the amplitude of the disturbance may be controlled. Recent research for isolated airfoils' indicates that this may not affect the solution greatly at low frequencies. The second method addresses some of the concerns raised by the LEE method. In this approach, called Very Large Eddy Simulation (VLES), the unsteady Reynolds averaged Navier-Stokes equations are solved directly using a high-accuracy computational aeroacoustics numerical scheme. With the addition of a two-equation turbulence model and the use of a relatively coarse grid, the numerical solution is effectively filtered into a directly calculated mean flow with the small-scale turbulence being modeled, and an unsteady large-scale component that is also being directly calculated. In this way, the unsteady disturbances are calculated in a nonlinear way, with a direct effect on the mean flow. This method is not as fast as the LEE approach, but does have many advantages to recommend it; however, like the LEE approach, only the effect of the largest unsteady structures will be captured. An initial calculation was performed on a supersonic jet exhaust plume, with promising results, but the calculation was hampered by the explicit time marching scheme that was employed. This explicit scheme required a very small time step to resolve the nozzle boundary layer, which caused a long run time. Current work is focused on testing a lower-order implicit time marching method to combat this problem.

Keith, Theo G., Jr.↗

Automation of Overset Structured Mesh Generation onBoundary Representation Geometries

A scheme is presented for the automatic generation of structured overset meshes ongeometries that are defined by Boundary Representation (BRep) solids. The surface meshsystem consists of face, edge and node meshes corresponding to the three respective basicBRep entity types. A cut-cell method is introduced to improve robustness of the on-geometrydetermination test for a face mesh grid point. A geometric component tagging scheme is utilizedto enhance local grid point distribution on a configuration with a large range of geometricscales. A cap grid topology is automatically utilized around the trailing edge of wing and tailtips to enhance mesh quality and to enable more effective surface coverage. Robustness of thehyperbolic surface marching method is improved by replacing the point projection scheme witha walking scheme. Relaxation of surface grid spacing at concave corners enables automatedhigh quality hyperbolic volume mesh creation. Domain connectivity is automatically performedon the surface mesh system. A variety of test cases are presented including a re-entry capsule,two models of the Juncture Flow Experiment wing-body, five rotorcraft concept vehicles, andvarious components of the High-Lift Common Research Model from the High-Lift PredictionWorkshop 4.

TTT↗

Tracking fuzzy borders using geodesic curves with application to liver segmentation on planning CT

Purpose: This work aims to develop a robust and efficient method to track the fuzzy borders between liver and the abutted organs where automatic liver segmentation usually suffers, and to investigate its applications in automatic liver segmentation on noncontrast-enhanced planning computed tomography (CT) images. Methods: In order to track the fuzzy liver–chestwall and liver–heart borders where oversegmentation is often found, a starting point and an ending point were first identified on the coronal view images; the fuzzy border was then determined as a geodesic curve constructed by minimizing the gradient-weighted path length between these two points near the fuzzy border. The minimization of path length was numerically solved by fast-marching method. The resultant fuzzy borders were incorporated into the authors’ automatic segmentation scheme, in which the liver was initially estimated by a patient-specific adaptive thresholding and then refined by a geodesic active contour model. By using planning CT images of 15 liver patients treated with stereotactic body radiation therapy, the liver contours extracted by the proposed computerized scheme were compared with those manually delineated by a radiation oncologist. Results: The proposed automatic liver segmentation method yielded an average Dice similarity coefficient of 0.930 ± 0.015, whereas it was 0.912 ± 0.020 if the fuzzy border tracking was not used. The application of fuzzy border tracking was found to significantly improve the segmentation performance. The mean liver volume obtained by the proposed method was 1727 cm{sup 3}, whereas it was 1719 cm{sup 3} for manual-outlined volumes. The computer-generated liver volumes achieved excellent agreement with manual-outlined volumes with correlation coefficient of 0.98. Conclusions: The proposed method was shown to provide accurate segmentation for liver in the planning CT images where contrast agent is not applied. The authors’ results also clearly demonstrated that the application of tracking the fuzzy borders could significantly reduce contour leakage during active contour evolution.

60 APPLIED LIFE SCIENCES↗

A Textbook for a First Course in Computational Fluid Dynamics

This paper describes and discusses the textbook, Fundamentals of Computational Fluid Dynamics by Lomax, Pulliam, and Zingg, which is intended for a graduate level first course in computational fluid dynamics. This textbook emphasizes fundamental concepts in developing, analyzing, and understanding numerical methods for the partial differential equations governing the physics of fluid flow. Its underlying philosophy is that the theory of linear algebra and the attendant eigenanalysis of linear systems provides a mathematical framework to describe and unify most numerical methods in common use in the field of fluid dynamics. Two linear model equations, the linear convection and diffusion equations, are used to illustrate concepts throughout. Emphasis is on the semi-discrete approach, in which the governing partial differential equations (PDE's) are reduced to systems of ordinary differential equations (ODE's) through a discretization of the spatial derivatives. The ordinary differential equations are then reduced to ordinary difference equations (O(Delta)E's) using a time-marching method. This methodology, using the progression from PDE through ODE's to O(Delta)E's, together with the use of the eigensystems of tridiagonal matrices and the theory of O(Delta)E's, gives the book its distinctiveness and provides a sound basis for a deep understanding of fundamental concepts in computational fluid dynamics.

Zingg, D. W.↗

Structured Overset and Unstructured Grid Simulations for the Third AIAA Sonic Boom Prediction Workshop

Predictions using the Launch Ascent and Vehicle Aerodynamics (LAVA) Unstructured and Structured Curvilinear solvers for the Biconvex and C608 geometries are compared in support of the 3rd AIAA Sonic Boom Prediction workshop. Description of the mesh generation techniques and numerical methods are provided along with a comparison of nearfield and far-field predictions with available experimental data as well as other workshop sub-missions. Strong consistency was observed between the Biconvex and C608 nearfield predictions across the two solvers used for this study, as well as validation and verification data. Additionally, near-field and farfield ground signature results using a combination of a truncated computational fluid dynamics (CFD) domain coupled to a mid-field space marching method and propagated to the ground using sBOOM will be discussed. This approach is shown to provide an efficient way to propagate near-field pressure signatures to the ground with the same accuracy as the near-field CFD coupled to sBOOM, but at less computational cost.

CST↗

An accelerated threshold-based back-projection algorithm for Compton camera image reconstruction

Purpose: Compton camera imaging (CCI) systems are currently under investigation for radiotherapy dose reconstruction and verification. The ability of such a system to provide real-time images during dose delivery will be limited by the computational speed of the image reconstruction algorithm. In this work, the authors present a fast and simple method by which to generate an initial back-projected image from acquired CCI data, suitable for use in a filtered back-projection algorithm or as a starting point for iterative reconstruction algorithms, and compare its performance to the current state of the art. Methods: Each detector event in a CCI system describes a conical surface that includes the true point of origin of the detected photon. Numerical image reconstruction algorithms require, as a first step, the back-projection of each of these conical surfaces into an image space. The algorithm presented here first generates a solution matrix for each slice of the image space by solving the intersection of the conical surface with the image plane. Each element of the solution matrix is proportional to the distance of the corresponding voxel from the true intersection curve. A threshold function was developed to extract those pixels sufficiently close to the true intersection to generate a binary intersection curve. This process is repeated for each image plane for each CCI detector event, resulting in a three-dimensional back-projection image. The performance of this algorithm was tested against a marching algorithm known for speed and accuracy. Results: The threshold-based algorithm was found to be approximately four times faster than the current state of the art with minimal deficit to image quality, arising from the fact that a generically applicable threshold function cannot provide perfect results in all situations. The algorithm fails to extract a complete intersection curve in image slices near the detector surface for detector event cones having axes nearly parallel to the image plane. This effect decreases the sum of the image, thereby also affecting the mean, standard deviation, and SNR of the image. All back-projected events associated with a simulated point source intersected the voxel containing the source and the FWHM of the back-projected image was similar to that obtained from the marching method. Conclusions: The slight deficit to image quality observed with the threshold-based back-projection algorithm described here is outweighed by the 75% reduction in computation time. The implementation of this method requires the development of an optimum threshold function, which determines the overall accuracy of the method. This makes the algorithm well-suited to applications involving the reconstruction of many large images, where the time invested in threshold development is offset by the decreased image reconstruction time. Implemented in a parallel-computing environment, the threshold-based algorithm has the potential to provide real-time dose verification for radiation therapy.

60 APPLIED LIFE SCIENCES↗

Dependence of mobility on the electron concentration upon scattering at polar optical phonons in A{sup III}–N nitrides

The dependence of the effective relaxation time on the electron concentration in A{sup III}–N nitrides in the case of electron scattering at polar longitudinal optical phonons is calculated by the marching method. The method takes into account the inelasticity of electron scattering at polar optical phonons for nitrides in the zinc-blende approximation. The calculations show a substantial increase in mobility in samples with a degenerate electron gas, if screening of the long-range potential of polar longitudinal optical phonons is taken into account.

36 MATERIALS SCIENCE↗

Rapid Simulation of Unconventional Reservoirs by Multidomain Multiresolution Modeling Based on the Diffusive Time of Flight

Summary The fast marching method (FMM)-based rapid flow simulation has been shown to accelerate simulation efficiency by orders of magnitude by transforming 3D simulation to equivalent 1D simulation using the concept of the “diffusive time of flight” (DTOF). However, the 1D transformation does not directly apply to multiwell problems. In this paper, we propose a novel DTOF-based multidomain multiresolution discretization scheme to accelerate multiwell simulation of unconventional reservoirs. Our method formulates multiwell simulation problems based on the DTOF which displays the pressure front propagation in unconventional reservoirs. The DTOF contours are used to partition the reservoir into local and shared domains. A local domain is where the flow is dominated by a single well, and the shared domain is where the fluid flow is influenced by multiple wells. The DTOF contours expand independently in local domains and interfere in the shared domain. After the partitioning, each domain is discretized using a multiresolution scheme whereby the original 3D fine mesh is preserved near the wells to account for detailed physics including gravity, and the rest of the domain is discretized into 1D mesh based on the DTOF contours to alleviate the simulation workload. The power and efficacy of our approach are demonstrated using synthetic and field-scale simulation models with different degrees of geologic and well-completion complexity. The simulation results, number of active cells, and computation time for the proposed discretization scheme are compared with the original high-fidelity 3D model for each case. The results show that the proposed method is suitable for multiwell simulation problems in unconventional reservoirs and can accelerate flow simulations by orders of magnitude with minimal loss of accuracy. The novelty of this work is the creation of DTOF-derived multiresolution discretization with local and shared domains to simplify and accelerate the calculation of subsurface flow problems, especially in unconventional reservoirs. Our workflow can be easily interfaced with commercial simulators, making it suitable for large-scale field applications.

Engineering↗

CO2 Plume Imaging with Accelerated Deep Learning-based Data Assimilation Considering Multiple Realizations: Application to the Illinois Basin-Decatur Carbon Sequestration Project

We propose a fast and efficient deep learning workflow for near real-time data assimilation, forecasting and visualization of CO2 plume evolution in saline aquifer and demonstrate its application at a field site. Unlike the previous work, this study incorporates the impact of spatial heterogeneity using multiple realizations. In the proposed workflow, a neural network model utilizes available monitoring data such as downhole pressure measurements as input and predicts the propagating pressure ‘front’ using the diffusive time of flight (DTOF) map which is considered as representative reservoir image of the flow field. The DTOF is the arrival time of pressure front propagation, which can be computed by the Fast Marching Method rapidly without flow simulations. Reservoir model calibration can be implemented by selecting the training data samples that describe the predicted DTOF map based on observed data. The power and efficacy of our workflow is demonstrated by application to the Illinois Basin-Decatur Project.

CO2 plume imaging↗

A Tensor Network-Based Quantum Algorithm for the Nonlinear 1D Burgers' Equation

In this work, we implement a tensor network-based quantum algorithm to solve unsteady, nonlinear partial differential equations (PDEs). The challenge lies in how to effectively represent, encode, process, and evolve the nonlinear system of PDEs on quantum computers. We will discuss the new techniques using the compressible 1-dimensional (1D) Burgers' equation as an example, because it represents the fundamental nonlinear feature and yet removes certain complexity in physics, allowing us to focus on the design of quantum algorithms. Previous attempts to solve nonlinear PDEs in quantum computation have often involved storing multiple copies of solutions or employing linearizations. Neither is practical due to exponential scaling with evolution time or insufficient solution accuracy. Our framework is based on matrix product states (MPSs) and matrix product operators (MPOs). For example, the velocity field is represented by MPS, whereas the linear and nonlinear spatial differential terms of the velocity field are processed by MPOs. Our primary focus herein is to verify and validate the various tensor network components of the algorithm using solutions obtained by the classical algorithms on high performance computing (HPC) architectures. We use a classical time marching method to demonstrate the functionality of the tensor network operations to model the PDE and their robustness with the time evolution of the system. Our classical simulation results demonstrate the utility of tensor network-based operations in modeling nonlinear PDEs and highlight the necessity as well as potential advantages of using quantum simulations for these techniques.

Gopalakrishnan Meena, Murali [ORNL] (ORCID:0000000↗