Search NASA⌕ Search

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.

At least 1,441 records · Page 80

Unstructured Unsteady Flow Solver Applicable to MSU TURBO and Computational Design

This paper presents numerical simulations for a high-speed transonic compressor rotor, NASA Rotor 35, using an unstructured grid flow solver U2NCLE. It solves Reynolds averaged Navier-Stokes equations using an arbitrary Mach number solution algorithm. Experiments were conducted at the NASA Glen Research Center to investigate compressor stability enhancement using steady and discrete tip injections. The mass injection upstream of the tip of a high- speed axial compressor rotor has shown effectiveness in suppressing stall in tip-critical rotors. This work presents numerical simulations of a high-speed compressor rotor with and without tip injections. Methods to model the flow injection are described. Numerical simulations are conducted at 80 and 100 percent of the design speed. Results show that numerical solutions are consistent with the experimental trends.

Newman, James C., III↗

Direct single-shot phase retrieval from the diffraction pattern of separated objects

The non-crystallographic phase problem arises in numerous scientific and technological fields. An important application is coherent diffractive imaging. Recent advances in X-ray free-electron lasers allow capturing of the diffraction pattern from a single nanoparticle before it disintegrates, in so-called ‘diffraction before destruction’ experiments. Presently, the phase is reconstructed by iterative algorithms, imposing a non-convex computational challenge, or by Fourier holography, requiring a well-characterized reference field. Here we present a convex scheme for single-shot phase retrieval for two (or more) sufficiently separated objects, demonstrated in two dimensions. In our approach, the objects serve as unknown references to one another, reducing the phase problem to a solvable set of linear equations. We establish our method numerically and experimentally in the optical domain and demonstrate a proof-of-principle single-shot coherent diffractive imaging using X-ray free-electron lasers pulses. Lastly, our scheme alleviates several limitations of current methods, offering a new pathway towards direct reconstruction of complex objects.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Fixed-angle conjectures for the quantum approximate optimization algorithm on regular MaxCut graphs

The quantum approximate optimization algorithm (QAOA) is a near-term combinatorial optimization algorithm suitable for noisy quantum devices. However, little is known about performance guarantees for p > 2. A recent work computing MaxCut performance guarantees for 3-regular graphs conjectures that any d-regular graph evaluated at particular fixed angles has an approximation ratio greater than some worst-case guarantee. In this work, we provide numerical evidence for this fixed angle conjecture for p < 12. We compute and provide these angles via numerical optimization and tensor networks. These fixed angles serve for an optimization-free version of QAOA and have universally good performance on any 3-regular graph. Heuristic evidence is presented for the fixed angle conjecture on graph ensembles, which suggests that these fixed angles are "close" to global optimum. Under the fixed angle conjecture, QAOA has a larger performance guarantee than the Goemans Williamson algorithm on 3-regular graphs for p >= 11.

Wurtz, Jonathan↗

Modeling of intragranular misorientation and grain fragmentation in polycrystalline materials using the viscoplastic self-consistent formulation

In this paper, the recently established methodology to use known algorithmic expressions of the second moments of the stress field in the grains of a polycrystalline aggregate for calculating average fluctuations of lattice rotation rates and the associated average intragranular misorientation distributions using the mean-field viscoplastic self-consistent (VPSC) formulation is extended to solve the coupled problem of considering the effect of intragranular misorientations on stress and rotation rate fluctuations. In turn, these coupled expressions are used to formulate and implement a grain fragmentation (GF) model in VPSC. Case studies, including tension and plane-strain compression of face-centered cubic polycrystals are used to illustrate the capabilities of the new model. GF-VPSC predictions of intragranular misorientation distributions and texture evolution are compared with experiments and full-field numerical simulations, showing good agreement. In particular, the inclusion of misorientation spreads reduced the intensity of the deformed texture and thus improved the texture predictions. Finally and moreover, considering that intragranular misorientations act as driving forces for recrystallization, the new GF-VPSC formulation is shown to enable modeling of microstructure evolution during deformation and recrystallization, in a computationally efficient manner.

36 MATERIALS SCIENCE↗

Numerical experience with a class of algorithms for nonlinear optimization using inexact function and gradient information

For optimization problems associated with engineering design, parameter estimation, image reconstruction, and other optimization/simulation applications, low accuracy function and gradient values are frequently much less expensive to obtain than high accuracy values. Here, researchers investigate the computational performance of trust region methods for nonlinear optimization when high accuracy evaluations are unavailable or prohibitively expensive, and confirm earlier theoretical predictions when the algorithm is convergent even with relative gradient errors of 0.5 or more. The proper choice of the amount of accuracy to use in function and gradient evaluations can result in orders-of-magnitude savings in computational cost.

