Search NASA⌕ Search

SEARCH · Search NASA

Results for “sparse”

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,621 records · Page 90

Bacteriophage Tail-Tube Assembly Studied by Proton-Detected 4D Solid-State NMR

Obtaining unambiguous resonance assignments remains a major bottleneck in solid-state NMR studies of protein structure and dynamics. Particularly for supramolecular assemblies with large subunits (>150 residues), the analysis of crowded spectral data presents a challenge, even if three-dimensional (3D) spectra are used. Here, we present a proton-detected 4D solid-state NMR assignment procedure that is tailored for large assemblies. The key to recording 4D spectra with three indirect carbon or nitrogen dimensions with their inherently large chemical shift dispersion lies in the use of sparse non-uniform sampling (as low as 2 %). As a proof of principle, we acquired 4D (H)COCANH, (H)CACONH, and (H)CBCANH spectra of the 20 kDa bacteriophage tail-tube protein gp17.1 in a total time of two and a half weeks. These spectra were sufficient to obtain complete resonance assignments in a straightforward manner without use of previous solution NMR data.

59 BASIC BIOLOGICAL SCIENCES↗

Colossal Stability of Gas-Phase Trianions: Super-Pnictogens

We report multiply charged negative ions are ubiquitous in nature. They are stable as crystals because of charge compensating cations; while in solutions, solvent molecules protect them. However, they are rarely stable in the gas phase because of strong electrostatic repulsion between the extra electrons. Therefore, understanding their stability without the influence of the environment has been of great interest to scientists for decades. While much of the past work has focused on dianions, work on triply charged negative ions is sparse and the search for the smallest trianion that is stable against spontaneous electron emission or fragmentation continues. Stability of BeB 11 (X) 12 3- (X=CN, SCN, BO) trianions is demonstrated in the gas phase, with BeB 11 (CN) 12 3 - exhibiting colossal stability against electron emission by 2.65 eV and against its neutral adduct by 15.85 eV. The unusual stability of these trianions opens the door to a new class of super-pnictogens with potential applications in aluminum-ion batteries.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Indian Summer Monsoon Drought 2009: Role of Aerosol and Cloud Microphysics

Cloud dynamics played a fundamental role in defining Indian summer monsoon (ISM) rainfall during drought in 2009. The anomalously negative precipitation was consistent with cloud properties. Although, aerosols inhibited the growth of cloud effective radius in the background of sparse water vapor, their role is secondary. The primary role, however, is played by the interactive feedback between cloud microphysics and dynamics owing to reduced efficient cloud droplet growth, lesser latent heating release and shortage of water content. Cloud microphysical processes were instrumental for the occurrence of ISM drought 2009.

2009↗

Providing performance portable numerics for Intel GPUs

Summary With discrete Intel GPUs entering the high‐performance computing landscape, there is an urgent need for production‐ready software stacks for these platforms. In this article, we report how we enable the Ginkgo math library to execute on Intel GPUs by developing a kernel backed based on the DPC++ programming environment. We discuss conceptual differences between the CUDA and DPC++ programming models and describe workflows for simplified code conversion. We evaluate the performance of basic and advanced sparse linear algebra routines available in Ginkgo's DPC++ backend in the hardware‐specific performance bounds and compare against routines providing the same functionality that ship with Intel's oneMKL vendor library.

97 MATHEMATICS AND COMPUTING↗

Population genomic response to geographic gradients by widespread and endemic fishes of the Arabian Peninsula

