Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematics & Computing”

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

Algebraic connectivity and graph robustness.

Recent papers have used Fiedler's definition of algebraic connectivity to show that network robustness, as measured by node-connectivity and edge-connectivity, can be increased by increasing the algebraic connectivity of the network. By the definition of algebraic connectivity, the second smallest eigenvalue of the graph Laplacian is a lower bound on the node-connectivity. In this paper we show that for circular random lattice graphs and mesh graphs algebraic connectivity is a conservative lower bound, and that increases in algebraic connectivity actually correspond to a decrease in node-connectivity. This means that the networks are actually less robust with respect to node-connectivity as the algebraic connectivity increases. However, an increase in algebraic connectivity seems to correlate well with a decrease in the characteristic path length of these networks - which would result in quicker communication through the network. Applications of these results are then discussed for perimeter security.

97 MATHEMATICS AND COMPUTING↗

Projection multiplex recording of computer-synthesised one-dimensional Fourier holograms for holographic memory systems: mathematical and experimental modelling

A multiplex method of recording computer-synthesised one-dimensional Fourier holograms intended for holographic memory devices is proposed. The method potentially allows increasing the recording density in the previously proposed holographic memory system based on the computer synthesis and projection recording of data page holograms. (holographic memory)

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Efficient computation of basic sums for random polydispersed composites

The main goal of the paper was to develop algorithms and methods for computation of basic sums, the mathematical objects of great importance in computational materials science having applications to description of the representative volume element (RVE) and to the effective properties of 2D composites. The previously used algorithm had the exponential complexity. We propose a linearly complex algorithm. All the presented algorithms can be easily implemented in modern scientific computing packages, while maintaining both efficient calculations and a high level of abstraction. The proposed approach is applied to derivation of a polynomial approximation of the effective conductivity formula for 2D random material with non-overlapping circular inclusions with normally distributed radii. The obtained formulas are applied to the optimal packing problem of disks on the plane.

97 MATHEMATICS AND COMPUTING↗

Analysis of tumor-immune functional responses in a mathematical model of neoantigen cancer vaccines

Cancer neoantigen vaccines have emerged as a promising approach to stimulating the immune system to fight cancer. We propose a simple model including key elements of cancer-immune interactions and conduct a phase plane analysis to understand the immunological mechanisms of cancer neoantigen vaccines. Analytical results are obtained for two widely used functional forms that represent the killing rate of tumor cells by immune cells: the law of mass action (LMA) and the dePillis-Radunskaya Law (LPR). Using the LMA, our results reveal that a slowly growing tumor can escape the immune surveillance and that there is a unique periodic solution. The LPR offers richer dynamics, in which tumor elimination and uncontrolled tumor growth are both present. We show that tumor elimination requires sufficient number of initial activated T cells in relationship to the malignant cells, which lends support to using the neoantigen cancer vaccine as an adjuvant therapy after the primary tumor is surgically removed or treated using radiotherapy. We also derive a sufficient condition for uncontrolled tumor growth under the assumption of the LPR. Here, the juxtaposition of analyses with these two different choices for the killing rate function highlights their importance on model behavior and biological implications, by which we hope to spur further theoretical and experimental work to understand mechanisms underlying different functional forms for the killing rate.

60 APPLIED LIFE SCIENCES↗

xRage: HE Initiation Models

The xRage code contains three HE ignition models: Forest Fire, Cerro Grande and Ignition and Growth. After describing these models we present results of verification and validation (V and V) tests. These include simulations to determine the Pop-plot for each model and comparision with embedded velocity gauge data for shock-to-detonation transition (SDT) experiments. The data for the SDT experiments on PBX 9502 is taken from the recently developed high explosive database (HED). The HED data files contains additional meta-data with the key experimental parameters. This enables the use of scripts to automate testing: generating xRage input file, running simulation and generating comparison plots with experimental and simulated data. The simulations show that the models are robust. But there is a mesh dependence with the time for transition-to-detonation varying by several tenths of microseconds. After the transition to a detonation wave, the detonation speed and pressure may vary by a few per cent.

36 MATERIALS SCIENCE↗

Synchronization in Complex Oscillator Networks and Smart Grids