Carter, Richard G.↗

A multilayer multi-configurational approach to efficiently simulate large-scale circuit-based quantum computers on classical machines

Here, a multilayer multi-configurational theory framework is adapted to simulate circuit-based quantum computers. Quantum addition of superpositions of an exponential number of summands is performed in polynomial time with high accuracy. We demonstrate numerically accurate calculations including up to one million qubits for entangling benchmarks. Simulation cost can be assessed by entropy-based entanglement measures. For the considered systems, we show that the entanglement only grows weakly with the system size. The present simulations demonstrate how quantum algorithms in low-entropy regimes can be used efficiently on classically simulated quantum computers.

97 MATHEMATICS AND COMPUTING↗

Acoustic Wave Propagation Modeling by a Two-dimensional Finite-difference Summation-by-parts Algorithm

Acoustic waveform modeling is a computationally intensive task and full three-dimensional simulations are often impractical for some geophysical applications such as long-range wave propagation and high-frequency sound simulation. In this study, we develop a two-dimensional high-order accurate finite-difference code for acoustic wave modeling. We solve the linearized Euler equations by discretizing them with the sixth order accurate finite difference stencils away from the boundary and the third order summation-by-parts (SBP) closure near the boundary. Non-planar topographic boundary is resolved by formulating the governing equation in curvilinear coordinates following the interface. We verify the implementation of the algorithm by numerical examples and demonstrate the capability of the proposed method for practical acoustic wave propagation problems in the atmosphere.

58 GEOSCIENCES↗

REYNO: A Reactive Hydrodynamics Modeling Suite

REYNO is a Python library that is primarily designed as a platform for the agile development and testing of novel reactive flow models. Equations of state and multi-step rate laws can be implemented using the provided class hierarchy with different thermodynamic closure conditions. The library includes a one-dimensional Lagrangian hydrodynamic solver to simulate multi-material reactive or inert problems in planar, cylindrical, or spherical coordinates. Custom time-dependent boundary conditions are also available for problems such as ramp compression. This document describes the different numerical methods and algorithms that are included in REYNO.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Vibration in Planetary Gear Systems with Unequal Planet Stiffnesses

An algorithm suitable for a minicomputer was developed for finding the natural frequencies and mode shapes of a planetary gear system which has unequal stiffnesses between the Sun/planet and planet/ring gear meshes. Mode shapes are represented in the form of graphical computer output that illustrates the lateral and rotational motion of the three coaxial gears and the planet gears. This procedure permits the analysis of gear trains utilizing nonuniform mesh conditions and user specified masses, stiffnesses, and boundary conditions. Numerical integration of the equations of motion for planetary gear systems indicates that this algorithm offers an efficient means of predicting operating speeds which may result in high dynamic tooth loads.

Frater, J. L.↗

Research in Computational Aeroscience Applications Implemented on Advanced Parallel Computing Systems

Improving the numerical linear algebra routines for use in new Navier-Stokes codes, specifically Tim Barth's unstructured grid code, with spin-offs to TRANAIR is reported. A fast distance calculation routine for Navier-Stokes codes using the new one-equation turbulence models is written. The primary focus of this work was devoted to improving matrix-iterative methods. New algorithms have been developed which activate the full potential of classical Cray-class computers as well as distributed-memory parallel computers.

Wigton, Larry↗

Multi-Area Distribution System State Estimation Using Decentralized Physics-Aware Neural Networks

The development of active distribution grids requires more accurate and lower computational cost state estimation. In this paper, the authors investigate a decentralized learning-based distribution system state estimation (DSSE) approach for large distribution grids. The proposed approach decomposes the feeder-level DSSE into subarea-level estimation problems that can be solved independently. The proposed method is decentralized pruned physics-aware neural network (D-P2N2). The physical grid topology is used to parsimoniously design the connections between different hidden layers of the D-P2N2. Monte Carlo simulations based on one-year of load consumption data collected from smart meters for a three-phase distribution system power flow are developed to generate the measurement and voltage state data. The IEEE 123-node system is selected as the test network to benchmark the proposed algorithm against the classic weighted least squares and state-of-the-art learning-based DSSE approaches. Numerical results show that the D-P2N2 outperforms the state-of-the-art methods in terms of estimation accuracy and computational efficiency.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Computation of diffuse sky irradiance from multidirectional radiance measurements

