Search NASA⌕ Search

SEARCH · Search NASA

Results for “singular value decomposition”

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 379 records · Page 21

Estimating parameters and uncertainty for three-dimensional flow and transport in a highly heterogeneous sand box experiment.

Heterogeneity plays an important role in groundwater flow and contaminant transport in natural systems. Since it is impossible to directly measure spatial variability of hydraulic conductivity, predictions of solute transport based on mathematical models are always uncertain. While in most cases groundwater flow and tracer transport problems are investigated in two-dimensional (2D) systems, it is important to study more realistic and well-controlled 3D systems to fully evaluate inverse parameter estimation techniques and evaluate uncertainty in the resulting estimates. We used tracer concentration breakthrough curves (BTCs) obtained from a magnetic resonance imaging (MRI) technique in a small flow cell (14 x 8 x 8 cm) that was packed with a known pattern of five different sands (i.e., zones) having cm-scale variability. In contrast to typical inversion systems with head, conductivity and concentration measurements at limited points, the MRI data included BTCs measured at a voxel scale ({approx}0.2 cm in each dimension) over 13 x 8 x 8 cm with a well controlled boundary condition, but did not have direct measurements of head and conductivity. Hydraulic conductivity and porosity were conceptualized as spatial random fields and estimated using pilot points along layers of the 3D medium. The steady state water flow and solute transport were solved using MODFLOW and MODPATH. The inversion problem was solved with a nonlinear parameter estimation package - PEST. Two approaches to parameterization of the spatial fields are evaluated: (1) The detailed zone information was used as prior information to constrain the spatial impact of the pilot points and reduce the number of parameters; and (2) highly parameterized inversion at cm scale (e.g., 1664 parameters) using singular value decomposition (SVD) methodology to significantly reduce the run-time demands. Both results will be compared to measured BTCs. With MRI, it is easy to change the averaging scale of the observed concentration from point to cross-section. This comparison allows us to evaluate which method best matches experimental results at different scales. To evaluate the uncertainty in parameter estimation, the null space Monte Carlo method will be used to reduce computational burden of the development of calibration-constrained Monte Carlo based parameter fields. This study will illustrate how accurately a well-calibrated model can predict contaminant transport.

58 GEOSCIENCES↗

Near real-time response matrix calibration for 10 Hz GOFB

The 10 Hz global orbit feedback (GOFB), for damping the trajectory perturbation ({approx}10 Hz) due to the vibrations of the triplet quadrupoles, is operational. The correction algorithm uses transfer functions between the beam position monitors and correctors obtained from the online optics model and a correction algorithm based on singular value decomposition (SVD). Recently the calibration of the transfer functions was measured using beam position measurements acquired while modulating dedicated correctors. In this report, the feedback results with model matrix and measured matrix are compared.

43 PARTICLE ACCELERATORS↗

MASSIVELY PARALLEL LATENT SEMANTIC ANALYSES USING A GRAPHICS PROCESSING UNIT

Latent Semantic Analysis (LSA) aims to reduce the dimensions of large term-document datasets using Singular Value Decomposition. However, with the ever-expanding size of datasets, current implementations are not fast enough to quickly and easily compute the results on a standard PC. A graphics processing unit (GPU) can solve some highly parallel problems much faster than a traditional sequential processor or central processing unit (CPU). Thus, a deployable system using a GPU to speed up large-scale LSA processes would be a much more effective choice (in terms of cost/performance ratio) than using a PC cluster. Due to the GPU’s application-specifi c architecture, harnessing the GPU’s computational prowess for LSA is a great challenge. We presented a parallel LSA implementation on the GPU, using NVIDIA® Compute Unifi ed Device Architecture and Compute Unifi ed Basic Linear Algebra Subprograms software. The performance of this implementation is compared to traditional LSA implementation on a CPU using an optimized Basic Linear Algebra Subprograms library. After implementation, we discovered that the GPU version of the algorithm was twice as fast for large matrices (1 000x1 000 and above) that had dimensions not divisible by 16. For large matrices that did have dimensions divisible by 16, the GPU algorithm ran fi ve to six times faster than the CPU version. The large variation is due to architectural benefi ts of the GPU for matrices divisible by 16. It should be noted that the overall speeds for the CPU version did not vary from relative normal when the matrix dimensions were divisible by 16. Further research is needed in order to produce a fully implementable version of LSA. With that in mind, the research we presented shows that the GPU is a viable option for increasing the speed of LSA, in terms of cost/performance ratio.

