Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sparse selection”

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 73 records · Page 4

A new μ -high energy resolution fluorescence detection microprobe imaging spectrometer at the Stanford Synchrotron Radiation Lightsource beamline 6-2

In this report we describe a new synchrotron X-ray Fluorescence (XRF) imaging instrument with an integrated High Energy Fluorescence Detection X-ray Absorption Spectroscopy (HERFD-XAS) spectrometer at the Stanford Synchrotron Radiation Lightsource at beamline 6-2. The X-ray beam size on the sample can be defined via a range of pinhole apertures or focusing optics. XRF imaging is performed using a continuous rapid scan system with sample stages covering a travel range of 250 × 200 mm 2 , allowing for multiple samples and/or large samples to be mounted. The HERFD spectrometer is a Johann-type with seven spherically bent 100 mm diameter crystals arranged on intersecting Rowland circles of 1 m diameter with a total solid angle of about 0.44% of 4π sr. A wide range of emission lines can be studied with the available Bragg angle range of ~64.5°–82.6°. With this instrument, elements in a sample can be rapidly mapped via XRF and then selected features targeted for HERFD-XAS analysis. Furthermore, utilizing the higher spectral resolution of HERFD for XRF imaging provides better separation of interfering emission lines, and it can be used to select a much narrower emission bandwidth, resulting in increased image contrast for imaging specific element species, i.e., sparse excitation energy XAS imaging. This combination of features and characteristics provides a highly adaptable and valuable tool in the study of a wide range of materials.

47 OTHER INSTRUMENTATION↗

A Shifted Block Lanczos Algorithm 1: The Block Recurrence

In this paper we describe a block Lanczos algorithm that is used as the key building block of a software package for the extraction of eigenvalues and eigenvectors of large sparse symmetric generalized eigenproblems. The software package comprises: a version of the block Lanczos algorithm specialized for spectrally transformed eigenproblems; an adaptive strategy for choosing shifts, and efficient codes for factoring large sparse symmetric indefinite matrices. This paper describes the algorithmic details of our block Lanczos recurrence. This uses a novel combination of block generalizations of several features that have only been investigated independently in the past. In particular new forms of partial reorthogonalization, selective reorthogonalization and local reorthogonalization are used, as is a new algorithm for obtaining the M-orthogonal factorization of a matrix. The heuristic shifting strategy, the integration with sparse linear equation solvers and numerical experience with the code are described in a companion paper.

Grimes, Roger G.↗

An efficient sparse matrix multiplication scheme for the CYBER 205 computer

This paper describes the development of an efficient algorithm for computing the product of a matrix and vector on a CYBER 205 vector computer. The desire to provide software which allows the user to choose between the often conflicting goals of minimizing central processing unit (CPU) time or storage requirements has led to a diagonal-based algorithm in which one of four types of storage is selected for each diagonal. The candidate storage types employed were chosen to be efficient on the CYBER 205 for diagonals which have nonzero structure which is dense, moderately sparse, very sparse and short, or very sparse and long; however, for many densities, no diagonal type is most efficient with respect to both resource requirements, and a trade-off must be made. For each diagonal, an initialization subroutine estimates the CPU time and storage required for each storage type based on results from previously performed numerical experimentation. These requirements are adjusted by weights provided by the user which reflect the relative importance the user places on the two resources. The adjusted resource requirements are then compared to select the most efficient storage and computational scheme.

Lambiotte, Jules J., Jr.↗

A Variational Inference Approach to Inverse Problems with Gamma Hyperpriors

Hierarchical models with gamma hyperpriors provide a flexible, sparse-promoting framework to bridge L 1 and L 2 regularizations in Bayesian formulations to inverse problems. Despite the Bayesian motivation for these models, existing methodologies are limited to maximum a posteriori estimation. The potential to perform uncertainty quantification has not yet been realized. This paper introduces a variational iterative alternating scheme for hierarchical inverse problems with gamma hyperpriors. The proposed variational inference approach yields accurate reconstruction, provides meaningful uncertainty quantification, and is easy to implement. In addition, it lends itself naturally to conduct model selection for the choice of hyperparameters. Here, we illustrate the performance of our methodology in several computed examples, including a deconvolution problem and sparse identification of dynamical systems from time series data.

Bayesian shrinkage↗

A class of designs for a sparse distributed memory

A general class of designs for a space distributed memory (SDM) is described. The author shows that Kanerva's original design and the selected-coordinate design are related, and that there is a series of possible intermediate designs between those two designs. In each such design, the set of addresses that activate a memory location is a sphere in the address space. We can also have hybrid designs, in which the memory locations may be a mixture of those found in the other designs. In some applications, the bits of the read and write addresses that will actually be used might be mostly zeros; that is, the addresses might lie on or near z hyperplane in the address space. The author describes a hyperplane design which is adapted to this situation and compares it to an adaptation of Kanerva's design. To study the performance of these designs, he computes the expected number of memory locations activated by both of two addresses.

