Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “eigenvector localization”

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.

28 records · Page 2

Optimization of cascade blade mistuning. II - Global optimum and numerical optimization

The values of the mistuning which yield the most stable eigenvectors are analytically determined, using the simplified equations of motion which were developed in Part I of this work. It is shown that random mistunings, if large enough, may lead to the maximal stability, whereas the alternate mistunings cannot. The problem of obtaining maximum stability for minimal mistuning is formulated, based on numerical optimization techniques. Several local minima are obtained using different starting mistuning vectors. The starting vectors which lead to the global minimum are identified. It is analytically shown that all minima appear in multiplicities which are equal to the number of compressor blades. The effect of mistuning on the flutter speed is studied using both an optimum mistuning vector and an alternate mistuning vector. Effects of mistunings in elastic axis locations are shown to have a negligible effect on the eigenvalues. Finally, it is shown that any general two-dimensional bending-torsion system can be reduced to an equivalent uncoupled torsional system.

Nissim, E.↗

Enhancing scalability of a matrix-free eigensolver for studying many-body localization

We propose several techniques to enhance the parallel scalability of a matrix-free eigensolver designed for studying many-body localization (MBL) of quantum spin chain models with nearest-neighbor interactions and on-site disorder. This type of problem is computationally challenging because the dimension of the associated Hamiltonian matrix grows exponentially with respect to the number of spins L, and we need to average over different realizations of the random disorder to obtain relevant statistical behavior. For each disorder realization, we need to compute eigenvalues from different regions of the spectrum and their corresponding eigenvectors. In previous work, the interior eigenstates for a single eigenvalue problem are computed via the shift-and-invert Lanczos algorithm. Due to the extremely high memory footprint of the LU factorizations, this technique is not well suited for large L’s. For example, we need thousands of compute nodes on modern high performance computing infrastructures to go beyond L = 24. The matrix-free approach does not suffer from this memory bottleneck, however, its scalability is limited by a computation and communication load imbalance. To reduce this imbalance and to significantly enhance the scalability of the matrix-free eigensolver, we reorder the matrix and leverage the consistent space runtime, CSPACER. We also show its efficiency in managing irregular communication patterns at scale compared to optimized MPI non-blocking two-sided and one-sided RMA implementation variants. This effort enables us to study MBL for spin chains with a larger number of spins. The efficiency and effectiveness of the proposed algorithm is demonstrated by computing eigenstates on a massively parallel many-core high performance computer.

METIS↗

Matrix partitioning and EOF/principal component analysis of Antarctic Sea ice brightness temperatures

A field of measured anomalies of some physical variable relative to their time averages, is partitioned in either the space domain or the time domain. Eigenvectors and corresponding principal components of the smaller dimensioned covariance matrices associated with the partitioned data sets are calculated independently, then joined to approximate the eigenstructure of the larger covariance matrix associated with the unpartitioned data set. The accuracy of the approximation (fraction of the total variance in the field) and the magnitudes of the largest eigenvalues from the partitioned covariance matrices together determine the number of local EOF's and principal components to be joined by any particular level. The space-time distribution of Nimbus-5 ESMR sea ice measurement is analyzed.

Murray, C. W., Jr.↗

A NASTRAN DMAP alter for determining a local stiffness modification to obtain a specified eigenvalue

A technique is described which has been programmed as a DMAP Alter to Rigid Format 3, for determining a stiffness matrix modification to obtain a specified eigenvalue for a structure. The stiffness matrix modifications allowable are those that can be described as the product of a single scalar variable and a matrix of constant coefficients input by the user. The program solves for the scalar variable multiplier which will yield a specified eigenvalue for the complete structure (provided it exists), makes the modification to the stiffness matrix, and proceeds in Rigid Format 3 to obtain the eigenvalues and eigenvectors of the modified structure.

Case, W. R., Jr.↗

Exploring the energy landscape of RBMs: reciprocal space insights into bosons, hierarchical learning and symmetry breaking

