Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “sparse data”

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 829 records · Page 46
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Effect of Biomass Water Dynamics in Cosmic-Ray Neutron Sensor Observations: A Long-Term Analysis of Maize–Soybean Rotation in Nebraska

Precise soil water content (SWC) measurement is crucial for effective water resource management. This study utilizes the Cosmic-Ray Neutron Sensor (CRNS) for area-averaged SWC measurements, emphasizing the need to consider all hydrogen sources, including time-variable plant biomass and water content. Near Mead, Nebraska, three field sites (CSP1, CSP2, and CSP3) growing a maize–soybean rotation were monitored for 5 (CSP1 and CSP2) and 13 (CSP3) years. Data collection included destructive biomass water equivalent (BWE) biweekly sampling, epithermal neutron counts, atmospheric meteorological variables, and point-scale SWC from a sparse time domain reflectometry (TDR) network (four locations and five depths). In 2023, dense gravimetric SWC surveys were collected eight (CSP1 and CSP2) and nine (CSP3) times over the growing season (April to October). The N0 parameter exhibited a linear relationship with BWE, suggesting that a straightforward vegetation correction factor may be suitable (fb). Results from the 2023 gravimetric surveys and long-term TDR data indicated a neutron count rate reduction of about 1% for every 1 kg m−2 (or mm of water) increase in BWE. This reduction factor aligns with existing shorter-term row crop studies but nearly doubles the value previously reported for forests. This long-term study contributes insights into the vegetation correction factor for CRNS, helping resolve a long-standing issue within the CRNS community.

Chemistry↗
DOE OSTI2020

Target Detection via Cognitive Radars Using Change-Point Detection, Learning, and Adaptation

Many radar detection algorithms that assume a stationary environment (clutter) have been proposed and analyzed over the years. However, in practice, changes in the nonstationary environment can perturb the parameters of the clutter distribution, or even alter the clutter distribution family, which can greatly deteriorate the target detection capability. To avoid such potential performance degradation, cognitive radar systems are envisioned which are required to rapidly realize the nonstationarity, accurately learn the new characteristics of the environments, and adaptively update the detector. In this paper, aiming to develop a fully cognitive radar for target detection in nonstationary environments, we propose a unifying framework that integrates (i) change-point detection of clutter distributions by using a data-driven cumulative sum (CUSUM) algorithm and its extended version, (ii) learning/identification of clutter distribution by applying sparse theory and kernel density estimation methods, and (iii) adaptive target detection by automatically modifying the likelihood-ratio test and corresponding detection threshold. Further, with extensive numerical examples, we demonstrate the achieved improvements in detection performance due to the proposed framework in comparison to a nonadaptive case, an adaptive matched filter (AMF) method, and the clairvoyant case. Herein, we also use Wilcoxon rank-sum tests to evaluate the statistical significance of the performance improvements

42 ENGINEERING↗
DOE OSTI2022

Quantifying Dynamic Signal Spread in Real-Time High-Energy X-ray Diffraction

Abstract Measured intensity in high-energy monochromatic X-ray diffraction (HEXD) experiments provides information regarding the microstructure of the crystalline material under study. The location of intensity on an areal detector is determined by the lattice spacing and orientation of crystals so that changes in the heterogeneity of these quantities are reflected in the spreading of diffraction peaks over time. High temporal resolution of such dynamics can now be experimentally observed using technologies such as the mixed-mode pixel array detector (MM-PAD) which facilitates in situ dynamic HEXD experiments to study plasticity and its underlying mechanisms. In this paper, we define and demonstrate a feature computed directly from such diffraction time series data quantifying signal spread in a manner that is correlated with plastic deformation of the sample. A distinguishing characteristic of the analysis is the capability to describe the evolution from the distinct diffraction peaks of an undeformed alloy sample through to the non-uniform Debye–Scherrer rings developed upon significant plastic deformation. We build on our previous work modeling data using an overcomplete dictionary by treating temporal measurements jointly to improve signal spread recovery. We demonstrate our approach in simulations and on experimental HEXD measurements captured using the MM-PAD. Our method for characterizing the temporal evolution of signal spread is shown to provide an informative means of data analysis that adds to the capabilities of existing methods. Our work draws on ideas from convolutional sparse coding and requires solving a coupled convex optimization problem based on the alternating direction method of multipliers.

