Search NASA⌕ Search

SEARCH · Search NASA

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 1,603 records · Page 89

Variational multiscale element-free Galerkin method combined with the moving Kriging interpolation for solving some partial differential equations with discontinuous solutions

Solving partial differential equations with discontinuous solutions is an important challenging problem in numerical analysis. To this end, there are some methods such as finite volume method, discontinuous Galerkin approach and particle technique that are able to solve these problems. In the current paper, the moving Kriging element-free Galerkin method has been combined with the variational multiscale algorithm to obtain acceptable and high-resolution solutions. For testing this technique, we select some PDEs with discontinuous solution such as Burgers’, Sod’s shock tube, advection–reaction–diffusion, Kuramoto–Sivashinsky, Boussinesq and shallow water equations. First, we obtain a time-discrete scheme by approximating time derivative via finite difference technique. Then we introduce the moving Kriging interpolation and also obtain their shape functions. We use the element-free Galerkin method for approximating the spatial derivatives. This method uses a weak form of the considered equation that is similar to the finite element method with the difference that in the classical element-free Galerkin method test and trial functions are moving least squares approximation (MLS) shape functions. Since the shape functions of moving least squares (MLS) approximation do not have Kronecker delta property, we cannot implement the essential boundary condition, directly. Thus, we employ the shape functions of moving Kriging interpolation and radial point interpolation technique which have the mentioned property. Also, in the element-free Galekin method, we do not use any triangular, quadrangular or other type of meshes. The element-free Galerkin method is a global method while finite element method is a local one. This technique employs a background mesh for integration which makes it different from the truly mesh procedures. Several test problems are solved and numerical simulations are reported which confirm the efficiency of the proposed schemes.

97 MATHEMATICS AND COMPUTING↗

EM reconstruction of dual isotope PET using staggered injections and prompt gamma positron emitters

Purpose: The aim of dual isotope positron emission tomography (DIPET) is to create two separate images of two coinjected PET radiotracers. DIPET shortens the duration of the study, reduces patient discomfort, and produces perfectly coregistered images compared to the case when two radiotracers would be imaged independently (sequential PET studies). Reconstruction of data from such simultaneous acquisition of two PET radiotracers is difficult because positron decay of any isotope creates only 511 keV photons; therefore, the isotopes cannot be differentiated based on the detected energy. Methods: Recently, the authors have proposed a DIPET technique that uses a combination of radiotracer A which is a pure positron emitter (such as{sup 18}F or {sup 11}C) and radiotracer B in which positron decay is accompanied by the emission of a high-energy (HE) prompt gamma (such as {sup 38}K or {sup 60}Cu). Events that are detected as triple coincidences of HE gammas with the corresponding two 511 keV photons allow the authors to identify the lines-of-response (LORs) of isotope B. These LORs are used to separate the two intertwined distributions, using a dedicated image reconstruction algorithm. In this work the authors propose a new version of the DIPET EM-based reconstruction algorithm that allows the authors to include an additional, independent estimate of radiotracer A distribution which may be obtained if radioisotopes are administered using a staggered injections method. In this work the method is tested on simple simulations of static PET acquisitions. Results: The authors’ experiments performed using Monte-Carlo simulations with static acquisitions demonstrate that the combined method provides better results (crosstalk errors decrease by up to 50%) than the positron-gamma DIPET method or staggered injections alone. Conclusions: The authors demonstrate that the authors’ new EM algorithm which combines information from triple coincidences with prompt gammas and staggered injections improves the accuracy of DIPET reconstructions for static acquisitions so they reach almost the benchmark level calculated for perfectly separated tracers.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Direct construction of optimized stellarator shapes. Part 2. Numerical quasisymmetric solutions

