Results for “computational efficiency” — Page 34

DOE OSTI2025

A Green’s function fast multipole method for computation of micromechanical fields in heterogeneous materials

Computation of micromechanical fields in heterogeneous materials is usually performed using either the finite element method or the Green’s function method based on FFTs. The finite element method allows for accurate discretization and for non-periodic boundary conditions but is computationally expensive. On the other hand, the FFT-based method is computationally efficient but requires discretization on a regular grid of hexahedral voxels. In this paper, a Green’s function method allowing for accurate discretization using tetrahedral elements and for non-periodic boundary conditions is proposed. The convolution is computed using the fast multipole method, which provides good accuracy even for low-order expansion due to the fast decay of interactions between elements. The proposed Green’s function fast multipole method is verified by comparison with analytical and FFT-based solutions. Furthermore, the computational time is analyzed and compared to the FFT-based method for non-periodic convolution. Finally, effective properties of an elastic polycrystalline microstructure containing thin intergranular cracks are computed and analyzed.

36 MATERIALS SCIENCE↗

DOE OSTI2025

Greedy emulators for nuclear two-body scattering

Applications of reduced basis method emulators are increasing in low-energy nuclear physics because they enable fast and accurate sampling of high-fidelity calculations, enabling robust uncertainty quantification. Here, in this paper, we develop, implement, and test two model-driven emulators based on the (Petrov-)Galerkin projection using the prototypical test case of two-body scattering with the Minnesota potential and a more realistic local chiral potential. The high-fidelity scattering equations are solved with the matrix Numerov method, a reformulation of the popular Numerov recurrence relation for solving special second-order differential equations as a linear system of coupled equations. A novel error estimator based on reduced-space residuals is applied to an active learning approach (a greedy algorithm) to choosing training samples (“snapshots”) for the emulator and contrasted with a proper orthogonal decomposition (POD) approach. Both approaches allow for computationally efficient offline-online decompositions, but the greedy approach requires many fewer snapshot calculations. These developments set the groundwork for emulating scattering observables based on chiral nucleon-nucleon and three-nucleon interactions and optical models, where computational speed-ups are necessary for Bayesian uncertainty quantification. Our emulators and error estimators are widely applicable to linear systems.

Bayesian methods↗

NASA NTRS1974

Transient Response of Shells of Revolution by Direct Integration and Modal Superposition Methods

The results of an analytical effort to obtain and evaluate transient response data for a cylindrical and a conical shell by use of two different approaches: direct integration and modal superposition are described. The inclusion of nonlinear terms is more important than the inclusion of secondary linear effects (transverse shear deformation and rotary inertia) although there are thin-shell structures where these secondary effects are important. The advantages of the direct integration approach are that geometric nonlinear and secondary effects are easy to include and high-frequency response may be calculated. In comparison to the modal superposition technique the computer storage requirements are smaller. The advantages of the modal superposition approach are that the solution is independent of the previous time history and that once the modal data are obtained, the response for repeated cases may be efficiently computed. Also, any admissible set of initial conditions can be applied.

Stephens, W. B.↗

NASA NTRS1992

The explicit computation of integration algorithms and first integrals for ordinary differential equations with polynomials coefficients using trees

This note is concerned with the explicit symbolic computation of expressions involving differential operators and their actions on functions. The derivation of specialized numerical algorithms, the explicit symbolic computation of integrals of motion, and the explicit computation of normal forms for nonlinear systems all require such computations. More precisely, if R = k(x(sub 1),...,x(sub N)), where k = R or C, F denotes a differential operator with coefficients from R, and g member of R, we describe data structures and algorithms for efficiently computing g. The basic idea is to impose a multiplicative structure on the vector space with basis the set of finite rooted trees and whose nodes are labeled with the coefficients of the differential operators. Cancellations of two trees with r + 1 nodes translates into cancellation of O(N(exp r)) expressions involving the coefficient functions and their derivatives.

Crouch, P. E.↗

NASA NTRS1999

Regional Climate Simulation with a Variable Resolution Stretched Grid GCM: The Regional Down-Scaling Effects

