Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “eigenvectors”

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

Asymptotic Representation for the Eigenvalues of a Non-selfadjoint Operator Governing the Dynamics of an Energy Harvesting Model

We consider a well known model of a piezoelectric energy harvester. The harvester is designed as a beam with a piezoceramic layer attached to its top face (unimorph configuration). A pair of thin perfectly conductive electrodes is covering the top and the bottom faces of the piezoceramic layer. These electrodes are connected to a resistive load. The model is governed by a system consisting of two equations. The first of them is the equation of the Euler–Bernoulli model for the transverse vibrations of the beam and the second one represents the Kirchhoff’s law for the electric circuit. Both equations are coupled due to the direct and converse piezoelectric effects. The boundary conditions for the beam equations are of clamped-free type. We represent the system as a single operator evolution equation in a Hilbert space. The dynamics generator of this system is a non-selfadjoint operator with compact resolvent. Our main result is an explicit asymptotic formula for the eigenvalues of this generator, i.e., we perform the modal analysis for electrically loaded (not short-circuit) system. We show that the spectrum splits into an infinite sequence of stable eigenvalues that approaches a vertical line in the left half plane and possibly of a finite number of unstable eigenvalues. This paper is the first in a series of three works. In the second one we will prove that the generalized eigenvectors of the dynamics generator form a Riesz basis (and, moreover, a Bari basis) in the energy space. In the third paper we will apply the results of the first two to control problems for this model.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Leveraging operator learning to accelerate convergence of the preconditioned conjugate gradient method

We propose a new deflation strategy to accelerate the convergence of the preconditioned conjugate gradient (PCG) method for solving parametric large-scale linear systems of equations. Unlike traditional deflation techniques that rely on eigenvector approximations or recycled Krylov subspaces, we generate the deflation subspaces using operator learning, specifically the Deep Operator Network (DeepONet). To this aim, we introduce two complementary approaches for assembling the deflation operators. The first approach approximates near-null space vectors of the discrete PDE operator using the basis functions learned by the DeepONet. The second approach directly leverages solutions predicted by the DeepONet. To further enhance convergence, we also propose several strategies for prescribing the sparsity pattern of the deflation operator. Here, a comprehensive set of numerical experiments encompassing steady-state, time-dependent, scalar, and vector-valued problems posed on both structured and unstructured geometries is presented and demonstrates the effectiveness of the proposed DeepONet-based deflated PCG method, as well as its generalization across a wide range of model parameters and problem resolutions.

Deflation↗

Data processing pipeline for Tianlai experiment

The Tianlai project is a 21cm intensity mapping experiment for detecting dark energy by measuring the baryon acoustic oscillation (BAO) features in the large scale structure power spectrum. This experiment provides an opportunity to test the data processing methods for cosmological 21cm signal extraction, which is still a great challenge in current radio astronomy research. The 21cm signal is much weaker than the foregrounds and easily aected by the imperfections in the instrumental responses. Furthermore, processing the large volumes of interferometer data poses a practical challenge. We have developed a data processing pipeline called tlpipe to process the drift scan survey data from the Tianlai experiment. It performs oine data processing tasks such as radio frequency interference (RFI) agging, array calibration, binning, and map-making, etc. It also includes utility functions needed for the data analysis, such as data selection, transformation, visualization and others. A number of new algorithms are implemented, for example the eigenvector decomposition method for array calibration and the Tikhnov regularization for m-mode analysis. In this paper we describe the design and implementation of the pipeline and illustrate its functions with some analysis of real data. Finally, we outline directions for future development of this publicly code.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Distributed finite-time estimation of the bounds on algebraic connectivity for directed graphs

This paper studied distributed estimation of the bounds on algebraic connectivity for a directed graph (i.e., digraph). As is well known, the main challenge of the underlying problem is how to enable local awareness of an entity otherwise prone to global information, in the presence of communication topology. More specifically, we introduce a novel state-dependent approach to estimate the bounds on algebraic connectivity with mild requirement on topology and communication effort. Finally, compared with existing results, the proposed algorithm does not estimate eigenvalues or eigenvectors directly, rather it exploits their implications on the consensus procedure, and achieves a tradeoff between estimation accuracy and topological/communication requirement, and its convergence can be expected in a finite time. Simulation results verified the performance of the proposed strategy.

