Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “singular vectors”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS2002

Singular Vectors for Moisture-Measuring Norms

In dynamic meteorology, singular vectors (SVs) are the structures that maximize a given norm of a forecast perturbation given a tangent linear model and a quadratic constraint on the initial perturbation. That constraint is a prescription of the value of either the same or a different norm applied to the initial perturbations. In the sense that SVs maximize the forecast perturbations according to a specified measure, they may be considered as optimal perturbations. SVs are used to characterize predictability, to identify and correct possible initial errors given forecast errors, to create a set of significant perturbations for ensemble forecasting, or to determine locations for observation targeting. They are a specific application of generally defined singular vectors in mathematics.

Errico, Ronald M.↗
DOE OSTI2025

Structural response reconstruction using a system-equivalent singular vector basis

Here, this paper develops a novel method for reconstructing the full-field response of structural dynamic systems using sparse measurements. The singular value decomposition is applied to a frequency response matrix relating the structural response to physical loads, base motion, or modal loads. The left singular vectors form a non-physical reduced basis that can be used for response reconstruction with far fewer sensors than existing methods. The contributions of the singular vectors to measured response are termed singular-vector loads (SVLs) and are used in a regularized Bayesian framework to generate full-field response estimates and confidence intervals. The reconstruction framework is applicable to the estimation of single data records and power spectral densities from multiple records. Reconstruction is successfully performed in configurations where the number of SVLs to identify is less than, equal to, and greater than the number of sensors used for reconstruction. In a simulation featuring a seismically excited shear structure, SVL reconstruction significantly outperforms modal FRF-based reconstruction and successfully estimates full-field responses with as few as two uniaxial accelerometers. SVL reconstruction is further verified in a simulation featuring an acoustically excited cylinder. Finally, response reconstruction and uncertainty quantification are performed on an experimental structure with three shaker inputs and 27 triaxial accelerometer outputs.

42 ENGINEERING↗
NASA NTRS1993

An accelerated training method for back propagation networks

The principal objective is to provide a training procedure for a feed forward, back propagation neural network which greatly accelerates the training process. A set of orthogonal singular vectors are determined from the input matrix such that the standard deviations of the projections of the input vectors along these singular vectors, as a set, are substantially maximized, thus providing an optimal means of presenting the input data. Novelty exists in the method of extracting from the set of input data, a set of features which can serve to represent the input data in a simplified manner, thus greatly reducing the time/expense to training the system.

Shelton, Robert O.↗
DOE OSTI2024

Random projection using random quantum circuits

The random sampling task performed by Google's Sycamore processor gave us a glimpse of the “quantum supremacy era.” This has definitely shed some light on the power of random quantum circuits in this abstract task of sampling outputs from the (pseudo)random circuits. In this paper, we explore a practical near-term use of local random quantum circuits in dimensional reduction of large low-rank data sets. We make use of the well-studied dimensionality reduction technique called the random projection method. This method has been extensively used in various applications such as image processing, logistic regression, entropy computation of low-rank matrices, etc. We prove that the matrix representations of local random quantum circuits with sufficiently shorter depths [ ∼ O ( n ) ] serve as good candidates for random projection. We demonstrate numerically that their projection abilities are not far off from the computationally expensive classical principal components analysis on MNIST and CIFAR-100 image datasets. We also benchmark the performance of quantum random projection against the commonly used classical random projection in the tasks of dimensionality reduction of image data sets and computing von Neumann entropies of large low-rank density matrices. And finally, using variational quantum singular value decomposition, we demonstrate a near-term implementation of extracting the singular vectors with dominant singular values after quantum random projecting a large low-rank matrix to lower dimensions. All such numerical experiments unequivocally demonstrate the ability of local random circuits to randomize a large Hilbert space at sufficiently shorter depths with robust retention of properties of large data sets in reduced dimensions. Published by the American Physical Society 2024

Kumaran, Keerthi (ORCID:0009000949125721)↗
NASA NTRS1984

Singular value decomposition with systolic arrays

Systolic arrays for determining the singular value decomposition of a mxn, m n, matrix A of bandwidth w are presented. After A has been reduced to bidiagonal form B by means of Givens plane rotations, the singular values of B are computed by the Golub-Reinsch iteration. The products of plane rotations form the matrices of left and right singular vectors. Assuming each processor can compute or supply a plane rotation, O(wn) processors accomplish the reduction to bidiagonal form in O(np) steps, where p is the number of superdiagonals. A constant number of processors then determines each singular value in about 6n steps. The singular vectors are computed by rerouting the rotations through the arrays used for the reduction to bidiagonal form, or else along the way by employing another rectangular array of O(wm) processors.

