Search NASA⌕ Search

SEARCH · Search NASA

Results for “computational framework”

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,279 records · Page 71

Quasiequilibrium states of black hole-neutron star binaries in the moving-puncture framework

General relativistic quasiequilibrium states of black hole-neutron star binaries are computed in the moving-puncture framework. We propose three conditions for determining the quasiequilibrium states and compare the numerical results with those obtained in the excision framework. We find that the results obtained in the moving-puncture framework agree with those in the excision framework and with those in the third post-Newtonian approximation for the cases that (i) the mass ratio of the binary is close to unity irrespective of the orbital separation, and (ii) the orbital separation is large enough (m{sub 0}{omega} < or approx. 0.02, where m{sub 0} and {omega} are the total mass and the orbital angular velocity, respectively) irrespective of the mass ratio. For m{sub 0}{omega} > or approx. 0.03, both of the results in the moving-puncture and excision frameworks deviate, more or less, from those in the third post-Newtonian approximation. Thus the numerical results do not provide a quasicircular state, rather they seem to have a non-negligible eccentricity of order 0.01-0.1. We show by numerical simulation that a method in the moving-puncture framework can provide approximately quasicircular states in which the eccentricity is by a factor of {approx}2 smaller than those in quasiequilibrium given by other approaches.

79 ASTRONOMY AND ASTROPHYSICS↗

Portable Parallel Programming for the Dynamic Load Balancing of Unstructured Grid Applications

The ability to dynamically adapt an unstructured -rid (or mesh) is a powerful tool for solving computational problems with evolving physical features; however, an efficient parallel implementation is rather difficult, particularly from the view point of portability on various multiprocessor platforms We address this problem by developing PLUM, tin automatic anti architecture-independent framework for adaptive numerical computations in a message-passing environment. Portability is demonstrated by comparing performance on an SP2, an Origin2000, and a T3E, without any code modifications. We also present a general-purpose load balancer that utilizes symmetric broadcast networks (SBN) as the underlying communication pattern, with a goal to providing a global view of system loads across processors. Experiments on, an SP2 and an Origin2000 demonstrate the portability of our approach which achieves superb load balance at the cost of minimal extra overhead.

Biswas, Rupak↗

SU-F-T-258: Efficacy of Exit Fluence-Based Dose Calculation for Prostate Radiation Therapy

Purpose: To investigate the efficacy of exit-fluence-based dose computation for prostate radiotherapy by determining if it estimates true dose more accurately than the original planning dose. Methods: Virtual exit-fluencebased dose computation was performed for 19 patients, each with 9–12 repeat CT images. For each patient, a 78 Gy treatment plan was created utilizing 5 mm CTV-to-PTV and OAR-to-PRV margins. A Monte Carlo framework was used to compute dose and exit-fluence images for the planning image and for each repeat CT image based on boney-anatomyaligned and prostate-centroid-aligned CTs. Identical source particles were used for the MC dose-computations on the planning and repeat CTs to maximize correlation. The exit-fluence-based dose and image were computed by multiplying source particle weights by FC(x,y)=FP(x,y)/FT(x,y), where (x,y) are the source particle coordinates projected to the exit-fluence plane and we denote the dose/fluence from the plan by (DP,FP), from the repeat-CT as (DT,FT), and the exit-fluence computation by (DFC,FFC). DFC mimics exit-fluence backprojection through the planning image as FT=FFC. Dose estimates were intercompared to judge the efficacy of exit-fluence-based dose computation. Results: Boney- and prostate-centroid aligned results are combined as there is no statistical difference between them, yielding 420 dose comparisons per dose-volume metric. DFC is more accurate than DP for 46%, 33%, and 44% of cases in estimating CTV D98, D50, and D2 respectively. DFC improved rectum D50 and D2 estimates 54% and 49% respectively and bladder D50 and D2 47 and 49% respectively. While averaged over all patients and images DFC and DP were within 3.1% of DT, they differed from DT by as much as 22% for GTV D98, 71% for the Bladder D50, 17% for Bladder D2, 19% for Rectum D2. Conclusion: Exit-fluence based dose computations infrequently improve CTV or OAR dose estimates and should be used with caution. Research supported in part by Varian Medical Systems.

60 APPLIED LIFE SCIENCES↗

Generalized Bayesian Framework for Evaluation of Integral Benchmark Experiments [Slides]

This presentation is on generalized Bayesian framework for evaluation of integral benchmark experiments. This presentation starts off with assumptions and approximations used with Bayes Theorem. then an overview of approximations used by ORNL codes, and Generalized Bayesian Monto Carlo (GBMC). The presentation then details out a precise framework. This presentation then concludes with considerations.