Engineering↗
DOE OSTI2017

Scaling Up Data-Parallel Analytics Platforms: Linear Algebraic Operation Cases

Linear algebraic operations such as matrix manipulations form the kernel of many machine learning and other crucial algorithms. Scaling up as well as scaling out such algorithms are key to supporting large scale data analysis that require efficient processing over millions of data samples. To this end, we present, ARION, a hardware acceleration based approach for scaling-up individual tasks of Spark, a popular data-parallel analytics platform. We support both linear algebraic operations of between two dense matrices, and between sparse and dense matrices in distributed environments. ARION provides a flexible control of acceleration according to matrix density, along with efficient scheduling based on runtime resource utilization. We demonstrate the benefit of our approach for general matrix multiplication operations over large matrices with up to four billion elements by using Gramian matrix computation that is commonly used in machine learning. Experiments show that our approach achieves more than 2× and 1.5× end-to-end performance speedups for dense and sparse matrices, respectively, and up to 57.04× faster computation compared to MLlib, a state of the art Spark-based implementation. This work is sponsored in part by the NSF under the grants: CNS-1565314, CNS-1405697, and CNS-1615411. The manuscript has been authored by UT-Battelle, LLC under Contract No. DE-AC05-00OR22725 with the U.S. Department of Energy. The United States Government retains and the publisher, by accepting the article for publication, acknowledges that the United States Government retains a non-exclusive, paid-up, irrevocable, world-wide license to publish or reproduce the published form of this manuscript, or allow others to do so, for United States Government purposes. The Department of Energy will provide public access to these results of federally sponsored research in accordance with the DOE Public Access Plan (http://energy.gov/downloads/doe-public-access-plan). This research used resources of the Oak Ridge Leadership Computing Facility at the Oak Ridge National Laboratory, which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC05-00OR22725.

Xu, Luna↗
DOE OSTI2019

Efficient Projection onto the $\ell_{\infty,1}$ Mixed-Norm Ball Using a Newton Root Search Method

Mixed norms that promote structured sparsity have numerous applications in signal processing and machine learning problems. Here, we present a new algorithm, based on a Newton root search technique, for computing the projection onto the $\ell_{\infty,1}$ ball, which has found application in cognitive neuroscience and classification tasks. Numerical simulations show that our proposed method is between 8 and 10 times faster on average, and up to 20 times faster for very sparse solutions, than the previous state of the art. Lastly, tests on real functional magnetic resonance image data show that, for some data distributions, our algorithm can obtain speed improvements by a factor of between 10 and 100, depending on the implementation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Error Characteristics and Scale Dependence of Current Satellite Precipitation Estimates Products in Hydrological Modeling

Satellite precipitation estimates (SPEs) are promising alternatives to gauge observations for hydrological applications (e.g., streamflow simulation), especially in remote areas with sparse observation networks. However, the existing SPEs products are still biased due to imperfections in retrieval algorithms, data sources and post-processing, which makes the effective use of SPEs a challenge, especially at different spatial and temporal scales. In this study, we used a distributed hydrological model to evaluate the simulated discharge from eight quasi-global SPEs at different spatial scales and explored their potential scale effects of SPEs on a cascade of basins ranging from approximately 100 to 130,000 km 2 . The results indicate that, regardless of the difference in the accuracy of various SPEs, there is indeed a scale effect in their application in discharge simulation. Specifically, when the catchment area is larger than 20,000 km2, the overall performance of discharge simulation emerges an ascending trend with the increase of catchment area due to the river routing and spatial averaging. Whereas below 20,000 km 2 , the discharge simulation capability of the SPEs is more randomized and relies heavily on local precipitation accuracy. Our study also highlights the need to evaluate SPEs or other precipitation products (e.g., merge product or reanalysis data) not only at the limited station scale, but also at a finer scale depending on the practical application requirements. Here we have verified that the existing SPEs are scale-dependent in hydrological simulation, and they are not enough to be directly used in very fine scale distributed hydrological simulations (e.g., flash flood). More advanced retrieval algorithms, data sources and bias correction methods are needed to further improve the overall quality of SPEs.

DTVGM↗
DOE OSTI2022

Numerical characterization of support recovery in sparse regression with correlated design

Sparse regression is employed in diverse scientific settings as a feature selection method. A pervasive aspect of scientific data is the presence of correlations between predictive features. These correlations hamper both feature selection and estimation and jeopardize conclusions drawn from estimated models. On the other hand, theoretical results on sparsity-inducing regularized regression have largely addressed conditions for selection consistency via asymptotics, and disregard the problem of model selection, whereby regularization parameters are chosen. In this numerical study, we address these issues through exhaustive characterization of the performance of several regression estimators, coupled with a range of model selection strategies. These estimators and selection criteria were examined across correlated regression problems with varying degrees of signal to noise, distributions of non-zero model coefficients, and model sparsity. Our results reveal a fundamental tradeoff between false positive and false negative control in all regression estimators and model selection criteria examined. Additionally, we numerically explore a transition point modulated by the signal-to-noise ratio and spectral properties of the design covariance matrix at which the selection accuracy of all considered algorithms degrades. Overall, we find that SCAD coupled with BIC or empirical Bayes model selection performs the best feature selection across the regression problems considered.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Multifidelity Ensemble Kalman Filtering Using Surrogate Models Defined by Theory-Guided Autoencoders

Data assimilation is a Bayesian inference process that obtains an enhanced understanding of a physical system of interest by fusing information from an inexact physics-based model, and from noisy sparse observations of reality. The multifidelity ensemble Kalman filter (MFEnKF) recently developed by the authors combines a full-order physical model and a hierarchy of reduced order surrogate models in order to increase the computational efficiency of data assimilation. The standard MFEnKF uses linear couplings between models, and is statistically optimal in case of Gaussian probability densities. This work extends the MFEnKF into to make use of a broader class of surrogate model such as those based on machine learning methods such as autoencoders non-linear couplings in between the model hierarchies. We identify the right-invertibility property for autoencoders as being a key predictor of success in the forecasting power of autoencoder-based reduced order models. We propose a methodology that allows us to construct reduced order surrogate models that are more accurate than the ones obtained via conventional linear methods. Numerical experiments with the canonical Lorenz'96 model illustrate that nonlinear surrogates perform better than linear projection-based ones in the context of multifidelity ensemble Kalman filtering. We additionality show a large-scale proof-of-concept result with the quasi-geostrophic equations, showing the competitiveness of the method with a traditional reduced order model-based MFEnKF.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Hydrologic applicability of satellite-based precipitation estimates for irrigation water management in the data-scarce region

Reliable precipitation estimates are crucial for planning and managing water resources, monitoring hydrologic extremes, and fulfilling irrigation water requirements. Accurate precipitation estimates are particularly challenging in complex mountain terrains, where monitoring gauges are often sparsely distributed due to their remote locations, and high installation and long-term operation costs. Recent advances in satellite-based precipitation estimates offer promising opportunities to improve our understanding of hydrologic processes and their applications for irrigation water management. Several datasets are available varying considerably in terms of their data sources, quality control methods, estimation procedure, and spatiotemporal resolutions. Choosing the most suitable dataset for a particular application is a complex task. In this study, we (1) evaluate the performance of six satellite-based precipitation estimates (SPEs): i) CHIRPS v2.0, ii) CMORPH v1.0, iii) ERA5, iv) IMERG v6, v) MSWEP v2.8, and vi) PERSIANN-CDR against the gauge precipitation using continuous statistical and categorical indices, (2) integrate SPEs with a calibrated semi-distributed hydrologic model to predict streamflow, and (3) demonstrate practical implications of improved streamflow prediction for irrigation water management in the central Himalayan region, Nepal. Our results illustrate that satellite-based precipitation estimates have competitive performance in capturing a wide range of rainfall characteristics, with demonstrated variability across river basins and time scales. Further, there are no significant discrepancies observed in satellite-based precipitation estimates for estimating irrigation water requirements for the three major crops (maize, wheat, and paddy) during the cropping period across the selected river basins, showing a greater promise for irrigation water management planning and decision making.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2025