Cavanagh, J↗

Feasibility Study on the Use of On-line Multivariate Statistical Process Control for Safeguards Applications in Natural Uranium Conversion Plants

The objective of this work was to determine the feasibility of using on-line multivariate statistical process control (MSPC) for safeguards applications in natural uranium conversion plants. Multivariate statistical process control is commonly used throughout industry for the detection of faults. For safeguards applications in uranium conversion plants, faults could include the diversion of intermediate products such as uranium dioxide, uranium tetrafluoride, and uranium hexafluoride. This study was limited to a 100 metric ton of uranium (MTU) per year natural uranium conversion plant (NUCP) using the wet solvent extraction method for the purification of uranium ore concentrate. A key component in the multivariate statistical methodology is the Principal Component Analysis (PCA) approach for the analysis of data, development of the base case model, and evaluation of future operations. The PCA approach was implemented through the use of singular value decomposition of the data matrix where the data matrix represents normal operation of the plant. Component mole balances were used to model each of the process units in the NUCP. However, this approach could be applied to any data set. The monitoring framework developed in this research could be used to determine whether or not a diversion of material has occurred at an NUCP as part of an International Atomic Energy Agency (IAEA) safeguards system. This approach can be used to identify the key monitoring locations, as well as locations where monitoring is unimportant. Detection limits at the key monitoring locations can also be established using this technique. Several faulty scenarios were developed to test the monitoring framework after the base case or normal operating conditions of the PCA model were established. In all of the scenarios, the monitoring framework was able to detect the fault. Overall this study was successful at meeting the stated objective.

Ladd-Lively, Jennifer L↗

Method for discovering relationships in data by dynamic quantum clustering

Data clustering is provided according to a dynamical framework based on quantum mechanical time evolution of states corresponding to data points. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering.

97 MATHEMATICS AND COMPUTING↗

GPU Accelerated Event Detection Algorithm

Smart grid external require new algorithmic approaches as well as parallel formulations. One of the critical components is the prediction of changes and detection of anomalies within the power grid. The state-of-the-art algorithms are not suited to handle the demands of streaming data analysis. (i) need for events detection algorithms that can scale with the size of data, (ii) need for algorithms that can not only handle multi dimensional nature of the data, but also model both spatial and temporal dependencies in the data, which, for the most part, are highly nonlinear, (iii) need for algorithms that can operate in an online fashion with streaming data. The GAEDA code is a new online anomaly detection techniques that take into account spatial, temporal, multi-dimensional aspects of the data set. The basic idea behind the proposed approach is to (a) to convert a multi-dimensional sequence into a univariate time series that captures the changes between successive windows extracted from the original sequence using singular value decomposition (SVD), and then (b) to apply known anomaly detection techniques for univariate time series. A key challenge for the proposed approach is to make the algorithm scalable to huge datasets by adopting techniques from perturbation theory, incremental SVD analysis. We used recent advances in tensor decomposition techniques which reduce computational complexity to monitor the change between successive windows and detect anomalies in the same manner as described above. Therefore we propose to develop the parallel solutions on many core systems such as GPUs, because these algorithms involve lot of numerical operations and are highly data-parallelizable.

Source record↗

Method for discovering relationships in data by dynamic quantum clustering

Data clustering is provided according to a dynamical framework based on quantum mechanical time evolution of states corresponding to data points. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data-points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering.

97 MATHEMATICS AND COMPUTING↗

Adaptive matching of the iota ring linear optics for space charge compensation