Genetic structure within marine species may be driven by local adaptation to their environment, or alternatively by historical processes, such as geographic isolation. The gulfs and seas bordering the Arabian Peninsula offer an ideal setting to examine connectivity patterns in coral reef fishes with respect to environmental gradients and vicariance. The Red Sea is characterized by a unique marine fauna, historical periods of desiccation and isolation, as well as environmental gradients in salinity, temperature, and primary productivity that vary both by latitude and by season. The adjacent Arabian Sea is characterized by a sharper environmental gradient, ranging from extensive coral cover and warm temperatures in the southwest, to sparse coral cover, cooler temperatures, and seasonal upwelling in the northeast. Reef fish, however, are not confined to these seas, with some Red Sea fishes extending varying distances into the northern Arabian Sea, while their pelagic larvae are presumably capable of much greater dispersal. These species must therefore cope with a diversity of conditions that invoke the possibility of steep clines in natural selection. Here, we test for genetic structure in two widespread reef fish species (a butterflyfish and surgeonfish) and eight range-restricted butterflyfishes across the Red Sea and Arabian Sea using genome-wide single nucleotide polymorphisms. We performed multiple matrix regression with randomization analyses on genetic distances for all species, as well as reconstructed scenarios for population subdivision in the species with signatures of isolation. We found that (a) widespread species displayed more genetic subdivision than regional endemics and (b) this genetic structure was not correlated with contemporary environmental parameters but instead may reflect historical events. We propose that the endemic species may be adapted to a diversity of local conditions, but the widespread species are instead subject to ecological filtering where different combinations of genotypes persist under divergent ecological regimes.

59 BASIC BIOLOGICAL SCIENCES↗

Parallel domain decomposition method for finite element approximation of 3D steady state non‐Newtonian fluids

Summary We introduce a stabilized finite element method for the 3D non‐Newtonian Navier–Stokes equations and a parallel domain decomposition method for solving the sparse system of nonlinear equations arising from the discretization. Non‐Newtonian flow problems are, generally speaking, more challenging than Newtonian flows because the nonlinearities are not only in the convection term but also in the viscosity term, which depends on the shear rate. Many good iterative methods and preconditioning techniques that work well for the Newtonian flows do not work well for the non‐Newtonian flows. We employ a Galerkin/least squares finite element method, with stabilization parameters adjusted to count the non‐Newtonian effect, to discretize the equations, and the resulting highly nonlinear system of equations is solved by a Newton–Krylov–Schwarz algorithm. In this study, we apply the proposed method to some inelastic power‐law fluid flows through the eccentric annuli with inner cylinder rotation and investigate the robustness of the method with respect to some physical parameters, including the power‐law index and the Reynolds number ratios. We then report the superlinear speedup achieved by the domain decomposition algorithm on a computer with up to 512 processors. Copyright © 2015 John Wiley & Sons, Ltd.

Shiu, Wen‐Shin↗

Do Diurnal Aerosol Changes Affect Daily Average Radiative Forcing?

Strong diurnal variability of aerosol has been observed frequently for many urban/industrial regions. How this variability may alter the direct aerosol radiative forcing (DARF), however, is largely unknown. To quantify changes in the time-averaged DARF, we perform an assessment of 29 days of high temporal resolution ground-based data collected during the Two-Column Aerosol Project (TCAP) on Cape Cod, which is downwind of metropolitan areas. We demonstrate that strong diurnal changes of aerosol loading (about 20% on average) have a negligible impact on the 24-h average DARF, when daily averaged optical properties are used to find this quantity. However, when there is a sparse temporal sampling of aerosol properties, which may preclude the calculation of daily averaged optical properties, large errors (up to 100%) in the computed DARF may occur. We describe a simple way of reducing these errors, which suggests the minimal temporal sampling needed to accurately find the forcing.

aerosol↗

Standard grids for high-precision integration of modern density functionals: SG-2 and SG-3

Density-functional approximations developed in the past decade necessitate the use of quadrature grids that are far more dense than those required to integrate older generations of functionals. This category of difficult-to-integrate functionals includes meta-generalized gradient approximations, which depend on orbital gradients and/or the Laplacian of the density, as well as functionals based on B97 and the popular “Minnesota” class of functionals, each of which contain complicated and/or oscillatory expressions for the exchange inhomogeneity factor. Following a strategy introduced previously by Gill and co-workers to develop the relatively sparse “SG-0” and “SG-1” standard quadrature grids, we introduce two higher-quality grids that we designate SG-2 and SG-3, obtained by systematically “pruning” medium- and high-quality atom-centered grids. The pruning procedure affords computational speedups approaching a factor of two for hybrid functionals applied to systems of ~100 atoms, without significant loss of accuracy. The grid dependence of several popular density functionals is characterized for various properties.

74 ATOMIC AND MOLECULAR PHYSICS↗

Global analysis of night marine air temperature and its uncertainty since 1880