Particle hit clustering and identification using point set transformers in liquid argon time projection chambers

Liquid argon time projection chambers are often used in neutrino physics and dark-matter searches because of their high spatial resolution. The images generated by these detectors are extremely sparse, as the energy values detected by most of the detector are equal to 0, meaning that despite their high resolution, most of the detector is unused in a particular interaction. Instead of representing all of the empty detections, the interaction is usually stored as a sparse matrix, a list of detection locations paired with their energy values. Traditional machine learning methods that have been applied to particle reconstruction such as convolutional neural networks (CNNs), however, cannot operate over data stored in this way and therefore must have the matrix fully instantiated as a dense matrix. Operating on dense matrices requires a lot of memory and computation time, in contrast to directly operating on the sparse matrix. We propose a machine learning model using a point set neural network that operates over a sparse matrix, greatly improving both processing speed and accuracy over methods that instantiate the dense matrix, as well as over other methods that operate over sparse matrices. Compared to competing state-of-the-art methods, our method improves classification performance by 14%, segmentation performance by more than 22%, while taking 80% less time and using 66% less memory. Compared to state-of-the-art CNN methods, our method improves classification performance by more than 86%, segmentation performance by more than 71%, while reducing runtime by 91% and reducing memory usage by 61%.

calibration and fitting methods↗
DOE OSTI2016