Ipsen, I. C. F.↗
NASA NTRS1984

Singular value decomposition with systolic arrays

Systolic arrays for determining the singular value decomposition of a mxn, m greater than or equal to n, matrix A of bandwidth w are presented. After A has been reduced to bidiagonal form B by means of Givens plane rotations, the singular values of B are computed by the Golub-Reinsch iteration. The products of plane rotations form the matrices of left and right singular vectors. Assuming each processor can compute or supply a plane rotation, O(wn) processors accomplish the reduction to bidiagonal form in O(np) steps, where p is the number of superdiagonals. A constant number of processors then determines each singular value in about 6n steps. The singular vectors are computed by rerouting the rotations through the arrays used for the reduction to bidiagonal form, or else along the way by employing another rectangular array of O(wm) processors.

Ipsen, I.↗
NASA NTRS1992

Large-scale sparse singular value computations

Four numerical methods for computing the singular value decomposition (SVD) of large sparse matrices on a multiprocessor architecture are presented. Lanczos and subspace iteration-based methods for determining several of the largest singular triplets (singular values and corresponding left and right-singular vectors) for sparse matrices arising from two practical applications: information retrieval and seismic reflection tomography are emphasized. The target architectures for implementations are the CRAY-2S/4-128 and Alliant FX/80. The sparse SVD problem is well motivated by recent information-retrieval techniques in which dominant singular values and their corresponding singular vectors of large sparse term-document matrices are desired, and by nonlinear inverse problems from seismic tomography applications which require approximate pseudo-inverses of large sparse Jacobian matrices.

Berry, Michael W.↗
DOE OSTI2024

Engineering and revealing Dirac strings in spinor condensates

Artificial monopoles have been engineered in various systems, yet there has been no systematic study of the singular vector potentials associated with the monopole field. We show that the Dirac string, the line singularity of the vector potential, can be engineered, manipulated, and made manifest in a spinor atomic condensate. We elucidate the connection among spin, orbital degrees of freedom, and the artificial gauge, and show that there exists a mapping between the vortex filament and the Dirac string. We also devise a proposal where preparing initial spin states with relevant symmetries can result in different vortex patterns, revealing an underlying correspondence between the internal spin states and the spherical vortex structures. Such a mapping also leads to a new way of constructing spherical Landau levels, and monopole harmonics. Our observation provides insights into the behavior of quantum matter possessing internal symmetries in curved spaces. Published by the American Physical Society 2024

Xu, Gui-Sheng↗
DOE OSTI2020

Shape-constrained Input Estimation for Efficient Multi-shaker Vibration Testing

Multi-shaker vibration testing is gaining interest from structural dynamics test engineers as it can provide a much more accurate match to complicated field vibration responses than traditional single-axis shaker tests. However, the force capabilities of the small modal shakers typically used in multi-shaker vibration tests has limited the achievable response levels. To date, most multi-shaker vibration tests have been performed using a variety of standard, commercially-available control systems. While these control systems are adequate for a wide range of multiple-input/multiple-output tests, their control algorithms have not been tailored for the specific problem of multi-shaker vibration tests: efficiently coordinating the various shakers to work together to achieve a desired response. Here, a new input estimation algorithm is developed and demonstrated using simulations and actual test data. This algorithm, dubbed shape-constrained input estimation, is shown to effectively coordinate multiple shakers using a set of constraint vectors based on the deflection shapes of the test structure. This is accomplished by using the singular vector shapes of the system frequency response matrix, which allows the constraint vectors to automatically change as a function of frequency. Simulation and test results indicate a significant reduction in the input forces required to achieve a desired response. Finally, the results indicate that shape-constrained input estimation is an effective method to achieve higher response levels from limited shaker forces which will enable higher level multi-shaker vibration tests to be performed.

42 ENGINEERING↗
DOE OSTI2020

Multigrid deflation for Lattice QCD

Computing the trace of the inverse of large matrices is typically addressed through statistical methods. Deflating out the lowest eigenvectors or singular vectors of the matrix reduces the variance of the trace estimator. This work summarizes our efforts to reduce the computational cost of computing the deflation space while achieving the desired variance reduction for Lattice QCD applications. Previous efforts computed the lower part of the singular spectrum of the Dirac operator by using an eigensolver preconditioned with a multigrid linear system solver. Despite the improvement in performance in those applications, as the problem size grows the runtime and storage demands of this approach will eventually dominate the stochastic estimation part of the computation. In this work, we propose to compute the deflation space in one of the following two ways. First, by using an inexact eigensolver on the Hermitian, but maximally indefinite, operator. Second, by exploiting the fact that the multigrid prolongator for this operator is rich in components toward the lower part of the singular spectrum. We show experimentally that the inexact eigensolver can approximate the lower part of the spectrum even for ill-conditioned operators. Also, the deflation based on the multigrid prolongator is more efficient to compute and apply, and, despite its limited ability to approximate the fine level spectrum, it obtains similar variance reduction on the trace estimator as deflating with approximate eigenvectors from the fine level operator.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1990