Quasisymmetric stellarators are appealing intellectually and as fusion reactor candidates since the guiding-centre particle trajectories and neoclassical transport are isomorphic to those in a tokamak, implying good confinement. Previously, quasisymmetric magnetic fields have been identified by applying black-box optimization algorithms to minimize symmetry-breaking Fourier modes of the field strength $B$ . Here, instead, we directly construct magnetic fields in cylindrical coordinates that are quasisymmetric to leading order in the distance from the magnetic axis, without using optimization. The approach involves solution of a one-dimensional nonlinear ordinary differential equation, originally derived by Garren & Boozer ( Phys. Fluids B, vol. 3, 1991, p. 2805). We illustrate the usefulness and accuracy of this optimization-free approach by providing the results of this construction as input to the codes VMEC and BOOZ_XFORM, confirming the purity and scaling of the magnetic spectrum. The space of magnetic fields that are quasisymmetric to this order is parameterized by the magnetic axis shape along with three other real numbers, one of which reflects the on-axis toroidal current density, and another one of which is zero for stellarator symmetry. The method here could be used to generate good initial conditions for conventional optimization, and its speed enables exhaustive searches of parameter space.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Hyper-Differential Sensitivity Analysis of Uncertain Parameters in PDE-Constrained Optimization

Many problems in engineering and sciences require the solution of large scale optimization constrained by partial differential equations (PDEs). Though PDE-constrained optimization is itself challenging, most applications pose additional complexity, namely, uncertain parameters in the PDEs. Uncertainty quantification (UQ) is necessary to characterize, prioritize, and study the influence of these uncertain parameters. Sensitivity analysis, a classical tool in UQ, is frequently used to study the sensitivity of a model to uncertain parameters. In this article, we introduce "hyper-differential sensitivity analysis" which considers the sensitivity of the solution of a PDE-constrained optimization problem to uncertain parameters. Our approach is a goal-oriented analysis which may be viewed as a tool to complement other UQ methods in the service of decision making and robust design. We formally define hyper-differential sensitivity indices and highlight their relationship to the existing optimization and sensitivity analysis literatures. Assuming the presence of low rank structure in the parameter space, computational efficiency is achieved by leveraging a generalized singular value decomposition in conjunction with a randomized solver which converts the computational bottleneck of the algorithm into an embarrassingly parallel loop. Two multi-physics examples, consisting of nonlinear steady state control and transient linear inversion, demonstrate efficient identification of the uncertain parameters which have the greatest influence on the optimal solution.

97 MATHEMATICS AND COMPUTING↗

Project Report: High Frequency Axion LDRD - A Multiport Approach to Thermal Noise and Scattering Parameter Simulation of Cryogenic Experiments

In this report, a simple algorithm for detailed system-level thermal noise analysis is developed, demonstrated, and verified. This method uses noise-wave theory and noise covariance matrices to cascade noise and scattering parameters of multiport devices at different temperatures. This method addresses the effects of return loss, multiport isolation/coupling, and static temperature differentials between components, and will work in cases where the noise temperature is at or near the quantum noise limit. An ideal multidevice network will first be demonstrated to show that this method’s results are consistent with the Friis cascade when component parameters such as return loss and isolation are ideal. Following the ideal multidevice example, a cryogenic experiment is conducted to demonstrate that the proposed simulation method is successful when real data are used.

42 ENGINEERING↗

Finite difference procedure for boundary layers including effects of longitudinal and transverse curvatures

A second order viscous layer solution procedure has been developed that does in a consistent way include curvature effects and the corresponding normal pressure gradients. In the present system, the normal momentum equation is retained. The parabolic system of nonlinear partial differential equations is converted by linear finite differencing procedures to a system of linear algebraic equations and solved in primitive coordinates. The solutions have been shown to give smooth stable distributions for all the variables, most particularly the normal velocity which plays an important role in the interaction procedure. An algorithm for matching the viscous layer solution with a rotational characteristics outer solution has been developed.

Tassa, Y.↗

Multiphysics Time-Integration for Turbulent Combustion at the Exascale