Universal Collaboration Strategies for Signal Detection: A Sparse Learning Approach

Here, this paper considers the problem of high-dimensional signal detection in a large distributed network whose nodes can collaborate with their one-hop neighboring nodes (spatial collaboration). We assume that only a small subset of nodes communicate with the fusion center (FC). We design optimal collaboration strategies which are universal for a class of deterministic signals. By establishing the equivalence between the collaboration strategy design problem and sparse principal component analysis (PCA), we solve the problem efficiently and evaluate the impact of collaboration on detection performance.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

A Sparse Grid Method for Bayesian Uncertainty Quantification with Application to Large Eddy Simulation Turbulence Models

There is wide agreement that the accuracy of turbulence models suffer from their sensitivity with respect to physical input data, the uncertainties of user-elected parameters, as well as the model inadequacy. However, the application of Bayesian inference to systematically quantify the uncertainties in parameters, by means of exploring posterior probability density functions (PPDFs), has been hindered by the prohibitively daunting computational cost associated with the large number of model executions, in addition to daunting computation time per one turbulence simulation. In this effort, we perform in this paper an adaptive hierarchical sparse grid surrogate modeling approach to Bayesian inference of large eddy simulation (LES). First, an adaptive hierarchical sparse grid surrogate for the output of forward models is constructed using a relatively small number of model executions. Using such surrogate, the likelihood function can be rapidly evaluated at any point in the parameter space without simulating the computationally expensive LES model. This method is essentially similar to those developed in Zhang et al. (Water Resour Res 49:6871–6892, 2013) for geophysical and groundwater models, but is adjusted and applied here for a much more challenging problem of uncertainty quantification of turbulence models. Through a numerical demonstration of the Smagorinsky model of two-dimensional flow around a cylinder at sub-critical Reynolds number, our approach is proven to significantly reduce the number of costly LES executions without losing much accuracy in the posterior probability estimation. Here, the model parameters are calibrated against synthetic data related to the mean flow velocity and Reynolds stresses at different locations in the flow wake. The influence of the user-elected LES parameters on the quality of output data will be discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Multi-static Serial LiDAR for Surveillance and Identification of Marine Life at MHK Installations

