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,171 records · Page 65

Optimization methods and silicon solar cell numerical models

An optimization algorithm for use with numerical silicon solar cell models was developed. By coupling an optimization algorithm with a solar cell model, it is possible to simultaneously vary design variables such as impurity concentrations, front junction depth, back junction depth, and cell thickness to maximize the predicted cell efficiency. An optimization algorithm was developed and interfaced with the Solar Cell Analysis Program in 1 Dimension (SCAP1D). SCAP1D uses finite difference methods to solve the differential equations which, along with several relations from the physics of semiconductors, describe mathematically the performance of a solar cell. A major obstacle is that the numerical methods used in SCAP1D require a significant amount of computer time, and during an optimization the model is called iteratively until the design variables converge to the values associated with the maximum efficiency. This problem was alleviated by designing an optimization code specifically for use with numerically intensive simulations, to reduce the number of times the efficiency has to be calculated to achieve convergence to the optimal solution.

Girardini, K.↗

Development of a gridless CFD method

The objective of this paper is to stimulate ideas concerning alternative approaches to discretizing fluid flow problems, i.e., the so-called gridless approach. The gridless approach uses only clouds of points and does not require that the points be connected to form a grid as is necessary in conventional CFD algorithms. The governing equations are solved directly by performing local least-squares curve fits in each cloud of points and then analytically differentiating the resulting curve fits to approximate the derivatives. A discussion of these topics is presented in viewgraph form.

John T Batina↗

Glaciological studies in the central Andes using AIRSAR/TOPSAR

The interaction of climate and topography in mountainous regions is dramatically expressed in the spatial distribution of glaciers and snowcover. Monitoring existing alpine glaciers and snow extent provides insight into the present mountain climate system and how it is changing, while mapping the positions of former glaciers as recorded in landforms such as cirques and moraines provide a record of the large past climate change associated with the last glacial maximum. The Andes are an ideal mountain range in which to study the response of snow and ice to past and present climate change. Their expansive latitudinal extent offers the opportunity to study glaciers in diverse climate settings from the tropical glaciers of Peru and Bolivia to the ice caps and tide-water glaciers of sub-polar Patagonia. SAR has advantages over traditional passive remote sensing instruments for monitoring present snow and ice and differentiating moraine relative ages. The cloud penetrating ability of SAR is indispensable for perennially cloud covered mountains. Snow and ice facies can be distinguished from SAR's response to surface roughness, liquid water content and grain size distribution. The combination of SAR with a coregestered high-resolution DEM (TOPSAR) provides a promising tool for measuring glacier change in three dimensions, thus allowing ice volume change to be measured directly. The change in moraine surface roughness over time enables SAR to differentiate older from younger moraines. Polarimetric SAR data have been used to distinguish snow and ice facies and relatively date moraines. However, both algorithms are still experimental and require ground truth verification. We plan to extend the SAR classification of snow and ice facies and moraine age beyond the ground truth sites to throughout the Cordillera Real to provide a regional view of past and present snow and ice. The high resolution DEM will enhance the SAR moraine dating technique by discriminating relative ages based on moraine slope degradation.

Forster, Richard R.↗

Robust Bioinformatics Recognition with VLSI Biochip Microsystem

A microsystem architecture for real-time, on-site, robust bioinformatic patterns recognition and analysis has been proposed. This system is compatible with on-chip DNA analysis means such as polymerase chain reaction (PCR)amplification. A corresponding novel artificial neural network (ANN) learning algorithm using new sigmoid-logarithmic transfer function based on error backpropagation (EBP) algorithm is invented. Our results show the trained new ANN can recognize low fluorescence patterns better than the conventional sigmoidal ANN does. A differential logarithmic imaging chip is designed for calculating logarithm of relative intensities of fluorescence signals. The single-rail logarithmic circuit and a prototype ANN chip are designed, fabricated and characterized.

bioinformatics↗