Turbulent reacting flow systems are often modeled with coupled time-dependent partial differential equations (PDEs). Solving such equations can easily tax the world's largest supercomputers. One pragmatic strategy for attacking such problems is to split the PDEs into components that can more easily be solved in isolation. This generic operator-splitting strategy leads to a set of ordinary differential equations (ODEs) that need to be solved as part of an "outer-loop" time-stepping approach. In many combustion applications, the ODEs to be solved can be very stiff, exhibiting timescales that span many orders of magnitude. The SUNDIALS library provides a plethora of robust time integration algorithms for solving these ODEs on exascale-capable computing hardware, yet for many complex applications (such multicomponent fuels or emissions predictions), the chemical models remain too complex to solve using reasonable resources. The Quasi-Steady State Approximation (QSSA) can be an effective tool for reducing the size and stiffness of the simulations. In this talk, I will discuss the use of the SUDIALS library of ODE solvers together with automatic code generation tools to solve complex turbulent reacting flow problems using QSSA models.

chemistry↗

Functionality and operation of fluoroscopic automatic brightness control/automatic dose rate control logic in modern cardiovascular and interventional angiography systems: A Report of Task Group 125 Radiography/Fluoroscopy Subcommittee, Imaging Physics Committee, Science Council

Task Group 125 (TG 125) was charged with investigating the functionality of fluoroscopic automatic dose rate and image quality control logic in modern angiographic systems, paying specific attention to the spectral shaping filters and variations in the selected radiologic imaging parameters. The task group was also charged with describing the operational aspects of the imaging equipment for the purpose of assisting the clinical medical physicist with clinical set-up and performance evaluation. Although there are clear distinctions between the fluoroscopic operation of an angiographic system and its acquisition modes (digital cine, digital angiography, digital subtraction angiography, etc.), the scope of this work was limited to the fluoroscopic operation of the systems studied. The use of spectral shaping filters in cardiovascular and interventional angiography equipment has been shown to reduce patient dose. If the imaging control algorithm were programmed to work in conjunction with the selected spectral filter, and if the generator parameters were optimized for the selected filter, then image quality could also be improved. Although assessment of image quality was not included as part of this report, it was recognized that for fluoroscopic imaging the parameters that influence radiation output, differential absorption, and patient dose are also the same parameters that influence image quality. Therefore, this report will utilize the terminology ''automatic dose rate and image quality'' (ADRIQ) when describing the control logic in modern interventional angiographic systems and, where relevant, will describe the influence of controlled parameters on the subsequent image quality. A total of 22 angiography units were investigated by the task group and of these one each was chosen as representative of the equipment manufactured by GE Healthcare, Philips Medical Systems, Shimadzu Medical USA, and Siemens Medical Systems. All equipment, for which measurement data were included in this report, was manufactured within the three year period from 2006 to 2008. Using polymethylmethacrylate (PMMA) plastic to simulate patient attenuation, each angiographic imaging system was evaluated by recording the following parameters: tube potential in units of kilovolts peak (kVp), tube current in units of milliamperes (mA), pulse width (PW) in units of milliseconds (ms), spectral filtration setting, and patient air kerma rate (PAKR) as a function of the attenuator thickness. Data were graphically plotted to reveal the manner in which the ADRIQ control logic responded to changes in object attenuation. There were similarities in the manner in which the ADRIQ control logic operated that allowed the four chosen devices to be divided into two groups, with two of the systems in each group. There were also unique approaches to the ADRIQ control logic that were associated with some of the systems, and these are described in the report. The evaluation revealed relevant information about the testing procedure and also about the manner in which different manufacturers approach the utilization of spectral filtration, pulsed fluoroscopy, and maximum PAKR limitation. This information should be particularly valuable to the clinical medical physicist charged with acceptance testing and performance evaluation of modern angiographic systems.

61 RADIATION PROTECTION AND DOSIMETRY↗

DAG-Based Software Frameworks for PDEs

The task-based approach to software and parallelism is well-known and has been proposed as a potential candidate, named the silver model, for exascale software. This approach is not yet widely used in the large-scale multi-core parallel computing of complex systems of partial differential equations. After surveying task-based approaches we investigate how well the Uintah software and an extension named Wasatch fit in the task-based paradigm and how well they perform on large scale parallel computers. The conclusion is that these approaches show great promise for petascale but that considerable algorithmic challenges remain.

