Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Algorithmic differentiation”

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 271 records · Page 15

Initial Results of an MDO Method Evaluation Study

The NASA Langley MDO method evaluation study seeks to arrive at a set of guidelines for using promising MDO methods by accumulating and analyzing computational data for such methods. The data are collected by conducting a series of re- producible experiments. In the first phase of the study, three MDO methods were implemented in the SIGHT: framework and used to solve a set of ten relatively simple problems. In this paper, we comment on the general considerations for conducting method evaluation studies and report some initial results obtained to date. In particular, although the results are not conclusive because of the small initial test set, other formulations, optimality conditions, and sensitivity of solutions to various perturbations. Optimization algorithms are used to solve a particular MDO formulation. It is then appropriate to speak of local convergence rates and of global convergence properties of an optimization algorithm applied to a specific formulation. An analogous distinction exists in the field of partial differential equations. On the one hand, equations are analyzed in terms of regularity, well-posedness, and the existence and unique- ness of solutions. On the other, one considers numerous algorithms for solving differential equations. The area of MDO methods studies MDO formulations combined with optimization algorithms, although at times the distinction is blurred. It is important to

Alexandrov, Natalia M.↗

AMReX v2024

The software framework, AMReX, supports the development of block-structured adaptive mesh refinement (AMR) algorithms for solving systems of partial differential equations. AMR reduces the computational cost and memory footprint compared to a uniform mesh while preserving the essential local descriptions of different physical processes in complex multiphysics algorithms. AMR uses a hierarchical representation of the solution at multiple levels of resolution where the solution on each level is defined on the union of data containers at that resolution. These data containers, which represent the solution over a logically rectangular subregion of the domain, can contain field data defined on a mesh, Lagrangian particles or combinations of both. In addition to these basic data types, AMReX supports a multilevel embedded boundary representation of complex geometry; linear solvers for cell-centered and nodal data; asynchronous I/O in a native format readable by ParaView, VisIt and yt; and interfaces to hypre and PETSc solvers. AMReX enables applications to run on distributed memory architectures with multicore CPUs and with GPU accelerators. AMReX uses a lightweight abstraction layer that effectively hides the details of the architecture from the application. The framework currently supports CUDA, HIP and SYCL for GPU acceleration and OpenMP for multi-core CPU architectures.

Almgren, Ann↗

Edge detection applied to SST fields

An algorithm designed to detect fronts automatically in satellite-derived sea-surface temperature (SST) fields is presented. The algorithm is operated at different levels to detect and differentiate between false and true edges. For purposes of comparison, the algorithm is applied to a test set of 98 SST images to detect the northern edge of the Gulf Stream. The algorithm successfully detected valid temperature fronts and ignored false edges, and also produced statistics about the temperature fronts that are useful in the subsequent analysis of these fronts. It is assumed that the algorithm performs equally well on other SST fronts such as those associated with rings, the subtropical convergence, or the shelf/slope fronts.

Cayula, Jean-Francois↗

Differentiating multi-MeV, multi-ion spectra with CR-39 solid-state nuclear track detectors

The development of high intensity petawatt lasers has created new possibilities for ion acceleration and nuclear fusion using solid targets. In such laser-matter interaction, multiple ion species are accelerated with broad spectra up to hundreds of MeV. To measure ion yields and for species identification, CR-39 solid-state nuclear track detectors are frequently used. However, these detectors are limited in their applicability for multi-ion spectra differentiation as standard image recognition algorithms can lead to a misinterpretation of data, there is no unique relation between track diameter and particle energy, and there are overlapping pit diameter relationships for multiple particle species. In this report, we address these issues by first developing an algorithm to overcome user bias during image processing. Second, we use calibration of the detector response for protons, carbon and helium ions (alpha particles) from 0.1 to above 10 MeV and measurements of statistical energy loss fluctuations in a forward-fitting procedure utilizing multiple, differently filtered CR-39, altogether enabling high-sensitivity, multi-species particle spectroscopy. To validate this capability, we show that inferred CR-39 spectra match Thomson parabola ion spectrometer data from the same experiment. Filtered CR-39 spectrometers were used to detect, within a background of ~ 2 × 10 11 sr -1 J -1 protons and carbons, (1.3 ± 0.7) × 10 8 sr -1 J -1 alpha particles from laser-driven proton-boron fusion reactions.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