Temperature-dependent mechanical properties and crystal plasticity parameters for additively manufactured Haynes-214 alloy: Experiments and numerical modeling

Our experimental mechanical testing data demonstrated that the additively manufactured (AM) laser powder bed fusion (L-PBF) Haynes-214 alloy exhibits non-linear mechanical properties as the temperature rises from ambient to 870 °C. Crystal plasticity (CP) simulations provide an effective approach to gaining deeper insights into microstructure-property linkages under thermomechanical loading. This method can reduce the need for costly high-temperature mechanical testing while accounting for the effects of crystallographic texture and grain morphology on the mechanical behavior of AM materials. However, calibrating a CP model is time-consuming because individual simulations are computationally expensive and hundreds (or more) of iterations over parameter sets may be required. To address this issue, we have designed a machine learning-differential evolution (ML-DE) CP framework that can accurately interpolate the tensile properties of AM L-PBF Haynes-214 alloy across a wide temperature range from ambient to 870 °C, with minimal reliance on experimental data. The framework uses electron backscatter diffraction (EBSD) measurements to generate statistically equivalent microstructural volume elements to serve as inputs to the CP modeling framework. Stress–strain curves were generated from 1000 CP simulations, which serve as the training data set for the three ML regression algorithms explored: linear, extra-trees, and multi-layer perceptron. These three regression models were independently evaluated to compare their efficiency and identify the most suitable algorithm for the given problem. Results revealed that the extra-trees ML regressor outperforms the other models in both qualitative and quantitative aspects with an R 2 of 0.98. Subsequently, the differential evolution optimization approach is employed to calibrate the ML-based CP material parameters with experimental results obtained at various temperatures. Finally, temperature-dependent CP material parameters are formulated. The effectiveness and efficiency of the designed framework are validated through comparison with experimental results, demonstrating a high degree of agreement. These calibrated parametric constitutive equations enable further use of the CP model to study the deformation behavior of this alloy under a wide range of thermo-mechanical loading conditions.

36 MATERIALS SCIENCE↗

Comparison of multigrid algorithms for high‐order continuous finite element discretizations

Summary We present a comparison of different multigrid approaches for the solution of systems arising from high‐order continuous finite element discretizations of elliptic partial differential equations on complex geometries. We consider the pointwise Jacobi, the Chebyshev‐accelerated Jacobi, and the symmetric successive over‐relaxation smoothers, as well as elementwise block Jacobi smoothing. Three approaches for the multigrid hierarchy are compared: (1) high‐order h ‐multigrid, which uses high‐order interpolation and restriction between geometrically coarsened meshes; (2) p ‐multigrid, in which the polynomial order is reduced while the mesh remains unchanged, and the interpolation and restriction incorporate the different‐order basis functions; and (3) a first‐order approximation multigrid preconditioner constructed using the nodes of the high‐order discretization. This latter approach is often combined with algebraic multigrid for the low‐order operator and is attractive for high‐order discretizations on unstructured meshes, where geometric coarsening is difficult. Based on a simple performance model, we compare the computational cost of the different approaches. Using scalar test problems in two and three dimensions with constant and varying coefficients, we compare the performance of the different multigrid approaches for polynomial orders up to 16. Overall, both h ‐multigrid and p ‐multigrid work well; the first‐order approximation is less efficient. For constant coefficients, all smoothers work well. For variable coefficients, Chebyshev and symmetric successive over‐relaxation smoothing outperform Jacobi smoothing. While all of the tested methods converge in a mesh‐independent number of iterations, none of them behaves completely independent of the polynomial order. When multigrid is used as a preconditioner in a Krylov method, the iteration number decreases significantly compared with using multigrid as a solver. Copyright © 2015 John Wiley & Sons, Ltd.

Sundar, Hari↗

A model and variance reduction method for computing statistical outputs of stochastic elliptic partial differential equations

