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,585 records · Page 88

Wavelet-Smoothed Interpolation of Masked Scientific Data for JPEG 2000 Compression [Slides]

How should we manage scientific data with 'holes'? Some applications, like JPEG 2000, expect logically rectangular data, but some sources, like the Parallel Ocean Program (POP), generate data that isn't defined on certain subsets. We refer to grid points that lack well-defined, scientifically meaningful sample values as 'masked' samples. Wavelet-smoothing is a highly scalable interpolation scheme for regions with complex boundaries on logically rectangular grids. Computation is based on forward/inverse discrete wavelet transforms, so runtime complexity and memory scale linearly with respect to sample count. Efficient state-of-the-art minimal realizations yield small constants (O(10)) for arithmetic complexity scaling, and in-situ implementation techniques make optimal use of memory. Implementation in two dimensions using tensor product filter banks is straighsorward and should generalize routinely to higher dimensions. No hand-tuning required when the interpolation mask changes, making the method aeractive for problems with time-varying masks. Well-suited for interpolating undefined samples prior to JPEG 2000 encoding. The method outperforms global mean interpolation, as judged by both SNR rate-distortion performance and low-rate artifact mitigation, for data distributions whose histograms do not take the form of sharply peaked, symmetric, unimodal probability density functions. These performance advantages can hold even for data whose distribution differs only moderately from the peaked unimodal case, as demonstrated by POP salinity data. The interpolation method is very general and is not tied to any particular class of applications, could be used for more generic smooth interpolation.

42 ENGINEERING↗

The Jump-Off Velocity of an Impulsively Loaded Spherical Shell

We consider a constant temperature spherical shell of isotropic, homogeneous, linearly elastic material with density ρ and Lamé coefficients λ and μ. The inner and outer radii of the shell are r i and r o , respectively. We assume that the inside of the shell is a void. On the outside of the shell, we apply a uniform, time-varying pressure p(t). We also assume that the shell is initially at rest. We want to compute the jump-off time and velocity of the pressure wave, which are the first time after t = 0 at which the pressure wave from the outer surface reaches the inner surface. This analysis computes the jump-off velocity and time for both compressible and incompressible materials. This differs substantially from [3], where only incompressible materials are considered. We will consider the behavior of an impulsively loaded, exponentially decaying pressure wave p(t) = P 0 e -αt , where α ≥ 0. We notice that a constant pressure wave P(t) = P 0 is a special case (α = 0) of a decaying pressure wave. Both of these boundary conditions are considered in [3].

36 MATERIALS SCIENCE↗

A survey of numerical linear algebra methods utilizing mixed-precision arithmetic

The efficient utilization of mixed-precision numerical linear algebra algorithms can offer attractive acceleration to scientific computing applications. Especially with the hardware integration of low-precision special-function units designed for machine learning applications, the traditional numerical algorithms community urgently needs to reconsider the floating point formats used in the distinct operations to efficiently leverage the available compute power. In this study, we provide a comprehensive survey of mixed-precision numerical linear algebra routines, including the underlying concepts, theoretical background, and experimental results for both dense and sparse linear algebra problems.

97 MATHEMATICS AND COMPUTING↗

Los Alamos National Laboratory Computational Physics Summer Student Workshop (Final Report)

The numerical solution of highly compressible, multi-material flows is an ongoing research area. These types of flows can be solved with a Lagrangian type mesh which moves with the material in a simulation to allow precise material interface tracking. Currently, researchers at Los Alamos National Laboratory and elsewhere are investigating cell-centered Lagrangian algorithms with the aim of producing methods that have second-order accuracy, preserve symmetry, and do not generate spurious vorticity. The new cell-centered algorithms solve a Riemann-like problem at the vertex of a cell. Professor Phil Roe at the University of Michigan has proposed a new structure for Lagrangian hydrodynamic algorithms that does not rely on the solution of the Riemann problem. The new approach utilizes Flux Corrected Transport (FCT) and it implements a form of vorticity control. The first step in the development of this method has been to construct an algorithm that solves the acoustic equations on an Eulerian mesh. The algorithm, which builds on the work of Morton and Roe, calculates fluxes at cell vertices, attains second-order accuracy using FCT, and has the special property of preserving vorticity. Results are presented that confirm the second order accuracy of the scheme and the vorticity preserving properties. The results are compared to the output produced by a MUSCL-Hancock algorithm. Some discussion of limiting methods for the FCT algorithm is also given.

42 ENGINEERING↗

Computation of condition-dependent proteome allocation reveals variability in the macro and micro nutrient requirements for growth

