Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “EIGENVECTOR”

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 181 records · Page 10

Extending the eigCG algorithm to non-symmetric linear systems with multiple right-hand sides

For Hermitian positive definite linear systems and eigenvalue problems, the eigCG algorithm is a memory efficient algorithm that solves the linear system and simultaneously computes some of its eigenvalues. The algorithm is based on the Conjugate-Gradient (CG) algorithm, however, it uses only a window of the vectors generated by the CG algorithm to compute approximate eigenvalues. The number and accuracy of the eigenvectors can be increased by solving more right-hand sides. For Hermitian systems with multiple right-hand sides, the computed eigenvectors can be used to speed up the solution of subsequent systems. The algorithm was tested on Lattice QCD problems by solving the normal equations and was shown to give large speed up factors and to remove the critical slowing down as we approach light quark masses. Here, an extension to the non-symmetric case based on the two-sided Lanczos algorithm is given. The new algorithm is tested on Lattice QCD problems and is shown to give promising results. We also study the removal of the critical slowing down and compare results with those of the eigCG algorithm. We also discuss the case when the system is gamma5-Hermitian.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An Orbit And Dispersion Correction Scheme for the PEP II

To achieve optimum luminosity in a storage ring it is vital to control the residual vertical dispersion. In the original PEP storage ring, a scheme to control the residual dispersion function was implemented using the ring orbit as the controlling element. The 'best' orbit not necessarily giving the lowest vertical dispersion. A similar scheme has been implemented in both the on-line control code and in the simulation code LEGO. The method involves finding the response matrices (sensitivity of orbit/dispersion at each Beam-Position-Monitor (BPM) to each orbit corrector) and solving in a least squares sense for minimum orbit, dispersion function or both. The optimum solution is usually a subset of the full least squares solution. A scheme of simultaneously correcting the orbits and dispersion has been implemented in the simulation code and on-line control system for PEP-II. The scheme is based on the eigenvector decomposition method. An important ingredient of the scheme is to choose the optimum eigenvectors that minimize the orbit, dispersion and corrector strength. Simulations indicate this to be a very effective way to control the vertical residual dispersion.

43 PARTICLE ACCELERATORS↗

Singular value decomposition utilizing parallel algorithms on graphical processors

One of the current challenges in underwater acoustic array signal processing is the detection of quiet targets in the presence of noise. In order to enable robust detection, one of the key processing steps requires data and replica whitening. This, in turn, involves the eigen-decomposition of the sample spectral matrix, Cx = 1/K xKX(k)XH(k) where X(k) denotes a single frequency snapshot with an element for each element of the array. By employing the singular value decomposition (SVD) method, the eigenvectors and eigenvalues can be determined directly from the data without computing the sample covariance matrix, reducing the computational requirements for a given level of accuracy (van Trees, Optimum Array Processing). (Recall that the SVD of a complex matrix A involves determining V, , and U such that A = U VH where U and V are orthonormal and is a positive, real, diagonal matrix containing the singular values of A. U and V are the eigenvectors of AAH and AHA, respectively, while the singular values are the square roots of the eigenvalues of AAH.) Because it is desirable to be able to compute these quantities in real time, an efficient technique for computing the SVD is vital. In addition, emerging multicore processors like graphical processing units (GPUs) are bringing parallel processing capabilities to an ever increasing number of users. Since the computational tasks involved in array signal processing are well suited for parallelization, it is expected that these computations will be implemented using GPUs as soon as users have the necessary computational tools available to them. Thus, it is important to have an SVD algorithm that is suitable for these processors. This work explores the effectiveness of two different parallel SVD implementations on an NVIDIA Tesla C2050 GPU (14 multiprocessors, 32 cores per multiprocessor, 1.15 GHz clock - peed). The first algorithm is based on a two-step algorithm which bidiagonalizes the matrix using Householder transformations, and then diagonalizes the intermediate bidiagonal matrix through implicit QR shifts. This is similar to that implemented for real matrices by Lahabar and Narayanan ("Singular Value Decomposition on GPU using CUDA", IEEE International Parallel Distributed Processing Symposium 2009). The implementation is done in a hybrid manner, with the bidiagonalization stage done using the GPU while the diagonalization stage is done using the CPU, with the GPU used to update the U and V matrices. The second algorithm is based on a one-sided Jacobi scheme utilizing a sequence of pair-wise column orthogonalizations such that A is replaced by AV until the resulting matrix is sufficiently orthogonal (that is, equal to U ). V is obtained from the sequence of orthogonalizations, while can be found from the square root of the diagonal elements of AH A and, once is known, U can be found from column scaling the resulting matrix. These implementations utilize CUDA Fortran and NVIDIA's CUB LAS library. The primary goal of this study is to quantify the comparative performance of these two techniques against themselves and other standard implementations (for example, MATLAB). Considering that there is significant overhead associated with transferring data to the GPU and with synchronization between the GPU and the host CPU, it is also important to understand when it is worthwhile to use the GPU in terms of the matrix size and number of concurrent SVDs to be calculated.