42 ENGINEERING↗

Two-tier model reduction of viscoelastically damped finite element models

Transient simulations of linear viscoelastically damped structures necessitate critical computational resources to directly integrate the full-order finite element model with time-stepping algorithms. Traditional modal reduction techniques are not directly applicable to these systems since viscoelastic materials depend on time and frequency. A more appropriate reduction basis is obtained from the nonlinear, complex eigenvalue problem, whose eigenvectors capture the appropriate kinematics and enable frequency-based mode selection; unfortunately, the computational cost is prohibitive for computing these modes from large-scale engineering models. To address this shortcoming, this work proposes a novel two-tier reduction procedure to reduce the upfront cost of solving the complex, nonlinear eigenvalue problem. The first reduction step reduces the full-order model with real mode shapes linearized about various centering frequencies to capture the kinematics over a full range of viscoelastic material behavior (glassy, rubbery, and glass-transition zones). This tier-one reduction preserves time-temperature superposition and allows the equations to depend parametrically on operating temperature. The second-level reduction then solves the complex, nonlinear eigenmode solutions in the tier-one reduced space about a fixed temperature to further reduce the equations-of-motion. The method is demonstrated on a cantilevered sandwich plate to display its accuracy and efficiency in comparison to full-order model predictions.

97 MATHEMATICS AND COMPUTING↗

Pushing memory bandwidth limitations through efficient implementations of Block-Krylov space solvers on GPUs

Lattice quantum chromodynamics simulations in nuclear physics have benefited from a tremendous number of algorithmic advances such as multigrid and eigenvector deflation. These improve the time to solution but do not alleviate the intrinsic memory-bandwidth constraints of the matrix-vector operation dominating iterative solvers. Batching this operation for multiple vectors and exploiting cache and register blocking can yield a super-linear speed up. Block-Krylov solvers can naturally take advantage of such batched matrix-vector operations, further reducing the iterations to solution by sharing the Krylov space between solves. However, practical implementations typically suffer from the quadratic scaling in the number of vector-vector operations. Here, using the QUDA library, we present an implementation of a block-CG solver on NVIDIA GPUs which reduces the memory-bandwidth complexity of vector-vector operations from quadratic to linear. We present results for the HISQ discretization, showing a 5x speedup compared to highly-optimized independent Krylov solves on NVIDIA's SaturnV cluster.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

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↗

Hybrid eigensolvers for nuclear configuration interaction calculations

We examine and compare several iterative methods for solving large-scale eigenvalue problems arising from nuclear structure calculations. In particular, we discuss the possibility of using block Lanczos method, a Chebyshev filtering based subspace iterations and the residual minimization method accelerated by direct inversion of iterative subspace (RMM-DIIS) and describe how these algorithms compare with the standard Lanczos algorithm and the locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm. Although the RMM-DIIS method does not exhibit rapid convergence when the initial approximations to the desired eigenvectors are not sufficiently accurate, it can be effectively combined with either the block Lanczos or the LOBPCG method to yield a hybrid eigensolver that has several desirable properties. We will describe a few practical issues that need to be addressed to make the hybrid solver efficient and robust.

97 MATHEMATICS AND COMPUTING↗

Seismic monitoring of EGS fracture stimulations at Utah FORGE (Part 1): Time-lapse variations of b-values and Shear-wave Splitting Rates of induced microearthquakes