Deep generative models have become ubiquitous due to their ability to learn and sample from complex distributions. Despite the proliferation of various frameworks, the relationships among these models remain largely unexplored, a gap that hinders the development of a unified theory of AI learning. In this work, we address two central challenges: clarifying the connections between different deep generative models and deepening our understanding of their learning mechanisms. We focus on Restricted Boltzmann Machines (RBMs), a class of generative models known for their universal approximation capabilities for discrete distributions. By introducing a reciprocal space formulation for RBMs, we reveal a connection between these models, diffusion processes, and systems of coupled bosons. Our analysis shows that at initialization, the RBM operates at a saddle point, where the local curvature is determined by the singular values of the weight matrix, whose distribution follows the Marc̆enko-Pastur law and exhibits rotational symmetry. During training, this rotational symmetry is broken due to hierarchical learning, where different degrees of freedom progressively capture features at multiple levels of abstraction. This leads to a symmetry breaking in the energy landscape, reminiscent of Landau’s theory. This symmetry breaking in the energy landscape is characterized by the singular values and the weight matrix eigenvector matrix. We derive the corresponding free energy in a mean-field approximation. We show that in the limit of infinite size RBM, the reciprocal variables are Gaussian distributed. Our findings indicate that in this regime, there will be some modes for which the diffusion process will not converge to the Boltzmann distribution. To illustrate our results, we trained replicas of RBMs with different hidden layer sizes using the MNIST dataset. Our findings not only bridge the gap between disparate generative frameworks but also shed light on the fundamental processes underpinning learning in deep generative models.

97 MATHEMATICS AND COMPUTING↗

A Shifted Block Lanczos Algorithm 1: The Block Recurrence

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

Grimes, Roger G.↗

Hamiltonian Truncation Effective Theory

Hamiltonian truncation is a non-perturbative numerical method for calculating observables of a quantum field theory. The starting point for this method is to truncate the interacting Hamiltonian to a finite-dimensional space of states spanned by the eigenvectors of the free Hamiltonian H_0 H 0 with eigenvalues below some energy cutoff E_\text{max} E max . In this work, we show how to treat Hamiltonian truncation systematically using effective field theory methodology. We define the finite-dimensional effective Hamiltonian by integrating out the states above E_\text{max} E max . The effective Hamiltonian can be computed by matching a transition amplitude to the full theory, and gives corrections order by order as an expansion in powers of 1/E_\text{max} 1 / E max . The effective Hamiltonian is non-local, with the non-locality controlled in an expansion in powers of H_0/E_\text{max} H 0 / E max . The effective Hamiltonian is also non-Hermitian, and we discuss whether this is a necessary feature or an artifact of our definition. We apply our formalism to 2D \lambda\phi^4 λ ϕ 4 theory, and compute the the leading 1/E_\text{max}^2 1 / E max 2 corrections to the effective Hamiltonian. We show that these corrections nontrivially satisfy the crucial property of separation of scales. Numerical diagonalization of the effective Hamiltonian gives residual errors of order 1/E_\text{max}^3 1 / E max 3 , as expected by our power counting. We also present the power counting for 3D \lambda \phi^4 λ ϕ 4 theory and perform calculations that demonstrate the separation of scales in this theory.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Projecting the Thermal Response in a HTGR-Type System during Conduction Cooldown Using Graph-Laplacian Based Machine Learning

Accurate prediction of an off-normal event in a nuclear reactor is dependent upon the availability of sensory data, reactor core physical condition, and understanding of the underlying phenomenon. This work presents a method to project the data from some discrete sensory locations to the overall reactor domain during conduction cooldown scenarios similar to High Temperature Gas-cooled Reactors (HTGRs). The existing models for conductive cooldown in a heterogeneous multi-body system, such as an assembly of prismatic blocks or pebble beds relies on knowledge of the thermal contact conductance, requiring significant knowledge of local thermal contacts and heat transport possibilities across those contacts. With a priori knowledge of bulk geometry features and some discrete sensors, a machine learning approach was devised. The presented work uses an experimental facility to mimic conduction cooldown with an assembly of 68 cylindrical rods initially heated to 1200 K. High-fidelity temperature data were collected using an infrared (IR) camera to provide training data to the model and validate the predicted temperature data. The machine learning approach used here first converts the macroscopic bulk geometry information into Graph-Laplacian, and then uses the eigenvectors of the Graph-Laplacian to develop Kernel functions. Support vector regression (SVR) was implemented on the obtained Kernels and used to predict the thermal response in a packed rod assembly during a conduction cooldown experiment. The usage of SVR modeling differs from most models today because of its representation of thermal coupling between rods in the core. When trained with thermographic data, the average normalized error is less than 2% over 400 s, during which temperatures of the assembly have dropped by more than 500 K. The rod temperature prediction performance was significantly better for rods in the interior of the assembly compared to those near the exterior, likely due to the model simplification of the surroundings.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