We present a model and variance reduction method for the fast and reliable computation of statistical outputs of stochastic elliptic partial differential equations. Our method consists of three main ingredients: (1) the hybridizable discontinuous Galerkin (HDG) discretization of elliptic partial differential equations (PDEs), which allows us to obtain high-order accurate solutions of the governing PDE; (2) the reduced basis method for a new HDG discretization of the underlying PDE to enable real-time solution of the parameterized PDE in the presence of stochastic parameters; and (3) a multilevel variance reduction method that exploits the statistical correlation among the different reduced basis approximations and the high-fidelity HDG discretization to accelerate the convergence of the Monte Carlo simulations. The multilevel variance reduction method provides efficient computation of the statistical outputs by shifting most of the computational burden from the high-fidelity HDG approximation to the reduced basis approximations. Furthermore, we develop a posteriori error estimates for our approximations of the statistical outputs. Based on these error estimates, we propose an algorithm for optimally choosing both the dimensions of the reduced basis approximations and the sizes of Monte Carlo samples to achieve a given error tolerance. We provide numerical examples to demonstrate the performance of the proposed method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Robust random number generation using steady-state emission of gain-switched laser diodes

We demonstrate robust, high-speed random number generation using interference of the steady-state emission of guaranteed random phases, obtained through gain-switching a semiconductor laser diode. Steady-state emission tolerates large temporal pulse misalignments and therefore significantly improves the interference quality. Using an 8-bit digitizer followed by a finite-impulse-response unbiasing algorithm, we achieve random number generation rates of 8 and 20 Gb/s, for laser repetition rates of 1 and 2.5 GHz, respectively, with a ±20% tolerance in the interferometer differential delay. We also report a generation rate of 80 Gb/s using partially phase-correlated short pulses. In relation to the field of quantum key distribution, our results confirm the gain-switched laser diode as a suitable light source, capable of providing phase-randomized coherent pulses at a clock rate of up to 2.5 GHz.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Adaptive Algebraic Multigrid for Finite Element Elliptic Equations with Random Coefficients

This thesis presents a two-grid algorithm based on Smoothed Aggregation Spectral Element Agglomeration Algebraic Multigrid (SA-ρAMGe) combined with adaptation. The aim is to build an efficient solver for the linear systems arising from discretization of second-order elliptic partial differential equations (PDEs) with stochastic coefficients. Examples include PDEs that model subsurface flow with random permeability field. During a Markov Chain Monte Carlo (MCMC) simulation process, that draws PDE coefficient samples from a certain distribution, the PDE coefficients change, hence the resulting linear systems to be solved change. At every such step the system (discretized PDE) needs to be solved and the computed solution used to evaluate some functional(s) of interest that then determine if the coefficient sample is acceptable or not. The MCMC process is hence computationally intensive and requires the solvers used to be efficient and fast. This fact that at every step of MCMC the resulting linear system changes, makes an already existing solver built for the old problem perhaps not as efficient for the problem corresponding to the new sampled coefficient. This motivates the main goal of our study, namely, to adapt an already existing solver to handle the problem (with changed coefficient) with the objective to achieve this goal to be faster and more efficient than building a completely new solver from scratch. Our approach utilizes the local element matrices (for the problem with changed coefficients) to build local problems associated with constructed by the method agglomerated elements (a set of subdomains that cover the given computational domain). We solve a generalized eigenproblem for each set in a subspace spanned by the previous local coarse space (used for the old solver) and a vector, component of the error, that the old solver cannot handle. A portion of the spectrum of these local eigen-problems (corresponding to eigenvalues close to zero) form the coarse basis used to define the new two-level method of our interest. We illustrate the performance of this adaptive two-level procedure with a large set of numerical experiments that demonstrate its efficiency over building the solvers from scratch.

97 MATHEMATICS AND COMPUTING↗

Beam hardening effects in grating-based x-ray phase-contrast imaging