97 MATHEMATICS AND COMPUTING↗

Unifying Radiative Transfer Models in Computer Graphics and Remote Sensing, Part II: A Differentiable, Polarimetric Forward Model and Validation

The constellation of Earth-observing satellites continuously collects measurements of scattered radiance, which must be transformed into geophysical parameters in order to answer fundamental scientific questions about the Earth. Retrieval of these parameters requires highly flexible, accurate, and fast forward and inverse radiative transfer models. Existing forward models used by the remote sensing community are typically accurate and fast, but sacrifice flexibility by assuming the atmosphere or ocean is composed of plane-parallel layers. Monte Carlo forward models can handle more complex scenarios such as 3D spatial heterogeneity, but are relatively slower. We propose looking to the computer graphics community for inspiration to improve the statistical efficiency of Monte Carlo forward models and explore new approaches to inverse models for remote sensing. In Part 2 of this work, we demonstrate that Monte Carlo forward models in computer graphics are capable of sufficient accuracy for remote sensing by extending Mitsuba 3, a forward and inverse modeling framework recently developed in the computer graphics community, to simulate simple atmosphere-ocean systems and show that our framework is capable of achieving error on par with codes currently used by the remote sensing community on benchmark results.

Radiative transfer↗

A review of predictive nonlinear theories for multiscale modeling of heterogeneous materials

Since the beginning of the industrial age, material performance and design have been in the midst of innovation of many disruptive technologies. Today's electronics, space, medical, transportation, and other industries are enriched by development, design and deployment of composite, heterogeneous and multifunctional materials. As a result, materials innovation is now considerably outpaced by other aspects from component design to product cycle. In this article, we review predictive nonlinear theories for multiscale modeling of heterogeneous materials. Deeper attention is given to multiscale modeling in space and to computational homogenization in addressing challenging materials science questions. Moreover, we discuss a state-of-the-art platform in predictive image-based, multiscale modeling with co-designed simulations and experiments that executes on the world's largest supercomputers. Such a modeling framework consists of experimental tools, computational methods, and digital data strategies. Once fully completed, this collaborative and interdisciplinary framework can be the basis of Virtual Materials Testing standards and aids in the development of new material formulations. Moreover, it will decrease the time to market of innovative products.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multidisciplinary Environments: A History of Engineering Framework Development

This paper traces the history of engineering frameworks and their use by Multidisciplinary Design Optimization (MDO) practitioners. The approach is to reference papers that have been presented at one of the ten previous Multidisciplinary Analysis and Optimization (MA&O) conferences. By limiting the search to MA&O papers, the authors can (1) identify the key ideas that led to general purpose MDO frameworks and (2) uncover roadblocks that delayed the development of these ideas. The authors make no attempt to assign credit for revolutionary ideas or to assign blame for missed opportunities. Rather, the goal is to trace the various threads of computer architecture and software framework research and to observe how these threads contributed to the commercial framework products available today.

Padula, Sharon L.↗

Accelerating population balance-Monte Carlo simulation for coagulation dynamics from the Markov jump model, stochastic algorithm and GPU parallel computing

This paper proposes a comprehensive framework for accelerating population balance-Monte Carlo (PBMC) simulation of particle coagulation dynamics. By combining Markov jump model, weighted majorant kernel and GPU (graphics processing unit) parallel computing, a significant gain in computational efficiency is achieved. The Markov jump model constructs a coagulation-rule matrix of differentially-weighted simulation particles, so as to capture the time evolution of particle size distribution with low statistical noise over the full size range and as far as possible to reduce the number of time loopings. Here three coagulation rules are highlighted and it is found that constructing appropriate coagulation rule provides a route to attain the compromise between accuracy and cost of PBMC methods. Further, in order to avoid double looping over all simulation particles when considering the two-particle events (typically, particle coagulation), the weighted majorant kernel is introduced to estimate the maximum coagulation rates being used for acceptance–rejection processes by single-looping over all particles, and meanwhile the mean time-step of coagulation event is estimated by summing the coagulation kernels of rejected and accepted particle pairs. The computational load of these fast differentially-weighted PBMC simulations (based on the Markov jump model) is reduced greatly to be proportional to the number of simulation particles in a zero-dimensional system (single cell). Finally, for a spatially inhomogeneous multi-dimensional (multi-cell) simulation, the proposed fast PBMC is performed in each cell, and multiple cells are parallel processed by multi-cores on a GPU that can implement the massively threaded data-parallel tasks to obtain remarkable speedup ratio (comparing with CPU computation, the speedup ratio of GPU parallel computing is as high as 200 in a case of 100 cells with 10 000 simulation particles per cell). These accelerating approaches of PBMC are demonstrated in a physically realistic Brownian coagulation case. The computational accuracy is validated with benchmark solution of discrete-sectional method. The simulation results show that the comprehensive approach can attain very favorable improvement in cost without sacrificing computational accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Real-time neuromorphic algorithms for inverse kinematics of redundant manipulators