The results obtained with the variable resolution stretched grid (SG) GEOS GCM (Goddard Earth Observing System General Circulation Models) are discussed, with the emphasis on the regional down-scaling effects and their dependence on the stretched grid design and parameters. A variable resolution SG-GCM and SG-DAS using a global stretched grid with fine resolution over an area of interest, is a viable new approach to REGIONAL and subregional CLIMATE studies and applications. The stretched grid approach is an ideal tool for representing regional to global scale interactions. It is an alternative to the widely used nested grid approach introduced a decade ago as a pioneering step in regional climate modeling. The GEOS SG-GCM is used for simulations of the anomalous U.S. climate events of 1988 drought and 1993 flood, with enhanced regional resolution. The height low level jet, precipitation and other diagnostic patterns are successfully simulated and show the efficient down-scaling over the area of interest the U.S. An imitation of the nested grid approach is performed using the developed SG-DAS (Data Assimilation System) that incorporates the SG-GCM. The SG-DAS is run with withholding data over the area of interest. The design immitates the nested grid framework with boundary conditions provided from analyses. No boundary condition buffer is needed for the case due to the global domain of integration used for the SG-GCM and SG-DAS. The experiments based on the newly developed versions of the GEOS SG-GCM and SG-DAS, with finer 0.5 degree (and higher) regional resolution, are briefly discussed. The major aspects of parallelization of the SG-GCM code are outlined. The KEY OBJECTIVES of the study are: 1) obtaining an efficient DOWN-SCALING over the area of interest with fine and very fine resolution; 2) providing CONSISTENT interactions between regional and global scales including the consistent representation of regional ENERGY and WATER BALANCES; 3) providing a high computational efficiency for future SG-GCM and SG-DAS versions using PARALLEL codes.

Fox-Rabinovitz, Michael S.↗

NASA NTRSDate not supplied

L'Ralph's Advanced Thermal Model Correlation Using Veritrek

Thermal model correlation uses data from thermal balance tests to better estimate uncertain input parameter values. During the correlation process, input parameters are modified in an iterative manner which can become computationally expensive since this requires that the high-fidelity thermal model be run for each iteration. Depending on the number of thermal balance test points there can be many sets of correlation parameters that satisfy correlation criteria; and having enough data to ascertain the best set of correlation parameters to use, further increases the computational expense. Reduced-order models (ROMs) provide computationally efficient surrogates of high-fidelity models and are often built to reduce development cycle times and cost. By leveraging the speed of reduced-order models and the Correlation Analysis feature in the Veritrek software, the typical computational expense of a traditional thermal model correlation process can be significantly reduced and having access to hundreds of thousands of iteration results provides an advanced means of intelligently determining the best set of correlation parameters to use. The L’Ralph thermal team at NASA Goddard Space Flight Center explored the use of the Veritrek software for their thermal model correlation efforts. The ROM that was created allowed for the variation of 15 input parameters to match 70 temperature sensor readouts from 3 thermal balance plateus and required 125 runs of the high-fidelity Thermal Desktop® model to generate a ROM that could predict the detailed model’s results to within 0.2 K (RMS). The ROM was then used to find dozens of plausible correlation parameter values based on L’Ralph instrument test data within a few seconds. By providing several plausible correlation parameter combinations, Veritrek allowed the thermal team to explore different uncertain parameter value combinations and provided insight into how deterministic each input parameter was. This allowed for a more confident decision on the best set of correlation parameters to use, compared to traditional model correlation techniques. In this presentation, the L’Ralph thermal team will be presenting their experience with the Veritrek software and how the software was utilized to provide additional insights during the correlation process.

Daniel Bae↗

NASA NTRSDate not supplied

L'Ralph's Advanced Thermal Model Correlation Using Veritrek