The emergence of synchronization in a network of coupled oscillators is a fascinating topic in various scientific disciplines. A coupled oscillator network is characterized by a population of heterogeneous oscillators and a graph describing the interaction among them. It is known that a strongly coupled and sufficiently homogeneous network synchronizes, but the exact threshold from incoherence to synchrony is unknown. Here we present a novel, concise, and closed-form condition for synchronization of the fully nonlinear, non-equilibrium, and dynamic network. Our synchronization condition can be stated elegantly in terms of the network topology and parameters, or equivalently in terms of an intuitive, linear, and static auxiliary system. Our results significantly improve upon the existing conditions advocated thus far, they are provably exact for various interesting network topologies and parameters, they are statistically correct for almost all networks, and they can be applied equally to synchronization phenomena arising in physics and biology as well as in engineered oscillator networks such as electric power networks. We illustrate the validity, the accuracy, and the practical applicability of our results in complex networks scenarios and in smart grid applications.

36 MATERIALS SCIENCE↗

Validation of Two Hydrocodes with a Bi-Metallic Shaped Charge Experiment [Slides]

Staggered grid (SGH) and cell-centered (CCH) Lagrangian Hydro are two approaches to modeling high explosives (HE) experiments. HE experiments involve complex flows. For example, the discontinuity in the tangential velocity across a frictionless contact surface. In this work, the SGH and CCH schemes with a contact surface algorithm are used to simulate a bimetallic shaped charge experiment using FLAG. Experiment will be performed at LANL in the coming year and used to validate the SGH and CCH schemes results.

42 ENGINEERING↗

Assessing the Effect of Parametric Uncertainty on the FRAPCON-3.4 Thermal Conductivity Model

In the absence of a well-accepted, mathematical description of how units of material respond to one or more external actions, scientists must often rely upon empirically-derived models to make predictions. These models are often employed to model very complex phenomena, with an unfortunate side-effect that intuition, as to the values of particular model parameters, may not serve to guide their use. Given our increased reliance on modeling and simulation to make predictions in the absence of experimental data, it befits the scientific and engineering communities to explore and report upon uncertainty quantification techniques applied to previously adopted (or at least well-accepted) empirical models that derive from or pertain to substantial experimental data sets. This report represents a collection of three methodologies aimed at assessing the predictive capability of the empirical thermal conductivity model adopted by the nuclear fuel performance code, FRAPCON-3.4. Each of these methodologies considers the effect of uncertain parameters – a plausible reality in the context of empirically-derived models – on the ability of the model to predict uranium dioxide conductivity data from open literature sources. The results lead the authors to question the predictive capability of the FRAPCON model for predicting the thermal conductivities associated with irradiated fuel samples. The report concludes with a preliminary examination of Idaho National Laboratory’s (INL) nuclear fuel performance code, BISON, developed under INL’s Multiphysics Object Oriented Simulation Environment (MOOSE).

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Special Issue: Microbial Community Modeling: Prediction of Microbial Interactions and Community Dynamics

Microbial communities are networks of species, the interaction structure of which dynamically reorganizes in a varying environment. Even in a static condition, community dynamics are often difficult to predict due to highly nonlinear interspecies interactions. Understanding fundamental principles of microbial interactions is therefore key for predicting and harnessing community function and properties. As extensively reviewed previously, mathematical models and computational methods that can predictively link interactions to community behaviors are indispensable tools for achieving this goal. This Special Issue of Processes collects eleven papers from lead scientists and researchers active in the area under the topic of “Microbial Community Modeling: Prediction of Microbial Interactions and Community Dynamics.” The collected papers cover various topics of interest: 1) two review/opinion papers discussing recent advances in biofilm modeling and specific issues for successful collaboration between experimentalists and theorists, 2) one paper on the dynamics of complex environmental communities, 3) six papers dealing with fundamental aspects of microbial interactions and stability in model communities, and 4) two papers on the development and utilization of microbial consortia for biotechnology applications.

Song, Hyun-Seob (ORCID:0000000221546358)↗

An FPGA-based hardware accelerator supporting sensitive sequence homology filtering with profile hidden Markov models

Abstract Background Sequence alignment lies at the heart of genome sequence annotation. While the BLAST suite of alignment tools has long held an important role in alignment-based sequence database search, greater sensitivity is achieved through the use of profile hidden Markov models (pHMMs). Here, we describe an FPGA hardware accelerator, called HAVAC, that targets a key bottleneck step (SSV) in the analysis pipeline of the popular pHMM alignment tool, HMMER. Results The HAVAC kernel calculates the SSV matrix at 1739 GCUPS on a $$\sim$$ ∼ $3000 Xilinx Alveo U50 FPGA accelerator card, $$\sim$$ ∼ 227× faster than the optimized SSV implementation in nhmmer . Accounting for PCI-e data transfer data processing, HAVAC is 65× faster than nhmmer’s SSV with one thread and 35× faster than nhmmer with four threads, and uses $$\sim$$ ∼ 31% the energy of a traditional high end Intel CPU. Conclusions HAVAC demonstrates the potential offered by FPGA hardware accelerators to produce dramatic speed gains in sequence annotation and related bioinformatics applications. Because these computations are performed on a co-processor, the host CPU remains free to simultaneously compute other aspects of the analysis pipeline.