Many present and future accelerators must operate with high intensity beams when distortions induced by space charge forces are among major limiting factors. Betatron tune depression of above approximately 0.1 per cell leads to significant distortions of linear optics. Many aspects of machine operation depend on proper relations between lattice functions and phase advances, and can be i proved with proper treatment of space charge effects. We implement an adaptive algorithm for linear lattice re matching with full account of space charge in the linear approximation for the case of Fermilab’s IOTA ring. The method is based on a search for initial second moments that give closed solution and, at the same predefined set of goals for emittances, beta functions, dispersions and phase advances at and between points of interest. Iterative singular value decomposition based technique is used to search for optimum by varying wide array of model parameters

43 PARTICLE ACCELERATORS↗

Regularization of soft-X-ray data in a tokamak application

An image inversion scheme for soft X-ray (SXR) diagnostics at the DIII-D tokamak is developed to obtain the local soft X-ray emission at a poloidal cross-section from the spatially line-integrated image taken by either a set of SXR arrays or a tangential camera. The scheme uses the Tikhonov regularization method since the inversion problem is generally ill-posed. The regularization technique uses the generalized singular value decomposition (GSVD) to determine a solution that depends on a free regularization parameter. The latter has to be chosen carefully, and the so called L -curve method to find the optimum regularization parameter is outlined. A representative test image is used to study the properties of the inversion scheme with respect to inversion accuracy, amount/strength of regularization and image resolution. The SXR arrays thereby represent an under-determined case while the tangential camera is an over-determined case of the linear inversion problem. In conclusion, it is found that the under-determined case suffers from lack of information but can still return a coarse, but fair image, while the camera data can be well inverted with high resolution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Study of Beam Position Diagnostics with Beam-excited Dipole Higher Order Modes using a Downconverter Test Electronics in Third Harmonic 3.9 GHz Superconducting Accelerating Cavities at FLASH

Beam-excited higher order modes (HOM) in accelerating cavities contain transverse beam position information. Previous studies have narrowed down three modal options for beam position diagnostics in the third harmonic 3.9 GHz cavities at FLASH. Localized modes in the beam pipes at approximately 4.1 GHz and in the fifth cavity dipole band at approximately 9 GHz were found, that can provide a local measurement of the beam position. In contrast, propagating modes in the first and second dipole bands between 4.2 and 5.5 GHz can reach a better resolution. All the options were assessed with a specially designed test electronics built by Fermilab. The aim is to define a mode or spectral region suitable for the HOM electronics. Two data analysis techniques are used and compared in extracting beam position information from the dipole HOMs: direct linear regression and singular value decomposition. Current experiments suggest a resolution of 50 {\mu}m accuracy in predicting local beam position using modes in the fifth dipole band, and a global resolution of 20 {\mu}m over the complete module. Based on these results we decided to build a HOM electronics for the second dipole band and the fifth dipole band, so that we will have both high resolution measurements for the whole module, and localized measurements for individual cavity. The prototype electronics is being built by Fermilab and planned to be tested in FLASH by the end of 2012.

43 PARTICLE ACCELERATORS↗

Systems and methods for determining optimal parameters for dynamic quantum clustering analyses

In the present work, quantum clustering is extended to provide a dynamical approach for data clustering using a time-dependent Schrodinger equation. To expedite computations, we can approximate the time-dependent Hamiltonian formalism by a truncated calculation within a set of Gaussian wave-functions (coherent states) centered around the original points. This allows for analytic evaluation of the time evolution of all such states, opening up the possibility of exploration of relationships among data points through observation of varying dynamical-distances among points and convergence of points into clusters. This formalism may be further supplemented by preprocessing, such as dimensional reduction through singular value decomposition and/or feature filtering. Additionally, the parameters of the analysis can be modified in order to improve the efficiency of the dynamic quantum clustering processes.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Flexible Power Method for Solving Infinite Dimensional Tensor Eigenvalue Problems