Final Report for project DE-EE0006787: Multi-static Serial LiDAR for Surveillance and Identification of Marine Life at MHK Installations. This project developed and tested an optical monitoring system prototype that will be suitable for marine and hydrokinetic (MHK) full project lifecycle observation (baseline, commissioning, and decommissioning), with automated real-time classification of marine animals. This system can be deployed to collect pre-installation baseline species observations at a proposed deployment site with minimal post-processing overhead. To satisfy deployed MHK project species of concern (e.g. Endangered Species Act-listed) monitoring requirements, the system provides automated tracking and notification of the presence of managed animals within established perimeters of MHK equipment and provides high resolution imagery of their behavior through a wide range of conditions. During a project’s decommissioning stage, the system can remain installed to provide resource managers with post-installation data. Our technology, known as an Unobtrusive Multi-static Serial LiDAR Imager (UMSLI), is a technology transfer of underwater distributed LiDAR imaging technology that preserves the advantages of traditional optical and acoustic solutions while overcoming associated disadvantages for MHK environmental monitoring applications. This new approach is a purposefully-designed, reconfigurable adaptation of an existing technology that can be easily mounted on or around different classes of MHK equipment. The system uses low average power red (638nm) laser illumination to be invisible and eye-safe to marine animals and is compact and cost effective. The equipment is designed for long term, maintenance-free operations, to inherently generate a sparse primary dataset that only includes detected anomalies (animal presence information), and to allow robust real-time automated animal classification/identification with a low data bandwidth requirement. Advantages of the technology over others currently being used or being considered for MHK monitoring include: Unlike a conventional camera, the depth of field is near-infinite and limited by attenuation (approximately 5-8 m) rather than focal properties of a lens; Operation in an adaptive mode which can project a sparse grid of pulses with higher peak power for longer range detection (>10 meters) and track animals within a zone of interest with high resolution imagery for identification of marine life at closer range (<5m); System detection limit and Signal-to-Noise-Ratio is superior to a camera, due to rejection of both backscattering component and ambient solar background; Multiple wide-angle pulsed laser illuminators and bucket detectors can be flexibly configured to cover a 4pi steradian (i.e. omnidirectional) scene volume, while also retrieving 3D features of animal targets from timing information; Process and classification framework centered around a novel active learning and incremental classification classifier that enables accurate identification of a variety of marine animals automatically; A two-tiered monitoring architecture and invisible watermarking-based data archiving and retrieving approach ensures significant data reduction while preserving high fidelity monitoring. A methodology to train and optimize the classifier for target species of concern to optimize site monitoring effectiveness. This technological innovation addresses a high priority regulatory requirement to observe marine life interaction near MHK projects. Our solution improves resource manager confidence that any interactions between marine animals and equipment are observed in a cost-effective and automated manner. Without EERE funding, this novel application of multi-static LiDAR would not have been available to the MHK community for environmental monitoring.

16 TIDAL AND WAVE POWER↗
DOE OSTI2015

Image Reconstruction from Under sampled Fourier Data Using the Polynomial Annihilation Transform

Fourier samples are collected in a variety of applications including magnetic resonance imaging and synthetic aperture radar. The data are typically under-sampled and noisy. In recent years, l 1 regularization has received considerable attention in designing image reconstruction algorithms from under-sampled and noisy Fourier data. The underlying image is assumed to have some sparsity features, that is, some measurable features of the image have sparse representation. The reconstruction algorithm is typically designed to solve a convex optimization problem, which consists of a fidelity term penalized by one or more l 1 regularization terms. The Split Bregman Algorithm provides a fast explicit solution for the case when TV is used for the l1l1 regularization terms. Due to its numerical efficiency, it has been widely adopted for a variety of applications. A well known drawback in using TV as an l 1 regularization term is that the reconstructed image will tend to default to a piecewise constant image. This issue has been addressed in several ways. Recently, the polynomial annihilation edge detection method was used to generate a higher order sparsifying transform, and was coined the “polynomial annihilation (PA) transform.” This paper adapts the Split Bregman Algorithm for the case when the PA transform is used as the l 1 regularization term. In so doing, we achieve a more accurate image reconstruction method from under-sampled and noisy Fourier data. Our new method compares favorably to the TV Split Bregman Algorithm, as well as to the popular TGV combined with shearlet approach.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Mesh-free data transfer algorithms for partitioned multiphysics problems: Conservation, accuracy, and parallelism

In this study we analyze and extend mesh-free algorithms for three-dimensional data transfer problems in partitioned multiphysics simulations. We first provide a direct comparison between a mesh-based weighted residual method using the common-refinement scheme and two mesh-free algorithms leveraging compactly supported radial basis functions: one using a spline interpolation and one using a moving least square reconstruction. Through the comparison we assess both the conservation and accuracy of the data transfer obtained from each of the methods. We do so for a varying set of geometries with and without curvature and sharp features and for functions with and without smoothness and with varying gradients. Our results show that the mesh-based and mesh-free algorithms are complementary with cases where each was demonstrated to perform better than the other. We then focus on the mesh-free methods by developing a set of algorithms to parallelize them based on sparse linear algebra techniques. This includes a discussion of fast parallel radius searching in point clouds and restructuring the interpolation algorithms to leverage data structures and linear algebra services designed for large distributed computing environments. The scalability of our new algorithms is demonstrated on a leadership class computing facility using a set of basic scaling studies. Finally, these scaling studies show that for problems with reasonable load balance, our new algorithms for both spline interpolation and moving least square reconstruction demonstrate both strong and weak scalability using more than 100,000 MPI processes with billions of degrees of freedom in the data transfer operation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Enhancing Regional Seismic Velocity Models With Higher‐Resolution Local Results Using Sparse Dictionary Learning