Thermal model correlation uses data from thermal balance tests to better estimate uncertain input parameter values. During the correlation process, input parameters are modified in an iterative manner which can become computationally expensive since this requires that the high-fidelity thermal model be run for each iteration. Depending on the number of thermal balance test points there can be many sets of correlation parameters that satisfy correlation criteria; and having enough data to ascertain the best set of correlation parameters to use, further increases the computational expense. Reduced-order models (ROMs) provide computationally efficient surrogates of high-fidelity models and are often built to reduce development cycle times and cost. By leveraging the speed of reduced-order models and the Correlation Analysis feature in the Veritrek software, the typical computational expense of a traditional thermal model correlation process can be significantly reduced and having access to hundreds of thousands of iteration results provides an advanced means of intelligently determining the best set of correlation parameters to use. The L’Ralph thermal team at NASA Goddard Space Flight Center explored the use of the Veritrek software for their thermal model correlation efforts. The ROM that was created allowed for the variation of 15 input parameters to match 70 temperature sensor readouts from 3 thermal balance plateus and required 125 runs of the high-fidelity Thermal Desktop® model to generate a ROM that could predict the detailed model’s results to within 0.2 K (RMS). The ROM was then used to find dozens of plausible correlation parameter values based on L’Ralph instrument test data within a few seconds. By providing several plausible correlation parameter combinations, Veritrek allowed the thermal team to explore different uncertain parameter value combinations and provided insight into how deterministic each input parameter was. This allowed for a more confident decision on the best set of correlation parameters to use, compared to traditional model correlation techniques. In this presentation, the L’Ralph thermal team will be presenting their experience with the Veritrek software and how the software was utilized to provide additional insights during the correlation process. "

Daniel Bae↗

NASA NTRS2011

Constraint Embedding Technique for Multibody System Dynamics

Multibody dynamics play a critical role in simulation testbeds for space missions. There has been a considerable interest in the development of efficient computational algorithms for solving the dynamics of multibody systems. Mass matrix factorization and inversion techniques and the O(N) class of forward dynamics algorithms developed using a spatial operator algebra stand out as important breakthrough on this front. Techniques such as these provide the efficient algorithms and methods for the application and implementation of such multibody dynamics models. However, these methods are limited only to tree-topology multibody systems. Closed-chain topology systems require different techniques that are not as efficient or as broad as those for tree-topology systems. The closed-chain forward dynamics approach consists of treating the closed-chain topology as a tree-topology system subject to additional closure constraints. The resulting forward dynamics solution consists of: (a) ignoring the closure constraints and using the O(N) algorithm to solve for the free unconstrained accelerations for the system; (b) using the tree-topology solution to compute a correction force to enforce the closure constraints; and (c) correcting the unconstrained accelerations with correction accelerations resulting from the correction forces. This constraint-embedding technique shows how to use direct embedding to eliminate local closure-loops in the system and effectively convert the system back to a tree-topology system. At this point, standard tree-topology techniques can be brought to bear on the problem. The approach uses a spatial operator algebra approach to formulating the equations of motion. The operators are block-partitioned around the local body subgroups to convert them into aggregate bodies. Mass matrix operator factorization and inversion techniques are applied to the reformulated tree-topology system. Thus in essence, the new technique allows conversion of a system with closure-constraints into an equivalent tree-topology system, and thus allows one to take advantage of the host of techniques available to the latter class of systems. This technology is highly suitable for the class of multibody systems where the closure-constraints are local, i.e., where they are confined to small groupings of bodies within the system. Important examples of such local closure-constraints are constraints associated with four-bar linkages, geared motors, differential suspensions, etc. One can eliminate these closure-constraints and convert the system into a tree-topology system by embedding the constraints directly into the system dynamics and effectively replacing the body groupings with virtual aggregate bodies. Once eliminated, one can apply the well-known results and algorithms for tree-topology systems to solve the dynamics of such closed-chain system.

Woo, Simon S.↗

DOE OSTI2026

Arbitrary Polynomial Separations in Trainable Quantum Machine Learning

Recent theoretical results in quantum machine learning have demonstrated a general trade-off between the expressive power of quantum neural networks (QNNs) and their trainability; as a corollary of these results, practical exponential separations in expressive power over classical machine learning models are believed to be infeasible as such QNNs take a time to train that is exponential in the model size. We here circumvent these negative results by constructing a hierarchy of efficiently trainable QNNs that exhibit unconditionally provable, polynomial memory separations of arbitrary constant degree over classical neural networks—including state-of-the-art models, such as Transformers—in performing a classical sequence modeling task. This construction is also computationally efficient, as each unit cell of the introduced class of QNNs only has constant gate complexity. We show that contextuality—informally, a quantitative notion of semantic ambiguity—is the source of the expressivity separation, suggesting that other learning tasks with this property may be a natural setting for the use of quantum learning algorithms.