Reliable and Efficient Parallel Processing Algorithms and Architectures for Modern Signal Processing

Least-squares (LS) estimations and spectral decomposition algorithms constitute the heart of modern signal processing and communication problems. Implementations of recursive LS and spectral decomposition algorithms onto parallel processing architectures such as systolic arrays with efficient fault-tolerant schemes are the major concerns of this dissertation. There are four major results in this dissertation. First, we propose the systolic block Householder transformation with application to the recursive least-squares minimization. It is successfully implemented on a systolic array with a two-level pipelined implementation at the vector level as well as at the word level. Second, a real-time algorithm-based concurrent error detection scheme based on the residual method is proposed for the QRD RLS systolic array. The fault diagnosis, order degraded reconfiguration, and performance analysis are also considered. Third, the dynamic range, stability, error detection capability under finite-precision implementation, order degraded performance, and residual estimation under faulty situations for the QRD RLS systolic array are studied in details. Finally, we propose the use of multi-phase systolic algorithms for spectral decomposition based on the QR algorithm. Two systolic architectures, one based on triangular array and another based on rectangular array, are presented for the multiphase operations with fault-tolerant considerations. Eigenvectors and singular vectors can be easily obtained by using the multi-pase operations. Performance issues are also considered.

Liu, Kuojuey Ray↗
DOE OSTI2022

PythonFOAM: In-situ data analyses with OpenFOAM and Python

Here, we outline the development of a general-purpose Python-based data analysis tool for OpenFOAM. Our implementation relies on the construction of OpenFOAM applications that have bindings to data analysis libraries in Python. Double precision data in OpenFOAM is cast to a NumPy array using the NumPy C-API and Python modules may then be used for arbitrary data analysis and manipulation on flow-field information. We highlight how the proposed wrapper may be used for an in-situ online singular value decomposition (SVD) implemented in Python and accessed from the OpenFOAM solver PimpleFOAM. Here, 'in-situ' refers to a programming paradigm that allows for a concurrent computation of the data analysis on the same computational resources utilized for the partial differential equation solver. In addition, to demonstrate parallel deployments, we deploy a distributed SVD, which collects snapshot data across the ranks of a distributed simulation to compute the global left singular vectors. Crucially, both OpenFOAM and Python share the same message passing interface (MPI) communicator for this deployment which allows Python objects and functions to exchange NumPy arrays across ranks. Subsequently, we provide scaling assessments of this distributed SVD on multiple nodes of Intel Broadwell and KNL architectures for canonical test cases such as the large eddy simulations of a backward facing step and a channel flow at friction Reynolds number of 395. Finally, we demonstrate the deployment of a deep neural network for compressing the flow-field information using an autoencoder to demonstrate an ability to use state-of-the-art machine learning tools in the Python ecosystem.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2022

Harmonizing solar induced fluorescence across spatial scales, instruments, and extraction methods using proximal and airborne remote sensing: A multi-scale study in a soybean field

Solar-induced chlorophyll fluorescence (SIF) has been widely used to track vegetation photosynthesis at different scales ranging from in-situ measurements to satellite products. Airborne platforms sample SIF data at a spatial scale intermediate between in-situ and satellite, matching that of ground measurement (e.g. flux tower footprints and other field sampling), enabling us to explore causes of SIF variation and validate satellite-based SIF products. However, harmonizing SIF across sensors and platforms (correcting for systematic errors to yield a consistent, comparable SIF product) is challenging because SIF can be retrieved in different absorption windows, with different instruments and methods complicating the comparison between different observational levels (i.e., ground, airborne, satellites) and between sites equipped with different instruments with varying optical properties (spectral resolution and sampling intervals, spatial resolution). Additionally, the spatial and temporal variability of atmospheric properties can influence the retrieval of the weak SIF signal. Because of these complications, direct comparisons of airborne and ground SIF across scales are rarely attempted. Here, in this study, we combined airborne SIF data with simultaneous ‘ground truth’ data collected by stationary and mobile platforms in a soybean field in Nebraska, USA. In this effort, we tested several SIF extraction methods, including Fraunhofer Line Discrimination (FLD), improved Fraunhofer Line Discrimination (iFLD), Spectral Fitting Method (SFM), SpecFit, and a Singular Vector Decomposition (SVD) method. The SpecFit method was sensitive to the 715–740 nm water bands and removing the water bands in the fitting process yielded better agreement between the airborne and ground SIF spectra. Accurate estimation of the ground level downwelling irradiance obtained by ground measurements over a calibration target improved agreement between airborne and ground SIF retrievals at the O 2 A band, and allowed us to derive a SIF dataset with improved agreement across platforms and sampling scales. This experimental approach provided a method for generating comparable SIF signals across instruments, methods and platforms, which is critical to understanding the SIF-GPP relationship at different scales and to cross-validate the diversity of platforms used for satellite products calibration and validation.

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2020