Jaeckel, Louis A.↗

Newly Released Capabilities in the Distributed-Memory SuperLU Sparse Direct Solver

We present the new features available in the recent release of SuperLU_DIST, Version 8.1.1. SuperLU_DIST is a distributed-memory parallel sparse direct solver. The new features include (1) a 3D communication-avoiding algorithm framework that trades off inter-process communication for selective memory duplication, (2) multi-GPU support for both NVIDIA GPUs and AMD GPUs, and (3) mixed-precision routines that perform single-precision LU factorization and double-precision iterative refinement. Apart from the algorithm improvements, we also modernized the software build system to use CMake and Spack package installation tools to simplify the installation procedure. Throughout the article, we describe in detail the pertinent performance-sensitive parameters associated with each new algorithmic feature, show how they are exposed to the users, and give general guidance of how to set these parameters. We illustrate that the solver’s performance both in time and memory can be greatly improved after systematic tuning of the parameters, depending on the input sparse matrix and underlying hardware.

97 MATHEMATICS AND COMPUTING↗

RE-INTEGRATE EMT Simulation Software: Graph Convolutional Network for Sparse Matrix Pattern Detection

The increasing complexity of power networks, driven by proliferation of inverters, presents analytical challenges that simplified models often fail to capture, necessitating Electromagnetic Transient (EMT) simulations. EMT models are represented as discretized differential-algebraic equations (DAEs), forming a linear system Ax = b that is computationally intensive to solve. Due to inherent sparsity of adjacency matrix A, distinct patterns emerge that, when accurately identified, enable efficient solver selection to minimize computation time. However, identifying ideal pattern is complicated by numerous reordering algorithms and limited structural insights. To address this, we introduce a Graph Convolutional Network (GCN) model for classifying sparse matrix patterns common in power system analysis. The model, achieving 96% test accuracy, is validated using PV plant models of 125 MW capacities connected to New England 39-bus transmission system (TS), and further scaled to a 4,992-bus network with 384 PV plants, yielding 191, 616 × 191, 616 sized A matrix. For all cases, the GCN model accurately identifies the matrix’s intrinsic sparse pattern, demonstrating its potential to enhance solver performance in EMT analysis.