59 BASIC BIOLOGICAL SCIENCES↗

Petascale Computing Enabling Technologies Project Final Report

The Petascale Computing Enabling Technologies (PCET) project addressed challenges arising from current trends in computer architecture that will lead to large-scale systems with many more nodes, each of which uses multicore chips. These factors will soon lead to systems that have over one million processors. Also, the use of multicore chips will lead to less memory and less memory bandwidth per core. We need fundamentally new algorithmic approaches to cope with these memory constraints and the huge number of processors. Further, correct, efficient code development is difficult even with the number of processors in current systems; more processors will only make it harder. The goal of PCET was to overcome these challenges by developing the computer science and mathematical underpinnings needed to realize the full potential of our future large-scale systems. Our research results will significantly increase the scientific output obtained from LLNL large-scale computing resources by improving application scientist productivity and system utilization. Our successes include scalable mathematical algorithms that adapt to these emerging architecture trends and through code correctness and performance methodologies that automate critical aspects of application development as well as the foundations for application-level fault tolerance techniques. PCET's scope encompassed several research thrusts in computer science and mathematics: code correctness and performance methodologies, scalable mathematics algorithms appropriate for multicore systems, and application-level fault tolerance techniques. Due to funding limitations, we focused primarily on the first three thrusts although our work also lays the foundation for the needed advances in fault tolerance. In the area of scalable mathematics algorithms, our preliminary work established that OpenMP performance of the AMG linear solver benchmark and important individual kernels on Atlas did not match the predictions of our simple initial model. Our investigations demonstrated that a poor default memory allocation mechanism degraded performance. We developed a prototype NUMA library to provide generic mechanisms to overcome these issues, resulting in significantly improved OpenMP performance. After additional testing, we will make this library available to all users, providing a simple means to improve threading on LLNL's production Linux platforms. We also made progress on developing new scalable algorithms that target multicore nodes. We designed and implemented a new AMG interpolation operator with improved convergence properties for very low complexity coarsening schemes. This implementation will also soon be available to LLNL's application teams as part of the hypre library. We presented results for both topics in an invited plenary talk entitled 'Efficient Sparse Linear Solvers for Multi-Core Architectures' at the 2009 HPCMP Institutes Annual Meeting/CREATE Annual All-Hands Meeting. The interpolation work was summarized in a talk entitled 'Improving Interpolation for Aggressive Coarsening' at the 14th Copper Mountain Conference on Multigrid Methods and in a research paper that will appear in Numerical Linear Algebra with Applications. In the area of code correctness, we significantly extended our behavior equivalence class identification mechanism. Specifically, we not only demonstrated it works well at very large scales but we also added the ability to classify MPI tasks not only by function call traces, but also by specific call sites (source code line numbers) being executed by tasks. More importantly, we developed a new technique to determine relative logical execution progress of tasks in the equivalence classes by combining static analysis with our original dynamic approach. We applied this technique to a correctness issue that arose at 4096 tasks during the development of the new AMG interpolation operator discussed above. This scale isat the limit of effectiveness of production tools, but our technique quickly located the erroneous source code, demonstrating the power of understanding relationships between behavioral equivalence classes. This work is the subject of a paper recently accepted to SC09, as well as a presentation entitled 'Providing Order to Extreme Scale Debugging Chaos' given at the ParaDyn Week annual conference in College Park, MD. In addition to this theoretical extension, we have made significant progress in developing a front end for this tool set, and the front-end is now available on several of LLNL's largescale computing resources. In addition, we explored mechanisms to identify exact locations of erroneous MPI usage in application source code. In this work, we developed a new model that led to a highly efficient algorithm for detecting deadlock during dynamic software testing. This work was the subject of a well-received paper at ICS 2009 [4].

99 GENERAL AND MISCELLANEOUS↗

Mesh Convergence Issues