Bi-cross validation of spectral clustering hyperparameters

One challenge impeding the analysis of terabyte scale X-ray scattering data from the Linac Coherent Light Source (LCLS) is determining the number of clusters required for the execution of traditional clustering algorithms. Here, we demonstrate that the previous work using bi-cross validation to determine the number of singular vectors directly maps to the spectral clustering problem of estimating both the number of clusters and hyperparameter values. Here by applying this method to LCLS X-ray scattering data enables the identification of dropped shots without manually setting boundaries on detector fluence and provides a path toward identifying rare and anomalous events.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2020

Systematic Assessment of Retrieval Methods for Canopy Far-Red Solar-Induced Chlorophyll Fluorescence Using High-Frequency Automated Field Spectroscopy

Remote sensing of solar-induced chlorophyll fluorescence (SIF) offers potential to infer photosynthesis across scales and biomes. Many retrieval methods have been developed to estimate top-of-canopy SIF using ground-based spectroscopy. However, inconsistencies among methods may confound interpretation of SIF dynamics, eco-physiological/environmental drivers, and its relationship with photosynthesis. Using high temporal- and spectral resolution ground-based spectroscopy, we aimed to (1) evaluate performance of SIF retrieval methods under diverse sky conditions using continuous field measurements; (2) assess method sensitivity to fluctuating light, reflectance, and fluorescence emission spectra; and (3) inform users for optimal ground-based SIF retrieval. Analysis included field measurements from bi-hemispherical and hemispherical-conical systems and synthetic upwelling radiance constructed from measured downwelling radiance, simulated reflectance, and simulated fluorescence for benchmarking. Fraunhofer-based differential optical absorption spectroscopy (DOAS) and singular vector decomposition (SVD) retrievals exhibit convergent SIF-PAR relationships and diurnal consistency across different sky conditions, while O2A-based spectral fitting method (SFM), SVD, and modified Fraunhofer line discrimination (3FLD) exhibit divergent SIF-PAR relationships across sky conditions. We find that such behavior holds across system configurations, though hemispherical-conical systems diverge less across sky conditions. O 2 A retrieval accuracy, influenced by atmospheric distortion, improves with a narrower fitting window and when training SVD with temporally local spectra. This may impact SIF-photosynthesis relationships interpreted by previous studies using O 2 A-based retrievals with standard (759–767.76 nm) fitting windows. Fraunhofer-based retrievals resist atmospheric impacts but are noisier and more sensitive to assumed SIF spectral shape than O 2 A-based retrievals. We recommend SVD or SFM using reduced fitting window (759.5–761.5 nm) for robust far-red SIF retrievals across sky conditions.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2021

Singular value decomposition and similarity renormalization group evolution of nuclear interactions

One of the main challenges for ab initio nuclear many-body theory is the growth of computational and storage costs as calculations are extended to heavy, exotic, and structurally complex nuclei. Here, we investigate the factorization of nuclear interactions as a means to address this issue. We perform Singular Value Decompositions of nucleon-nucleon interactions in partial wave representation and study the dependence of the singular value spectrum on interaction characteristics like regularization scheme and resolution scales. We develop and implement the Similarity Renormalization Group (SRG) evolution of the factorized interaction, and demonstrate that this SVD-SRG approach accurately preserves two-nucleon observables. We find that low-resolution interactions allow the truncation of the SVD at low rank, and that a small number of relevant components is sufficient to capture the nuclear interaction and perform an accurate SRG evolution, while the Coulomb interaction requires special consideration. The rank is uniform across all partial waves, and almost independent of the basis choice in the tested cases. This suggests an interpretation of the relevant singular components as mere representations of a small set of abstract operators that can describe the interaction and its SRG flow. Following the traditional workflow for nuclear interactions, we discuss how the transformation between the center-of-mass and laboratory frames creates redundant copies of the partial wave components when implemented in matrix representation, and we discuss strategies for mitigation. Lastly, we test the low-rank approximation to the SRG-evolved interactions in many-body calculations using the In-Medium SRG. By including nuclear radii in our analysis, we verify that the implementation of the SRG using the singular vectors of the interaction does not spoil the evolution of other observables.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