Accurate determination of the diffuse solar spectral irradiance directly above the land surface is important in characterizing the reflectance properties of these surfaces, especially vegetation canopies. This determination is also needed to infer the net radiation budget of the earth-atmosphere system above these surfaces. An algorithm is developed here for the computation of hemispheric diffuse irradiance using the measurements from an instrument called PARABOLA, which rapidly measures upwelling and downwelling radiances in three selected wavelength bands. The validity of the algorithm is established from simulations. The standard reference data set of diffuse radiances of Dave (1978), obtained by solving the radiative transfer equation numerically for realistic atmospheric models, is used to simulate PARABOLA radiances. Hemispheric diffuse irradiance is estimated from a subset of simulated radiances by using the algorithm described. The algorithm is validated by comparing the estimated diffuse irradiance with the true diffuse irradiance of the standard data set. The validations include sensitivity studies for two wavelength bands (visible, 0.65-0.67 micron; near infrared, 0.81-0.84 micron), different atmospheric conditions, solar elevations, and surface reflectances. In most cases the hemispheric diffuse irradiance computed from simulated PARABOLA radiances and the true irradiance obtained from radiative transfer calculations agree within 1-2 percent. This technique can be applied to other sampling instruments designed to estimate hemispheric diffuse sky irradiance.

Ahmad, Suraiya P.↗

Nonideal Rayleigh-Taylor Mixing

Rayleigh-Taylor mixing is a classical hydrodynamic instability that occurs when a light fluid pushes against a heavy fluid. The two main sources of nonideal behavior in Rayleigh-Taylor (RT) mixing are regularizations (physical and numerical), which produce deviations from a pure Euler equation, scale invariant formulation, and nonideal (i.e., experimental) initial conditions. The Kolmogorov theory of turbulence predicts stirring at all length scales for the Euler fluid equations without regularization. We interpret mathematical theories of existence and nonuniqueness in this context, and we provide numerical evidence for dependence of the RT mixing rate on nonideal regularizations; in other words, indeterminacy when modeled by Euler equations. Operationally, indeterminacy shows up as nonunique solutions for RT mixing, parametrized by Schmidt and Prandtl numbers, in the large Reynolds number (Euler equation) limit. Verification and validation evidence is presented for the large eddy simulation algorithm used here. Mesh convergence depends on breaking the nonuniqueness with explicit use of the laminar Schmidt and Prandtl numbers and their turbulent counterparts, defined in terms of subgrid scale models. The dependence of the mixing rate on the Schmidt and Prandtl numbers and other physical parameters will be illustrated. We demonstrate numerically the influence of initial conditions on the mixing rate. Both the dominant short wavelength initial conditions and long wavelength perturbations are observed to play a role. By examination of two classes of experiments, we observe the absence of a single universal explanation, with long and short wavelength initial conditions, and the various physical and numerical regularizations contributing in different proportions in these two different contexts.

97 MATHEMATICS AND COMPUTING↗

Numerical simulation of actively controlled space structures

The numerical simulation of large, actively controlled space structures is a problem that has received considerable attention. A new computational method is presented in this paper, which simulates the vibration suppression of a large space structure by a linear compensator. The structure is assumed to be modeled by a large linear finite element model. Nested circularly linked lists and the trapezoidal rule are key aspects of this algorithm. There is an emphasis on generality, while establishing an equivalence between numerical stability and system stability.

Quan, Ralph↗

Examination of Semi-Analytical Solution Methods in the Coarse Operator of Parareal Algorithm for Power System Simulation

With continuing advances in high-performance parallel computing platforms, parallel algorithms have become powerful tools for development of faster than real-time power system dynamic simulations. In particular, it has been demonstrated in recent years that parallel-in-time (Parareal) algorithms have the potential to achieve such an ambitious goal. Here, the selection of a fast and reasonably accurate coarse operator of the Parareal algorithm is crucial for its effective utilization and performance. This paper examines semi-analytical solution (SAS) methods as the coarse operators of the Parareal algorithm and explores performance of the SAS methods to the standard numerical time integration methods. Two promising time-power series-based SAS methods were considered; Adomian decomposition method and Homotopy analysis method with a windowing approach for improving the convergence. Numerical performance case studies on 10-generator 39-bus system and 327-generator 2383-bus system were performed for these coarse operators over different disturbances, evaluating the number of Parareal iterations, computational time, and stability of convergence. All the coarse operators tested with different scenarios have converged to the same corresponding true solution (if they are convergent) and the SAS methods provide comparable computational speed, while having more stable convergence to the true solution in many cases.