Purpose: In this work, the authors investigate how beam hardening affects the image formation in x-ray phase-contrast imaging and consecutively develop a correction algorithm based on the results of the analysis. Methods: The authors' approach utilizes a recently developed x-ray imaging technique using a grating interferometer capable of visualizing the differential phase shift of a wave front traversing an object. An analytical description of beam hardening is given, highlighting differences between attenuation and phase-contrast imaging. The authors present exemplary beam hardening artifacts for a number of well-defined samples in measurements at a compact laboratory setup using a polychromatic source. Results: Despite the differences in image formation, the authors show that beam hardening leads to a similar reduction of image quality in phase-contrast imaging as in conventional attenuation-contrast imaging. Additionally, the authors demonstrate that for homogeneous objects, beam hardening artifacts can be corrected by a linearization technique, applicable to all kinds of phase-contrast methods using polychromatic sources. Conclusions: The evaluated correction algorithm is shown to yield good results for a number of simple test objects and can thus be advocated in medical imaging and nondestructive testing.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Neural Network Reflectance Prediction Model for Both Open Ocean and Coastal Waters

Remote sensing of global ocean color is a valuable tool for understanding the ecology and biogeochemistry of the worlds oceans, and provides critical input to our knowledge of the global carbon cycle and the impacts of climate change. Ocean polarized reflectance contains information about the constituents of the upper ocean euphotic zone, such as colored dissolved organic matter (CDOM), sediments, phytoplankton, and pollutants. In order to retrieve the information on these constituents, remote sensing algorithms typically rely on radiative transfer models to interpret water color or remote-sensing reflectance; however, this can be resource-prohibitive for operational use due to the extensive CPU time involved in radiative transfer solutions. In this work, we report a fast model based on machine learning techniques, called Neural Network Reflectance Prediction Model (NNRPM), which can be used to predict ocean bidirectional polarized reflectance given inherent optical properties of ocean waters. This supervised model is trained using a large volume of data derived from radiative transfer simulations for coupled atmosphere and ocean systems using the successive order of scattering technique (SOS-CAOS). The performance of the model is validated against another large independent test dataset generated from SOS-CAOS. The model is able to predict both polarized and unpolarized reflectances with an absolute error (AE) less than 0.004 for 99% of test cases. We have also shown that the degree of linear polarization (DoLP) for unpolarized incident light can be predicted with an AE less than 0.002 for 99% of test cases. In general, the simulation time of SOS-CAOS depends on optical depth, and required accuracy. When comparing the average speeds of the NNRPM against the SOS-CAOS model for the same parameters, we see that the NNRPM is able to predict the Ocean BRDF 6000 times faster than SOS-CAOS. Both ultraviolet and visible wavelengths are included in the model to help differentiate between dissolved organic material and chlorophyll in the study of the open ocean and the coastal zone. The incorporation of this model into the retrieval algorithm will make the retrieval process more efficient, and thus applicable for operational use with global satellite observations.

radiative transfer↗

OPTIMIZATION OF LAYER DENSITIES FOR MULTILAYERED INSULATION SYSTEMS

Numerous tests of various multilayer insulation systems have indicated that there are optimal densities for these systems. However, the only method of calculating this optimal density was by a complex physics based algorithm developed by McIntosh. In the 1970's much data were collected on the performance of these insulation systems with many different variables analyzed. All formulas generated included number of layers and layer density as geometric variables in solving for the heat flux, none of them was in a differentiable form for a single geometric variable. It was recently discovered that by converting the equations from heat flux to thermal conductivity using Fourier's Law, the equations became functions of layer density, temperatures, and material properties only. The thickness and number of layers of the blanket were merged into a layer density. These equations were then differentiated with respect to layer density. By setting the first derivative equal to zero, and solving for the layer density, the critical layer density was determined. This method was checked and validated using test data from the Multipurpose Hydrogen Testbed which was designed using Mcintosh's algorithm.

36 MATERIALS SCIENCE↗