Characterizing geologic formations near geothermal wells is crucial for efficient extraction of subsurface geothermal energy resources. To monitor effective fracture stimulation of enhanced geothermal systems (EGS), we analyze a catalog of induced microearthquakes to characterize seismicity induced by Phase 2C fracture stimulations of the Utah FORGE project and derive the b-values for 424 induced microearthquakes in three stages of fracture stimulation. Here, we find the time-lapse variations of these b-values. We apply eigenvector rotation and waveform correlation to 3C geophone data to separate fast S 1 and slow S 2 waves, determine their directions, measure their lag time, and calculate the S-wave splitting rate (SSR) for six induced microearthquakes in Stage 1 and 21 in Stage 3. Both SSR values and b-values increase with time. The increase in these values may be related to heavily fractured zones created by fracture stimulations during Stage 2 injections. Large and highly variable SSR values in Stage 3 may reflect heterogeneities in the fracture zones. Time-lapse variations of SSR values and b-values may be one of the most useful approaches to monitoring and characterizing the effectiveness and efficiency of various types of fracture stimulations.

58 GEOSCIENCES↗

Eigensensitivity analysis of subgrid-scale stresses in large-eddy simulation of a turbulent axisymmetric jet

The study of complex turbulent flows by means of large-eddy simulation approaches has become increasingly popular in many scientific and engineering applications. The underlying filtering operation of the approach enables to significantly reduce the spatial and temporal resolution requirements by means of representing only large-scale motions. However, the small-scale stresses and their effects on the resolved flow field are not negligible, and therefore require additional modeling. As a consequence, the assumptions made in the closure formulations become potential sources of model-form uncertainty that can impact the quantities of interest. The objective of this work, thus, is to perform a model-form sensitivity analysis in large-eddy simulations of an axisymmetric turbulent jet following an eigenspace-based strategy recently proposed. The approach relies on introducing perturbations to the decomposed subgrid-scale stress tensor within a range of physically plausible values. These correspond to discrepancy in magnitude (trace), anisotropy (eigenvalues) and orientation (eigenvectors) of the normalized, small-scale stresses with respect to a given tensor state, such that propagation of their effects can be assessed. As a result, the generality of the framework with respect to the six degrees of freedom of the small-scale stress tensor makes it also suitable for its application within data-driven techniques for improved subgrid-scale modeling.

42 ENGINEERING↗

Discrete Green’s functions and spectral graph theory for computationally efficient thermal modeling

Here, this work concerns solutions of the heat equation with the spectral graph method, for which the temperature is defined at discrete points in the domain and the spatial relationship among the points is described by a graph. The heat equation on the graph is solved using matrix techniques involving the eigenvectors and eigenvalues of the Laplacian matrix. The spectral graph approach precludes the computationally intensive meshing and numerous time-integration steps of the finite element method. In the present work, the spectral graph method is extended to include heat loss at the boundaries with a generalized boundary condition, and physics-based edge weights are introduced which simplify the calibration process. From this approach a discrete Green’s function is defined which allows for solutions under a variety of heating conditions including: space-varying initial conditions; time-and-space varying internal heating; and, time-and-space-varying heating at boundaries of type 1 (Dirichlet), type 2 (Neumann) and type 3 (Robin). Results are provided for benchmark heat transfer problems in one spatial dimension and in three spatial dimensions, and verification is provided by comparison with exact analytical solutions and finite difference solutions. The spectral graph method converges within 0.4% error of the analytical solution. The practical utility of the approach is demonstrated by thermal simulation of a multilayer additive manufacturing process. The spectral graph results are compared to experimentally-obtained temperature data for two metal parts, with error less than 5% of the experimental measurements, with computation time less than one minute on a desktop computer.

36 MATERIALS SCIENCE↗

A stochastic Galerkin method for first-order quasilinear hyperbolic systems with uncertainty