Abstract We use sparse dictionary learning to develop transformations between seismic velocity models of different resolution and spatial extent. Starting with data in the common region of both models, the method can enhance a regional lower‐resolution model to match the style and resolution of local higher‐resolution results while preserving its regional coverage. The method is demonstrated by applying it to two‐dimensional V S and three‐dimensional V P and V S regional and local velocity models in southern California. The enhanced reconstructed regional results exhibit clear visual improvements, especially in the reconstructed V P / V S ratios, and better correlations with geological features. Moreover, the reconstructed regional V P , V S models outperform the original ones in comparison of simulated earthquake waveforms to observations. The improved fitting to observed waveforms extends beyond the domain of the overlapping region. The developed dictionary learning approach provides physically interpretable results and offers a powerful tool for additional applications of data enhancement in earth sciences.

Geochemistry & Geophysics↗
DOE OSTI2024

Smooth trends in fermium charge radii and the impact of shell effects

The quantum-mechanical nuclear-shell structure determines the stability and limits of the existence of the heaviest nuclides with large proton numbers Z ≳ 100. Shell effects also affect the sizes and shapes of atomic nuclei, as shown by laser spectroscopy studies in lighter nuclides. However, experimental information on the charge radii and the nuclear moments of the heavy actinide elements, which link the heaviest naturally abundant nuclides with artificially produced superheavy elements, is sparse. Here we present laser spectroscopy measurements along the fermium (Z = 100) isotopic chain and an extension of data in the nobelium isotopic chain (Z = 102) across a key region. Multiple production schemes and different advanced techniques were applied to determine the isotope shifts in atomic transitions, from which changes in the nuclear mean-square charge radii were extracted. A range of nuclear models based on energy density functionals reproduce well the observed smooth evolution of the nuclear size. Both the remarkable consistency of model prediction and the similarity of predictions for different isotopes suggest a transition to a regime in which shell effects have a diminished effect on the size compared with lighter nuclei.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2024

Experimental validation of a collision-radiation dataset for molecular hydrogen in plasmas

Quantitative spectroscopy of molecular hydrogen has generated substantial demand, leading to the accumulation of diverse elementary process data encompassing radiative transitions, electron-impact transitions, predissociations, and quenching. However, their rates currently available are still sparse, and there are inconsistencies among those proposed by different authors. In this study, we demonstrate an experimental validation of such a molecular dataset by composing a collisional-radiative model (CRM) for molecular hydrogen and comparing experimentally obtained vibronic populations across multiple levels. From the population kinetics of molecular hydrogen, the importance of each elementary process in various parameter space is studied. In low-density plasmas (electron density ne≲1017 m−3) the excitation rates from the ground states and radiative decay rates, both of which have been reported previously, determine the excited state population. The inconsistency in the excitation rates affects the population distribution the most significantly in this parameter space. However, in higher density plasmas (ne≳1018 m−3), the excitation rates from excited states become important, which have never been reported in the literature, and may need to be approximated in some way. In order to validate these molecular datasets and approximated rates, we carried out experimental observations for two different hydrogen plasmas; a low-density radio frequency heated plasma (ne≈1016 m−3) and the Large Helical Device (LHD) divertor plasma (ne≳1018 m−3). The visible emission lines from EF1Σg+, HH¯1Σg+, D1Πu±, GK1Σg+, I1Πg±, J1Δg±, h3Σg+, e3Σu+, d3Πu±,g3Σg+, i3Πg±, and j3Δg± states were observed simultaneously and their population distributions were obtained from their intensities. We compared the observed population distributions with the CRM prediction, in particular the CRM with the rates compiled by Janev et al., Miles et al., and those calculated with the molecular convergent close-coupling (MCCC) method. The MCCC prediction gives the best agreement with the experiment, particularly for the emission from the low-density plasma. However, the population distribution in the LHD divertor shows a worse agreement with the CRM than those from low-density plasma, indicating the necessity of the precise excitation rates from excited states. We also found that the rates for the electron attachment is inconsistent with experimental results. This requires further investigation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