GPU-acceleration of the ELPA2 distributed eigensolver for dense symmetric and hermitian eigenproblems

The solution of eigenproblems is often a key computational bottleneck that limits the tractable system size of numerical algorithms, among them electronic structure theory in chemistry and in condensed matter physics. Large eigenproblems can easily exceed the capacity of a single compute node, thus must be solved on distributed-memory parallel computers. We here present GPU-oriented optimizations of the ELPA two-stage tridiagonalization eigensolver (ELPA2). On top of cuBLAS-based GPU offloading, we add a CUDA kernel to speed up the back-transformation of eigenvectors, which can be the computationally most expensive part of the two-stage tridiagonalization algorithm. Furthermore, we benchmark the performance of this GPU-accelerated eigensolver on two hybrid CPU–GPU architectures, namely a compute cluster based on Intel Xeon Gold CPUs and NVIDIA Volta GPUs, and the Summit supercomputer based on IBM POWER9 CPUs and NVIDIA Volta GPUs. Consistent with previous benchmarks on CPU-only architectures, the GPU-accelerated two-stage solver exhibits a parallel performance superior to the one-stage counterpart. Finally, we demonstrate the performance of the GPU-accelerated eigensolver developed in this work for routine semi-local KS-DFT calculations comprising thousands of atoms.

97 MATHEMATICS AND COMPUTING↗

Mean Flow Augmented Acoustics in Rocket Systems

Oscillatory motion in solid rocket motors and liquid engines has long been a subject of concern. Many rockets display violent fluctuations in pressure, velocity, and temperature originating from the complex interactions between the combustion process and gas dynamics. The customary approach to modeling acoustic waves inside a rocket chamber is to apply the classical inhomogeneous wave equation to the combustion gas. The assumption of a linear, non-dissipative wave in a quiescent fluid remains valid while the acoustic amplitudes are small and local gas velocities stay below Mach 0.2. The converging section of a rocket nozzle, where gradients in pressure, density, and velocity become large, is a notable region where this approach is not applicable. The expulsion of unsteady energy through the nozzle of a rocket is identified as the predominate source of acoustic damping for most rocket systems. An accurate model of the acoustic behavior within this region where acoustic modes are influenced by the presence of a steady mean flow is required for reliable stability predictions. Recently, an approach to address nozzle damping with mean flow effects was implemented by French [1]. This new approach extends the work originated by Sigman and Zinn [2] by solving the acoustic velocity potential equation (AVPE) formulated by perturbing the Euler equations [3]. The acoustic velocity potential (psi) describing the acoustic wave motion in the presence of an inhomogeneous steady high-speed flow is defined by, (del squared)(psi) − (lambda/c)(exp 2)(psi) − M(dot)[M(dot)(del)(del(psi))] − 2(lambda(M/c) + (M(dot)del(M))(dot)del(psi)−2(lambda)(psi)[M(dot)del(1/c)]=0 (1) with M as the Mach vector, c as the speed of sound, and lambda as the complex eigenvalue. French apply the finite volume method to solve the steady flow field within the combustion chamber and nozzle with inviscid walls. The complex eigenvalues and eigenvector are determined with the use of the ARPACK eigensolver. The present study employs the COMSOL Multphysics framework to solve the coupled eigenvalue problem using the finite element approach. The study requires one way coupling of the CFD High Mach Number Flow (HMNF) and mathematics module. The HMNF module evaluated the gas flow inside of a solid rocket motor using St. Robert's law modeling solid propellant burn rate, slip boundary conditions, and the supersonic outflow condition. Results from the HMNF model are used by the coefficient form of the mathematics module to determine the eigenvalues of the AVPE. The mathematics model is truncated at the nozzle sonic line, where a zero flux boundary condition is self-satisfying. The remaining boundaries are modeled with a zero flux boundary condition, assuming zero acoustic absorption on all surfaces. Pertinent results from these analyses are the complex valued eigenvalue and eigenvectors. Comparisons are made to the French results to evaluate the modeling approach. A comparison of the French results with that of the present analysis is displayed in figures 1 and 2, respectively. The graphic shows the first tangential eigenvector's real (a) and imaginary (b) values.

Fischbach, Sean R.↗