The paper presents an efficient neuromorphic formulation to accurately solve the inverse kinematics problem for redundant manipulators. The approach involves a dynamical learning procedure based on a novel formalism in neural network theory: the concept of 'terminal' attractors. Topographically mapped terminal attractors are used to define a neural network whose synaptic elements can rapidly encapture the inverse kinematics transformations, and, subsequently generalize to compute joint-space coordinates required to achieve arbitrary end-effector configurations. Unlike prior neuromorphic implementations, this technique can also systematically exploit redundancy to optimize kinematic criteria, e.g., torque optimization. Simulations on 3-DOF and 7-DOF redundant manipulators, are used to validate the theoretical framework and illustrate its computational efficacy.

Barhen, Jacob↗

Multimodal parameter spaces of a complex multi-channel neuron model

One of the most common types of models that helps us to understand neuron behavior is based on the Hodgkin–Huxley ion channel formulation (HH model). A major challenge with inferring parameters in HH models is non-uniqueness: many different sets of ion channel parameter values produce similar outputs for the same input stimulus. Such phenomena result in an objective function that exhibits multiple modes (i.e., multiple local minima). This non-uniqueness of local optimality poses challenges for parameter estimation with many algorithmic optimization techniques. HH models additionally have severe non-linearities resulting in further challenges for inferring parameters in an algorithmic fashion. To address these challenges with a tractable method in high-dimensional parameter spaces, we propose using a particular Markov chain Monte Carlo (MCMC) algorithm, which has the advantage of inferring parameters in a Bayesian framework. The Bayesian approach is designed to be suitable for multimodal solutions to inverse problems. We introduce and demonstrate the method using a three-channel HH model. We then focus on the inference of nine parameters in an eight-channel HH model, which we analyze in detail. We explore how the MCMC algorithm can uncover complex relationships between inferred parameters using five injected current levels. The MCMC method provides as a result a nine-dimensional posterior distribution, which we analyze visually with solution maps or landscapes of the possible parameter sets. The visualized solution maps show new complex structures of the multimodal posteriors, and they allow for selection of locally and globally optimal value sets, and they visually expose parameter sensitivities and regions of higher model robustness. We envision these solution maps as enabling experimentalists to improve the design of future experiments, increase scientific productivity and improve on model structure and ideation when the MCMC algorithm is applied to experimental data.

97 MATHEMATICS AND COMPUTING↗

Unified first-principles theory of thermal properties of insulators

The conventional first-principles theory for the thermal and thermodynamic properties of insulators is based on the perturbative treatment of the anharmonicity of crystal bonds. While this theory has been a successful predictive tool for strongly bonded solids such as diamond and silicon, here we show that it fails dramatically for strongly anharmonic (weakly bonded) materials, and that the conventional quasiparticle picture breaks down at relatively low temperatures. To address this failure, we present a unified first-principles theory of the thermodynamic and thermal properties of insulators that captures multiple thermal properties within the same framework across the full range of anharmonicity from strongly bonded to weakly bonded insulators. This theory features a new phonon renormalization approach derived from many-body physics that creates well-defined quasiparticles even at relatively high temperatures, and it accurately captures the effects of strongly anharmonic bonds on phonons and thermal transport. Using a prototypical strongly anharmonic material, sodium chloride (NaCl), as an example, we demonstrate that our new first-principles framework simultaneously captures the apparently contradictory experimental observations of large thermal expansion and low thermal conductivity of NaCl on the one hand, and anomalously weak temperature dependence of phonon modes on the other, while the conventional theory fails in all three cases. Here we demonstrate that four-phonon scattering due to higher-order anharmonicity significantly lowers the thermal conductivity of NaCl and is required for a proper comparison to experiment. Furthermore, we show that our renormalization framework, along with four-phonon scattering, also successfully predicts the measured phonon frequencies and thermal properties of a weakly anharmonic material, diamond, indicating universal applicability for thermal properties of insulators. Our work gives new insights into the physics of heat flow in solids, and presents a computationally efficient and rigorous framework that captures the thermal and thermodynamic properties of both weakly and strongly bonded insulators simultaneously.

36 MATERIALS SCIENCE↗

The ACTS Center for Software Sustainability

