SEARCH · Search NASA

Results for “eigenvalue problems”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 919 records · Page 51

All sources NASA NTRS DOE OSTI

NASA NTRS1991

A time-accurate implicit method for chemically reacting flows at all Mach numbers

The objective of this work is to develop a unified solution algorithm capable of treating time-accurate chemically reacting flows at all Mach numbers, ranging from molecular diffusion velocities to supersonic speeds. A rescaled pressure term is used in the momentum equation to circumvent the singular behavior of pressure at low Mach numbers. A dual time-stepping integration procedure is established. The system eigenvalues become well behaved and have the same order of magnitude, even in the very low Mach number regime. The computational efficiency for moderate and high speed flow is competitive with the conventional density-based scheme. The capabilities of the algorithm are demonstrated by applying it to selected model problems including nozzle flows and flame dynamics.

Withington, J. P.↗

NASA NTRS1973

Divergence and Necessary Conditions for Extremums

The problem is considered of finding a dimension reducing transformation matrix B that maximizes the divergence in the reduced dimension for multi-class cases. A comparitively simple expression for the gradient of the average divergence with respect to B is developed. The developed expression for the gradient contains no eigenvectors or eigenvalues; also, all matrix inversions necessary to evaluate the gradient are available from computing the average divergence.

Quirein, J. A.↗

DOE OSTI2021

An Analytic Benchmark for Neutron Boltzmann Transport with Downscattering—Part I: Flux and Eigenvalue Solutions

Computing in the energy dimension is one of the greatest challenges confronting present-day deterministic neutron transport solvers. Accurately resolving the neutron flux as neutrons downscatter across resonances in the nuclear cross sections currently requires considerable computing power and suffers from approximation errors. Flux uncertainty resulting from the uncertainty of the resonance structure is the single-largest cause of reactivity uncertainty. Any additional reference solution for the critical neutron downscattering problem with resonance phenomena would be a boon to verification and validation of neutronics codes. This paper establishes a benchmark to verify the accuracy of neutron transport criticality solvers along the energy dimension. For the first time, the analytic solution of the flux amplitude is derived in the particular case of an infinite homogeneous medium with isotropic scattering in the center of mass and an arbitrary number of no-threshold, neutral particle reaction resonances (e.g., radiative capture, fission, and resonance scattering). Furthermore, original analytic expressions are established to quantify the discrepancy between the ψ k (E) and ψ α (E) flux amplitudes, respective solutions of the multiplication factor k, or the exponential time-evolution frequency α eigenproblems. The physical study of these relations led to analysis of their first-order relative difference near the criticality condition α=0. Finally, numerical solutions are provided to a benchmark problem constituted of the first resonance of 239 Pu, the 6.67-eV resonance of 238 U, and a scattering isotope with a flat cross section, allowing for the computational verification of the energy resolution of current neutron transport criticality codes. Through these novel results, this analytic benchmark can serve as a reference to verify the energy resolution and sensitivity analysis of neutron transport criticality calculations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

NASA NTRS1972

Spectral factorization in periodically time-varying systems and application to navigation problems.

Spectral factorization has been used previously to derive the steady-state solution of Kalman filtering equations without iteration for constant coefficient systems. The present work extends the spectral factorization algorithm to time-varying systems having periodic coefficient matrices for cases of both discrete and continuous systems. Time-consuming, expensive iterations of sequential covariance equations are not required to reach the final solution since this is an algebraic algorithm employing existing eigenvalue, eigenvector subroutines. The computer program incorporating the algorithm is suitable for sensitivity studies in formulating navigation and guidance strategies of low-thrust interplanetary missions. The determination of an optimum tracking pattern from an earth station is examined as an example.

Nishimura, T.↗

DOE OSTI2018

SIESTA-SIPs: Massively parallel spectrum-slicing eigensolver for an ab initio molecular dynamics package

Integration of Shift-and-Invert Parallel spectral transformation (SIPs) eigensolver (as implemented in the SLEPc library) into an ab initio molecular dynamics package, SIESTA, is described. The effectiveness of the code is demonstrated on applications to polyethylene chains, boron nitride sheets, and bulk water clusters. For problems with the same number of orbitals, the performance of the SLEPc eigensolver depends on the sparsity of the matrices involved, favoring reduced dimensional systems such as polyethylene or boron nitride sheets in comparison to bulk systems like water clusters. For all problems investigated, performance of SIESTA-SIPs exceeds the performance of SIESTA with default solver (ScaLAPACK) at the larger number of cores and the larger number of orbitals. A method that improves the load-balance with each iteration in the self-consistency cycle by exploiting the emerging knowledge of the eigenvalue spectrum is demonstrated

ab initio↗

