Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical algorithms”

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,189 records · Page 66
All sourcesNASA NTRSDOE OSTI
NASA NTRS1983

Monotone implicit algorithms for the small-disturbance and full potential equations applied to transonic flows

Numerical calculations of transonic flows by potential equations typically use algorithms that change the method of calculation for regions of subsonic and supersonic flow. In this paper, implicit approximate-factorization algorithms are modified to use the monotonic switch in the type of finite-differencing that was developed by Godunov for the Euler equations. Calculations of flows over airfoils by these algorithms are compared with calculations by other methods that are in common usage. For the small-disturbance potential equation, comparisons are made with the Murman-Cole method and the monotone method of Engquist and Osher for both steady and unsteady flows. For the full potential equation, comparisons are made with the methods of Jameson and of Holst and Ballhaus for steady flows. The comparisons show that the monotone methods are more stable. For steady flows, solutions are obtained for cases where the Murman-Cole switch requires a time step over ten times smaller in order for the calculations to remain stable. These improvements are achieved with no increase in computer storage and only minor modifications in current codes.

Goorjian, P. M.↗
DOE OSTI2021

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications

Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Modeling flow at the nozzle of a solid rocket motor

The mechanical behavior of a rocket motor internal flow field results in a system of nonlinear partial differential equations which can be solved numerically. The accuracy and the convergence of the solution of the system of equations depends largely on how precisely the sharp gradients can be resolved. An adaptive grid generation scheme is incorporated into the computer algorithm to enhance the capability of numerical modeling. With this scheme, the grid is refined as the solution evolves. This scheme significantly improves the methodology of solving flow problems in rocket nozzle by putting the refinement part of grid generation into the computer algorithm.

Chow, Alan S.↗
NASA NTRS1992

Boundary layer study on nozzle wall at hypersonic velocities

The boundary layer on the wall of the Hypervelocity Tunnel 9 was investigated with pitot pressure and total temperature measurements. Experimental results are presented for standard and supercooled Mach 14 runs. The boundary layer data at supercooled conditions are compared to numerical predictions made with a Navier-Stokes algorithm including vibrational nonequilibrium and intermolecular force effects. For standard tunnel conditions, the numerical solutions agree well with experimental data. For the supercooled cases, the numerical code predicts the total temperature but overpredicts the pitot pressure.

Jones, Kenneth M.↗
NASA NTRS1993

A study of the compressible flow through a diffusing S-duct

Benchmark aerodynamic data are presented for compressible flow through a representative S-duct configuration. A numerical prediction of the S-duct flow field, obtained from a subsonic parabolized Navier-Stokes algorithm, is also shown. The experimental and numerical results are compared. Measurements of the three-dimensional velocity field, total pressures, and static pressures were obtained at five cross-sectional planes. Aerodynamic data were gathered with calibrated pneumatic probes. Surface static pressure and surface flow visualization data were also acquired. All reported tests were conducted with an inlet centerline Mach number of 0.6. The Reynolds number, based on the inlet centerline velocity and duct inlet diameter, was 2.6 x 10(exp 6). Thin inlet turbulent boundary layers existed. The collected data should be beneficial to aircraft inlet designers and the measurements are suitable for the validation of computational codes. The results show that a region of streamwise flow separation occurred within the duct. Details about the separated flow region, including mechanisms which drive this complicated flow phenomenon, are discussed. Results also indicate that the duct curvature induces strong pressure driven secondary flows. The cross flows evolve into counter-rotating vortices. These vortices convect low momentum fluid of the boundary layer toward the center of the duct, degrading both the uniformity and magnitude of the total pressure profile.

Wellborn, Steven R.↗
NASA NTRS2019

An Approach to Retrieve BRDF from Satellite and Airborne Measurements of Surface-Reflected Radiance Based on Decoupling of Atmospheric Radiative Transfer and Surface Reflection