This report covers the activities carried out by the project The ACTS Center for Software Sustainability, whose proposal was submitted to ASCR in 2007. These activities have their roots in the project Advanced Computational Testing Software (ACTS) Toolkit, which was part of the DOE2000 Program. Driven by the state of the software, the technology and the nature of the tools in the Toolkit, the project was reformulated in a project that better represented the goals and activities within ACTS, An Expanded Framework for the Advanced CompuTational Software (ACTS) Collection. At the heart of this project was the consolidation of lessons learned and demands from the computational science community that guided us to the creation of the now well-known DOE ACTS Collection. The goal of the project was to increase the pay-off of DOE ASCR investment in the development of the general purpose tools in the DOE ACTS Collection, reduce the duplication of efforts, and minimize the development time of high-end computer applications while maximizing the life of the codes.

97 MATHEMATICS AND COMPUTING↗

The Future of Computing: Integrating Scientific Computation on Neuromorphic Systems

Neuromorphic computing is known for its integration of algorithms and hardware elements that are inspired by the brain. Conventionally, this nontraditional method of computing is used for many neural or learning inspired applications. Unfortunately, this has resulted in the field of neuromorphic computing being relatively narrow in scope. In this paper we discuss two research areas actively trying to widen the impact of neuromorphic systems. The first is Fugu, a high-level programming interface designed to bridge the gap between general computer scientists and those who specialize in neuromorphic areas. The second aims to map classical scientific computing problems onto these frameworks through the example of random walks. This elucidates a class of scientific applications that are conducive to neuromorphic algorithms.

97 MATHEMATICS AND COMPUTING↗

Adjoint Algorithm for CAD-Based Shape Optimization Using a Cartesian Method

Adjoint solutions of the governing flow equations are becoming increasingly important for the development of efficient analysis and optimization algorithms. A well-known use of the adjoint method is gradient-based shape optimization. Given an objective function that defines some measure of performance, such as the lift and drag functionals, its gradient is computed at a cost that is essentially independent of the number of design variables (geometric parameters that control the shape). More recently, emerging adjoint applications focus on the analysis problem, where the adjoint solution is used to drive mesh adaptation, as well as to provide estimates of functional error bounds and corrections. The attractive feature of this approach is that the mesh-adaptation procedure targets a specific functional, thereby localizing the mesh refinement and reducing computational cost. Our focus is on the development of adjoint-based optimization techniques for a Cartesian method with embedded boundaries.12 In contrast t o implementations on structured and unstructured grids, Cartesian methods decouple the surface discretization from the volume mesh. This feature makes Cartesian methods well suited for the automated analysis of complex geometry problems, and consequently a promising approach to aerodynamic optimization. Melvin et developed an adjoint formulation for the TRANAIR code, which is based on the full-potential equation with viscous corrections. More recently, Dadone and Grossman presented an adjoint formulation for the Euler equations. In both approaches, a boundary condition is introduced to approximate the effects of the evolving surface shape that results in accurate gradient computation. Central to automated shape optimization algorithms is the issue of geometry modeling and control. The need to optimize complex, "real-life" geometry provides a strong incentive for the use of parametric-CAD systems within the optimization procedure. In previous work, we presented an effective optimization framework that incorporates a direct-CAD interface. In this work, we enhance the capabilities of this framework with efficient gradient computations using the discrete adjoint method. We present details of the adjoint numerical implementation, which reuses the domain decomposition, multigrid, and time-marching schemes of the flow solver. Furthermore, we explain and demonstrate the use of CAD in conjunction with the Cartesian adjoint approach. The final paper will contain a number of complex geometry, industrially relevant examples with many design variables to demonstrate the effectiveness of the adjoint method on Cartesian meshes.

Nemec, Marian↗

NASA's Integrated Instrument Simulator Suite for Atmospheric Remote Sensing from Spaceborne Platforms (ISSARS) and Its Role for the ACE and GPM Missions

Forward simulation is an indispensable tool for evaluation of precipitation retrieval algorithms as well as for studying snow/ice microphysics and their radiative properties. The main challenge of the implementation arises due to the size of the problem domain. To overcome this hurdle, assumptions need to be made to simplify compiles cloud microphysics. It is important that these assumptions are applied consistently throughout the simulation process. ISSARS addresses this issue by providing a computationally efficient and modular framework that can integrate currently existing models and is also capable of expanding for future development. ISSARS is designed to accommodate the simulation needs of the Aerosol/Clouds/Ecosystems (ACE) mission and the Global Precipitation Measurement (GPM) mission: radars, microwave radiometers, and optical instruments such as lidars and polarimeter. ISSARS's computation is performed in three stages: input reconditioning (IRM), electromagnetic properties (scattering/emission/absorption) calculation (SEAM), and instrument simulation (ISM). The computation is implemented as a web service while its configuration can be accessed through a web-based interface.