99 GENERAL AND MISCELLANEOUS↗

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

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

Abdel-Rehim, A M↗

Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver

We describe a number of recently developed techniques for improving the performance of large-scalenuclear configuration interaction calculations on high performance parallel computers. We show thebenefit of using a preconditioned block iterative method to replace the Lanczos algorithm that hastraditionally been used to perform this type of computation. The rapid convergence of the block iterativemethod is achieved by a proper choice of starting guesses of the eigenvectors and the construction of aneffective preconditioner. These acceleration techniques take advantage of special structure of the nuclearconfiguration interaction problem which we discuss in detail. The use of a block method also allows usto improve the concurrency of the computation, and take advantage of the memory hierarchy of modernmicroprocessors to increase the arithmetic intensity of the computation relative to data movement. Wealso discuss the implementation details that are critical to achieving high performance on massivelyparallel multi-core supercomputers, and demonstrate that the new block iterative solver is two to threetimes faster than the Lanczos based algorithm for problems of moderate sizes on a Cray XC30 system.

Shao, Meiyue↗

Algorithms and algebraic solutions of decay chain differential equations for stable and unstable nuclide fractionation

Radioactive decay processes, such as alpha decay, produce decay chains where the mass numbers of nuclides decrease as larger nuclides expel energetic particles to form smaller nuclides. Under these conditions, the coefficient matrix that describes the differential rate expressions for radioactive decay can be made lower triangular. With this special structure, formulating an algebraic solution to the decay chains can be done by first formulating the eigenvectors that make up the coefficient matrix, which can then be solved using forward substitution for a lower triangular matrix. This work details the derivation of algebraic solutions for decay chains of any number of stable and unstable nuclides with any number of branching based on this eigenvector analysis. A prototype computational code was developed to validate and compare this methodology against a number of other methods for solving similar systems. A two-phase sorting algorithm yielding the lower triangular matrix structure was established to apply the developed algebraic solutions for decay chains involving beta-emitting radionuclides transformed into daughter nuclides without change in their mass number. In conclusion, the methodologies produced in this work provide an efficient way to estimate nuclide fractions from natural decay processes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Protein conformational switch discerned via network centrality properties

Network analysis has emerged as a powerful tool for examining structural biology systems. The spatial organization of the components of a biomolecular structure has been rendered as a graph representation and analyses have been performed to deduce the biophysical and mechanistic properties of these components. For proteins, the analysis of protein structure networks (PSNs), especially via network centrality measurements and cluster coefficients, has led to identifying amino acid residues that play key functional roles and classifying amino acid residues in general. Whether these network properties examined in various studies are sensitive to subtle (yet biologically significant) conformational changes remained to be addressed. Here, we focused on four types of network centrality properties (betweenness, closeness, degree, and eigenvector centralities) for conformational changes upon ligand binding of a sensor protein (constitutive androstane receptor) and an allosteric enzyme (ribonucleotide reductase). We found that eigenvector centrality is sensitive and can distinguish salient structural features between protein conformational states while other centrality measures, especially closeness centrality, are less sensitive and rather generic with respect to the structural specificity. We also demonstrated that an ensembleinformed, modified PSN with static edges removed (which we term PSN*) has enhanced sensitivity at discerning structural changes.

59 BASIC BIOLOGICAL SCIENCES↗

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↗

Negative thermal expansion correlated with polyhedral movements and distortions in orthorhombic Y{sub 2}Mo{sub 3}O{sub 12}