Bi-directional Reflection Distribution Function (BRDF) defines anisotropy of the surface reflection. It is required to specify the boundary condition for radiative transfer (RT) modeling. Measurements of reflected radiance by satellite- and air-borne sensors provide information about anisotropy of surface reflection. Atmospheric correction needs to be performed to derive BRDF from the reflected radiance. Common approach for BRDF retrievals consists of the use of kernel-based BRDF and RT modeling that needs to be done anew at every step of the iterative process. The kernels’ weights are obtained by minimization of the difference between measured and modeled radiance. This study develops a new method of retrieving kernel-based BRDF that requires RT calculations to be done only once. The method employs the exact analytical expression of radiance at any atmospheric level through the solutions of two auxiliary atmosphere-only RT problems and the surface-reflected radiance at the surface level. The latter is related to BRDF and solutions of the auxiliary RT problems by a Fredholm integral equation of the second kind. The approach requires to perform RT calculations one time before the iterations. It can use observations taken at different atmospheric conditions assuming that surface conditions remain unchanged during the time span of observations. The algorithm accurately catches zero weights of the kernels that may be a concern if the number of kernels is greater than 3 in current mainstream approaches. The study presents numerical tests of the BRDF retrieval algorithm for various surface and atmospheric conditions.

Radkevich, Alexander↗
DOE OSTI2021

Resilience and fault tolerance in high-performance computing for numerical weather and climate prediction

Progress in numerical weather and climate prediction accuracy greatly depends on the growth of the available computing power. As the number of cores in top computing facilities pushes into the millions, increased average frequency of hardware and software failures forces users to review their algorithms and systems in order to protect simulations from breakdown. This report surveys hardware, application-level and algorithm-level resilience approaches of particular relevance to time-critical numerical weather and climate prediction systems. A selection of applicable existing strategies is analysed, featuring interpolation-restart and compressed checkpointing for the numerical schemes, in-memory checkpointing, user-level failure mitigation and backup-based methods for the systems. Numerical examples showcase the performance of the techniques in addressing faults, with particular emphasis on iterative solvers for linear systems, a staple of atmospheric fluid flow solvers. The potential impact of these strategies is discussed in relation to current development of numerical weather prediction algorithms and systems towards the exascale. Trade-offs between performance, efficiency and effectiveness of resiliency strategies are analysed and some recommendations outlined for future developments.

54 ENVIRONMENTAL SCIENCES↗
NASA NTRS1988

The use of multigrid techniques in the solution of the Elrod algorithm for a dynamically loaded journal bearing

A numerical solution to a theoretical model of vapor cavitation in a dynamically loaded journal bearing is developed, utilizing a multigrid iterative technique. The code is compared with a presently existing direct solution in terms of computational time and accuracy. The model is based on the Elrod algorithm, a control volume approach to the Reynolds equation which mimics the Jakobssen-Floberg and Olsson cavitation theory. Besides accounting for a moving cavitation boundary and conservation of mass at the boundary, it also conserves mass within the cavitated region via liquid striations. The mixed nature of the equations (elliptic in the full film zone and nonelliptic in the cavitated zone) coupled with the dynamic aspects of the problem create interesting difficulties for the present solution approach. Emphasis is placed on the methods found to eliminate solution instabilities. Excellent results are obtained for both accuracy and reduction of computational time.

Woods, Claudia M.↗
DOE OSTI2022

On the Search for Low W 0

The magnitude of the vacuum expectation value of the Gukov-Vafa-Witten superpotential |W o | plays a central role in the phenomenology of type IIB flux compactifications. Recent analytical constructions have shown that perturbatively flat vacua can be used to obtain very low values of |W o |. We present systematic algorithms to carry out exhaustive numerical searches for such vacua. Here we also analyse them in the statistical context, as part of the entire ensemble of type IIB flux vacua at low |W o |. Our preliminary analysis indicates that these perturbatively flat vacua are statistically sparse in the whole set of vacua at low |W o | as calculated by Denef and Douglas. Two-moduli examples are used to illustrate these more general findings in specific settings. We find that these simple (two moduli) cases are good examples for existence proofs but they do not feature a large statistical tuning freedom for phenomenological applications.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2021