An updated version of the Met Office Hadley Centre's monthly night marine air temperature data set is presented. It is available on a 5° latitude-longitude grid from 1880 as anomalies relative to 1961–1990 calendar-monthly climatological average night marine air temperature (NMAT). Adjustments are made for changes in observation height; these depend on estimates of the stability of the near surface atmospheric boundary layer. In previous versions of the data set, ad hoc adjustments were also made for three periods and regions where poor observational practice was prevalent. These adjustments are re-examined. Estimates of uncertainty are calculated for every grid box and result from measurement errors, uncertainty in adjustments applied to the observations, uncertainty in the measurement height, and under-sampling. The new data set is a clear improvement over previous versions in terms of coverage because of the recent digitization of historical observations from ships' logbooks. However, the periods prior to about 1890 and around World War II remain particularly uncertain, and sampling is still sparse in some regions in other periods. A further improvement is the availability of uncertainty estimates for every grid box and every month. Previous versions required adjustments that were dependent on contemporary measurements of sea surface temperature (SST); to avoid these, the new data set starts in 1880 rather than 1856. Overall agreement with variations of SST is better for the updated data set than for previous versions, supporting existing estimates of global warming and increasing confidence in the global record of temperature variability and change.

54 ENVIRONMENTAL SCIENCES↗

Ordering Polymer‐Grafted Nanoparticles at Oil–Air Interfaces under Magnetic Fields

Abstract Polymer‐grafted magnetic nanoparticles at oil–air interfaces are examined to reveal the role of chain length and anisotropy on particle packing order in thin films. It is found that particles grafted with intermediate chain lengths and sparse grafting densities exhibit enhanced packing order with increasing magnetic field strength. Voronoi tessellation results present an increase in the cell area distribution of these samples, suggesting that chain conformations are affected. For the longest graft length, particles become more disordered under magnetic fields. It is proposed that fluctuations in the bridged chains rearrange particles into less ordered packing with field application and the mechanism of packing order differs for varying graft chain lengths. Grafting anisotropy is found to determine the spatial nanoparticle organization in assembled monolayers.

Liu, Siqi↗

Parallel beamlet dose calculation via beamlet contexts in a distributed multi‐GPU framework

Purpose Dose calculation is one of the most computationally intensive, yet essential tasks in the treatment planning process. With the recent interest in automatic beam orientation and arc trajectory optimization techniques, there is a great need for more efficient model‐based dose calculation algorithms that can accommodate hundreds to thousands of beam candidates at once. Foundational work has shown the translation of dose calculation algorithms to graphical processing units ( GPU s), lending to remarkable gains in processing efficiency. But these methods provide parallelization of dose for only a single beamlet, serializing the calculation of multiple beamlets and under‐utilizing the potential of modern GPU s. In this paper, the authors propose a framework enabling parallel computation of many beamlet doses using a novel beamlet context transformation and further embed this approach in a scalable network of multi‐ GPU computational nodes. Methods The proposed context‐based transformation separates beamlet‐local density and TERMA into distinct beamlet contexts that independently provide sufficient data for beamlet dose calculation. Beamlet contexts are arranged in a composite context array with dosimetric isolation, and the context array is subjected to a GPU collapsed‐cone convolution superposition procedure, producing the set of beamlet‐specific dose distributions in a single pass. Dose from each context is converted to a sparse representation for efficient storage and retrieval during treatment plan optimization. The context radius is a new parameter permitting flexibility between the speed and fidelity of the dose calculation process. A distributed manager‐worker architecture is constructed around the context‐based GPU dose calculation approach supporting an arbitrary number of worker nodes and resident GPU s. Phantom experiments were executed to verify the accuracy of the context‐based approach compared to Monte Carlo and a reference CPU ‐ CCCS implementation for single beamlets and broad beams composed by addition of beamlets. Dose for representative 4 π beam sets was calculated in lung and prostate cases to compare its efficiency with that of an existing beamlet‐sequential GPU ‐ CCCS implementation. Code profiling was also performed to evaluate the scalability of the framework across many networked GPU s. Results The dosimetric accuracy of the context‐based method displays <1.35% and 2.35% average error from the existing serialized CPU ‐ CCCS algorithm and Monte Carlo simulation for beamlet‐specific PDD s in water and slab phantoms, respectively. The context‐based method demonstrates substantial speedup of up to two orders of magnitude over the beamlet‐sequential GPU ‐ CCCS method in the tested configurations. The context‐based framework demonstrates near linear scaling in the number of distributed compute nodes and GPU s employed, indicating that it is flexible enough to meet the performance requirements of most users by simply increasing the hardware utilization. Conclusions The context‐based approach demonstrates a new expectation of performance for beamlet‐based dose calculation methods. This approach has been successful in accelerating the dose calculation process for very large‐scale treatment planning problems ‐ such as automatic 4 π IMRT beam orientation and VMAT arc trajectory selection, with hundreds of thousands of beamlets ‐ in clinically feasible timeframes. The flexibility of this framework makes it as a strong candidate for use in a variety of other very large‐scale treatment planning tasks and clinical workflows.