Graphical abstract: Our work confirms the negative thermal expansion (NTE) behavior of the orthorhombic Y{sub 2}Mo{sub 3}O{sub 12} in this range 0–1000 K. The orthorhombic Y{sub 2}Mo{sub 3}O{sub 12} has an open framework structure where MoO{sub 4} tetrahedra and YO{sub 6} octahedra are connected by oxygen atoms. The previous mechanisms for the NTE behavior of orthorhombic Y{sub 2}Mo{sub 3}O{sub 12} are that the translational mode (see (b)) of the O bridge atoms in Y-O-Mo linkages will cause the linkages to be bent, reducing the space between polyhedra and making the volumetric shrinkage. Furthermore, the internal polyhedral distortions have been reported experimentally. It is necessary to reveal the relationship between NTE and polyhedral movements, distortions. From the vibrational properties, we get that the different vibrational eigenvectors of oxygen atoms relative to Y or Mo atoms can lead internal polyhedra to distort unevenly (see (c)). Herein, an extended 3D model of the connected unit YO{sub 6}-MoO{sub 4} based on the Y-O-Mo linkage is proposed (see (a)). It presents a simultaneous dynamic process, i.e. the YO{sub 6} octahedra and MoO{sub 4} tetrahedra distort unevenly, along with both polyhedra being closer which makes the volumetric contraction. This model is helpful to improve the mechanisms of NTE and may be applied in the whole A{sub 2}M{sub 3}O{sub 12} family. - Highlights: • The NTE properties of Y{sub 2}Mo{sub 3}O{sub 12} are confirmed using a first-principles calculation. • The optical branch with the lowest frequency is most responsible for the NTE. • The relationship between NTE and polyhedral movements, distortions is elucidated. • An extended 3D model of the connected unit YO{sub 6}-MoO{sub 4} is proposed. - Abstract: The internal polyhedral distortions have been reported experimentally in orthorhombic Y{sub 2}Mo{sub 3}O{sub 12} as a negative thermal expansion (NTE) material. To reveal the relationship between NTE and polyhedral movements, distortions, the vibrational properties of Y{sub 2}Mo{sub 3}O{sub 12} have been studied using first-principles calculations. The lowest optical branch corresponding to translational mode of the O bridge atom in Y-O-Mo linkage has the largest negative Grüneisen parameter and therefore contributes most to the NTE behavior. The different vibrational eigenvectors of oxygen atoms relative to Y or Mo atoms can cause internal polyhedral to distort unevenly. Herein, an extended 3D model of the connected unit YO{sub 6}-MoO{sub 4} based on the Y-O-Mo linkage presents a simultaneous dynamic process, i.e. the YO{sub 6} octahedra and MoO{sub 4} tetrahedra distort unevenly, along with both polyhedra being closer which makes the volumetric contraction. This model is helpful to improve the mechanisms of NTE and may be applied in the whole A{sub 2}M{sub 3}O{sub 12} family.

36 MATERIALS SCIENCE↗

Computationally Guided Investigation of the Optical Spectra of Pure β-UO 3

Single-phase β-UO 3 is synthesized by flash heating UO 2 (NO 3 )·6H 2 O in air to 450 °C and annealing for 60 h under the same conditions. For the first time, we report the Raman spectra of pure β-UO 3 . To facilitate the assignment of Raman and infrared vibrational modes, we use density functional theory with density functional perturbation theory. By employing a novel analysis scheme that includes the mode frequencies as well as a quantitative analysis of the mode eigenvectors, we assign the observed spectral features to individual chemical modes. In particular, the density functional theory optimized structure, observed Raman spectrum, and eigenvector analysis suggest the presence of four crystallographically distinct uranyl ions, one more than has previously been suggested.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Nowcasting Earthquakes: Imaging the Earthquake Cycle in California With Machine Learning

We propose a new machine learning-based method for nowcasting earthquakes to image the time-dependent earthquake cycle. The result is a timeseries that may correspond to the process of stress accumulation and release. The timeseries are constructed by using principal component analysis of regional seismicity. The patterns are found as eigenvectors of the cross-correlation matrix of a collection of seismicity timeseries in a coarse grained regional spatial grid (pattern recognition via unsupervised machine learning). The eigenvalues of this matrix represent the relative importance of the various eigenpatterns. Using the eigenvectors and eigenvalues, we compute the weighted correlation timeseries of the regional seismicity. This timeseries has the property that the weighted correlation generally decreases prior to major earthquakes in the region, and increases suddenly just after a major earthquake occurs. As in a previous paper, we find that this method produces a nowcasting timeseries that resembles the hypothesized regional stress accumulation and release process characterizing the earthquake cycle. We then address the problem of whether the timeseries contain information regarding future large earthquakes. For this, we compute a receiver operating characteristic and determine the decision thresholds for several future time periods of interest (optimization via supervised machine learning). We find that signals can be detected that can be used to characterize the information content of the timeseries. These signals may be useful in assessing present and near-future seismic hazards.

