SEARCH · Search NASA
Results for “numerical algorithm computing”
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.
An adaptive discontinuous Petrov-Galerkin method for the Grad-Shafranov equation
In this work, we propose and develop an arbitrary-order adaptive discontinuous Petrov--Galerkin (DPG) method for the nonlinear Grad--Shafranov equation. An ultraweak formulation of the DPG scheme for the equation is given based on a minimal residual method. The DPG scheme has the advantage of providing more accurate gradients compared to conventional finite element methods, which is desired for numerical solutions to the Grad--Shafranov equation. The numerical scheme is augmented with an adaptive mesh refinement approach, and a criterion based on the residual norm in the minimal residual method is developed to achieve dynamic refinement. Nonlinear solvers for the resulting system are explored and a Picard iteration with Anderson acceleration is found to be efficient to solve the system. Finally, the proposed algorithm is implemented in parallel on MFEM using a domain-decomposition approach, and our implementation is general, supporting arbitrary order of accuracy and general meshes. Furthermore, numerical results are presented to demonstrate the efficiency and accuracy of the proposed algorithm.
CyGutz
This software is an efficient computational package of the Gutzwiller variational method. It solves the Gutzwiller variational problem for general multiband models with arbitrary on-site interaction in a fully self-consistent numerical approach. The underlying algorithm drastically reduces the problem of the high-dimensional Gutzwiller minimization by mapping it to a minimization only in the variational density matrix. For fixed density the Gutzwiller renormalization matrix is determined as a fix-point of a proper functional, whose evaluation requires only ground-state calculations of matrices defined in the Gutzwiller variational space. Furthermore, the package is able to account for the symmetries of the variational function in a controlled way, reducing the number of variational parameters. The software is highly efficient and robust, and is particularly suitable for first-principles studies (e.g., in combination with DFT) of many complex real materials, where the full intra-atomic interaction is important to obtain correct results.
Fast Dynamic Simulation-Based Small Signal Stability Assessment and Control
Power grid planning and operation decisions are made based on simulation of the dynamic behavior of the system. Enabling substantial energy savings while increasing the reliability of the aging North American power grid through improved utilization of existing transmission assets hinges on the adoption of wide-area measurement systems (WAMS) for power system stabilization. However, adoption of WAMS alone will not suffice if the power system is to reach its full entitlement in stability and reliability. It is necessary to enhance predictability with "faster than real-time" dynamic simulations that will enable the dynamic stability margins, proactive real-time control, and improve grid resiliency to fast time-scale phenomena such as cascading network failures. Present-day dynamic simulations are performed only during offline planning studies, considering only worst case conditions such as summer peak, winter peak days, etc. With widespread deployment of renewable generation, controllable loads, energy storage devices and plug-in hybrid electric vehicles expected in the near future and greater integration of cyber infrastructure (communications, computation and control), monitoring and controlling the dynamic performance of the grid in real-time would become increasingly important. The state-of-the-art dynamic simulation tools have limited computational speed and are not suitable for real-time applications, given the large set of contingency conditions to be evaluated. These tools are optimized for best performance of single-processor computers, but the simulation is still several times slower than real-time due to its computational complexity. With recent significant advances in numerical methods and computational hardware, the expectations have been rising towards more efficient and faster techniques to be implemented in power system simulators. This is a natural expectation, given that the core solution algorithms of most commercial simulators were developed decades ago, when High Performance Computing (HPC) resources were not commonly available.
Distributed Barrier Certificates for Safe Operation of Inverter-Based Microgrids
Inverter-interfaced microgrids differ from the traditional power systems due to their lack of inertia. Vanishing timescale separation between voltage and frequency dynamics makes it critical that faster-timescale stabilizing control laws also guarantee by-construction the satisfaction of voltage limits during transients. In this article, we apply a barrier functions method to compute distributed active and reactive power setpoint control laws that certify satisfaction of voltage limits during transients. Using sum-of-squares optimization tools, we propose an algorithmic construction of these control laws. Numerical simulations are provided to illustrate the proposed method.
Velocity-Space Hybridization of Direct Simulation Monte Carlo and a Quasi-Particle Boltzmann Solver
This paper presents a new method for modeling rarefied gas flows based on hybridization of direct simulation Monte Carlo (DSMC) and discrete velocity method (DVM)-based quasi-particle representations of the velocity distribution function. It is aimed at improving the resolution of the tails of the distribution function (compared with DSMC) and computational efficiency (compared with DVM). Details of the method, such as the collision algorithm and the particle merging scheme, are discussed. The hybrid approach is applied to the study of noise in a Maxwellian distribution, computation of electron-impact ionization rate coefficient, as well as numerical simulation of a supersonic Couette flow. The hybrid-based solver is compared with pure DSMC and DVM approaches in terms of accuracy, computational speed, and memory use. It is shown that such a hybrid approach can provide a lower computational cost than a pure DVM approach, while being able to retain accuracy in modeling high-velocity tails of the distribution function. For problems where trace species have a significant impact on the flow physics, the proposed method is shown to be capable of providing better computational efficiency and accuracy compared with standard fixed-weight DSMC.
Projected role of advanced computational aerodynamic methods at the Lockheed-Georgia company
Experience with advanced computational methods being used at the Lockheed-Georgia Company to aid in the evaluation and design of new and modified aircraft indicates that large and specialized computers will be needed to make advanced three-dimensional viscous aerodynamic computations practical. The Numerical Aerodynamic Simulation Facility should be used to provide a tool for designing better aerospace vehicles while at the same time reducing development costs by performing computations using Navier-Stokes equations solution algorithms and permitting less sophisticated but nevertheless complex calculations to be made efficiently. Configuration definition procedures and data output formats can probably best be defined in cooperation with industry, therefore, the computer should handle many remote terminals efficiently. The capability of transferring data to and from other computers needs to be provided. Because of the significant amount of input and output associated with 3-D viscous flow calculations and because of the exceedingly fast computation speed envisioned for the computer, special attention should be paid to providing rapid, diversified, and efficient input and output.
General method for assessing the geographically correlated error for an orbiter with applications to Topex
An estimation based computational algorithm for evaluating geographically dependent orbit determination errors is presented. A derivation is included of the generalized geographically correlated error analysis algorithm and the algorithm is applied to a Topex simulation. Then a general numerical technique which provides the capability to analyze any type of mismodeled parameter with the geopotential as a special case is described. The numerical algorithm is compared with the analytic method of Rosborough (1986) and it is shown that both methods generate consistent geographically dependent orbit error profiles when the ephemeris error is dominated by the mismodeled geopotential.
An efficient HZETRN (a galactic cosmic ray transport code)
An accurate and efficient engineering code for analyzing the shielding requirements against the high-energy galactic heavy ions is needed. The HZETRN is a deterministic code developed at Langley Research Center that is constantly under improvement both in physics and numerical computation and is targeted for such use. One problem area connected with the space-marching technique used in this code is the propagation of the local truncation error. By improving the numerical algorithms for interpolation, integration, and grid distribution formula, the efficiency of the code is increased by a factor of eight as the number of energy grid points is reduced. The numerical accuracy of better than 2 percent for a shield thickness of 150 g/cm(exp 2) is found when a 45 point energy grid is used. The propagating step size, which is related to the perturbation theory, is also reevaluated.
Advanced adaptive computational methods for Navier-Stokes simulations in rotorcraft aerodynamics
A phase 2 research and development effort was conducted in area transonic, compressible, inviscid flows with an ultimate goal of numerically modeling complex flows inherent in advanced helicopter blade designs. The algorithms and methodologies therefore are classified as adaptive methods, which are error estimation techniques for approximating the local numerical error, and automatically refine or unrefine the mesh so as to deliver a given level of accuracy. The result is a scheme which attempts to produce the best possible results with the least number of grid points, degrees of freedom, and operations. These types of schemes automatically locate and resolve shocks, shear layers, and other flow details to an accuracy level specified by the user of the code. The phase 1 work involved a feasibility study of h-adaptive methods for steady viscous flows, with emphasis on accurate simulation of vortex initiation, migration, and interaction. Phase 2 effort focused on extending these algorithms and methodologies to a three-dimensional topology.
Multi-dimensional combustor flowfield analyses in gas-gas rocket engine
The objectives of the present research are to improve design capabilities for low thrust rocket engines through understanding of the detailed mixing and combustions processes. Of particular interest is a small gaseous hydrogen-oxygen thruster which is considered as a coordinated part of an on-going experimental program at NASA LeRC. Detailed computational modeling requires the application of the full three-dimensional Navier Stokes equations, coupled with species diffusion equations. The numerical procedure is performed on both time-marching and time-accurate algorithms and using an LU approximate factorization in time, flux split upwinding differencing in space. The emphasis in this paper is focused on using numerical analysis to understand detailed combustor flowfields, including the shear layer dynamics created between fuel film cooling and the core gas in the vicinity on the nearby combustor wall; the integrity and effectiveness of the coolant film; three-dimensional fuel jets injection/mixing/combustion characteristics; and their impacts on global engine performance.
Dynamics of Numerics & Spurious Behaviors in CFD Computations
The global nonlinear behavior of finite discretizations for constant time steps and fixed or adaptive grid spacings is studied using tools from dynamical systems theory. Detailed analysis of commonly used temporal and spatial discretizations for simple model problems is presented. The role of dynamics in the understanding of long time behavior of numerical integration and the nonlinear stability, convergence, and reliability of using time-marching approaches for obtaining steady-state numerical solutions in computational fluid dynamics (CFD) is explored. The study is complemented with examples of spurious behavior observed in steady and unsteady CFD computations. The CFD examples were chosen to illustrate non-apparent spurious behavior that was difficult to detect without extensive grid and temporal refinement studies and some knowledge from dynamical systems theory. Studies revealed the various possible dangers of misinterpreting numerical simulation of realistic complex flows that are constrained by available computing power. In large scale computations where the physics of the problem under study is not well understood and numerical simulations are the only viable means of solution, extreme care must be taken in both computation and interpretation of the numerical data. The goal of this paper is to explore the important role that dynamical systems theory can play in the understanding of the global nonlinear behavior of numerical algorithms and to aid the identification of the sources of numerical uncertainties in CFD.
Overview of a Generalized Numerical Predictor-Corrector Targeting Guidance with Application to Human-Scale Mars Entry, Descent, and Landing
Recent advances in planetary entry guidance algorithms are motived by precision landing criteria for human-scale Mars missions and improved in-space computing capabilities. An NPC targeting guidance algorithm, originally developed for the Mars Surveyor Program 2001 Missions, has been modified and extended to permit a fully generalized, flexible, and robust approach to spacecraft aerocapture and EDL guidance design. This paper describes this generalized targeting NPC guidance (NPCG) and how its modifications enable its use in precision targeting for human missions. System modeling, trajectory propagation, and guidance segment definition and design are described. Finally, the NPCG capability and performance is demonstrated using a human-scale Mars entry, descent, and landing mission simulation.
CyGutz
This software is an efficient computational package of the Gutzwiller variational method. It solves the Gutzwiller variational problem for general multiband models with arbitrary on-site interaction in a fully self-consistent numerical approach. The underlying algorithm drastically reduces the problem of the high-dimensional Gutzwiller minimization by mapping it to a minimization only in the variational density matrix. For fixed density the Gutzwiller renormalization matrix is determined as a fix-point of a proper functional, whose evaluation requires only ground-state calculations of matrices defined in the Gutzwiller variational space. Furthermore, the package is able to account for the symmetries of the variational function in a controlled way, reducing the number of variational parameters. The software is highly efficient and robust, and is particularly suitable for first-principles studies (e.g., in combination with DFT) of many complex real materials, where the full intra-atomic interaction is important to obtain correct results.
The solution of coupled Schroedinger equations using an extrapolation method
In this paper, extrapolation to the limit in a finite-difference method is applied to solve a system of coupled Schroedinger equations. This combination results in a method that only requires knowledge of the potential energy functions for the system. This numerical procedure has several distinct advantages over the more conventional methods. Namely, initial guesses for the term values are not needed; assumptions need be made about the behavior of the wavefunctions, such as the slope or magnitude in the nonclassical region; and the algorithm is easy to implement, has a firm mathematical foundation, and provides error estimates. Moreover, the method is less sensitive to round-off error than other methods since a small number of mesh points is used and it can be implemented on small computers. A comparison of the method with another numerical method shows results agreeing within 1 part in 10 exp 4.
Notes and comments on computational elastoplasticity - Some new models and their numerical implementation
The following topics are discussed in this paper: (1) the basic interactive nature of classical elasto-plasticity and a redefinition of elastic and plastic processes that facilitates numerical calculations, (2) generalized mid-point or end-point algorithms to determine the stress increment in an elastic-plastic solid from a given strain increment, (3) an endochronic (internal time) rate theory of time-independent plasticity which encompasses various multiple-yield-surface theories and nonlinear kinematic hardening theories as its specializations, and (4) comments on finite element and boundary element methods for solving boundary value problems in elasto-plasticity.
Direct Numerical Simulation of Transitional and Turbulent Flows Over Multi-Scale Surface Roughness—Part I: Methodology and Challenges
Abstract High-fidelity simulation of transitional and turbulent flows over multi-scale surface roughness presents several challenges. For instance, the complex and irregular geometrical nature of surface roughness makes it impractical to employ conforming structured grids, commonly adopted in large-scale numerical simulations due to their high computational efficiency. One possible solution to overcome this problem is offered by immersed boundary methods, which allow wall boundary conditions to be enforced on grids that do not conform to the geometry of the solid boundary. To this end, a three-dimensional, second-order accurate boundary data immersion method (BDIM) is adopted. A novel mapping algorithm that can be applied to general three-dimensional surfaces is presented, together with a newly developed data-capturing methodology to extract and analyze on-surface flow quantities of interest. A rigorous procedure to compute gradient quantities such as the wall shear stress and the heat flux on complex non-conforming geometries is also introduced. The new framework is validated by performing a direct numerical simulation (DNS) of fully developed turbulent channel flow over sinusoidal egg-carton roughness in a minimal-span domain. For this canonical case, the averaged streamwise velocity profiles are compared against results from the literature obtained with a body-fitted grid. General guidelines on the BDIM resolution requirements for multi-scale roughness simulation are given. Momentum and energy balance methods are used to validate the calculation of the overall skin friction and heat transfer at the wall. The BDIM is then employed to investigate the effect of irregular homogeneous surface roughness on the performance of an LS-89 high-pressure turbine blade at engine-relevant conditions using DNS. This is the first application of the BDIM to realize multi-scale roughness for transitional flow in transonic conditions in the context of high-pressure turbines. The methodology adopted to generate the desired roughness distribution and to apply it to the reference blade geometry is introduced. The results are compared to the case of an equivalent smooth blade.
Quantifying the Impact of Single Bit Flips on Floating Point Arithmetic
In high-end computing, the collective surface area, smaller fabrication sizes, and increasing density of components have led to an increase in the number of observed bit flips. If mechanisms are not in place to detect them, such flips produce silent errors, i.e. the code returns a result that deviates from the desired solution by more than the allowed tolerance and the discrepancy cannot be distinguished from the standard numerical error associated with the algorithm. These phenomena are believed to occur more frequently in DRAM, but logic gates, arithmetic units, and other circuits are also susceptible to bit flips. Previous work has focused on algorithmic techniques for detecting and correcting bit flips in specific data structures, however, they suffer from lack of generality and often times cannot be implemented in heterogeneous computing environment. Our work takes a novel approach to this problem. We focus on quantifying the impact of a single bit flip on specific floating-point operations. We analyze the error induced by flipping specific bits in the most widely used IEEE floating-point representation in an architecture-agnostic manner, i.e., without requiring proprietary information such as bit flip rates and the vendor-specific circuit designs. We initially study dot products of vectors and demonstrate that not all bit flips create a large error and, more importantly, expected value of the relative magnitude of the error is very sensitive on the bit pattern of the binary representation of the exponent, which strongly depends on scaling. Our results are derived analytically and then verified experimentally with Monte Carlo sampling of random vectors. Furthermore, we consider the natural resilience properties of solvers based on the fixed point iteration and we demonstrate how the resilience of the Jacobi method for linear equations can be significantly improved by rescaling the associated matrix.