DOE OSTI2016

ON THE GRAVITATIONAL STABILITY OF THE MACLAURIN DISK

We study the global gravitational stability of a gaseous self-gravitating Maclaurin disk in the absence of a halo. Further, we replace Newtonian gravity with the specific modified gravity theory known as MOG in the relevant literature. MOG is an alternative theory for addressing the dark matter problem without invoking exotic dark matter particles, and it possesses two free parameters α and μ {sub 0} in the weak field limit. We derive the equilibrium gravitational potential of the Maclaurin disk in MOG and develop a semianalytic method for studying the response of the disk to linear nonaxisymmetric perturbations. The eigenvalue spectrum of the normal modes of the disk is obtained, and its physical meaning has been explored. We show that Maclaurin disks are less stable in MOG than in Newtonian gravity. In fact, both parameters ( α , μ {sub 0}) have destabilizing effects on the disk. Interestingly, μ {sub 0} excites only the bar mode m = 2, while α affects all of the modes. More specifically, when α > 1, the bar mode is strongly unstable and unlike in Newtonian gravity cannot be avoided, at least in the weak field limit, with increasing the pressure support of the disk.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1987

Improvements to the fastex flutter analysis computer code

Modifications to the FASTEX flutter analysis computer code (UDFASTEX) are described. The objectives were to increase the problem size capacity of FASTEX, reduce run times by modification of the modal interpolation procedure, and to add new user features. All modifications to the program are operable on the VAX 11/700 series computers under the VAX operating system. Interfaces were provided to aid in the inclusion of alternate aerodynamic and flutter eigenvalue calculations. Plots can be made of the flutter velocity, display and frequency data. A preliminary capability was also developed to plot contours of unsteady pressure amplitude and phase. The relevant equations of motion, modal interpolation procedures, and control system considerations are described and software developments are summarized. Additional information documenting input instructions, procedures, and details of the plate spline algorithm is found in the appendices.

Taylor, Ronald F.↗

NASA NTRS1995

Visualization of 2-D and 3-D Tensor Fields

In previous work we have developed a novel approach to visualizing second order symmetric 2-D tensor fields based on degenerate point analysis. At degenerate points the eigenvalues are either zero or equal to each other, and the hyperstreamlines about these points give rise to trisector or wedge points. These singularities and their connecting hyperstreamlines determine the topology of the tensor field. In this study we are developing new methods for analyzing and displaying 3-D tensor fields. This problem is considerably more difficult than the 2-D one, as the richness of the data set is much larger. Here we report on our progress and a novel method to find, analyze and display 3-D degenerate points. First we discuss the theory, then an application involving a 3-D tensor field, the Boussinesq problem with two forces.

Hesselink, Lambertus↗

DOE OSTI2017

Deflation as a method of variance reduction for estimating the trace of a matrix inverse

Many fields require computing the trace of the inverse of a large, sparse matrix. The typical method used for such computations is the Hutchinson method which is a Monte Carlo (MC) averaging over matrix quadratures. To improve its convergence, several variance reductions techniques have been proposed. In this paper, we study the effects of deflating the near null singular value space. We make two main contributions. First, we analyze the variance of the Hutchinson method as a function of the deflated singular values and vectors. Although this provides good intuition in general, by assuming additionally that the singular vectors are random unitary matrices, we arrive at concise formulas for the deflated variance that include only the variance and mean of the singular values. We make the remarkable observation that deflation may increase variance for Hermitian matrices but not for non-Hermitian ones. This is a rare, if not unique, property where non-Hermitian matrices outperform Hermitian ones. The theory can be used as a model for predicting the benefits of deflation. Second, we use deflation in the context of a large scale application of "disconnected diagrams" in Lattice QCD. On lattices, Hierarchical Probing (HP) has previously provided an order of magnitude of variance reduction over MC by removing "error" from neighboring nodes of increasing distance in the lattice. Although deflation used directly on MC yields a limited improvement of 30% in our problem, when combined with HP they reduce variance by a factor of over 150 compared to MC. For this, we pre-computated 1000 smallest singular values of an ill-conditioned matrix of size 25 million. Furthermore, using PRIMME and a domain-specific Algebraic Multigrid preconditioner, we perform one of the largest eigenvalue computations in Lattice QCD at a fraction of the cost of our trace computation.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1992

A numerical method for systems of conservation laws of mixed type admitting hyperbolic flux splitting

The present treatment of elliptic regions via hyperbolic flux-splitting and high order methods proposes a flux splitting in which the corresponding Jacobians have real and positive/negative eigenvalues. While resembling the flux splitting used in hyperbolic systems, the present generalization of such splitting to elliptic regions allows the handling of mixed-type systems in a unified and heuristically stable fashion. The van der Waals fluid-dynamics equation is used. Convergence with good resolution to weak solutions for various Riemann problems are observed.