SmoQyDEAC.jl: A differential evolution package for the analytic continuation of imaginary time correlation functions

We introduce the SmoQyDEAC.jl package, a Julia implementation of the Differential Evolution Analytic Continuation (DEAC) algorithm [N. S. Nichols et al., Phys. Rev. E 106, 025312 (2022)] for analytically continuing noisy imaginary time correlation functions to the real frequency axis. Our implementation supports fermionic and bosonic correlation functions on either the imaginary time or Matsubara frequency axes, and treatment of the covariance error in the input data. This paper presents an overview of the DEAC algorithm and the features implemented in the SmoQyDEAC.jl package. It also provides detailed benchmarks of the package's output against the popular maximum entropy and stochastic analytic continuation methods.

97 MATHEMATICS AND COMPUTING↗

Codebase release r1.1 for SmoQyDEAC.jl

We introduce the SmoQyDEAC.jl package, a Julia implementation of the Differential Evolution Analytic Continuation (DEAC) algorithm [N. S. Nichols et al., Phys. Rev. E 106, 025312 (2022)] for analytically continuing noisy imaginary time correlation functions to the real frequency axis. Our implementation supports fermionic and bosonic correlation functions on either the imaginary time or Matsubara frequency axes, and treatment of the covariance error in the input data. This paper presents an overview of the DEAC algorithm and the features implemented in the SmoQyDEAC.jl package. It also provides detailed benchmarks of the package’s output against the popular maximum entropy and stochastic analytic continuation methods. The code for this package can be downloaded from our GitHub repository at https://github.com/SmoQySuite/SmoQyDEAC.jl or installed using the Julia package manager. The online documentation, including examples, can be accessed at https://smoqysuite.github.io/SmoQyDEAC.jl/stable/.

Neuhaus, James (ORCID:0000000169048510)↗

Electromagnetic Design Optimization Integrated with Mechanical Stress Analysis of PM-Assisted Synchronous Reluctance Machine Topologies Enabled with a Blend of Magnets

Permanent Magnet-Assisted Synchronous Reluctance Machines (PMASynRM) provide a low-cost alternative to Surface PM Machines due to the use of relatively lower grades of rare-earth (RE) or RE-free magnets, as the performance degradation due to weaker magnets is compensated by the presence of reluctance torque. However, the weaker magnets suffer from a high risk of demagnetization, leading to unreliable motor operation. Using a blend of RE and RE-free magnets has the potential to overcome this issue. This paper proposes to blend different grades of various rare-earth (RE) and rare-earth-free (RE-free) magnets in six different combinations and utilizes them in two-layer and three-layer U-shaped PMASynRM topologies with both eight-pole and six-pole variations. The rotor of the various designs is then optimized using a differential evolution (DE) based optimization algorithm to obtain low-cost designs with reduced RE magnet volume and minimum demagnetization risk. The optimization of each design is also integrated with the evaluation of mechanical stresses in the rotor laminations so as to maintain the stresses below the material yield strength. Furthermore, the various performance metrics, such as toque–speed/power–speed characteristics, demagnetization, and efficiency maps, are evaluated for each of the optimized and mechanically feasible designs. A quantitative comparison of the various optimized designs is also obtained to highlight the various trade-offs. The results indicate the feasibility of meeting the baseline torque requirement across the entire speed range, even with a 100% reduction in RE magnet volume and less than 5% demagnetization risk, while achieving a cost reduction exceeding 50%. Moreover, the two-layer, eight-pole designs exhibit relatively higher performance, whereas the three-layer, eight-pole designs are found to be the most economical option.

design optimization↗

Decision surface estimate of nonlinear system stability domain by Lie series method.

The Lie series recursive algorithm for Zubov's partial differential equation is used to generate two sets of points, where one represents the exact asymptotic stability boundary of an equilibrium state of the nonlinear system under consideration and the other is interior to it. Based on these two sets of data as training samples of two classes, a decision hypersurface can be determined such that it is a close approximation of the asymptotic stability boundary.