Directed Acyclic Graph↗

Numerical Method for Fractional Advection-Diffusion Equation with Heredity

We propose a method of construction of difference schemes for fractional partial differential equations with delay in time. For the fractional equation with two-sided diffusion, fractional transfer in time, and a functional aftereffect, we construct an implicit difference scheme. We use the shifted Grünwald–Letnikov formulas for the approximation of fractional derivatives with respect to spatial variables and the L1-algorithm for the approximation of fractional derivatives in time. Also we use piecewise constant interpolation and extrapolation by extending the discrete prehistory of the model in time. The algorithm is a fractional analog of a purely implicit method; on each time step, it is reduced to the solution of linear algebraic systems. We prove the stability of the method and find its order of convergence.

97 MATHEMATICS AND COMPUTING↗

Accelerating multilevel Markov Chain Monte Carlo using machine learning models

Here, this work presents an efficient approach for accelerating multilevel Markov Chain Monte Carlo (MCMC) sampling for large-scale problems using low-fidelity machine learning models. While conventional techniques for large-scale Bayesian inference often substitute computationally expensive high-fidelity models with machine learning models, thereby introducing approximation errors, our approach offers a computationally efficient alternative by augmenting high-fidelity models with low-fidelity ones within a hierarchical framework. The multilevel approach utilizes the low-fidelity machine learning model (MLM) for inexpensive evaluation of proposed samples thereby improving the acceptance of samples by the high-fidelity model. The hierarchy in our multilevel algorithm is derived from geometric multigrid hierarchy. We utilize an MLM to accelerate the coarse level sampling. Training machine learning model for the coarsest level significantly reduces the computational cost associated with generating training data and training the model. We present an MCMC algorithm to accelerate the coarsest level sampling using MLM and account for the approximation error introduced. We provide theoretical proofs of detailed balance and demonstrate that our multilevel approach constitutes a consistent MCMC algorithm. Additionally, we derive the expression for cost reduction due to machine learning model to facilitate cost analysis of the hierarchical sampling algorithm. Our technique is demonstrated on a standard benchmark inference problem in groundwater flow, where we estimate the probability density of a quantity of interest using a four-level MCMC algorithm. Our proposed algorithm accelerates multilevel sampling by a factor of two while achieving similar accuracy compared to sampling using the standard multilevel algorithm.

97 MATHEMATICS AND COMPUTING↗

GP-BayesOpInf

SAND2025-01851O GP-BayesOpInf is a software tool that uses algorithms to combine Gaussian process regression, principal component analysis, and linear Bayesian inference to produce a probabilistic reduced-order model for time-dependent systems. Numerical examples include the compressible Euler equations for an ideal gas, a heat diffusion process with a nonlinear reaction term, and a set of ordinary differential equations describing a compartmental model in epidemiology. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

SciDAC↗

Kinetic Model of HoxEFU reduction by NADH [SWR-26-087]

This repository is used to release code generated for manuscripts on the Photosynthetic Energy Transduction core program. This code simulates the reduction of HoxEFU by NADH. The electro transfer rate constants for the simulation are specified in the .csv files. The two .csv files correspond tot he two models described in Dawson et al. Cell. Rep. Phys. Sci. 2026. The code utilizes a chemical master equation, a set of differential equations, defining the time evolution of the oxidation and reduction kinetics of NAD+, NADH, a FMN flavin, and a set of iron sulfur clusters. The kinetics of HoxEFU reduction by NADH are evaluated by numerical integration of the chemical master equation using a variable-time-step Runge-Kutta algorithm.