We propose a flexible power method for computing the leftmost, i.e., algebraically smallest, eigenvalue of an infinite dimensional tensor eigenvalue problem, $H x = \lambda x$, where the infinite dimensional symmetric matrix $H$ exhibits a translational invariant structure. We assume the smallest eigenvalue of $H$ is simple and apply a power iteration of $e^{-H}$ with the eigenvector represented in a compact way as a translational invariant infinite Tensor Ring (iTR). Hence, the infinite dimensional eigenvector can be represented by a finite number of iTR cores of finite rank. In order to implement this power iteration, we use a small parameter $t$ so that the infinite matrix-vector operation $e^{-Ht}x$ can efficiently be approximated by the Lie product formula, also known as Suzuki--Trotter splitting, and we employ a low rank approximation through a truncated singular value decomposition on the iTR cores in order to keep the cost of subsequent power iterations bounded. We also use an efficient way for computing the iTR Rayleigh quotient and introduce a finite size iTR residual which is used to monitor the convergence of the Rayleigh quotient and to modify the timestep $t$. In this paper, we discuss 2 different implementations of the flexible power algorithm and illustrate the automatic timestep adaption approach for several numerical examples.

Beeumen, Roel Van↗

Quantifying Rates of Erosion Using Historical Aerial Photos - 19478

Erosion can play an important role in the fate and transport of waste at sites where disposal of long-lived waste is anticipated. The statistical characterization of key processes related to erosion is essential to the understanding of site stability through time. In this work multi-temporal historical aerial images are analyzed in conjunction with orthophotography and Lidar data to develop probability distributions for variables representing important erosion processes. Scans of photographic negatives were obtained for multiple photographs and several negatives were scanned with a calibrated photogrammetric scanner by Geomni (formerly Blue Skies Consulting) in Belen, New Mexico. Other negatives were provided by USDA or scanned on a high-resolution, large format media scanner in the United States National Archives Cartographic Research Room, College Park, Maryland (1939). An additional set of aerial photographs was obtained from the USGS EROS Data Center web site. For other years, photographic prints were available for aerial photography. Several prints were scanned with a large-format media scanner at 1200 dpi. Ground control points for selected digital images used in the stereoscopic analyses were identified in ArcMap. Ground control points were collected by matching features which could be identified in the aerial photography as well as the orthophotography or shaded relief imagery from the Lidar dataset. Such features included fence line intersections, road intersections, railroad bridges, and structures, depending on the age of the photography. Many old fence lines and abandoned roads remained visible in the shaded relief imagery while they were completely obscured by tree canopy in modern photography. Ground control elevations were sampled from the Lidar-based DEM or directly from point clouds. The image coordinates and matching three-dimensional projected coordinates of the ground control points were exported to IDL where parameters for a three-dimensional direct linear transformation (DLT) were obtained. Built-in singular value decomposition routines were used to solve an overdetermined set of equations for the eleven parameters of the DLT for a particular historical photograph. A solution to the DLT parameters was obtained for each historical aerial photograph in which features of interest were identified using the stereoscope. Ultimately, this process resulted in the identification of locations for features like gully heads using both the Lidar dataset and projection of the estimated location from the historical aerial photo under consideration back to the Lidar dataset. The distance between the estimate of the location from the historical image and that of the Lidar dataset was the estimated distance the feature has moved. This distance was then divided by the number of years between the Lidar dataset and the year of the historical aerial image of interest to get a rate of movement through time. This was done for several dozen points on each historical aerial image. There was inevitable uncertainty associated with the estimation of points from the historical aerial imagery. This includes estimation of changes in locations of features like gully heads through time. In this work a method to estimate the uncertainty associated with measurements of locations of features using the stereoscopic analysis is developed and applied. For features with locations in space that do not change (e.g., road intersections, etc.) the difference in measurements of locations from the Lidar dataset and that of the estimate from the historical aerial image provides an observation of the measurement error. These points used to estimate the measurement error are referred to as control points. For each of the historical aerial images, a different measurement error distribution is estimated using control points. These measurement errors are combined with the estimated distances from the stereoscopic analyses to produce distributions of gully retreat rates and hillslope erosion rates used along with output from Erosion Working Group (EWG) Landscape Evolution Models (LEMs) to provide statistical probability distributions for input into the PPA Model. Specifically, gully head retreat rate and gully widening rate were characterized using statistical probability distributions. The central limit theorem was then applied to develop rates that represent long-term averages that are used to inform a PPA Model built in GoldSim. The importance of these rates with respect to characterization of future risk can then assessed using sensitivity analyses. This provides an approach to determine if subsequent reduction of the uncertainty associated with the probability distributions of erosion rates will correspond to meaningful reduction in the estimation of future risk from the site. Ultimately this is a general method that utilizes historical aerial imagery to estimate rates of erosion with uncertainty. This information can be used to inform PPA models to project future risks from a given site. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