Kormanik, J.↗

On least squares approximations to indefinite problems of the mixed type

A least squares method is presented for computing approximate solutions of indefinite partial differential equations of the mixed type such as those that arise in connection with transonic flutter analysis. The method retains the advantages of finite difference schemes namely simplicity and sparsity of the resulting matrix system. However, it offers some great advantages over finite difference schemes. First, the method is insensitive to the value of the forcing frequency, i.e., the resulting matrix system is always symmetric and positive definite. As a result, iterative methods may be successfully employed to solve the matrix system, thus taking full advantage of the sparsity. Furthermore, the method is insensitive to the type of the partial differential equation, i.e., the computational algorithm is the same in elliptic and hyperbolic regions. In this work the method is formulated and numerical results for model problems are presented. Some theoretical aspects of least squares approximations are also discussed.

Fix, G. J.↗

Improved local linearization algorithm for solving the quaternion equations

The objective of this paper is to develop a new and more accurate local linearization algorithm for numerically solving sets of linear time-varying differential equations. Of special interest is the application of this algorithm to the quaternion rate equations. The results are compared, both analytically and experimentally, with previous results using local linearization methods. The new algorithm requires approximately one-third more calculations per step than the previously developed local linearization algorithm; however, this disadvantage could be reduced by using parallel implementation. For some cases the new algorithm yields significant improvement in accuracy, even with an enlarged sampling interval. The reverse is true in other cases. The errors depend on the values of angular velocity, angular acceleration, and integration step size. One important result is that for the worst case the new algorithm can guarantee eigenvalues nearer the region of stability than can the previously developed algorithm.

Yen, K.↗

A new approach to mixed H2/H infinity controller synthesis using gradient-based parameter optimization methods

In the past few years, the mixed H(sub 2)/H-infinity control problem has been the object of much research interest since it allows the incorporation of robust stability into the LQG framework. The general mixed H(sub 2)/H-infinity design problem has yet to be solved analytically. Numerous schemes have considered upper bounds for the H(sub 2)-performance criterion and/or imposed restrictive constraints on the class of systems under investigation. Furthermore, many modern control applications rely on dynamic models obtained from finite-element analysis and thus involve high-order plant models. Hence the capability to design low-order (fixed-order) controllers is of great importance. In this research a new design method was developed that optimizes the exact H(sub 2)-norm of a certain subsystem subject to robust stability in terms of H-infinity constraints and a minimal number of system assumptions. The derived algorithm is based on a differentiable scalar time-domain penalty function to represent the H-infinity constraints in the overall optimization. The scheme is capable of handling multiple plant conditions and hence multiple performance criteria and H-infinity constraints and incorporates additional constraints such as fixed-order and/or fixed structure controllers. The defined penalty function is applicable to any constraint that is expressible in form of a real symmetric matrix-inequity.

Ly, Uy-Loi↗

The analysis of control trajectories using symbolic and database computing

This final report comprises the formal semi-annual status reports for this grant for the periods June 30-December 31, 1993, January 1-June 30, 1994, and June 1-December 31, 1994. The research supported by this grant is broadly concerned with the symbolic computation, mixed numeric-symbolic computation, and database computation of trajectories of dynamical systems, especially control systems. A review of work during the report period covers: trajectories and approximating series, the Cayley algebra of trees, actions of differential operators, geometrically stable integration algorithms, hybrid systems, trajectory stores, PTool, and other activities. A list of publications written during the report period is attached.

Grossman, Robert↗

Operations for Learning with Graphical Models

This paper is a multidisciplinary review of empirical, statistical learning from a graphical model perspective. Well-known examples of graphical models include Bayesian net- works, directed graphs representing a Markov chain, and undirected networks representing a Markov field. These graphical models are extended to model data analysis and empirical learning using the notation of plates. Graphical operations for simplifying and manipulating a problem are provided including decomposition, differentiation, and the manipulation of probability models from the exponential family. These operations adapt existing techniques from statistics and automatic differentiation to graphs. Two standard algorithm schemes for learning are reviewed in a graphical framework: Gibbs sampling and the expectation maximization algorithm. Some algorithms are developed in this graphical framework including a generalized version of linear regression, techniques for feed-forward networks, and learning Gaussian and discrete Bayesian networks from data. The paper concludes by sketching some implications for data analysis and summarizing some popular algorithms that fall within the framework presented. The main original contributions here are the decomposition techniques and the demonstration that graphical models provide a framework for understanding and developing complex learning algorithms.

