Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “compute intensive problems”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
NASA NTRS1994

Development of the NASA/FLAGRO computer program for analysis of airframe structures

The NASA/FLAGRO (NASGRO) computer program was developed for fracture control analysis of space hardware and is currently the standard computer code in NASA, the U.S. Air Force, and the European Agency (ESA) for this purpose. The significant attributes of the NASGRO program are the numerous crack case solutions, the large materials file, the improved growth rate equation based on crack closure theory, and the user-friendly promptive input features. In support of the National Aging Aircraft Research Program (NAARP); NASGRO is being further developed to provide advanced state-of-the-art capability for damage tolerance and crack growth analysis of aircraft structural problems, including mechanical systems and engines. The project currently involves a cooperative development effort by NASA, FAA, and ESA. The primary tasks underway are the incorporation of advanced methodology for crack growth rate retardation resulting from spectrum loading and improved analysis for determining crack instability. Also, the current weight function solutions in NASGRO or nonlinear stress gradient problems are being extended to more crack cases, and the 2-d boundary integral routine for stress analysis and stress-intensity factor solutions is being extended to 3-d problems. Lastly, effort is underway to enhance the program to operate on personal computers and work stations in a Windows environment. Because of the increasing and already wide usage of NASGRO, the code offers an excellent mechanism for technology transfer for new fatigue and fracture mechanics capabilities developed within NAARP.

Forman, R. G.↗
NASA NTRS1985

On the effect of quarter-point element size on fracture criteria

The effect of the quarter-point element size on the solution parameters of fracture criteria is investigated in view of its effect on the computed stress intensity factors. An analytical relationship between the error in calculating crack propagation increment and stress intensity for single mode problems is obtained while, for mixed mode problems, the investigation is based on numerical experimentation. The singular element size is found to have a substantial effect on both crack propagation angle and increment for the geometries considered.

Yehia, N. A. B.↗
DOE OSTI2016

Enabling NVM for Data-Intensive Scientific Services

Specialized, transient data services are playing an increasingly prominent role in data-intensive scientific computing. These services offer flexible, on-demand pairing of applications with storage hardware using semantics that are optimized for the problem domain. Concurrent with this trend, upcoming scientific computing and big data systems will be deployed with emerging NVM technology to achieve the highest possible price/productivity ratio. Clearly, therefore, we must develop techniques to facilitate the confluence of specialized data services and NVM technology. In this work we explore how to enable the composition of NVM resources within transient distributed services while still retaining their essential performance characteristics. Our approach involves eschewing the conventional distributed file system model and instead projecting NVM devices as remote microservices that leverage user-level threads, RPC services, RMA-enabled network transports, and persistent memory libraries in order to maximize performance. We describe a prototype system that incorporates these concepts, evaluate its performance for key workloads on an exemplar system, and discuss how the system can be leveraged as a component of future data-intensive architectures.

Carns, Philip↗
DOE OSTI2020

Machine learning and ligand binding predictions: A review of data, methods, and obstacles

We report that computational predictions of ligand binding is a difficult problem, with more accurate methods being extremely computationally expensive. The use of machine learning for drug binding predictions could possibly leverage the use of biomedical big data in exchange for time-intensive simulations. This paper reviews current trends in the use of machine learning for drug binding predictions, data sources to develop machine learning algorithms, and potential problems that may lead to overfitting and ungeneralizable models. A few popular datasets that can be used to develop virtual high-throughput screening models are characterized using spatial statistics to quantify potential biases. We can see from evaluating some common benchmarks that good performance correlates with models with high-predicted bias scores and models with low bias scores do not have much predictive power. A better understanding of the limits of available data sources and how to fix them will lead to more generalizable models that will lead to novel drug discovery.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1978

Radiative transfer calculated from a Markov chain formalism

The theory of Markov chains is used to formulate the radiative transport problem in a general way by modeling the successive interactions of a photon as a stochastic process. Under the minimal requirement that the stochastic process is a Markov chain, the determination of the diffuse reflection or transmission from a scattering atmosphere is equivalent to the solution of a system of linear equations. This treatment is mathematically equivalent to, and thus has many of the advantages of, Monte Carlo methods, but can be considerably more rapid than Monte Carlo algorithms for numerical calculations in particular applications. We have verified the speed and accuracy of this formalism for the standard problem of finding the intensity of scattered light from a homogeneous plane-parallel atmosphere with an arbitrary phase function for scattering. Accurate results over a wide range of parameters were obtained with computation times comparable to those of a standard 'doubling' routine. The generality of this formalism thus allows fast, direct solutions to problems that were previously soluble only by Monte Carlo methods. Some comparisons are made with respect to integral equation methods.