Sustaining a robust metabolic network requires a balanced and fully functioning proteome. In addition to amino acids, many enzymes require cofactors (coenzymes and engrafted prosthetic groups) to function properly. Extensively validated resource allocation models, such as genome-scale models of metabolism and gene expression (ME-models), have the ability to compute an optimal proteome composition underlying a metabolic phenotype, including the provision of all required cofactors. Here we apply the ME-model for Escherichia coli K-12 MG1655 to computationally examine how environmental conditions change the proteome and its accompanying cofactor usage. We found that: (1) The cofactor requirements computed by the ME-model mostly agree with the standard biomass objective function used in models of metabolism alone (M-models); (2) ME-model computations reveal non-intuitive variability in cofactor use under different growth conditions; (3) An analysis of ME-model predicted protein use in aerobic and anaerobic conditions suggests an enrichment in the use of peroxyl scavenging acids in the proteins used to sustain aerobic growth; (4) The ME-model could describe how limitation in key protein components affect the metabolic state of E . coli . Genome-scale models have thus reached a level of sophistication where they reveal intricate properties of functional proteomes and how they support different E . coli lifestyles.

59 BASIC BIOLOGICAL SCIENCES↗

Verification of 2-D Detonation Shock Dynamics in conjunction with Los Alamos Lagrangian hydrocode

As the latest version of the fast-tube Detonation Shock Dynamics (DSD) solver is linked with the Los Alamos Lagrangian hydrocode, verification problems from a 2006 DSD report (LA-14277) have been duplicated with some of the verification criteria changed to more quantitative ones. The observed error convergence is as good as or better than reported in, quite possibly due to the careful treatment of floating point numbers to ensure that their precision level is maintained throughout the code. This report duplicates the three sample verification problems in LA-14277 using the Los Alamos ASC Lagrangian hydrocode (FLAG), official release of 3.2 Alpha6 with a few modifications. This version of FLAG is linked with the latest fast-tube Detonation Shock Dynamics (DSD) version beta 2 solver released in 2011 as part of the LanlDSD software product. New verification criteria are used for the arcwave problem where two specific locations are chosen for burn arrival time comparison. For this report FLAG's internal driver code prepares the distance function ({Psi}) and material ID fields from its hydro setup, instead of the stand-alone driver that is being utilized by the other LANL hydrocodes currently interfaced to LanlDSD. As it is implemented in version 3.2 Alpha6, the {Psi} and material ID fields and other parameters are passed from FLAG to the DSD solver directly, and the burn table is directly passed back to FLAG as part of the calling arguments. The burn-front arrival time 'exact' solutions, mentioned in the sequel for the rate-stick and 'arc-wave' problems, are computed using a pair of special-purpose Fortran codes provided by Aslam. In each case an ansatz for the form of the solution is made in which the radius from the detonator center point is used as the independent space coordinate. This leads to a simplified, problem-specific, 1D form of the governing equation. This equation is solved using 2nd-order spatial differencing and the forward Euler method on a very fine temporal and geometric mesh. The boundary conditions are handled exactly at the correct location, with second order accuracy. Care has been taken to ensure that this solution is fully converged.

36 MATERIALS SCIENCE↗

Information Geometry of Quantum Resources

I review recent works showing that information geometry is a useful framework to characterize quantum coherence and entanglement. Quantum systems exhibit peculiar properties which cannot be justified by classical physics, e.g. quantum coherence and quantum correlations. Once confined to thought experiments, they are nowadays created and manipulated by exerting an exquisite experimental control of atoms, molecules and photons. It is important to identify and quantify such quantum features, as they are deemed to be key resources to achieve supraclassical performances in computation and communication protocols. The information geometry viewpoint elucidates the advantage provided by quantum superpositions in phase estimation. Furthermore, it enables to link measures of coherence and entanglement to observables, which can be evaluated in a laboratory by a limited number of measurements.

97 MATHEMATICS AND COMPUTING↗

Low-dissipation centred schemes for hyperbolic equations in conservative and non-conservative form