This paper is concerned with generalized polynomial chaos (gPC) approximation for first-order quasilinear hyperbolic systems with uncertainty. The one-dimensional (1D) hyperbolic system is first symmetrized with the aid of left eigenvector matrix of the Jacobian matrix. Then the gPC stochastic Galerkin method is applied to derive a provably symmetrically hyperbolic equations for the gPC expansion coefficients. The resulting deterministic gPC Galerkin system is discretized by a path-conservative finite volume WENO scheme in space and a third-order total variation diminishing Runge–Kutta method in time. The method is further extended to two-dimensional (2D) quasilinear hyperbolic system with uncertainty, where the symmetric hyperbolicity of the one-dimensional gPC Galerkin system is carried over via an operator splitting technique. Several numerical experiments are conducted to demonstrate the accuracy and effectiveness of the proposed gPC stochastic Galerkin method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Computing resonant modes of accelerator cavities by solving nonlinear eigenvalue problems via rational approximation

Here, we present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems arising from the modeling of particle accelerator cavities. The eigenvalue nonlinearity in these problems results from the use of waveguides to couple external power sources or to allow certain excited electromagnetic modes to exit the cavity. We use a rational approximation to reduce the nonlinear eigenvalue problem first to a rational eigenvalue problem. We then apply a special linearization procedure to turn the rational eigenvalue problem into a larger linear eigenvalue problem with the same eigenvalues, which can be solved by existing iterative methods. By using a compact scheme to represent both the linearized operator and the eigenvectors to be computed, we obtain a numerical method that only involves solving linear systems of equations of the same dimension as the original nonlinear eigenvalue problem. We refer to this method as a compact rational Krylov (CORK) method. We implemented the CORK method in the Omega3P module of the Advanced Computational Electromagnetic 3D Parallel (ACE3P) simulation suite and validated it by comparing the computed cavity resonant frequencies and damping Q factors of a small model problem to those obtained from a fitting procedure that uses frequency responses computed by another ACE3P module called S3P. We also used the CORK method to compute trapped modes damped in an ideal eight 9-cell SRF cavity cryomodule. This was the first time it was possible to compute these modes directly. The damping Q factors of the computed modes match well with those measured in experiments and the difference in resonant frequencies is within the range introduced by cavity imperfection. Therefore, the CORK method is an extremely valuable tool for computational cavity design.

43 PARTICLE ACCELERATORS↗

Pressure-induced evolution of the lattice dynamics for selected UO 3 polymorphs

Uranium trioxide (UO 3 ) is a stable chemical form of uranium oxide with multiple polymorphs found throughout the nuclear fuel cycle. The pressure-induced changes in the structure and lattice dynamics of four of these polymorphs are simulated with density functional perturbation theory and analyzed. Two phases, α- and δ-UO 3 are found to exhibit an isotropic response to pressure and do not undergo any changes in coordination geometry up to ~40 GPa. In contrast, the other two phases investigated, β- and γ-UO 3 , exhibit an anisotropic response to pressure. Decomposition of the phonon eigenvectors allows us to assign specific pressure-induced structural changes to individual phonon modes. Here, this analysis has been performed on a per atom basis for the relatively simple α- and δ-UO 3 structures, which have one symmetrically unique uranium site, and on a per coordination environment basis for β- and γ-UO 3 , which have multiple U sites.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Theoretical study of negative thermal expansion mechanism of ZnF{sub 2}

Graphical abstract: ZnF{sub 2} owns open-framework structure and its negative thermal expansion (NTE) properties have been confirmed using a first-principles calculation. According to the phonon eigenvectors and group theory analysis, the lowest frequency (48.9 cm{sup -1}, B{sub 1g} mode) rigid unit mode (RUM) of ZnF{sub 6} causes a rotary coupling between two adjacent octahedrons and makes the Zn-Zn distance shorter, which is considered to be most responsible for the NTE properties of ZnF{sub 2}. Highlights: Black-Right-Pointing-Pointer The NTE properties of ZnF{sub 2} are confirmed using a first-principles calculation. Black-Right-Pointing-Pointer Phonon mode classification and Grueneisen parameters are systematically presented. Black-Right-Pointing-Pointer The rigid unit mode causes a rotary coupling and makes the Zn-Zn distance shorter. Black-Right-Pointing-Pointer The optical branch with the lowest frequency is most responsible for the NTE. -- Abstract: ZnF{sub 2} is reported to exhibit negative thermal expansion (NTE) at lower temperatures very recently. In this article, we present the electronic and NTE properties of ZnF{sub 2} using a first-principles calculation. Our results show that ZnF{sub 2} is an insulator with a direct band gap and a strong hybridization occurs between Zn-3p, 4s and F-2p states. The related calculations on NTE properties are obtained within the quasi-harmonic approximation. The resulting relationship between volume and temperature confirms the NTE properties. Besides, we discuss the NTE mechanism in accordance to phonon vibrational modes. The phonon vibrational modes contributing to the NTE are singled out by Grueneisen parameters and all these modes are low-frequency optical phonons. The lowest frequency rigid unit mode (RUM) of ZnF{sub 6} causes a rotary coupling between two adjacent octahedrons and makes the Zn-Zn distance shorter, which is most responsible for the NTE properties of ZnF{sub 2}.