Neph, Ryan↗

Accuracy and convergence properties of the fixed-stress iterative solution of two-way coupled poromechanics

Here, the paper deals with the numerical solution of Biot's equations of coupled consolidation obtained by a mixed formulation combining continuous Galerkin finite–element and multipoint flux approximation finite–volume methods. The solution algorithm relies on the recently developed fixed–stress solution scheme, in which first the flow problem and then the mechanical one are addressed iteratively. We show that the algorithm can be interpreted as a particular block triangular preconditioning strategy applied within a Richardson iteration. The key component to the success of the preconditioner is the sparse approximation to the Schur complement based on a pressure space mass matrix scaled by a weighting factor that depends element–wise on the inverse of a suitable bulk modulus. The accuracy of the method is assessed, making use of well–known analytical solutions from the literature. Numerical results demonstrate robustness and low computational cost of the fixed–stress scheme in accurately capturing the two–way coupling between deformation and pressure.

58 GEOSCIENCES↗

Enhanced detection of paramagnetic fluorine-19 magnetic resonance imaging agents using zero echo time sequence and compressed sensing

Fluorine-19 ( 19 F) magnetic resonance imaging (MRI) is an emerging technique offering specific detection of labeled cells in vivo. Lengthy acquisition times and modest signal-to-noise ratio (SNR) makes three-dimensional spin-density–weighted 19 F imaging challenging. Recent advances in tracer paramagnetic metallo-perfluorocarbon (MPFC) nanoemulsion probes have shown multifold SNR improvements due to an accelerated 19 F T 1 relaxation rate and a commensurate gain in imaging speed and averages. However, 19 F T 2 -reduction and increased linewidth limit the amount of metal additive in MPFC probes, thus constraining the ultimate SNR. To overcome these barriers, we describe a compressed sampling (CS) scheme, implemented using a “zero” echo time (ZTE) sequence, with data reconstructed via a sparsity-promoting algorithm. Our CS-ZTE scheme acquires k-space data using an undersampled spherical radial pattern and signal averaging. Image reconstruction employs off-the-shelf sparse solvers to solve a joint total variation and -norm regularized least square problem. To evaluate CS-ZTE, we performed simulations and acquired 19 F MRI data at 11.7 T in phantoms and mice receiving MPFC-labeled dendritic cells. For MPFC-labeled cells in vivo, we show SNR gains of ~6.3 × with 8-fold undersampling. We show that this enhancement is due to three mechanisms including undersampling and commensurate increase in signal averaging in a fixed scan time, denoising attributes from the CS algorithm, and paramagnetic reduction of T 1 . Importantly, 19 F image intensity analyses yield accurate estimates of absolute quantification of 19 F spins. Overall, the CS-ZTE method using MPFC probes achieves ultrafast imaging, a substantial boost in detection sensitivity, accurate 19 F spin quantification, and minimal image artifacts.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Extending the eigCG algorithm to nonsymmetric Lanczos for linear systems with multiple right-hand sides

The technique that was used to build the EigCG algorithm for sparse symmetric linear systems is extended to the nonsymmetric case using the BiCG algorithm. We show that, similarly to the symmetric case, we can build an algorithm that is capable of computing a few smallest magnitude eigenvalues and their corresponding left and right eigenvectors of a nonsymmetric matrix using only a small window of the BiCG residuals while simultaneously solving a linear system with that matrix. For a system with multiple right-hand sides, we give an algorithm that computes incrementally more eigenvalues while solving the first few systems and then uses the computed eigenvectors to deflate BiCGStab for the remaining systems. Our experiments on various test problems, including Lattice QCD, show the remarkable ability of EigBiCG to compute spectral approximations with accuracy comparable to that of the unrestarted, nonsymmetric Lanczos. Furthermore, our incremental EigBiCG followed by appropriately restarted and deflated BiCGStab provides a competitive method for systems with multiple right-hand sides.