TU-CD-BRB-10: 18F-FDG PET Image-Derived Tumor Features Highlight Altered Pathways Identified by Trancriptomic Analysis in Head and Neck Cancer

Purpose: Several quantitative features can be extracted from 18F-FDG PET images, such as standardized uptake values (SUVs), metabolic tumor volume (MTV), shape characterization (SC) or intra-tumor radiotracer heterogeneity quantification (HQ). Some of these features calculated from baseline 18F-FDG PET images have shown a prognostic and predictive clinical value. It has been hypothesized that these features highlight underlying tumor patho-physiological processes at smaller scales. The objective of this study was to investigate the ability of recovering alterations of signaling pathways from FDG PET image-derived features. Methods: 52 patients were prospectively recruited from two medical centers (Brest and Poitiers). All patients underwent an FDG PET scan for staging and biopsies of both healthy and primary tumor tissues. Biopsies went through a transcriptomic analysis performed in four spates on 4×44k chips (Agilent™). Primary tumors were delineated in the PET images using the Fuzzy Locally Adaptive Bayesian algorithm and characterized using 10 features including SUVs, SC and HQ. A module network algorithm followed by functional annotation was exploited in order to link PET features with signaling pathways alterations. Results: Several PET-derived features were found to discriminate differentially expressed genes between tumor and healthy tissue (fold-change >2, p<0.01) into 30 co-regulated groups (p<0.05). Functional annotations applied to these groups of genes highlighted associations with well-known pathways involved in cancer processes, such as cell proliferation and apoptosis, as well as with more specific ones such as unsaturated fatty acids. Conclusion: Quantitative features extracted from baseline 18F-FDG PET images usually exploited only for diagnosis and staging, were identified in this work as being related to specific altered pathways and may show promise as tools for personalizing treatment decisions.

60 APPLIED LIFE SCIENCES↗

SU-F-T-261: Reconstruction of Initial Photon Fluence Based On EPID Images

Purpose: Verifying an algorithm to reconstruct relative initial photon fluence for clinical use. Clinical EPID and CT images were acquired to reconstruct an external photon radiation treatment field. The reconstructed initial photon fluence could be used to verify the treatment or calculate the applied dose to the patient. Methods: The acquired EPID images were corrected for scatter caused by the patient and the EPID with an iterative reconstruction algorithm. The transmitted photon fluence behind the patient was calculated subsequently. Based on the transmitted fluence the initial photon fluence was calculated using a back-projection algorithm which takes the patient geometry and its energy dependent linear attenuation into account. This attenuation was gained from the acquired cone-beam CT or the planning CT by calculating a water-equivalent radiological thickness for each irradiation direction. To verify the algorithm an inhomogeneous phantom consisting of three inhomogeneities was irradiated by a static 6 MV photon field and compared to a reference flood field image. Results: The mean deviation between the reconstructed relative photon fluence for the inhomogeneous phantom and the flood field EPID image was 3% rising up to 7% for off-axis fluence. This was probably caused by the used clinical EPID calibration, which flattens the inhomogeneous fluence profile of the beam. Conclusion: In this clinical experiment the algorithm achieved good results in the center of the field while it showed high deviation of the lateral fluence. This could be reduced by optimizing the EPID calibration, considering the off-axis differential energy response. In further progress this and other aspects of the EPID, eg. field size dependency, CT and dose calibration have to be studied to realize a clinical acceptable accuracy of 2%.

60 APPLIED LIFE SCIENCES↗

A Vlasov-Fokker-Planck code for high energy density physics

OSHUN is a parallel relativistic 2D3P Vlasov-Fokker-Planck code, developed primarily to study electron transport and instabilities pertaining to laser-produced-including laser-fusion-plasmas. It incorporates a spherical harmonic expansion of the electron distribution function, where the number of terms is an input parameter that determines the angular resolution in momentum-space. The algorithm employs the full 3D electromagnetic fields and a rigorous linearized Fokker-Planck collision operator. The numerical scheme conserves energy and number density. This enables simulations for plasmas with temperatures from MeV down to a few eV and densities from less than critical to more than solid. Kinetic phenomena as well as electron transport physics can be recovered accurately and efficiently.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A domain decomposition method of stochastic PDEs: An iterative solution techniques using a two-level scalable preconditioner