Buntine, Wray L.↗

Image Mission Attitude Support Experiences

The spin-stabilized Imager for Magnetopause to Aurora Global Exploration (IMAGE) is the National Aeronautics and Space Administration's (NASA's) first Medium-class Explorer Mission (MIDEX). IMAGE was launched into a highly elliptical polar orbit on March 25, 2000 from Vandenberg Air Force Base, California, aboard a Boeing Delta II 7326 launch vehicle. This paper presents some of the observations of the flight dynamics analyses during the launch and in-orbit checkout period through May 18, 2000. Three new algorithms - one algebraic and two differential correction - for computing the parameters of the coning motion of a spacecraft are described and evaluated using in-flight data from the autonomous star tracker (AST) on IMAGE. Other attitude aspects highlighted include support for active damping consequent upon the failure of the passive nutation damper, performance evaluation of the AST, evaluation of the Sun sensor and magnetometer using AST data, and magnetometer calibration.

Ottenstein, N.↗

Dynamics of Numerics and CFD

This lecture attempts to illustrate the basic ideas of how the recent advances in nonlinear dynamical systems theory (dynamics) can provide new insights into the understanding of numerical algorithms used in solving nonlinear differential equations (DEs). Examples will be given of the use of dynamics to explain unusual phenomena that occur in numerics. The inadequacy of the use of linearized analysis for the understanding of long time behavior of nonlinear problems will be illustrated, and the role of dynamics in studying the nonlinear stability, accuracy, convergence property and efficiency of using time- dependent approaches to obtaining steady-state numerical solutions in computational fluid dynamics (CFD) will briefly be explained.

Yee, H. C.↗

Differentially Variable Component Analysis (dVCA): Identifying Multiple Evoked Components using Trial-to-Trial Variability

Electric potentials and magnetic fields generated by ensembles of synchronously active neurons in response to external stimuli provide information essential to understanding the processes underlying cognitive and sensorimotor activity. Interpreting recordings of these potentials and fields is difficult as each detector records signals simultaneously generated by various regions throughout the brain. We introduce the differentially Variable Component Analysis (dVCA) algorithm, which relies on trial-to-trial variability in response amplitude and latency to identify multiple components. Using simulations we evaluate the importance of response variability to component identification, the robustness of dVCA to noise, and its ability to characterize single-trial data. Finally, we evaluate the technique using visually evoked field potentials recorded at incremental depths across the layers of cortical area VI, in an awake, behaving macaque monkey.

Knuth, Kevin H.↗

Application of the Finite Element Method in Atomic and Molecular Physics

The finite element method (FEM) is a numerical algorithm for solving second order differential equations. It has been successfully used to solve many problems in atomic and molecular physics, including bound state and scattering calculations. To illustrate the diversity of the method, we present here details of two applications. First, we calculate the non-adiabatic dipole polarizability of Hi by directly solving the first and second order equations of perturbation theory with FEM. In the second application, we calculate the scattering amplitude for e-H scattering (without partial wave analysis) by reducing the Schrodinger equation to set of integro-differential equations, which are then solved with FEM.

Shertzer, Janine↗

UAVSAR: Airborne L-band Radar for Repeat Pass Interferometry

The primary objectives of the UAVSAR Project were to: a) develop a miniaturized polarimetric L-band synthetic aperture radar (SAR) for use on an unmanned aerial vehicle (UAV) or piloted vehicle. b) develop the associated processing algorithms for repeat-pass differential interferometric measurements using a single antenna. c) conduct measurements of geophysical interest, particularly changes of rapidly deforming surfaces such as volcanoes or earthquakes. Two complete systems were developed. Operational Science Missions began on February 18, 2009 ... concurrent development and testing of the radar system continues.

Moes, Timothy R.↗