We propose a one-parameter family of low-dissipation centred numerical schemes for solving hyperbolic equations in conservative or non-conservative form, using finite volume or discontinuous Galerkin finite element methods. The new schemes spring out from the multi-dimensional FORCE method and are determined by a single parameter α ≥ 1. Given an increasing sequence of real numbers 1 ≤ α 1 < α 2 < . . . < α K , there corresponds a sequence of numerical schemes with stability restriction associated to a decreasing sequence of Courant numbers 1 > c 1 > c 2 > . . . > c K > 0 and a decreasing sequence of corresponding numerical viscosity functions d 1 > d 2 > . . . > d K . For a given Courant number c k ≤ 1 there is a real number α k > 0 and a corresponding stable scheme with minimal numerical viscosity d k . The proposed schemes suit very well the family of high-order discontinuous Galerkin finite element methods and the recently proposed class of ADER-TR schemes, whose orders of accuracy define decreasing sequences of Courant numbers, as the order of accuracy increases. The centred methods of this paper are stable in 2D and 3D in the frame of simultaneous updating formulae, unlike other centred methods, such as 1D FORCE, which are not. Furthermore, the schemes are highly accurate for slowly-moving waves, which is precisely the kind of waves that traditional centred methods smear disastrously. Additional features of the proposed schemes include ease of implementation and applicability to any hyperbolic system either in conservative or non-conservative form. Here, the proposed schemes are analysed and computationally assessed through a suite of test problems for a linear model system, for the Euler equations in one and two space dimensions, and for the Baer-Nunziato equations for compressible two-phase flow.

97 MATHEMATICS AND COMPUTING↗

Chance-Constrained AC Optimal Power Flow: Reformulations and Efficient Algorithms

Higher levels of renewable electricity generation increase uncertainty in power system operation. To ensure secure system operation, new tools that account for this uncertainty are required. Here, in this paper, we adopt a chance-constrained AC optimal power flow formulation, which guarantees that generation, power flows and voltages remain within their bounds with a pre-defined probability. We then discuss different chance-constraint reformulations and solution approaches for the problem. Additionally, we first discuss an analytical reformulation based on partial linearization, which enables us to obtain a tractable representation of the optimization problem. We then provide an efficient algorithm based on an iterative solution scheme which alternates between solving a deterministic AC OPF problem and assessing the impact of uncertainty. This more flexible computational framework enables not only scalable implementations, but also alternative chance-constraint reformulations. In particular, we suggest two sample based reformulations that do not require any approximation or relaxation of the AC power flow equations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Perfectly Matched Layers and Characteristic Boundaries in Lattice Boltzmann: Accuracy vs Cost

Artificial boundary conditions (BCs) play a ubiquitous role in numerical simulations of transport phenomena in several diverse fields, such as fluid dynamics, electromagnetism, acoustics, geophysics, and many more. They are essential for accurately capturing the behavior of physical systems whenever the simulation domain is truncated for computational efficiency purposes. Ideally, an artificial BC would allow relevant information to enter or leave the computational domain without introducing artifacts or unphysical effects. Boundary conditions designed to control spurious wave reflections are referred to as nonreflective boundary conditions (NRBCs). Another approach is given by the perfectly matched layers (PMLs), in which the computational domain is extended with multiple dampening layers, where outgoing waves are absorbed exponentially in time. Here, in this work, the definition of PML is revised in the context of the lattice Boltzmann method. The impact of adopting different types of BCs at the edge of the dampening zone is evaluated and compared, in terms of both accuracy and computational costs. It is shown that for sufficiently large buffer zones, PMLs allow stable and accurate simulations even when using a simple zeroth-order extrapolation BC. Moreover, employing PMLs in combination with NRBCs potentially offers significant gains in accuracy at a modest computational overhead, provided the parameters of the BC are properly tuned to match the properties of the underlying fluid flow.

97 MATHEMATICS AND COMPUTING↗

Verification of MCNP5-1.60 and MCNP6-Beta-2 for Criticality Safety Applications

To verify that both MCNP5-1.60 and MCNP6-Beta-2 are performing correctly for criticality safety applications, several suites of verification/validation benchmark problems were run in early 2012. Results from these benchmark suites were compared with results from previously verified versions of MCNP5. The goals of this verification testing were: (1) Verify that MCNP5-1.60 works correctly for nuclear criticality safety applications, producing the same results as for the previous verification performed in 2010; (2) Determine the sensitivity to computer roundoff using different Fortran-90 compilers for building MCNP5 and MCNP6, to support moving to current versions of the compilers; and (3) Verify that MCNP6-Beta-2 works correctly for nuclear criticality safety applications, producing the same results as for MCNP5-1.60. This provides support for eventual migration of users and applications to MCNP6. The current production version of MCNP5 included in the RSICC release package is MCNP5-1.60. This version was first distributed by RSICC in October 2010. While there were subsequent RSICC distributions of the MCNP package in July 2011 and February 2012, no changes were made to MCNP5-1.60. The RSICC release package in February 2012 included both MCNP5-1.60 and the current beta version of MCNP6, MCNP6-Beta-2. MCNP6 is the merger of MCNP5 and MCNPX capabilities. The current release of MCNP6 available from RSICC as of February 2012 is MCNP6-Beta-2. This version includes all of the features for criticality safety calculations that are available in MCNP5-1.60, and many new features largely unrelated to nuclear criticality safety calculations. This release is a 'beta' release to allow intermediate and advanced users to begin testing the merged code in their field of expertise. It should not be used for production calculations.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Two new SciDAC institutes promote mathematical tools and software technology for high-performance computing