Abdel-Rehim, A M↗

Domain decomposition approaches for accelerating contour integration eigenvalue solvers for symmetric eigenvalue problems

This work discusses techniques for computing a few selected eigenvalue–eigenvector pairs of large and sparse symmetric matrices. A recently developed class of techniques to solve this type of problems is based on integrating the matrix resolvent operator along a complex contour that encloses the interval containing the eigenvalues of interest. This paper considers such contour integration techniques from a domain decomposition viewpoint and proposes two schemes. The first scheme can be seen as an extension of domain decomposition linear system solvers in the framework of contour integration methods for eigenvalue problems, such as FEAST. The second scheme focuses on integrating the resolvent operator primarily along the interface region defined by adjacent subdomains. A parallel implementation of the proposed schemes is described, and results on distributed computing environments are reported. These results show that domain decomposition approaches can lead to reduced run times and improved scalability.

97 MATHEMATICS AND COMPUTING↗

A comparison of preconditioned Krylov subspace methods for large‐scale nonsymmetric linear systems

Summary Preconditioned Krylov subspace (KSP) methods are widely used for solving large‐scale sparse linear systems arising from numerical solutions of partial differential equations (PDEs). These linear systems are often nonsymmetric due to the nature of the PDEs, boundary or jump conditions, or discretization methods. While implementations of preconditioned KSP methods are usually readily available, it is unclear to users which methods are the best for different classes of problems. In this work, we present a comparison of some KSP methods, including GMRES, TFQMR, BiCGSTAB, and QMRCGSTAB, coupled with three classes of preconditioners, namely, Gauss–Seidel, incomplete LU factorization (including ILUT, ILUTP, and multilevel ILU), and algebraic multigrid (including BoomerAMG and ML). Theoretically, we compare the mathematical formulations and operation counts of these methods. Empirically, we compare the convergence and serial performance for a range of benchmark problems from numerical PDEs in two and three dimensions with up to millions of unknowns and also assess the asymptotic complexity of the methods as the number of unknowns increases. Our results show that GMRES tends to deliver better performance when coupled with an effective multigrid preconditioner, but it is less competitive with an ineffective preconditioner due to restarts. BoomerAMG with a proper choice of coarsening and interpolation techniques typically converges faster than ML, but both may fail for ill‐conditioned or saddle‐point problems, whereas multilevel ILU tends to succeed. We also show that right preconditioning is more desirable. This study helps establish some practical guidelines for choosing preconditioned KSP methods and motivates the development of more effective preconditioners.

Ghai, Aditi↗

Convergence analysis of Anderson-type acceleration of Richardson's iteration

We consider here Anderson extrapolation to accelerate the (stationary) Richardson iterative method for sparse linear systems. Using an Anderson mixing at periodic intervals, we assess how this benefits convergence to a prescribed accuracy. The method, named alternating Anderson–Richardson, has appealing properties for high-performance computing, such as the potential to reduce communication and storage in comparison to more conventional linear solvers. We establish sufficient conditions for convergence, and we evaluate the performance of this technique in combination with various preconditioners through numerical examples. Furthermore, we propose an augmented version of this technique.

97 MATHEMATICS AND COMPUTING↗

Multilevel graph embedding

The goal of the present paper is the design of embeddings of a general sparse graph into a set of points in $\mathbb{R}^d$ for appropriate d ≥ 2. The embeddings that we are looking at here aim to keep vertices that are grouped in communities together and keep the rest apart. To achieve this property, we utilize coarsening that respects possible community structures of the given graph. We employ a hierarchical multilevel coarsening approach that identifies communities (strongly connected groups of vertices) at every level. The multilevel strategy allows any given (presumably expensive) graph embedding algorithm to be made into a more scalable (and faster) algorithm. We demonstrate the presented approach on a number of given embedding algorithms and large-scale graphs and achieve speed-up over the methods in a recent paper.

97 MATHEMATICS AND COMPUTING↗