Hossain, Md Rifat [Florida International Universit↗

Computer simulation of a wind tunnel test section with discrete finite-length wall slots

A computer simulation of a slotted wind tunnel test section which includes a discrete, finite-length wall slot representation with plenum chamber constraints and accounts for the nonlinear effects of the dynamic pressure of the slot outflow jet and of the low energy of slot inflow air was developed. The simulation features were selected to be those appropriate for the intended subsequent use of the simulation in a wall interference assessment procedure using sparsely located wall pressure measurements. It is demonstrated that accounting for slot discreteness is important in interpreting wall pressure measured between slots, and that accounting for nonlinear slot flow effects produces significant changes in tunnel-induced velocity distributions and, in particular, produces a longitudinal component of tunnel-induced velocity due to model lift. A characteristic mode of tunnel flow interaction with constraints imposed by the plenum chamber and diffuser entrance is apparent in simulation results and is derived analytically through a simplified analysis.

Kemp, W. B., Jr.↗

Drill-Site Selection for Cosmogenic-Nuclide Exposure Dating of the Bed of the Greenland Ice Sheet

Direct observations of the size of the Greenland Ice Sheet during Quaternary interglaciations are sparse yet valuable for testing numerical models of ice-sheet history and sea level contribution. Recent measurements of cosmogenic nuclides in bedrock from beneath the Greenland Ice Sheet collected during past deep-drilling campaigns reveal that the ice sheet was significantly smaller, and perhaps largely absent, sometime during the past 1.1 million years. These discoveries from decades-old basal samples motivate new, targeted sampling for cosmogenic-nuclide analysis beneath the ice sheet. Current drills available for retrieving bed material from the US Ice Drilling Program require < 700 m ice thickness and a frozen bed, while quartz-bearing bedrock lithologies are required for measuring a large suite of cosmogenic nuclides. We find that these and other requirements yield only ∼ 3.4 % of the Greenland Ice Sheet bed as a suitable drilling target using presently available technology. Additional factors related to scientific questions of interest are the following: which areas of the present ice sheet are the most sensitive to warming, where would a retreating ice sheet expose bare ground rather than leave a remnant ice cap, and which areas are most likely to remain frozen bedded throughout glacial cycles and thus best preserve cosmogenic nuclides? Here we identify locations beneath the Greenland Ice Sheet that are best suited for potential future drilling and analysis. These include sites bordering Inglefield Land in northwestern Greenland, near Victoria Fjord and Mylius-Erichsen Land in northern Greenland, and inland from the alpine topography along the ice margin in eastern and northeastern Greenland. Results from cosmogenic-nuclide analysis in new sub-ice bedrock cores from these areas would help to constrain dimensions of the Greenland Ice Sheet in the past.

Greenland↗

Interpolation as a means of shift selection for multilevel Monte Carlo with lattice displacements

The calculation of disconnected diagram contributions to physical signals is a computationally expensive task in Lattice QCD. To extract the physical signal, the trace of the inverse Lattice Dirac operator, a large sparse matrix, must be stochastically estimated. Because the variance of the stochastic estimator is typically large, variance reduction techniques must be employed. Multilevel Monte Carlo (MLMC) methods reduce the variance of the trace estimator by utilizing a telescoping sequence of estimators. Frequency Splitting is one such method that uses a sequence of inverses of shifted operators to estimate the trace of the inverse of the lattice Dirac operator, however there is no a priori way to select the shifts that minimize the cost of the multilevel trace estimation. We present a sampling and interpolation scheme that is able to predict the variances associated with Frequency Splitting under displacements of the underlying space time lattice. The interpolation scheme is able to predict the variances to high accuracy and therefore choose shifts that correspond to an approximate minimum of the cost for the trace estimation. We show that Frequency Splitting with the chosen shifts displays significant speedups over multigrid deflation

Whyte, Travis↗

Distributed out-of-memory NMF on CPU/GPU architectures

We propose an efficient distributed out-of-memory implementation of the non-negative matrix factorization (NMF) algorithm for heterogeneous high-performance-computing systems. The proposed implementation is based on prior work on NMFk, which can perform automatic model selection and extract latent variables and patterns from data. In this work, we extend NMFk by adding support for dense and sparse matrix operation on multi-node, multi-GPU systems. The resulting algorithm is optimized for out-of-memory problems where the memory required to factorize a given matrix is greater than the available GPU memory. Memory complexity is reduced by batching/tiling strategies, and sparse and dense matrix operations are significantly accelerated with GPU cores (or tensor cores when available). Input/output latency associated with batch copies between host and device is hidden using CUDA streams to overlap data transfers and compute asynchronously, and latency associated with collective communications (both intra-node and inter-node) is reduced using optimized NVIDIA Collective Communication Library (NCCL) based communicators. Benchmark results show significant improvement, from 32X to 76x speedup, with the new implementation using GPUs over the CPU-based NMFk. Good weak scaling was demonstrated on up to 4096 multi-GPU cluster nodes with approximately 25,000 GPUs when decomposing a dense 340 Terabyte-size matrix and an 11 Exabyte-size sparse matrix of density 10 -6 .

97 MATHEMATICS AND COMPUTING↗

Optimizing shift selection in multilevel Monte Carlo for disconnected diagrams in lattice QCD

The calculation of disconnected diagram contributions to physical signals is a computationally expensive task in Lattice QCD. To extract the physical signal, the trace of the inverse Lattice Dirac operator, a large sparse matrix, must be stochastically estimated. Because the variance of the stochastic estimator is typically large, variance reduction techniques must be employed. Multilevel Monte Carlo (MLMC) methods reduce the variance of the trace estimator by utilizing a telescoping sequence of estimators. Frequency Splitting is one such method that uses a sequence of inverses of shifted operators to estimate the trace of the inverse lattice Dirac operator, however there is no a priori way to select the shifts that minimize the cost of the multilevel trace estimation. Here we present a sampling and interpolation scheme that is able to predict the variances associated with Frequency Splitting under displacements of the underlying space time lattice. The interpolation scheme is able to predict the variances to high accuracy and therefore chooses shifts that correspond to an approximate minimum of the cost for the trace estimation. We show that Frequency Splitting with the chosen shifts displays significant speedups over multigrid deflation, and that these shifts can be used for multiple configurations within the same ensemble with no penalty to performance.

97 MATHEMATICS AND COMPUTING↗

Reproduction drives changes in space use and habitat selection in a highly adaptable invasive mammal

Abstract For ungulates, it is not well understood how the interaction between habitat and reproduction affects movement behavior, space use, and habitat selection. We used known parturition (farrowing) data to validate First Passage Time (FPT) movement analysis to identify wild pig (Sus scrofa) parturition events from data collected with GPS collars. We examined home range and habitat selection during three physiologically distinct time periods in the reproductive cycle: late-gestation; farrowing; and neonate-care period. Sows exhibited a behavioral change 1-2 days prior to farrowing, suggesting FPT analysis can reliably identify parturition events for wide-ranging species that have a focused birthing area. Home range was smallest during the farrowing period, likely reflective of nest building, parturition, and protection of neonates. Home range size during the neonate-care period was intermediate between the late-gestation and farrowing periods, indicative of offspring care that may restrict maternal movement. Across all periods, sows avoided developed areas that have sparse canopy and ground cover and are associated with human activities. During late-gestation, sows avoided pine forests that have an open understory and less vegetative cover. During late-gestation and neonate-care, sows selected bottomland hardwood forests, habitat associated with ample food, cover, and water. During farrowing and neonate-care periods, sows selected upland hardwood forests, habitat with high quality food and cover for neonates. The physiological requirements of reproduction drive female habitat selection and spatial scale of movement patterns associated with parturition. Our study contributes to delineation of the appropriate scale at which to analyze movement data to provide insight about where individuals chose to place their home range, how much space to use, and how they use resources on the landscape to maximize reproductive success and fitness.

Zoology↗

Investigation of the application of HCMM thermal data to snow hydrology

The author has identified the following significant results. Comparison of the thermal IR band temperatures over the rapidly melting snowcover in a number of locations in the Salt-Verde Arizona watershed by the U-2 high altitude multispectral scanner, with temperatures for these same locations measured by the corresponding HCMM pass, indicate that the U-2 temperatures are typically 5 C higher than the values analyzed from the HCMM infrared digital printout. Results tend to substantiate findings of other investigators that with the offset that has been applied to all HCMM data, the HCMM temperature values may, in fact, actually be 5 C too low. Analysis of differences between the HCMM day and night temperatures for selected snowcovered areas in the Sierra Nevada Mountains, derived from the daytime and nighttime printouts, show greater delta tau values for the sparsely vegetated higher elevations than for the lower elevation, more densely forested terrain. The differences for the 12 hour sequence are also greater in most instances than the 36 hour difference.

Barnes, J. C.↗

The CSM testbed matrix processors internal logic and dataflow descriptions

This report constitutes the final report for subtask 1 of Task 5 of NASA Contract NAS1-18444, Computational Structural Mechanics (CSM) Research. This report contains a detailed description of the coded workings of selected CSM Testbed matrix processors (i.e., TOPO, K, INV, SSOL) and of the arithmetic utility processor AUS. These processors and the current sparse matrix data structures are studied and documented. Items examined include: details of the data structures, interdependence of data structures, data-blocking logic in the data structures, processor data flow and architecture, and processor algorithmic logic flow.

Regelbrugge, Marc E.↗

The Use of Additional GPS Frequencies to Independently Determine Tropospheric Water Vapor Profiles

It is well known that the currently employed L1 and L2 GPS/MET frequencies (1.2 - 1.6) Ghz) do not allow for the separation of water vapor and density (or temperature) from active microwave occultation measurements in regions of the troposphere warmer than 240 K Therefore, additional information must be used, from other types of measurements and weather analyses, to recover water vapor (and temperature) profiles. Thus in data sparse regions, these inferred profiles can be subject to larger errors than would result in data rich regions. The use of properly selected additional GPS frequencies enables a direct, independent measurement of the absorption associated with the water vapor profile, which may then be used in the standard GPS/MET retrievals to obtain a more accurate determination of atmospheric temperature throughout the water vapor layer. This study looks at the use of microwave crosslinks in the region of the 22 Ghz water vapor absorption line for this purpose. An added advantage of using 22 Ghz frequencies is that they are only negligibly affected by the ionosphere in contrast to the large effect at the GPS frequencies. The retrieval algorithm uses both amplitude and phase measurements to obtain profiles of atmospheric pressure, temperature and water water vapor pressure with a vertical resolution of 1 km or better. This technique also provides the cloud liquid water content along the ray path, which is in itself an important element in climate monitoring. Advantages of this method include the ability to make measurements in the presence of clouds and the use of techniques and technology proven through the GPS/MET experiment and several of NASA's planetary exploration missions. Simulations demonstrating this method will be presented for both clear and cloudy sky conditions.

Herman, B.M.↗

Vadose Zone Flow and Transport Parameters Data Package for the Hanford Site Composite Analysis and Cumulative Impact Evaluation

This report provides a description of the basis for the development and implementation of a conceptual model for vadose zone flow and transport for the composite analysis (CA) groundwater pathway analysis and the cumulative impact evaluation (CIE). The parameterization for a numerical model is intimately linked to the conceptual model framework. The report describes the basis for the selection of hydraulic and transport parameters for the hydrostratigraphic units (HSUs) identified in the 200 East and 200 West Areas. Whenever data are sparse or unavailable, surrogate hydraulic properties are chosen based on samples collected within the 200 Areas and nearby locations that are representative of sediments characteristic of the HSUs identified elsewhere.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