Bigger is often said to be better, and the newest extreme-scale computers certainly are bigger, with millions of processing units. Moreover, the breadth of science performed on the U.S. Department of Energy (DOE) computing facilities is expanding, with new technology such as artificial intelligence emerging. These advances are exciting, creating new opportunities for scientific discovery; however, they also raise new questions for scientists who want to exploit these advances for tackling more complex problems. Will my simulation code be able to utilize the accelerators in extreme-scale computing systems? Can I take advantage of the deepening memory hierarchy in heterogeneous processors? Is there a way around bottlenecks caused by the widening ratio of peak floating-point operations per second to I/0 bandwidth? How can I manage my huge amounts of data effectively? Can I analyze data in situ, or must I transfer it to offline storage for later analysis? To address such questions, DOE announced that it is providing $57.5 million over the next five years for two multidisciplinary teams — FASTMath and RAPIDS2 — to develop new tools and techniques to harness supercomputers for scientific discovery. The teams, called SciDAC Institutes, are part of the Scientific Discovery through Advanced Computing program.

97 MATHEMATICS AND COMPUTING↗

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

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

59 BASIC BIOLOGICAL SCIENCES↗

DeepGRN: prediction of transcription factor binding site across cell-types using attention-based deep neural networks

Abstract Background Due to the complexity of the biological systems, the prediction of the potential DNA binding sites for transcription factors remains a difficult problem in computational biology. Genomic DNA sequences and experimental results from parallel sequencing provide available information about the affinity and accessibility of genome and are commonly used features in binding sites prediction. The attention mechanism in deep learning has shown its capability to learn long-range dependencies from sequential data, such as sentences and voices. Until now, no study has applied this approach in binding site inference from massively parallel sequencing data. The successful applications of attention mechanism in similar input contexts motivate us to build and test new methods that can accurately determine the binding sites of transcription factors. Results In this study, we propose a novel tool (named DeepGRN) for transcription factors binding site prediction based on the combination of two components: single attention module and pairwise attention module. The performance of our methods is evaluated on the ENCODE-DREAM in vivo Transcription Factor Binding Site Prediction Challenge datasets. The results show that DeepGRN achieves higher unified scores in 6 of 13 targets than any of the top four methods in the DREAM challenge. We also demonstrate that the attention weights learned by the model are correlated with potential informative inputs, such as DNase-Seq coverage and motifs, which provide possible explanations for the predictive improvements in DeepGRN. Conclusions DeepGRN can automatically and effectively predict transcription factor binding sites from DNA sequences and DNase-Seq coverage. Furthermore, the visualization techniques we developed for the attention modules help to interpret how critical patterns from different types of input features are recognized by our model.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A posteriori error estimation and adaptivity in hp virtual elements

An explicit and computable error estimator for the hp version of the virtual element method (VEM), together with lower and upper bounds with respect to the exact energy error, is presented. Such error estimator is employed to provide, following the approach of Melenk and Wohlmuth (Adv Comput Math 15(1–4):311–331, 2001), hp adaptive mesh refinements for very general polygonal meshes. In addition, a novel VEM hp Clément quasi-interpolant, instrumental for the a posteriori error analysis, is introduced. The performances of the adaptive method are validated by a number of numerical experiments.

97 MATHEMATICS AND COMPUTING↗

Simulating plasma wave propagation on a superconducting quantum chip

Quantum computers may one day enable the efficient simulation of strongly coupled plasmas that lie beyond the reach of classical computation in regimes where quantum effects are important and the scale separation is large. Here, in this article, we take a first step toward efficient simulation of quantum plasmas by demonstrating linear plasma wave propagation on a superconducting quantum chip. Using high-fidelity and highly expressive device-native gates, combined with an error-mitigation technique, we simulate the scattering of laser pulses from inhomogeneous plasmas. Our approach is made feasible by the identification of a suitable local spin model whose excitations mimic plasma waves, and whose circuit implementation requires a lower gate count than other proposed approaches that would require a future fault-tolerant quantum computer. This work opens avenues to study more complicated phenomena that cannot be simulated efficiently on classical computers, such as nonlinear quantum dynamics when strongly coupled plasmas are driven out of equilibrium.

general physics↗