Esposito, L. W.↗
NASA NTRS1998

Geometry Modeling and Grid Generation for Design and Optimization

Geometry modeling and grid generation (GMGG) have played and will continue to play an important role in computational aerosciences. During the past two decades, tremendous progress has occurred in GMGG; however, GMGG is still the biggest bottleneck to routine applications for complicated Computational Fluid Dynamics (CFD) and Computational Structures Mechanics (CSM) models for analysis, design, and optimization. We are still far from incorporating GMGG tools in a design and optimization environment for complicated configurations. It is still a challenging task to parameterize an existing model in today's Computer-Aided Design (CAD) systems, and the models created are not always good enough for automatic grid generation tools. Designers may believe their models are complete and accurate, but unseen imperfections (e.g., gaps, unwanted wiggles, free edges, slivers, and transition cracks) often cause problems in gridding for CSM and CFD. Despite many advances in grid generation, the process is still the most labor-intensive and time-consuming part of the computational aerosciences for analysis, design, and optimization. In an ideal design environment, a design engineer would use a parametric model to evaluate alternative designs effortlessly and optimize an existing design for a new set of design objectives and constraints. For this ideal environment to be realized, the GMGG tools must have the following characteristics: (1) be automated, (2) provide consistent geometry across all disciplines, (3) be parametric, and (4) provide sensitivity derivatives. This paper will review the status of GMGG for analysis, design, and optimization processes, and it will focus on some emerging ideas that will advance the GMGG toward the ideal design environment.

Samareh, Jamshid A.↗
NASA NTRS1979

A general and computationally fast formulation for radiative transfer with scattering

A general formulation of monocromatic radiative transfer with scattering has been developed for plane-parallel geometry. The inhomogeneous and nonisothermal medium absorbs, emits, and anisotropically scatters radiation. Surfaces can emit and scatter radiation in any specified manner. The solution procedure uses the fact that phase incoherent scattering is linear in radiative sources. Certain basic scattering functions are then defined and calculated by an adding computer code using matrix algebra. These scattering functions are weighted by the temperature field and summed (superimposed) to obtain the solution for any specific problem. Numerical results for exiting intensities and one-sided heat fluxes from general media bound by one arbitrary surface are presented. These parametric studies demonstrate the effects of scattering particles and surfaces on radiative transfer from inhomogeneous and nonisothermal media. Application of the formulation to radiative equilibrium is also discussed. The conclusion is that all problems in plane-parallel radiative transfer with scattering can be solved by a common and computationally fast algorithm based on this formulation.

Cogley, A. C.↗
DOE OSTI2025

Real-time data processing for serial crystallography experiments