Shu, Chi-Wang↗

DOE OSTI2022

Native Natural circulation in VERA

This work seeks to introduce a native natural circulation solver to VERA's thermohydraulics capabilities. This work begins with initial investigations into the viability of such a solver by determining the fundamental equations as well as necessary inputs. The method was then implemented in the form of a Python script coupled to CTF which was compared to TRACE. Once viability of the natural circulation solver was established, it was then implemented natively in MPACT for use with previously created simplified thermohydraulics solvers. This new implementation of the native natural circulation solver in MPACT is then tested for single physics problems for both a BWR and PWR single channel model and compared to TRACE where it shows an error of about 30% for BWRs and about 15% for PWRs. The solver is additionally tested for NuScale based models where it demonstrates an error to the reported flow rate of about 10%, resulting in an eigenvalue error of only 138 pcm when comparing fixed flow rate multiphysics runs. Finally, the solver is tested in multiphysics systems for a small PWR assembly, a small BWR assembly, and a full core approximate model of the NuScale design. In these multiphysics runs, it demonstrates no impact on multiphysics convergence stability, as well as negligible impact on runtimes. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

DOE OSTI2024

Data‐driven variational method for discrepancy modeling: Dynamics with small‐strain nonlinear elasticity and viscoelasticity

Abstract The effective inclusion of a priori knowledge when embedding known data in physics‐based models of dynamical systems can ensure that the reconstructed model respects physical principles, while simultaneously improving the accuracy of the solution in the previously unseen regions of state space. This paper presents a physics‐constrained data‐driven discrepancy modeling method that variationally embeds known data in the modeling framework. The hierarchical structure of the method yields fine scale variational equations that facilitate the derivation of residuals which are comprised of the first‐principles theory and sensor‐based data from the dynamical system. The embedding of the sensor data via residual terms leads to discrepancy‐informed closure models that yield a method which is driven not only by boundary and initial conditions, but also by measurements that are taken at only a few observation points in the target system. Specifically, the data‐embedding term serves as residual‐based least‐squares loss function, thus retaining variational consistency. Another important relation arises from the interpretation of the stabilization tensor as a kernel function, thereby incorporating a priori knowledge of the problem and adding computational intelligence to the modeling framework. Numerical test cases show that when known data is taken into account, the data driven variational (DDV) method can correctly predict the system response in the presence of several types of discrepancies. Specifically, the damped solution and correct energy time histories are recovered by including known data in the undamped situation. Morlet wavelet analyses reveal that the surrogate problem with embedded data recovers the fundamental frequency band of the target system. The enhanced stability and accuracy of the DDV method is manifested via reconstructed displacement and velocity fields that yield time histories of strain and kinetic energies which match the target systems. The proposed DDV method also serves as a procedure for restoring eigenvalues and eigenvectors of a deficient dynamical system when known data is taken into account, as shown in the numerical test cases presented here.

Masud, Arif↗

DOE OSTI2019

Hybrid super homogenization and discontinuity factor method for continuous finite element diffusion

This paper presents a novel homogenization equivalence technique aiming to simultaneously leveragethe simplicity of the Super Homogenization (SPH) method to reproduce reference reaction rates andthe ability to preserve reference leakage rates at desired surfaces through Discontinuity Factors (DF).The need for this new class of methods arises from the inability of the current state-of-the-art SPH technology to properly reproduce the reactor multiplication factor for problems with significant leakage. This work shows that this defect lies in the use of normalization factors in the SPH algorithm: while they are necessary with purely reflecting problems to ensure uniqueness of the solution, they introduce homogenization inconsistencies if at least one vacuum boundary condition is present. Two solutions to this problem are presented in this work: (i) to simply remove the normalization factor or (ii) to introduce additional degrees of freedom in the form of DFs in such a way that the normalization factors can still constrain the problem. While the former clearly offers unrivaled simplicity and can lead to very satisfactory results for leakage-dominated cores or if spatial restriction of the SPH regions is applied – as demonstrated for the High Temperature Test Reactor, the latter is more robust and does not require to scale the fission terms with the reference eigenvalue.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

NASA NTRS1981

Acoustic transmission in non-uniform ducts with mean flow. I - The method of weighted residuals. II - The finite element method