Dahl, Peter [National Laboratory of the Rockies (N↗

Genetic Signatures in the Envelope Glycoproteins of HIV-1 that Associate with Broadly Neutralizing Antibodies

A steady increase in knowledge of the molecular and antigenic structure of the gp120 and gp41 HIV-1 envelope glycoproteins (Env) is yielding important new insights for vaccine design, but it has been difficult to translate this information to an immunogen that elicits broadly neutralizing antibodies. To help bridge this gap, we used phylogenetically corrected statistical methods to identify amino acid signature patterns in Envs derived from people who have made potently neutralizing antibodies, with the hypothesis that these Envs may share common features that would be useful for incorporation in a vaccine immunogen. Before attempting this, essentially as a control, we explored the utility of our computational methods for defining signatures of complex neutralization phenotypes by analyzing Env sequences from 251 clonal viruses that were differentially sensitive to neutralization by the well-characterized gp120-specific monoclonal antibody, b12. We identified ten b12-neutralization signatures, including seven either in the b12-binding surface of gp120 or in the V2 region of gp120 that have been previously shown to impact b12 sensitivity. A simple algorithm based on the b12 signature pattern was predictive of b12 sensitivity/resistance in an additional blinded panel of 57 viruses. Upon obtaining these reassuring outcomes, we went on to apply these same computational methods to define signature patterns in Env from HIV-1 infected individuals who had potent, broadly neutralizing responses. We analyzed a checkerboard-style neutralization dataset with sera from 69 HIV-1-infected individuals tested against a panel of 25 different Envs. Distinct clusters of sera with high and low neutralization potencies were identified. Six signature positions in Env sequences obtained from the 69 samples were found to be strongly associated with either the high or low potency responses. Five sites were in the CD4-induced coreceptor binding site of gp120, suggesting an important role for this region in the elicitation of broadly neutralizing antibody responses against HIV-1.

59 BASIC BIOLOGICAL SCIENCES↗

SAR terrain classifier and mapper of biophysical attributes

In preparation for the launch of SIR-C/X-SAR and design studies for future orbital SAR, a program has made considerable progress in the development of an SAR terrain classifier and algorithms for quantification of biophysical attributes. The goal of this program is to produce a generalized software package for terrain classification and estimation of biophysical attributes and to make this package available to the larger scientific community. The basic elements of the SAR (Synthetic Aperture Radar) terrain classifier are outlined. An SAR image is calibrated with respect to known system and processor gains and external targets (if available). A Level 1 classifier operates on the data to differentiate: urban features, surfaces and tall and short vegetation. Level 2 classifiers further subdivide these classes on the basis of structure. Finally, biophysical and geophysical inversions are applied to each class to estimate attributes of interest. The process used to develop the classifiers and inversions is shown. Radar scattering models developed from theory and from empirical data obtained by truck-mounted polarimeters and the JPL AirSAR are validated. The validated models are used in sensitivity studies to understand the roles of various scattering sources (i.e., surface trunk, branches, etc.) in determining net backscatter. Model simulations of sigma (sup o) as functions of the wave parameters (lambda, polarization and angle of incidence) and the geophysical and biophysical attributes are used to develop robust classifiers. The classifiers are validated using available AirSAR data sets. Specific estimators are developed for each class on the basis of the scattering models and empirical data sets. The candidate algorithms are tested with the AirSAR data sets. The attributes of interest include: total above ground biomass, woody biomass, soil moisture and soil roughness.

Ulaby, Fawwaz T.↗

Sparse maps—A systematic infrastructure for reduced-scaling electronic structure methods. I. An efficient and simple linear scaling local MP2 method that uses an intermediate basis of pair natural orbitals

In this work, a systematic infrastructure is described that formalizes concepts implicit in previous work and greatly simplifies computer implementation of reduced-scaling electronic structure methods. The key concept is sparse representation of tensors using chains of sparse maps between two index sets. Sparse map representation can be viewed as a generalization of compressed sparse row, a common representation of a sparse matrix, to tensor data. By combining few elementary operations on sparse maps (inversion, chaining, intersection, etc.), complex algorithms can be developed, illustrated here by a linear-scaling transformation of three-center Coulomb integrals based on our compact code library that implements sparse maps and operations on them. The sparsity of the three-center integrals arises from spatial locality of the basis functions and domain density fitting approximation. A novel feature of our approach is the use of differential overlap integrals computed in linear-scaling fashion for screening products of basis functions. Finally, a robust linear scaling domain based local pair natural orbital second-order Möller-Plesset (DLPNO-MP2) method is described based on the sparse map infrastructure that only depends on a minimal number of cutoff parameters that can be systematically tightened to approach 100% of the canonical MP2 correlation energy. With default truncation thresholds, DLPNO-MP2 recovers more than 99.9% of the canonical resolution of the identity MP2 (RI-MP2) energy while still showing a very early crossover with respect to the computational effort. Based on extensive benchmark calculations, relative energies are reproduced with an error of typically <0.2 kcal/mol. The efficiency of the local MP2 (LMP2) method can be drastically improved by carrying out the LMP2 iterations in a basis of pair natural orbitals. While the present work focuses on local electron correlation, it is of much broader applicability to computation with sparse tensors in quantum chemistry and beyond.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Rayleigh wave numerical dispersion in a 3D finite-difference algorithm.

A Rayleigh wave propagates laterally without dispersion in the vicinity of the plane stress-free surface of a homogeneous and isotropic elastic halfspace. The phase speed is independent of frequency and depends only on the Poisson ratio of the medium. However, after temporal and spatial discretization, a Rayleigh wave simulated by a 3D staggered-grid finite-difference (FD) seismic wave propagation algorithm suffers from frequency- and direction-dependent numerical dispersion. The magnitude of this dispersion depends critically on FD algorithm implementation details. Nevertheless, proper gridding can control numerical dispersion to within an acceptable level, leading to accurate Rayleigh wave simulations. Many investigators have derived dispersion relations appropriate for body wave propagation by various FD algorithms. However, the situation for surface waves is less well-studied. We have devised a numerical search procedure to estimate Rayleigh phase speed and group speed curves for 3D O(2,2) and O(2,4) staggered-grid FD algorithms. In contrast with the continuous time-space situation (where phase speed is obtained by extracting the appropriate root of the Rayleigh cubic), we cannot develop a closed-form mathematical formula governing the phase speed. Rather, we numerically seek the particular phase speed that leads to a solution of the discrete wave propagation equations, while holding medium properties, frequency, horizontal propagation direction, and gridding intervals fixed. Group speed is then obtained by numerically differentiating the phase speed with respect to frequency. The problem is formulated for an explicit stress-free surface positioned at two different levels within the staggered spatial grid. Additionally, an interesting variant involving zero-valued medium properties above the surface is addressed. We refer to the latter as an implicit free surface. Our preliminary conclusion is that an explicit free surface, implemented with O(4) spatial FD operators and positioned at the level of the compressional stress components, leads to superior numerical dispersion performance. Phase speeds measured from fixed-frequency synthetic seismograms agree very well with the numerical predictions.

58 GEOSCIENCES↗

IMAGING STARSPOT EVOLUTION ON KEPLER TARGET KIC 5110407 USING LIGHT-CURVE INVERSION

The Kepler target KIC 5110407, a K-type star, shows strong quasi-periodic light curve fluctuations likely arising from the formation and decay of spots on the stellar surface rotating with a period of 3.4693 days. Using an established light-curve inversion algorithm, we study the evolution of the surface features based on Kepler space telescope light curves over a period of two years (with a gap of .25 years). At virtually all epochs, we detect at least one large spot group on the surface causing a 1%-10% flux modulation in the Kepler passband. By identifying and tracking spot groups over a range of inferred latitudes, we measured the surface differential rotation to be much smaller than that found for the Sun. We also searched for a correlation between the 17 stellar flares that occurred during our observations and the orientation of the dominant surface spot at the time of each flare. No statistically significant correlation was found except perhaps for the very brightest flares, suggesting that most flares are associated with regions devoid of spots or spots too small to be clearly discerned using our reconstruction technique. While we may see hints of long-term changes in the spot characteristics and flare statistics within our current data set, a longer baseline of observation will be needed to detect the existence of a magnetic cycle in KIC 5110407.

79 ASTRONOMY AND ASTROPHYSICS↗