Twelve Ways to Fool the Masses When Giving Parallel-in-Time Results

Getting good speedup—let alone high parallel efficiency—for parallel-in-time (PinT) integration examples can be frustratingly difficult. The high complexity and large number of parameters in PinT methods can easily (and unintentionally) lead to numerical experiments that overestimate the algorithm’s performance. In the tradition of Bailey’s article “Twelve ways to fool the masses when giving performance results on parallel computers”, we discuss and demonstrate pitfalls to avoid when evaluating the performance of PinT methods. Despite being written in a light-hearted tone, this paper is intended to raise awareness that there are many ways to unintentionally fool yourself and others and that by avoiding these fallacies more meaningful PinT performance results can be obtained.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Carving out OPE space and precise O(2) model critical exponents

We develop new tools for isolating CFTs using the numerical bootstrap. A “cutting surface” algorithm for scanning OPE coefficients makes it possible to find islands in high-dimensional spaces. Together with recent progress in large-scale semidefinite programming, this enables bootstrap studies of much larger systems of correlation functions than was previously practical. We apply these methods to correlation functions of charge-0, 1, and 2 scalars in the 3d O(2) model, computing new precise values for scaling dimensions and OPE coefficients in this theory. Our new determinations of scaling dimensions are consistent with and improve upon existing Monte Carlo simulations, sharpening the existing decades-old 8σ discrepancy between theory and experiment.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

A fragmentation approach to jet flavor

An intuitive definition of the partonic flavor of a jet in quantum chromodynamics is often only well-defined in the deep ultraviolet, where the strong force becomes a free theory and a jet consists of a single parton. However, measurements are performed in the infrared, where a jet consists of numerous particles and requires an algorithmic procedure to define their phase space boundaries. To connect these two regimes, we introduce a novel and simple partonic jet flavor definition in the infrared. We define the jet flavor to be the net flavor of the partons that lie exactly along the direction of the Winner-Take-All recombination scheme axis of the jet, which is safe to all orders under emissions of soft particles, but is not collinear safe. Collinear divergences can be absorbed into a perturbative fragmentation function that describes the evolution of the jet flavor from the ultraviolet to the infrared. The evolution equations are linear and a small modification to traditional DGLAP and we solve them to leading-logarithmic accuracy. The evolution equations exhibit fixed points in the deep infrared, we demonstrate quantitative agreement with parton shower simulations, and we present various infrared and collinear safe observables that are sensitive to this flavor definition.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2022

Utilizing commercial heating, ventilating, and air conditioning systems to provide grid services: A review

The modern power grid faces multiple challenges due to an increase in the adoption of renewable generation, such as dynamically balancing supply and demand at different time scales. Demand side management in buildings plays a vital role in achieving this balance because buildings can provide grid services through a variety of building assets. However, the development of grid-interactive, efficient buildings is still in its infancy, and a systematic and holistic understanding of grid service delivery strategies in terms of energy efficiency, load shifting, load shedding and load modulating is still limited. This paper is a comprehensive review of the development and application of building-level control strategies for utilizing heating, ventilating, and air conditioning systems to provide grid services. These strategies have been investigated through numerical and experimental studies. Control algorithms, such as heuristic rule-based control and model-based control, have been used to enable the automatic control delivery of grid services. The advantages and disadvantages of the strategies are summarized and discussed. Finally, research trends are also identified, which include considering predicted mean vote-based and occupant-based thermal comfort, modeling of occupant behavior, integrating power grid operations with building control, and combining different demand flexibility modes in the control design.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2021

Data source authentication of synchrophasor measurement devices based on 1D-CNN and GRU