We report the use of streaming data interfaces to perform fully online data processing for serial crystallography experiments, without storing intermediate data on disk. The system produces Bragg reflection intensity measurements suitable for scaling and merging, with a latency of less than 1 s per frame. Our system uses the CrystFEL software in combination with the ASAP::O data framework. In a series of user experiments at PETRA III, frames from a 16 megapixel Dectris EIGER2 X detector were searched for peaks, indexed and integrated at the maximum full-frame readout speed of 133 frames per second. The computational resources required depend on various factors, most significantly the fraction of non-blank frames ('hits'). The average single-thread processing time per frame was 242 ms for blank frames and 455 ms for hits, meaning that a single 96-core computing node was sufficient to keep up with the data, with ample headroom for unexpected throughput reductions. Further significant improvements are expected, for example by binning pixel intensities together to reduce the pixel count. We discuss the implications of real-time data processing on the `data deluge' problem from recent and future photon-science experiments, in particular on calibration requirements, computing access patterns and the need for the preservation of raw data.

47 OTHER INSTRUMENTATION↗
DOE OSTI2015

TU-EF-304-07: Monte Carlo-Based Inverse Treatment Plan Optimization for Intensity Modulated Proton Therapy

Purpose: Intensity-modulated proton therapy (IMPT) is increasingly used in proton therapy. For IMPT optimization, Monte Carlo (MC) is desired for spots dose calculations because of its high accuracy, especially in cases with a high level of heterogeneity. It is also preferred in biological optimization problems due to the capability of computing quantities related to biological effects. However, MC simulation is typically too slow to be used for this purpose. Although GPU-based MC engines have become available, the achieved efficiency is still not ideal. The purpose of this work is to develop a new optimization scheme to include GPU-based MC into IMPT. Methods: A conventional approach using MC in IMPT simply calls the MC dose engine repeatedly for each spot dose calculations. However, this is not the optimal approach, because of the unnecessary computations on some spots that turned out to have very small weights after solving the optimization problem. GPU-memory writing conflict occurring at a small beam size also reduces computational efficiency. To solve these problems, we developed a new framework that iteratively performs MC dose calculations and plan optimizations. At each dose calculation step, the particles were sampled from different spots altogether with Metropolis algorithm, such that the particle number is proportional to the latest optimized spot intensity. Simultaneously transporting particles from multiple spots also mitigated the memory writing conflict problem. Results: We have validated the proposed MC-based optimization schemes in one prostate case. The total computation time of our method was ∼5–6 min on one NVIDIA GPU card, including both spot dose calculation and plan optimization, whereas a conventional method naively using the same GPU-based MC engine were ∼3 times slower. Conclusion: A fast GPU-based MC dose calculation method along with a novel optimization workflow is developed. The high efficiency makes it attractive for clinical usages.

60 APPLIED LIFE SCIENCES↗
DOE OSTI2024

Reproducibility of real-time time-dependent density functional theory calculations of electronic stopping power in warm dense matter

Real-time time-dependent density functional theory (TDDFT) is widely considered to be the most accurate available method for calculating electronic stopping powers from first principles, but there have been relatively few assessments of the consistency of its predictions across different implementations. This problem is particularly acute in the warm dense regime, where computational costs are high and experimental validation is rare and resource intensive. We report a comprehensive cross-verification of stopping power calculations in conditions relevant to inertial confinement fusion conducted using four different TDDFT implementations. We find excellent agreement among both the post-processed stopping powers and relevant time-resolved quantities for alpha particles in warm dense hydrogen. We also analyze sensitivities to a wide range of methodological details, including the exchange-correlation model, pseudopotentials, initial conditions, observable from which the stopping power is extracted, averaging procedures, projectile trajectory, and finite-size effects. We show that among these details, pseudopotentials, trajectory-dependence, and finite-size effects have the strongest influence, and we discuss different strategies for controlling the latter two considerations.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2014

A region-appearance-based adaptive variational model for 3D liver segmentation

Purpose: Liver segmentation from computed tomography images is a challenging task owing to pixel intensity overlapping, ambiguous edges, and complex backgrounds. The authors address this problem with a novel active surface scheme, which minimizes an energy functional combining both edge- and region-based information. Methods: In this semiautomatic method, the evolving surface is principally attracted to strong edges but is facilitated by the region-based information where edge information is missing. As avoiding oversegmentation is the primary challenge, the authors take into account multiple features and appearance context information. Discriminative cues, such as multilayer consecutiveness and local organ deformation are also implicitly incorporated. Case-specific intensity and appearance constraints are included to cope with the typically large appearance variations over multiple images. Spatially adaptive balancing weights are employed to handle the nonuniformity of image features. Results: Comparisons and validations on difficult cases showed that the authors’ model can effectively discriminate the liver from adhering background tissues. Boundaries weak in gradient or with no local evidence (e.g., small edge gaps or parts with similar intensity to the background) were delineated without additional user constraint. With an average surface distance of 0.9 mm and an average volume overlap of 93.9% on the MICCAI data set, the authors’ model outperformed most state-of-the-art methods. Validations on eight volumes with different initial conditions had segmentation score variances mostly less than unity. Conclusions: The proposed model can efficiently delineate ambiguous liver edges from complex tissue backgrounds with reproducibility. Quantitative validations and comparative results demonstrate the accuracy and efficacy of the model.

62 RADIOLOGY AND NUCLEAR MEDICINE↗
NASA NTRS1977

Stress intensity estimates by a computer assisted photoelastic method

Following an introductory history, the frozen stress photoelastic method is reviewed together with analytical and experimental aspects of cracks in photoelastic models. Analytical foundations are then presented upon which a computer assisted frozen stress photoelastic technique is based for extracting estimates of stress intensity factors from three-dimensional cracked body problems. The use of the method is demonstrated for two currently important three-dimensional crack problems.

Smith, C. W.↗
NASA NTRS1997

Efficient Evaluation and Optimization of Structural Reliability

Use of approximations for calculating the structural failure probability under uncertainties is a necessary aspect. But efficient use of suitable approximations at different stages of reliability prediction and design makes this valuable tool practical for many large scale structures. This research addresses the modern approximation concepts and their utility in structural reliability estimation. Emphasis is placed on building higher order approximations using intervening variables to closely represent the nonlinear limit state functions. Several test problems with highly nonlinear performance functions are used to demonstrate the accuracy of the proposed method. Many of the structural problems are modeled and simulated using the finite element methods (FEM) for obtaining a detailed structural response. FEM is a computationally intensive numerical procedure with a large number of degrees of freedom. With an increase in the complexity of the structural model and the multidisciplinary nature of analyses, the number of limit states and their computation increases very significantly. The requirement of frequent repetitive analysis of the structure hinders the utility of any tool and discourages that approach from being used. One particular tool which faces this difficulty is the computation of the structural reliability under parametric uncertainties.

Grandhi, Ramana V.↗
DOE OSTI2024

A Variable Eddington Factor Model for Thermal Radiative Transfer with Closure Based on Data-Driven Shape Function

Here, a new variable Eddington factor (VEF) model is presented for nonlinear problems of thermal radiative transfer (TRT). The VEF model is data-driven and acts on known (a-priori) radiation-diffusion solutions for material temperatures in the TRT problem. A linear auxiliary problem is constructed for the radiative transfer equation (RTE) whose emission source and opacities are evaluated at these known material temperatures. The solution to this RTE approximates the specific intensity distribution in phase-space and time. It is applied as a shape function to define the Eddington tensor for the presented VEF model. The shape function computed via the auxiliary RTE problem will capture some degree of transport effects within the TRT problem. The VEF moment equations closed with this approximate Eddington tensor will thus carry with them these captured transport effects. In this study, the temperature data comes from multigroup P 1 , P 1/3 , and flux-limited diffusion radiative transfer models. The proposed VEF model can be interpreted as a transport-corrected diffusion reduced-order model. Numerical results are presented on the Fleck-Cummings test problem which models a supersonic wavefront of radiation. The VEF model is shown to improve accuracy by 1–2 orders of magnitude compared to the considered radiation-diffusion model solutions to the TRT problem.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Assessment of Grizzly Capabilities for Reactor Pressure Vessels and Reinforced Concrete Structures

Over the last several years, capabilities to simulate the progression and effects of degradation in critical structures in light water reactor (LWR) nuclear power plants have been under development in the Grizzly code. Age-related material degradation is important for a number of systems in LWRs, but the main focus for Grizzly development has been on reactor pressure vessels (RPVs) and concrete structures because of their central role and the difficulty of replacement of these structures if they are found to be degraded to an unacceptable degree. The capabilities for analyzing both RPVs and concrete structures in Grizzly have reached a point where the feature sets are sufficiently complete to perform credible analyses of those types of structures. Because of this, the emphasis has shifted from foundational development to assessing the accuracy of these modeling capabilities on representative problems of interest and on improving the physical basis of those models to improve their ability to predict the actual response of those structural systems. This report documents a first set of test cases that have been developed to assess the Grizzly code on real-world problems for these two types of structures. For RPVs, these test cases consist of a set of benchmark problems where Grizzly is compared to another code. For concrete structures, a set of models of experimental specimens designed to characterize the multidimensional swelling response of reinforced concrete members due to alkali-silica reaction (ASR) has been developed and compared with experimental results. Both the RPV and concrete test cases developed here are much more computationally intensive than the small regression tests that are used in the testing that Grizzly undergoes every time a proposed set of changes is made to ensure that those changes do not adversely affect previously established behavior. A system for regularly running these large problems to monitor the behavior of the code as it is developed has been instituted. While these test cases generally indicate good comparison with the benchmark results, they also indicate areas where further development is warranted.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2016

The Improved Simple Corner Balance Method and Efforts to Enhance its Computational Performance

The diamond difference (DD) spatial discretization has long been a work horse of the neutron transport community. For nearly as long as DD has been used in neutron transport, it has been observed that DD produces undamped, non-physical angular fluxes in spatially under resolved problems and can fail in the thick diffusion limit. A long list of alternative spatial discretizations, all with better physics properties: accuracy, robustness, and/or preservation of the thick diffusion limit, have been proposed as alternatives to DD. Unfortunately, these alternative spatial discretizations also require significantly more floating point operations (FLOPs) per unknown compared to DD. Historically, neutron transport problems of interest have been able to be resolved sufficiently that DD is accurate enough and FLOPs have been the computational performance bottleneck controlling time to solution. Thus, in practice DD has been and remains a preferred spatial discretization for neutron transport simulations. Trends in computing architecture are leading to a new paradigm where data movement, not FLOPs will control time to solution. This presents an opportunity to improve neutron transport physics by reconsidering more FLOP intensive spatial discretization than DD without incurring a time to solution penalty. In this work, we consider the improved simple corner balance (ISCB) spatial discretization, a unique alternative to DD that has the same memory footprint as DD, and detail efforts to improve its computational performance. The ISCB spatial discretization is a more FLOP intensive spatial discretization than DD with the same memory footprint as DD. Though designed to maximize FLOP intensity, third party libraries such as LAPACK are not tuned for the unique, frequent, small linear algebra needs of neutron transport problems. While hand coding a sparse Gauss elimination is likely to be faster than a dense matrix solve (CM vs. HGE), were LAPACK suitable for small linear algebra problems, we would not have seen a performance increase with decreased numbers of LAPACK calls for the Schur complement solve (SC4 vs. SC1). Significant effort has reduced the relative compute time of ISCB to DD, but on current computer architectures DD is still faster than ISCB. Future work comparing the overall efficiency of ISCB to DD may reveal that while ISCB is slower than DD on current computers, ISCB is more accurate than DD by a factor greater than the compute time slowdown. As new computer architectures become available, we will test our hypothesis that neutron transport simulations will be bandwidth limited, ideally rendering the additional FLOPs required by ISCB to be 'free' [in terms of time to solution]. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1993

Diffraction of a Gaussian Beam by a Spherical Obstacle

The Kirchhoff integral for diffraction in the near-forward direction is derived from the exact solution of the electromagnetic boundary value problem of a focused Gaussian laser beam incident on a spherical particle. The diffracted intensity in the vicinity of the particle is computed and the way in which the features of the diffraction pattern depend on the width of the Gaussian beam is commented on.

Lock, James A.↗
NASA NTRS2002

High-Efficiency High-Resolution Global Model Developments at the NASA Goddard Data Assimilation Office

The Data Assimilation Office (DAO) has been developing a new generation of ultra-high resolution General Circulation Model (GCM) that is suitable for 4-D data assimilation, numerical weather predictions, and climate simulations. These three applications have conflicting requirements. For 4-D data assimilation and weather predictions, it is highly desirable to run the model at the highest possible spatial resolution (e.g., 55 km or finer) so as to be able to resolve and predict socially and economically important weather phenomena such as tropical cyclones, hurricanes, and severe winter storms. For climate change applications, the model simulations need to be carried out for decades, if not centuries. To reduce uncertainty in climate change assessments, the next generation model would also need to be run at a fine enough spatial resolution that can at least marginally simulate the effects of intense tropical cyclones. Scientific problems (e.g., parameterization of subgrid scale moist processes) aside, all three areas of application require the model's computational performance to be dramatically improved as compared to the previous generation. In this talk, I will present the current and future developments of the "finite-volume dynamical core" at the Data Assimilation Office. This dynamical core applies modem monotonicity preserving algorithms and is genuinely conservative by construction, not by an ad hoc fixer. The "discretization" of the conservation laws is purely local, which is clearly advantageous for resolving sharp gradient flow features. In addition, the local nature of the finite-volume discretization also has a significant advantage on distributed memory parallel computers. Together with a unique vertically Lagrangian control volume discretization that essentially reduces the dimension of the computational problem from three to two, the finite-volume dynamical core is very efficient, particularly at high resolutions. I will also present the computational design of the dynamical core using a hybrid distributed-shared memory programming paradigm that is portable to virtually any of today's high-end parallel super-computing clusters.

Lin, Shian-Jiann↗