The problem of acoustic transmission through nonuniform ducts containing a high-speed subsonic flow is studied by means of the method of weighted residuals in the form of a modified Galerkin method and a Galerkin formulation of the finite element method. The method of weighted residuals is shown to employ the basis functions generated from eigenvalue calculations for the case of no flow, and is verified by comparison with exact eigenvalue calculations in the uniform duct case and numerical solutions of the one-dimensional form of the equations in the nonuniform duct case. The finite element scheme based on both the Galerkin method and the residual least squares method and employing eight-noded isoparametric elements is presented and used to investigate multimodal propagation by the coupling of the solution in the duct nonuniform section to modal expansions in uniform sections. Comparison of the results of the two methods reveals them to be in substantial agreement, and predicts the importance of multimodal interactions at high Mach numbers.

Eversman, W.↗

NASA NTRS1986

Semi-implicit and fully implicit shock-capturing methods for hyperbolic conservation laws with stiff source terms

Some numerical aspects of finite-difference algorithms for nonlinear multidimensional hyperbolic conservation laws with stiff nonhomogenous (source) terms are discussed. If the stiffness is entirely dominated by the source term, a semi-implicit shock-capturing method is proposed provided that the Jacobian of the soruce terms possesses certain properties. The proposed semi-implicit method can be viewed as a variant of the Bussing and Murman point-implicit scheme with a more appropriate numerical dissipation for the computation of strong shock waves. However, if the stiffness is not solely dominated by the source terms, a fully implicit method would be a better choice. The situation is complicated by problems that are higher than one dimension, and the presence of stiff source terms further complicates the solution procedures for alternating direction implicit (ADI) methods. Several alternatives are discussed. The primary motivation for constructing these schemes was to address thermally and chemically nonequilibrium flows in the hypersonic regime. Due to the unique structure of the eigenvalues and eigenvectors for fluid flows of this type, the computation can be simplified, thus providing a more efficient solution procedure than one might have anticipated.

Yee, H. C.↗

NASA NTRS1987

Semi-implicit and fully implicit shock-capturing methods for hyperbolic conservation laws with stiff source terms

Some numerical aspects of finite-difference algorithms for nonlinear multidimensional hyperbolic conservation laws with stiff nonhomogeneous (source) terms are discussed. If the stiffness is entirely dominated by the source term, a semi-implicit shock-capturing method is proposed provided that the Jacobian of the source terms possesses certain properties. The proposed semi-implicit method can be viewed as a variant of the Bussing and Murman point-implicit scheme with a more appropriate numerical dissipation for the computation of strong shock waves. However, if the stiffness is not solely dominated by the source terms, a fully implicit method would be a better choice. The situation is complicated by problems that are higher than one dimension, and the presence of stiff source terms further complicates the solution procedures for alternating direction implicit (ADI) methods. Several alternatives are discussed. The primary motivation for constructing these schemes was to address thermally and chemically nonequilibrium flows in the hypersonic regime. Due to the unique structure of the eigenvalues and eigenvectors for fluid flows of this type, the computation can be simplified, thus providing a more efficient solution procedure than one might have anticipated.

Yee, H. C.↗

NASA NTRS1986

Numerical simulation of a controlled boundary layer

The problem of interest is the boundary layer over a flat plate. The three standard laminar flow control (LFC) techniques are pressure gradient, suction, and heating. The parameters used to describe the amount of control in the context of the boundary layer equations are introduced. The numerical method required to find the mean flow, the linear eigenvalues of the Orr-Sommerfeld equation, and the full, nonlinear, 3-D solution of the Navier-Stokes equations are outlined. A secondary instability exists for the parallel boundary subject to uniform pressure gradient, suction, or heating. Selective control of the spanwise mode reduces the secondary instability in the parallel boundary layer at low Reynolds number.

Zang, Thomas A.↗

NASA NTRS1990

Partitioning sparse matrices with eigenvectors of graphs

The problem of computing a small vertex separator in a graph arises in the context of computing a good ordering for the parallel factorization of sparse, symmetric matrices. An algebraic approach for computing vertex separators is considered in this paper. It is shown that lower bounds on separator sizes can be obtained in terms of the eigenvalues of the Laplacian matrix associated with a graph. The Laplacian eigenvectors of grid graphs can be computed from Kronecker products involving the eigenvectors of path graphs, and these eigenvectors can be used to compute good separators in grid graphs. A heuristic algorithm is designed to compute a vertex separator in a general graph by first computing an edge separator in the graph from an eigenvector of the Laplacian matrix, and then using a maximum matching in a subgraph to compute the vertex separator. Results on the quality of the separators computed by the spectral algorithm are presented, and these are compared with separators obtained from other algorithms for computing separators. Finally, the time required to compute the Laplacian eigenvector is reported, and the accuracy with which the eigenvector must be computed to obtain good separators is considered. The spectral algorithm has the advantage that it can be implemented on a medium-size multiprocessor in a straightforward manner.

Pothen, Alex↗