Anschuetz, Eric R. [California Institute of Techno↗

NASA NTRS1978

Improved sonic-box computer program for calculating transonic aerodynamic loads on oscillating wings with thickness

A computer program was developed to account approximately for the effects of finite wing thickness in transonic potential flow over an oscillation wing of finite span. The program is based on the original sonic box computer program for planar wing which was extended to account for the effect of wing thickness. Computational efficiency and accuracy were improved and swept trailing edges were accounted for. Account for the nonuniform flow caused by finite thickness was made by application of the local linearization concept with appropriate coordinate transformation. A brief description of each computer routine and the applications of cubic spline and spline surface data fitting techniques used in the program are given, and the method of input was shown in detail. Sample calculations as well as a complete listing of the computer program listing are presented.

Ruo, S. Y.↗

NASA NTRS1981

Nonparametric identification of a class of nonlinear close-coupled dynamic systems

A nonparametric identification technique for the identification of close coupled dynamic systems with arbitrary memoryless nonlinearities is presented. The method utilizes noisy recorded data (acceleration, velocity and displacement) to identify the restoring forces in the system. The masses in the system are assumed to be known (or fairly well estimated from the design drawings). The restoring forces are expanded in a series of orthogonal polnomials and the coefficients of these polynomial expansions are obtained by using least square fit method. A particularly simple and computationally efficient method is proposed for dealing with separable restoring forces. The identified results are found to be relatively insensitive to measurement noise. An analysis of the effects of measurement noise on the quality of the estimates is given. The computations are shown to be relatively quick (when compared say to the Wiener identification method) and the core storage required relatively small, making the method suitable for onboard identification of large space structures.

Udwadia, F. E.↗

NASA NTRS1989

The indexed time table approach for planning and acting

A representation is discussed of symbolic temporal relations, called IxTeT, that is both powerful enough at the reasoning level for tasks such as plan generation, refinement and modification, and efficient enough for dealing with real time constraints in action monitoring and reactive planning. Such representation for dealing with time is needed in a teleoperated space robot. After a brief survey of known approaches, the proposed representation shows its computational efficiency for managing a large data base of temporal relations. Reactive planning with IxTeT is described and exemplified through the problem of mission planning and modification for a simple surveying satellite.

Ghallab, Malik↗

NASA NTRS1991

A numerical algorithm for optimal feedback gains in high dimensional linear quadratic regulator problems

A hybrid method for computing the feedback gains in linear quadratic regulator problem is proposed. The method, which combines use of a Chandrasekhar type system with an iteration of the Newton-Kleinman form with variable acceleration parameter Smith schemes, is formulated to efficiently compute directly the feedback gains rather than solutions of an associated Riccati equation. The hybrid method is particularly appropriate when used with large dimensional systems such as those arising in approximating infinite-dimensional (distributed parameter) control systems (e.g., those governed by delay-differential and partial differential equations). Computational advantages of the proposed algorithm over the standard eigenvector (Potter, Laub-Schur) based techniques are discussed, and numerical evidence of the efficacy of these ideas is presented.

Banks, H. T.↗

NASA NTRS2001

Aerodynamic Performance of an Active Flow Control Configuration Using Unstructured-Grid RANS

This research is focused on assessing the value of the Reynolds-Averaged Navier-Stokes (RANS) methodology for active flow control applications. An experimental flow control database exists for a TAU0015 airfoil, which is a modification of a NACA0015 airfoil. The airfoil has discontinuities at the leading edge due to the implementation of a fluidic actuator and aft of mid chord on the upper surface. This paper documents two- and three-dimensional computational results for the baseline wing configuration (no control) with tile experimental results. The two-dimensional results suggest that the mid-chord discontinuity does not effect the aerodynamics of the wing and can be ignored for more efficient computations. The leading-edge discontinuity significantly affects tile lift and drag; hence, the integrity of the leading-edge notch discontinuity must be maintained in the computations to achieve a good match with the experimental data. The three-dimensional integrated performance results are in good agreement with the experiments inspite of some convergence and grid resolution issues.

Joslin, Ronald D.↗

NASA NTRS2001

Aerodynamic Performance of an Active Flow Control Configuration Using Unstructured-Grid RANS

This research is focused on assessing the value of the Reynolds-Averaged Navier-Stokes (RANS) methodology for active flow control applications. An experimental flow control database exists for a TAU0015 airfoil, which is a modification of a NACA0015 airfoil. The airfoil has discontinuities at the leading edge due to the implementation of a fluidic actuator and aft of mid chord oil the upper surface. This paper documents two- and three-dimensional computational results for the baseline wing configuration (no control) with the experimental results. The two-dimensional results suggest that the mid-chord discontinuity does not effect the aerodynamics of the wing and can be ignored for more efficient computations. The leading-edge discontinuity significantly affects the lift and drag; hence the integrity of the leading-edge notch discontinuity must be maintained in the computations to achieve a good match with the experimental data. The three-dimensional integrated performance results are in good agreement with the experiments in spite of some convergence and grid resolution issues.

Joslin, Ronald D.↗

NASA NTRS1985

Relative advantages of thin-layer Navier-Stokes and interactive boundary-layer procedures

Numerical procedures for solving the thin-shear-layer Navier-Stokes equations and for the interaction of solutions to inviscid and boundary-layer equations are described and evaluated. To allow appraisal of the numerical and fluid dynamic abilities of the two schemes, they have been applied to one airfoil as a function of angle of attack at two slightly different Reynolds numbers. The NACA 0012 airfoil has been chosen because it allows comparison with measured lift, drag, and moment and with surface-pressure distributions. Calculations have been performed with algebraic eddy-viscosity formulations, and they include consideration of transition. The results are presented in a form that allows easy appraisal of the accuracy of both procedures and of the relative costs. The interactive procedure is computationally efficient but restrictive relative to the thin-layer Navier-Stokes procedure. The latter procedure does a better job of predicting drag than does the former. In both procedures, the location of transition is crucial for accurate or detailed computations, particularly at high angles of attack. When the upstream influence of pressure field through the shear layer is important, the thin-layer Navier-Stokes procedure has an edge over the interactive procedure.

Mehta, U.↗

NASA NTRS1986

A comparison of interactive boundary-layer and thin-layer Navier-Stokes procedures

Numerical procedures for solving the thin-shear-layer Navier-Stokes equations and for the interaction of solutions to inviscid and boundary-layer equations are described and evaluated. To allow appraisal of the numerical and fluid dynamic abilities of the two schemes, they have been applied to one airfoil as a function of angle of attack at two slightly different Reynolds numbers. The NACA 0012 airfoil has been chosen because it allows comparison with measured lift, drag, and moment and with surface-pressure distributions. Calculations have been performed with algebraic eddy-viscosity formulations, and they include consideration of transition. The results are presented in a form that allows easy appraisal of the accuracy of both procedures and of the relative costs. The interactive procedure is computationally efficient but restrictive relative to the thin-layer Navier-Stokes procedure. The latter procedure does a better job of predicting drag than does the former. In both procedures, the location of transition is crucial for accurate or detailed computations, particularly at high angles of attack. When the upstream influence of pressure field through the shear layer is important, the thin-layer Navier-Stokes procedure has an edge over the interactive procedure.

Mehta, U.↗

NASA NTRS1990

An adaptive inverse kinematics algorithm for robot manipulators

An adaptive algorithm for solving the inverse kinematics problem for robot manipulators is presented. The algorithm is derived using model reference adaptive control (MRAC) theory and is computationally efficient for online applications. The scheme requires no a priori knowledge of the kinematics of the robot if Cartesian end-effector sensing is available, and it requires knowledge of only the forward kinematics if joint position sensing is used. Computer simulation results are given for the redundant seven-DOF robotics research arm, demonstrating that the proposed algorithm yields accurate joint angle trajectories for a given end-effector position/orientation trajectory.

Colbaugh, R.↗