58 GEOSCIENCES↗

Variational quantum state eigensolver

Extracting eigenvalues and eigenvectors of exponentially large matrices will be an important application of near-term quantum computers. The variational quantum eigensolver (VQE) treats the case when the matrix is a Hamiltonian. Here, we address the case when the matrix is a density matrix ρ. We introduce the variational quantum state eigensolver (VQSE), which is analogous to VQE in that it variationally learns the largest eigenvalues of ρ as well as a gate sequence V that prepares the corresponding eigenvectors. VQSE exploits the connection between diagonalization and majorization to define a cost function C=Tr(ρ~H) where H is a non-degenerate Hamiltonian. Due to Schur-concavity, C is minimized when ρ~=VρV† is diagonal in the eigenbasis of H. VQSE only requires a single copy of ρ (only n qubits) per iteration of the VQSE algorithm, making it amenable for near-term implementation. We heuristically demonstrate two applications of VQSE: (1) Principal component analysis, and (2) Error mitigation.

97 MATHEMATICS AND COMPUTING↗

Toward shell model interactions with credible uncertainties

Background: The nuclear shell model is a powerful framework for predicting nuclear structure observables, but relies on interaction matrix elements fit to experimental data as its inputs. Extending the shell model's applicability, particularly toward dripline nuclei, requires efficient fitting methods and credible uncertainty quantification. Traditional approaches face computational challenges and may underestimate uncertainties. Purpose: We develop and test a framework combining eigenvector continuation and Markov chain Monte Carlo to efficiently fit shell model interaction matrix elements and quantify their uncertainties. Methods: Eigenvector continuation is used to emulate shell model calculations, reducing computational costs. The emulator enables Markov chain Monte Carlo sampling to optimize interaction matrix elements and rigorously assess parametric uncertainties. Here, the framework is benchmarked using the USDB interaction in the 𝑠⁢𝑑 shell. Results: The emulator reproduces the USDB interaction with negligible error, validating its use in shell model fitting applications. However, we find that to obtain credible predictive intervals, the model defect of the shell model itself, rather than experimental or emulator error, must be taken into account in order to obtain credible uncertainties. Conclusions: The proposed framework provides an efficient and rigorous approach for fitting shell model interactions and quantifying uncertainties. Further, the normality assumption used in the past appears sufficient to describe the distribution of interaction matrix elements. However, it is crucial to account for model correlations to avoid underestimating uncertainties.

Nuclear forces↗

Neutron spectroscopic study of crystalline electric field excitations in stoichiometric and lightly stuffed Yb 2 Ti 2 O 7

Time-of-flight neutron spectroscopy has been used to determine the crystalline electric field Hamiltonian, eigenvalues and eigenvectors appropriate to the J=7/2 Yb 3+ ion in the candidate quantum spin ice pyrochlore magnet Yb 2 Ti 2 O 7 . The precise ground state of this exotic, geometrically frustrated magnet is known to be sensitive to weak disorder associated with the growth of single crystals from the melt. Such materials display weak “stuffing,” wherein a small proportion, approximately 2%, of the nonmagnetic Ti 4+ sites are occupied by excess Yb 3+ . We have carried out neutron spectroscopic measurements on a stoichiometric powder sample of Yb 2 Ti 2 O 7 , as well as a crushed single crystal with weak stuffing and an approximate composition of Yb 2+x Ti 2–x O 7+y with x = 0.046. All samples display three crystalline electric field transitions out of the ground state, and the ground state doublet itself is identified as primarily composed of m J = ±1/2, as expected. However, stuffing at low temperatures in Yb 2+x Ti 2–x O 7+y induces a similar finite crystalline electric field lifetime as is induced in stoichiometric Yb 2 Ti 2 O 7 by elevated temperature. In conclusion, an extended strain field exists about each local “stuffed” site, which produces a distribution of random crystalline electric field environments in the lightly stuffed Yb 2+x Ti 2–x O 7+y , in addition to producing a small fraction of Yb ions in defective environments with grossly different crystalline electric field eigenvalues and eigenvectors.

36 MATERIALS SCIENCE↗

Distributed Learning of Mode Shapes in Power System Models