36 MATERIALS SCIENCE↗

Calculating infinite-medium α-eigenvalue spectra with Monte Carlo using a transition rate matrix method

The time-dependent behavior of the energy spectrum in neutron transport was investigated with a formulation, based on continuous-time Markov processes, for computing α eigenvalues and eigenvectors in an infinite medium. In this study, a research Monte Carlo code called “TORTE” (To Obtain Real Time Eigenvalues) was created and used to estimate elements of a transition rate matrix. TORTE is capable of using both multigroup and continuous-energy nuclear data, and verification was performed. Eigenvalue spectra for infinite homogeneous mixtures were obtained, and an eigenfunction expansion was used to investigate transient behavior of the neutron energy spectrum.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Principal Component Analysis of azimuthal flow in intermediate-energy heavy-ion reactions

Principal Component Analysis (PCA) via Singular Value Decomposition (SVD) of large datasets is an adaptive exploratory method to uncover natural patterns underlying the data. Several recent applications of the PCA-SVD to event-by-event single-particle azimuthal angle distribution matrices in ultra-relativistic heavy-ion collisions at RHIC-LHC energies indicate that the sine and cosine functions chosen a priori in the traditional Fourier analysis are naturally the most optimal basis for azimuthal flow studies according to the data itself. We perform PCA-SVD analyses of mid-central Au+Au collisions at $E$ $beam$ / $A$ =1.23 GeV simulated using an isospin-dependent Boltzmann-Uehling-Uhlenbeck (IBUU) transport model to address the following two questions: (1) if the principal components of the covariance matrix of nucleon azimuthal angle distributions in heavy-ion reactions around 1 GeV/nucleon are naturally sine and/or cosine functions and (2) what if any advantages the PCA-SVD may have over the traditional flow analysis using the Fourier expansion for studying the EOS of dense nuclear matter. In conclusion, we find that (1) in none of our analyses the principal components come out naturally as sine and/or cosine functions, (2) while both the eigenvectors and eigenvalues of the covariance matrix are appreciably EOS dependent, the PCA-SVD has no apparent advantage over the traditional Fourier analysis for studying the EOS of dense nuclear matter using the azimuthal collective flow in heavy-ion collisions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Autoencoder node saliency: Selecting relevant latent representations

The autoencoder is an artificial neural network that performs nonlinear dimension reduction and learns hidden representations of unlabeled data. With a linear transfer function it is similar to the principal component analysis (PCA). While both methods use weight vectors for linear transformations, the autoencoder does not come with any indication similar to the eigenvalues in PCA that are paired with eigenvectors. In this work, we propose a novel autoencoder node saliency method that examines whether the features constructed by autoencoders exhibit properties related to known class labels. The supervised node saliency ranks the nodes based on their capability of performing a learning task. It is coupled with the normalized entropy difference (NED). We establish a property for NED values to verify classifying behaviors among the top ranked nodes. Lastly, by applying our methods to real datasets, we demonstrate their ability to provide indications on the performing nodes and explain the learned tasks in autoencoders.

97 MATHEMATICS AND COMPUTING↗