Recent advances in high performance computing systems and sensing technologies motivate computational simulations with extremely high resolution models with capabilities to quantify uncertainties for credible numerical predictions. A two-level domain decomposition method is reported in this investigation to devise a linear solver for the large-scale system in the Galerkin spectral stochastic finite element method (SSFEM). In particular, a two-level scalable preconditioner is introduced in order to iteratively solve the large-scale linear system in the intrusive SSFEM using an iterative substructuring based domain decomposition solver. The implementation of the algorithm involves solving a local problem on each subdomain that constructs the local part of the preconditioner and a coarse problem that propagates information globally among the subdomains. The numerical and parallel scalabilities of the two-level preconditioner are contrasted with the previously developed one-level preconditioner for two-dimensional flow through porous media and elasticity problems with spatially varying non-Gaussian material properties. A distributed implementation of the parallel algorithm is carried out using MPI and PETSc parallel libraries. The scalabilities of the algorithm are investigated in a Linux cluster.

42 ENGINEERING↗

Learning effective SDEs from Brownian dynamic simulations of colloidal particles

We construct a reduced, data-driven, parameter dependent effective stochastic differential equation (eSDE) for electric-field mediated colloidal crystallization using data obtained from Brownian dynamics simulations. We use diffusion maps (a manifold learning algorithm) to identify a set of useful latent observables. In this latent space we identify an eSDE using a deep learning architecture inspired by numerical stochastic integrators and compare it with the traditional Kramers–Moyal expansion estimation. We show that the obtained variables and the learned dynamics accurately encode the physics of the Brownian dynamic simulations. We further illustrate that our reduced model captures the dynamics of corresponding experimental data. Further, our dimension reduction/reduced model identification approach can be easily ported to a broad class of particle systems dynamics experiments/models.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Model-independent limits and constraints on extended theories of gravity from cosmic reconstruction techniques

The onset of dark energy domination depends on the particular gravitational theory driving the cosmic evolution. Model independent techniques are crucial to test the both the present ΛCDM cosmological paradigm and alternative theories, making the least possible number of assumptions about the Universe. In this paper we investigate whether cosmography is able to distinguish between different gravitational theories, by determining bounds on model parameters for three different extensions of General Relativity, namely quintessence, F (Τ) and f ( R ) gravitational theories. We expand each class of theories in powers of redshift z around the present time, making no additional assumptions. This procedure is an extension of previous work and can be seen as the most general approach for testing extended theories of gravity through the use of cosmography. In the case of F (Τ) and f ( R ) theories, we show that some assumptions on model parameters often made in previous works are superfluous or even unjustified. We use data from the Union 2.1 supernovae catalogue, baryonic acoustic oscillation data and H ( z ) differential age compilations, which probe cosmology on different scales of the cosmological evolution. We perform a Monte Carlo analysis using a Metropolis-Hastings algorithm with a Gelman-Rubin convergence criterion, reporting 1-σ and 2-σ confidence levels. To do so, we perform two distinct fits, assuming only data within z < 1 first and then without limitations in redshift. We obtain the corresponding numerical intervals in which coefficients span, and find that the data is compatible the ΛCDM limit of all three theories at the 1-σ level, while still compatible with quite a large portion of parameter space. We compare our results to the truncated ΛCDM paradigm, demonstrating that our bounds divert from the expectations of previous works, showing that the permitted regions of coefficients are significantly modified and in general widened with respect to values usually reported in the existing literature. Finally, we test the extended theories through the Bayesian selection criteria AIC and BIC.

79 ASTRONOMY AND ASTROPHYSICS↗