On Some Criticality Benchmarks in Spherical Geometry

In a paper published in 2003, Sood et al. reported numerical results for a set of problems that are useful as benchmarks for criticality code verification. Here, we reconsider a subset of those problems, namely the one-group problems for homogeneous spheres with linearly anisotropic angular distribution of secondary neutrons, and we use an improved version of the P{sub N} method to obtain very accurate numerical results for them. The standard way of implementing the P{sub N} method for spheres has been shown to be numerically unstable by Aronson. Recently, in a joint work with C. E. Siewert of NCSU and J. R. Thomas, Jr. of VPI, we have developed a new version of the PN method for spheres that overcomes the difficulties pointed out by Aronson. In our implementation, we use singular-value decomposition (SVD) to solve, in a least squares sense, the system of equations obtained from the boundary condition for the coefficients of the approximation. In doing so, we can go to extremely high orders of the P{sub N} approximation (tens of thousands) without losing accuracy. (authors)

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Regularized Differentiation for Bioburden Density Estimation in Planetary Protection

In this paper, we propose and investigate the performance of two novel shrinkage estimators for bioburden density estimation in planetary protection. The estimators are based on the regularized differentiation of a cumulative count of colony forming units collected throughout the data collecting session or the life cycle of the entire mission. The regularized differentiation recasts the problem of bioburden density estimation as a linear least squares problem. The least squares problem is then solved through regularization techniques, such as truncated singular value decomposition and penalized least squares. The regularization is necessary to avoid noise amplification during the differentiation of noisy data. The two regularization estimators are compared with four other commonly used estimators to simultaneously evaluate the means of multivariable independent Poisson distributions: the maximum likelihood, noninformative Bayes estimator with Jeffreys prior, Empirical Bayes using conjugate gamma-Poisson model with gamma parameters selected by method of moments, and the Clevenson-Zidek estimator. It is shown through computer-simulated data that the regularized differentiation based on ridge regression has the smallest mean-squared error among all estimators. The analysis of shrinkage mechanism implemented by regularized differentiation is performed, and it is shown that the regularized differentiation amounts to performing a weighted averaging of all the samples. The weights are determined by the regularization parameter automatically selected by the L-curve technique. Since the method of least squares makes no distributional assumptions about the data, it presents an attractive technique for bioburden density estimation when there are concerns about the misspecification of the distributional model. The paper concludes with the analysis of the bioburden data collected during InSight mission and directions for future work.

97 - MATHEMATICS AND COMPUTING↗

Internal Alignment of the SLD Vertex Detector

The tracking resolution and vertex finding capabilities of the SLD experiment depended upon a precise knowledge of the location and orientation of the elements of the SLD pixel vertex detector (VXD3) in 3D space. At the heart of the procedure described here to align the 96 CCDs is the matrix inversion technique of singular value decomposition (SVD). This tool was employed to unfold the detector geometry corrections from the track data in the VXD3. The algorithm was adapted to perform an optimal {chi}{sup 2} minimization by careful treatment of the track hit residual measurement errors. The tracking resolution obtained with the aligned geometry achieved the design performance. Comments are given on how this method could be used for other trackers.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Using Higher Order Modes in Superconducting Accelerating Cavities for Beam Monitoring

Dipole modes have been shown to be successful diagnostics for the beam position in superconducting accelerating cavities at the Free Electron Laser in Hamburg (FLASH) facility at DESY. By help of downmixing electronics the signals from the two higher order mode (HOM) couplers mounted on each cavity are monitored. The calibration, based on singular value decomposition, is more complicated than in standard position monitors. Position like signals based on this calibration are currently being in the process of being included in the control system. A second setup based on digitizing the spectrum from the HOM couplers has been used for monitoring monopole modes. The beam phase with respect to the RF has been thus monitored. The position calibration measurements and phase monitoring made at the FLASH are presented.

43 PARTICLE ACCELERATORS↗