(U) This document is written to describe issues that impact on the ability of codes to converge to a unique answer. Several issues that could be discussed in the area of mesh convergence and resolution the topics include the resolution of geometry, stress gradients, shock propagation, material softening, and localization of deformation. After a quick discussion of what mesh convergence means, this paper presents a review of some of the criteria for mesh convergence. With an introductory level understanding of these criteria, two problems are presented to demonstrate convergence and non-­convergence. The first example is a simple convergent hemisphere of gas, known as the Noh problem. With this problem convergence is shown. The Noh problem is also used to investigate the impact of mesh stiffening, or viscosity. The second problem is that of an explosively driven hemisphere. The hemisphere made of U6Nb with an inner radius of 40 mm and an outer radius of 41 mm was filled with PBX9501 and tested. Test results included surface temperature and information on the breakup, such as distribution of fines. Convergence computational methods are discussed along with some proposals for obtaining mesh convergence for a wide range of applications.

36 MATERIALS SCIENCE↗

Joint the Center for Applied Scientific Computing

The Center for Applied Scientific Computing serves as Livermore Lab’s window to the broader computer science, computational physics, applied mathematics, and data science research communities. In collaboration with academic, industrial, and other government laboratory partners, we conduct world-class scientific research and development on problems critical to national security. CASC applies the power of high-performance computing and the efficiency of modern computational methods to the realms of stockpile stewardship, cyber and energy security, and knowledge discovery for intelligence applications.

97 MATHEMATICS AND COMPUTING↗

Time Utility Functions for Modeling and Evaluating Resource Allocations in a Heterogeneous Computing System

This study considers a heterogeneous computing system and corresponding workload being investigated by the Extreme Scale Systems Center (ESSC) at Oak Ridge National Laboratory (ORNL). The ESSC is part of a collaborative effort between the Department of Energy (DOE) and the Department of Defense (DoD) to deliver research, tools, software, and technologies that can be integrated, deployed, and used in both DOE and DoD environments. The heterogeneous system and workload described here are representative of a prototypical computing environment being studied as part of this collaboration. Each task can exhibit a time-varying importance or utility to the overall enterprise. In this system, an arriving task has an associated priority and precedence. The priority is used to describe the importance of a task, and precedence is used to describe how soon the task must be executed. These two metrics are combined to create a utility function curve that indicates how valuable it is for the system to complete a task at any given moment. This research focuses on using time-utility functions to generate a metric that can be used to compare the performance of different resource schedulers in a heterogeneous computing system. The contributions of this paper are: (a) a mathematical model of a heterogeneous computing system where tasks arrive dynamically and need to be assigned based on their priority, precedence, utility characteristic class, and task execution type, (b) the use of priority and precedence to generate time-utility functions that describe the value a task has at any given time, (c) the derivation of a metric based on the total utility gained from completing tasks to measure the performance of the computing environment, and (d) a comparison of the performance of resource allocation heuristics in this environment.

99 GENERAL AND MISCELLANEOUS↗

Solving Inverse Detection Problems Using Passive Radiation Signatures [Slides]

The ability to reconstruct an unknown radioactive object based on its passive gamma-ray and neutron signatures is very important in homeland security applications. Often in the analysis of unknown radioactive objects, for simplicity or speed or because there is no other information, they are modeled as spherically symmetric regardless of their actual geometry. In these presentation we discuss the accuracy and implications of this approximation for decay gamma rays and for neutron-induced gamma rays. We discuss an extension of spherical raytracing (for uncollided fluxes) that allows it to be used when the exterior shielding is flat or cylindrical. We revisit some early results in boundary perturbation theory, showing that the Roussopolos estimate is the correct one to use when the quantity of interest is the flux or leakage on the boundary. We apply boundary perturbation theory to problems in which spherically symmetric systems are perturbed in asymmetric nonspherical ways. We apply mesh adaptive direct search (MADS) algorithms to object reconstructions. We present a benchmark test set that may be used to quantitatively evaluate inverse detection methods.

42 ENGINEERING↗

Efficient spectral and pseudospectral algorithms for 3D simulations of whistler-mode waves in a plasma

Efficient spectral and pseudospectral algorithms for simulation of linear and nonlinear 3D whistler waves in a cold electron plasma are developed. These algorithms are applied to the simulation of whistler waves generated by loop antennas and spheromak-like stationary waves of considerable amplitude. The algorithms are linearly stable and show good stability properties for computations of nonlinear waves over tens of thousands of time steps. Additional speedups by factors of 10-20 (comparing single core CPU and one GPU) are achieved by using graphics processors (GPUs), which enable efficient numerical simulation of the wave propagation on relatively high resolution meshes (tens of millions nodes) in personal computing environment. Comparisons of the numerical results with analytical solutions and experiments show good agreement. The limitations of the codes and the performance of the GPU computing are discussed.

97 MATHEMATICS AND COMPUTING↗