97 MATHEMATICS AND COMPUTING↗

On a numerical solution of the supersonic panel flutter eigenproblem

An automated digital computer procedure is presented in this paper which enables efficient solution of the eigenvalue problem associated with the supersonic panel flutter phenomena. The step-by-step incremental solution procedure is based on an inverse iteration technique which effectively utilizes solution results from the previous step in determining such results during the current solution step. Also, the computations are limited to the determination of a few specific roots only, which are expected to contain the flutter mode, and this is achieved at each step without having to compute any other root. The structural discretization achieved by the finite-element method yields highly banded stiffness, mass, and aerodynamic matrices; the aerodynamic matrix evaluated by the linearized piston theory is real but unsymmetric in nature. The solution algorithm presented in this paper fully exploits the banded form of the associated matrices, and the resulting computer program written in FORTRAN V for the JPL UNIVAC 1108 computer proves to be most efficient and economical when compared to existing procedures of such analysis. Numerical results are presented for a two-dimensional panel flutter problem.

Gupta, K. K.↗

Towards a generalized computational fluid dynamics technique for all Mach numbers

Currently there exists no single unified approach for efficiently and accurately solving computational fluid dynamics (CFD) problems across the Mach number regime, from truly low speed incompressible flows to hypersonic speeds. There are several CFD codes that have evolved into sophisticated prediction tools with a wide variety of features including multiblock capabilities, generalized chemistry and thermodynamics models among other features. However, as these codes evolve, the demand placed on the end user also increases simply because of the myriad of features that are incorporated into these codes. In order for a user to be able to solve a wide range of problems, several codes may be needed requiring the user to be familiar with the intricacies of each code and their rather complicated input files. Moreover, the cost of training users and maintaining several codes becomes prohibitive. The objective of the current work is to extend the compressible, characteristic-based, thermochemical nonequilibrium Navier-Stokes code GASP to very low speed flows and simultaneously improve convergence at all speeds. Before this work began, the practical speed range of GASP was Mach numbers on the order of 0.1 and higher. In addition, a number of new techniques have been developed for more accurate physical and numerical modeling. The primary focus has been on the development of optimal preconditioning techniques for the Euler and the Navier-Stokes equations with general finite-rate chemistry models and both equilibrium and nonequilibrium thermodynamics models. We began with the work of Van Leer, Lee, and Roe for inviscid, one-dimensional perfect gases and extended their approach to include three-dimensional reacting flows. The basic steps required to accomplish this task were a transformation to stream-aligned coordinates, the formulation of the preconditioning matrix, incorporation into both explicit and implicit temporal integration schemes, and modification of the numerical flux formulae. In addition, we improved the convergence rate of the implicit time integration schemes in GASP through the use of inner iteration strategies and the use of the GMRES (General Minimized Resisual) which belongs to the class of algorithms referred to as Krylov subspace iteration. Finally, we significantly improved the practical utility of GASP through the addition of mesh sequencing, a technique in which computations begin on a coarse grid and get interpolated onto successively finer grids. The fluid dynamic problems of interest to the propulsion community involve complex flow physics spanning different velocity regimes and possibly involving chemical reactions. This class of problems results in widely disparate time scales causing numerical stiffness. Even in the absence of chemical reactions, eigenvalue stiffness manifests itself at transonic and very low speed flows which can be quantified by the large condition number of the system and evidenced by slow convergence rates. This results in the need for thorough numerical analysis and subsequent implementation of sophisticated numerical techniques for these difficult yet practical problems. As a result of this work, we have been able to extend the range of applicability of compressible codes to very low speed inviscid flows (M = .001) and reacting flows.

Walters, R. W.↗

Differential holography

Differential Holography technology measures the amplitude and/or phase of, e.g., an incident linearly polarized spatially coherent quasi-monochromatic optical field by optically computing the first derivative of the field and linearly mapping it to an irradiance signal detectable by an image sensor. This information recorded on the image sensor is then recovered by a simple algorithm. In some embodiments, an input field is split into two or more beams to independently compute the horizontal and vertical derivatives (using amplitude gradient filters in orthogonal orientations) for detection on one image sensor in separate regions of interest (ROIs) or on multiple image sensors. A third unfiltered beam recorded in a third ROI directly measures amplitude variations in the input field to numerically remove its contribution as noise before recovering the original wavefront using a numerical in algorithm. When combined, the measured amplitude and phase constitute a holographic recording of the incident optical field.

Ravizza, Frank↗