We address the problem of distributed estimation of eigenvectors for power system models using online phasor measurements. The power system is considered to be divided into a set of non-overlapping areas, each of which is equipped with a local estimator. Online measurements of bus voltage and current phasors are first used to generate estimates of the generator states in each area using decentralized Kalman filters. Thereafter, these estimates are used for identifying a reduced-order model of the system in a completely distributed way by sharing state information between the estimators over a strongly connected communication graph. The identified model is then utilized to estimate its right eigenvectors over the same distributed graph. Results are validated using a 50-bus power system model with four areas.

Gusrialdi, Azwirman↗

Graph Laplacian Spectrum and Primary Frequency Regulation: Preprint

We present a framework based on spectral graph theory that captures the interplay among network topology, system inertia, and generator and load damping in determining overall power grid behavior and performance. Specifically, we show that the impact of network topology on a power system can be quantified through the network Laplacian eigenvalues, and such eigenvalues determine the grid robustness against low frequency disturbances. Moreover, we can explicitly decompose the frequency signal along scaled Laplacian eigenvectors when damping-intertia ratios are uniform across buses. The insight revealed by this framework suggests why load-side participation in frequency regulation not only makes the system respond faster, but also helps lower the system nadir after disturbance. Finally, by presenting a new controller specifically tailored to suppress high frequency disturbances, we demonstrate that our results can provide useful guidelines in the controller design for load-side primary frequency regulation. We simulate the improved controller on the IEEE 39-bus New England interconnection system to illustrate its robustness against high frequency oscillation compared to both the conventional droop control and a recent controller design.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Distributed Link Removal Using Local Estimation of Network Topology

In this paper, we consider the problem of network structure manipulation in the absence of information on the global network topology. In particular, the problem of removing some of links is investigated in order to slow or stop the spread of disease in a network while preserving its connectivity. Existing methods solve this combinatorial problem in a centralized manner and they require the global information of network structure. In this paper, we propose a distributed design algorithm to compute a suboptimal solution to this problem efficiently by mimicking gradient based method, namely by iteratively removing one or multiple links at a time from the network. Specifically, using matrix perturbation analysis we formulate an optimization problem involving the eigenvector associated with the largest eigenvalue of the adjacency matrix and whose solution is equal to a suboptimal solution to the original problem. This strategy also enables us to overcome the combinatorial issue of the problem. Distributed algorithms to estimate the eigenvector and to verify network’s connectivity are then proposed which facilitate us to solve the new optimization problem. In addition, topological insights into the proposed algorithm and optimality of its solution are also discussed. Lastly, the proposed distributed design method is demonstrated and evaluated via several numerical examples.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An initial study on the estimation of time-varying volumetric treatment images and 3D tumor localization from single MV cine EPID images

Purpose: In this work the authors develop and investigate the feasibility of a method to estimate time-varying volumetric images from individual MV cine electronic portal image device (EPID) images. Methods: The authors adopt a two-step approach to time-varying volumetric image estimation from a single cine EPID image. In the first step, a patient-specific motion model is constructed from 4DCT. In the second step, parameters in the motion model are tuned according to the information in the EPID image. The patient-specific motion model is based on a compact representation of lung motion represented in displacement vector fields (DVFs). DVFs are calculated through deformable image registration (DIR) of a reference 4DCT phase image (typically peak-exhale) to a set of 4DCT images corresponding to different phases of a breathing cycle. The salient characteristics in the DVFs are captured in a compact representation through principal component analysis (PCA). PCA decouples the spatial and temporal components of the DVFs. Spatial information is represented in eigenvectors and the temporal information is represented by eigen-coefficients. To generate a new volumetric image, the eigen-coefficients are updated via cost function optimization based on digitally reconstructed radiographs and projection images. The updated eigen-coefficients are then multiplied with the eigenvectors to obtain updated DVFs that, in turn, give the volumetric image corresponding to the cine EPID image. Results: The algorithm was tested on (1) Eight digital eXtended CArdiac-Torso phantom datasets based on different irregular patient breathing patterns and (2) patient cine EPID images acquired during SBRT treatments. The root-mean-squared tumor localization error is (0.73 ± 0.63 mm) for the XCAT data and (0.90 ± 0.65 mm) for the patient data. Conclusions: The authors introduced a novel method of estimating volumetric time-varying images from single cine EPID images and a PCA-based lung motion model. This is the first method to estimate volumetric time-varying images from single MV cine EPID images, and has the potential to provide volumetric information with no additional imaging dose to the patient.

60 APPLIED LIFE SCIENCES↗