real-aperture instruments↗

Stakeholder Engaged Structured Decision Making to Improve Performance and Reduce Costs While Protecting Human Health and the Environment - 18645

The objective of the Best Practice is to facilitate a paradigm shift when it comes to approaches to the decision making process for nuclear waste management, disposal, and remediation decisions. The stakeholder-engaged structured decision making (SDM) paradigm shift provides a transparent framework for developing optimal solutions to complex problems (Keeney, 1992, Gregory et al, 2012). This is a deliberative-analytical process. The deliberative side centers on understanding stakeholder concerns and values, and developing objectives while identifying options that may achieve those objectives. SDM is implemented with the aid of computer tools that are aimed specifically at capturing these deliberative aspects of a decision analysis. SDM captures this information in a structured format that allows access to the values, objectives, and options that have been identified to help. Through this approach we achieve transparency, traceability, and reproducibility. The goal of SDM at this stage is to provide a formal structure for capturing and processing deliberative information. The deliberative part sets the stage for the analytical part of SDM. A variety of Subject matter experts (SMEs) are engaged in how to evaluate the options through the objectives. Objectives often include minimizing human health risk and minimizing cost, but in the full scope of a sustainability-based approach to decision making, it can include objectives related to economic, environmental and social issues. Subject matter experts might provide other options for achieving the objectives, but their primary role is to evaluate/model the options to the endpoint defined by the objectives or in other words perform a consequence analysis. The structure of SDM makes it clear exactly what is needed from the SMEs, because the options are identified, and the endpoint (objectives) are defined - evaluations and/or models are needed to connect options to objectives. This consequence analysis completes the evaluation, and directly addresses which of the options is the best option. The same SDM approach to finding the best options can also be used for prioritization and resource allocation. Because all of the information is captured in a formal system with the help of computer tools (a software framework for implementing SDM), the decision models that are developed for an application can be fully evaluated numerically and for the insights gained from using a formal process for managing the multiple factors that need to be considered for complex decisions. This includes uncertainty and sensitivity analysis that can be used to guide the need for further data/information collection if the optimal decision is not adequately supported - that is, if there is insufficient confidence in the decision. Also, this feeds directly into adaptive management therefore if more data/information are collected then the efficacy of the current decision can be evaluated, potentially leading to a change in decisions if warranted. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Physics-informed neural networks for heterogeneous poroelastic media

This study presents a novel physics-informed neural network (PINN) framework for modeling poroelasticity in heterogeneous media with material interfaces. The approach introduces a composite neural network (CoNN) where separate neural networks predict displacement and pressure variables for each material. While sharing identical activation functions, these networks are independently trained for all other parameters. To address challenges posed by heterogeneous material interfaces, the CoNN is integrated with the Interface-PINNs (I-PINNs) framework (Sarma et al., Comput. Methods Appl. Mech. Eng. 429: 117135, 2024), allowing different activation functions across material interfaces. Further, this ensures accurate approximation of discontinuous solution fields and gradients. Performance and accuracy of this combined architecture were evaluated against the conventional PINNs approach, a single neural network (SNN) architecture, and the eXtended PINNs (XPINNs) framework through two one-dimensional benchmark examples with discontinuous material properties. The results show that the proposed CoNN with I-PINNs architecture achieves an RMSE that is two orders of magnitude better than the conventional PINNs approach and is at least 40 times faster than the SNN framework. Compared to XPINNs, the proposed method achieves an RMSE at least one order of magnitude better and is 40% faster.

42 ENGINEERING↗

A Framework for Lattice QCD Calculations on GPUs

Efficient calculation of the greatest common divisor (GCD) for big integers each whose number of bits is greater than or equal to 1024 has drawn a considerable amount of attention because it can be used to detect a weakness of the RSA security infrastructure. This paper presents a parallel binary GCD algorithm and its implementation for big integers on the Intel Xeon Phi coprocessor. This algorithm is capable of computing GCDs efficiently on many pairs of big integers in parallel by utilizing all cores on a Xeon Phi coprocessor as well as taking advantage of all vector processing units of the coprocessor to speed up critical integer operations within the algorithm. Using 240 threads on a Xeon Phi coprocessor to carry out GCD calculations for a large amount of 2048-bit integers, the implementation achieves the speedup of 30 times over a sequential binary GCD algorithm implementation on a single CPU core, and it delivers twice amount of performance in comparison to the same sequential binary GCD implementation running on 240 threads of the Xeon Phi.

Winter, F. T.↗