Synchrophasor measurement devices (SMDs) have been widely deployed to support real-time monitoring and control of power systems. In the meantime, data spoofing has emerged in recent years. Therefore, it is of great importance to study data authentication algorithms for detecting and defending the data spoofing effectively. Here, a one-dimensional convolutional neural network (1D-CNN) is utilized to extract temporal signatures hidden in frequency, voltage angle and amplitude data; then the gated recurrent unit (GRU) employs these temporal signatures for data source authentication. In case studies, the performances of different algorithms are tested in large-scale power systems with numerous SMDs for the first time, and comparisons among different algorithms show that the proposed algorithm can achieve a higher accuracy of data source authentication with a shorter time window.

47 OTHER INSTRUMENTATION↗
DOE OSTI2021

Model-based and Model-free Designs for an Extended Continuous-time LQR with Exogenous Inputs

We present an extended linear quadratic regulator (LQR) design for continuous-time linear time-invariant (LTI) systems in the presence of exogenous inputs. We first propose a model-based solution with cost minimization guarantees for states and inputs using dynamic programming (DP). The control law consists of a combination of the optimal state feedback and an additional optimal term dependent on the exogenous inputs. The control gains for the two components are obtained by solving a set of matrix differential equations. We provide these solutions for both finite horizons and steady-state cases. In the second part of the paper, we formulate a reinforcement learning (RL) based algorithm which does not need any model information except the input matrix, and can compute an approximate steady-state LQR gain using measurements of the states, the control inputs, and the exogenous inputs. Both model-based and data-driven optimal control algorithms are tested with a numerical example under different exogenous inputs showcasing the effectiveness of the designs.

Mukherjee, Sayak↗
DOE OSTI2024

Asymptotic consistency of the WSINDy algorithm in the limit of continuum data

In this work we study the asymptotic consistency of the weak-form sparse identification of nonlinear dynamics algorithm (WSINDy) in the identification of differential equations from noisy samples of solutions. We prove that the WSINDy estimator is unconditionally asymptotically consistent for a wide class of models that includes the Navier–Stokes, Kuramoto–Sivashinsky and Sine–Gordon equations. We thus provide a mathematically rigorous explanation for the observed robustness to noise of weak-form equation learning. Conversely, we also show that, in general, the WSINDy estimator is only conditionally asymptotically consistent, yielding discovery of spurious terms with probability one if the noise level exceeds a critical threshold σ c . We provide explicit bounds on σ c in the case of Gaussian white noise and we explicitly characterize the spurious terms that arise in the case of trigonometric and/or polynomial libraries. Furthermore, we show that, if the data is suitably denoised (a simple moving average filter is sufficient), then asymptotic consistency is recovered for models with locally-Lipschitz, polynomial-growth nonlinearities. Our results reveal important aspects of weak-form equation learning, which may be used to improve future algorithms. We demonstrate our findings numerically using the Lorenz system, the cubic oscillator, a viscous Burgers-growth model and a Kuramoto–Sivashinsky-type high-order PDE.

asymptotic consistency↗
DOE OSTI2022

Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. In this study, we tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field $\mathrm{XY}$ model, where $\mathscr{O}$(n 2 )-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

Learning to Predict Arbitrary Quantum Processes

We present an efficient machine-learning (ML) algorithm for predicting any unknown quantum process ℰ over 𝑛 qubits. For a wide range of distributions 𝒟 on arbitrary 𝑛-qubit states, we show that this ML algorithm can learn to predict any local property of the output from the unknown process ℰ, with a small average error over input states drawn from 𝒟. The ML algorithm is computationally efficient even when the unknown process is a quantum circuit with exponentially many gates. Our algorithm combines efficient procedures for learning properties of an unknown state and for learning a low-degree approximation to an unknown observable. The analysis hinges on proving new norm inequalities, including a quantum analogue of the classical Bohnenblust-Hille inequality, which we derive by giving an improved algorithm for optimizing local Hamiltonians. Numerical experiments on predicting quantum dynamics with evolution time up to 10 6 and system size up to 50 qubits corroborate our proof. Overall, our results highlight the potential for ML models to predict the output of complex quantum dynamics much faster than the time needed to run the process itself.

quantum computation↗