Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “eigenvalue problem”

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 829 records · Page 46
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Lanczos Algorithm, the Transfer Matrix, and the Signal-to-Noise Problem

This Letter introduces a method for determining the energy spectrum of lattice quantum chromodynamics by applying the Lanczos algorithm to the transfer matrix and using a bootstrap generalization of the Cullum-Willoughby method to filter out spurious eigenvalues. Proof-of-principle analyses of the simple harmonic oscillator and the lattice quantum chromodynamics proton mass demonstrate that this method provides faster ground-state convergence than the “effective mass,” which is related to the power-iteration algorithm. Lanczos provides more accurate energy estimates than multistate fits to correlation functions with small imaginary times while achieving comparable statistical precision. Two-sided error bounds are computed for Lanczos results and guarantee that excited-state effects cannot shift Lanczos results far outside their statistical uncertainties.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2017

The structure and propagation of laminar flames under autoignitive conditions

The laminar flame speed s l is an important reference quantity for characterising and modelling combustion. Experimental measurements of laminar flame speed require the residence time of the fuel/air mixture (τ f ) to be shorter than the autoignition delay time (τ). This presents a considerable challenge for conditions where autoignition occurs rapidly, such as in compression ignition engines. As a result, experimental measurements in typical compression ignition engine conditions do not exist. Simulations of freely propagating premixed flames, where the burning velocity is found as an eigenvalue of the solution, are also not well posed in such conditions, since the mixture ahead of the flame can autoignite, leading to the so called “cold boundary problem”. In this paper, a numerical method for estimating a reference flame speed, s R , is proposed that is valid for laminar flame propagation at autoignitive conditions. Two isomer fuels are considered to test this method: ethanol, which in the considered conditions is a single-stage ignition fuel; and dimethyl ether, which has a temperature-dependent single- or two-stage ignition and a negative temperature coefficient regime for τ. Calculations are performed for the flame position in a one-dimensional computational domain with inflow-outflow boundary conditions, as a function of the inlet velocity U I and for stoichiometric fuel–air premixtures. The response of the flame position, L F , to U I shows distinct stabilisation regimes. For single-stage ignition fuels, at low U I the flame speed exceeds U I and the flame becomes attached to the inlet. Above a critical U I value, the flame detaches from the inlet and L f becomes extremely sensitive to U I until, for sufficiently high U I , the sensitivity decreases and L f corresponds to the location expected from a purely autoignition stabilised flame. The transition from the attached to the autoignition regimes has a corresponding peak dL f /dU I value which is proposed to be a unique reference flame speed s R for single-stage ignition fuels. For two-stage ignition fuels, there is an additional stable regime where a high-temperature flame propagates into a pool of combustion intermediates generated by the first stage of autoignition. This results in two peaks in dL f /dU I and therefore two reference flame speed values. The lower value corresponds to the definition of s R for single-stage ignition fuels, while the higher value exists only for two-stage ignition fuels and corresponds to a high temperature flame propagating into the first stage of autoignition and is denoted s R ' . Finally, a transport budget analysis for low- and high-temperature radical species is also performed, which confirms that the flame structures at U I = s R and U I = s R ' do indeed correspond to premixed flames (deflagrations), as opposed to spontaneous ignition fronts which do not have a unique propagation speed.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2016

Comment on “Approximate solutions of the Dirac equation for the Rosen-Morse potential including the spin-orbit centrifugal term” [J. Math. Phys. 51, 023525 (2010)]

It is shown that the application of the Nikiforov-Uvarov method by Ikhdair for solving the Dirac equation with the radial Rosen-Morse potential plus the spin-orbit centrifugal term is inadequate because the required conditions are not satisfied. The energy spectra given is incorrect and the wave functions are not physically acceptable. We clarify the problem and prove that the spinor wave functions are expressed in terms of the generalized hypergeometric functions {sub 2}F{sub 1}(a, b, c; z). The energy eigenvalues for the bound states are given by the solution of a transcendental equation involving the hypergeometric function.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1978

Minimal order observers for linear functions of the state vector

The problem of estimating linear functions of a state vector in a multi-input/output system is considered. A simple lower bound on the observer order with arbitrary eigenvalues is established. Algorithms to construct minimal-order stable (or arbitrary dynamics) observers are also outlined.

Srinathkumar, S.↗
NASA NTRS1983

Direct and implicit optical matrix-vector algorithms

New direct and implicit algorithms for optical matrix-vector and systolic array processors are considered. Direct rather than indirect algorithms to solve linear systems and implicit rather than explicit solutions to solve second-order partial differential equations are discussed. In many cases, such approaches more properly utilize the advantageous features of optical systolic array processors. The matrix-decomposition operation (rather than solution of the simplified matrix-vector equation that results) is recognized as the computationally burdensome aspect of such problems that should be computed on an optical system. The Householder QR matrix-decomposition algorithm is considered as a specific example of a direct solution. Extensions to eigenvalue computation and formation of matrices of special structure are also noted.

Casasent, D.↗
NASA NTRS1992

On the placement of active members in adaptive truss structures for vibration control

The problem of optimal placement of active members which are used for vibration control in adaptive truss structures is investigated. The control scheme is based on the method of eigenvalue assignment as a means of shaping the transient response of the controlled adaptive structures, and the minimization of required control action is considered as the optimization criterion. To this end, a performance index which measures the control strokes of active members is formulated in an efficient way. In order to reduce the computation burden, particularly for the case where the locations of active members have to be selected from a large set of available sites, several heuristic searching schemes are proposed for obtaining the near-optimal locations. The proposed schemes significantly reduce the computational complexity of placing multiple active members to the order of that when a single active member is placed.

Lu, L.-Y.↗
NASA NTRS1993

A study of eigenvalue sensitivity for hydrodynamic stability operators

The eigenvalue sensitivity for hydrodynamic stability operators is investigated. Classical matrix perturbation techniques as well as the concept of epsilon-pseudospectra are applied to show that parts of the spectrum are highly sensitive to small perturbations. Applications are drawn from incompressible plane Couette flow, trailing line vortex flow, and compressible Blasius boundary-layer flow. Parameter studies indicate a monotonically increasing effect of the Reynolds number on the sensitivity. The phenomenon of eigenvalue sensitivity is due to the nonnormality of the operators and their discrete matrix analogs and may be associated with large transient growth of the corresponding initial value problem.

Schmid, Peter J.↗
DOE OSTI2019

(U) Differences in the Use of Isotopic $χ$ Vectors Demonstrated with an Analytic k ∞ Problem (And Verification of SENSMG and MCNP6’s KSEN)

Comparisons of responses and first-order sensitivities of responses to the neutron fission spectrum ( χ ) have been done using different transport methods. Kodeli and Slavič compared sensitivities from Monte Carlo, deterministic, and method of characteristics of k eff in the SNEAK-7 benchmark, and the agreement was reasonable. Yamamoto compared deterministic and Monte Carlo sensitivities of k - and α -eigenvalues to the fission χ , but only for material (i.e. single-isotope) values of the fission χ . Haeck et al. compared Monte Carlo and deterministic sensitivities of k eff to the fission χ of individual isotopes for several benchmarks, and the agreement was excellent (except, strangely, for U-236). Kiedrowski and Brown compared Monte Carlo and analytic sensitivities of k ∞ to the fission χ in analytic problems, but only for material values of the fission χ .

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
DOE OSTI2020

Uncoupling Electrokinetic Flow Solutions

The continuum-scale electrokinetic porous-media flow and excess charge redistribution equations are uncoupled using eigenvalue decomposition. The uncoupling results in a pair of independent diffusion equations for “intermediate” potentials subject to modified material properties and boundary conditions. The fluid pressure and electrostatic potential are then found by recombining the solutions to the two intermediate uncoupled problems in a matrix-vector multiplication. Expressions for the material properties or source terms in the intermediate uncoupled problem may require extended precision or careful rewriting to avoid numerical cancellation, but the solutions themselves can typically be computed in double precision. The approach works with analytical or gridded numerical solutions and is illustrated through two examples. The solution for flow to a pumping well is manipulated to predict streaming potential and electroosmosis, and a periodic one-dimensional analytical solution is derived and used to predict electroosmosis and streaming potential in a laboratory flow cell subjected to low frequency alternating current and pressure excitation. The examples illustrate the utility of the eigenvalue decoupling approach, repurposing existing analytical solutions or numerical models and leveraging solutions that are simpler to derive for coupled physics.

58 GEOSCIENCES↗
DOE OSTI2019

Properties of a potential energy matrix in oscillator basis

Matrix elements of potential energy are examined in detail. We consider a model problem — a particle in a central potential. The most popular forms of central potential are taken up, namely, square-well potential, Gaussian, Yukawa and exponential potentials. We study eigenvalues and eigenfunctions of the potential energy matrix constructed with oscillator functions. It is demonstrated that eigenvalues coincide with the potential energy in coordinate space at some specific discrete points. We establish approximate values for these points. It is also shown that the eigenfunctions of the potential energy matrix are the expansion coefficients of the spherical Bessel functions in a harmonic oscillator basis. We also demonstrate a close relation between the separable approximation and L{sup 2} basis (J-matrix) method for the quantum theory of scattering.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2018

Diagnostics for Undersampling and Clustering in Monte Carlo Criticality Calculations

For the past 40 years, it has been known from the theoretical work of Gelbard [1] and Brissenden [2] that the results from Monte Carlo (MC) criticality calculations are biased if the number of neutrons per generation is not sufficiently large. The computed k-effective eigenvalue will be lower than the actual eigenvalue, and the computed eigenfunction will be too low in high-importance regions and too high in low-importance regions. This difficulty is commonly called the undersampling problem for criticality calculations. The biases for undersampling were confirmed for practical, realistic problems with modern MC codes by Brown [3]. The solution to undersampling is simple - use a larger number of neutrons per generation to reduce the biases to levels that are negligible. Over the past few years, the OECD-NEA-WPNCS Expert Group on Advanced Monte Carlo Techniques (EGAMCT) [4,5,6] investigated an extreme form of undersampling called clustering. When the number of neutrons per generation is small, neutrons in successive generations tend to group together (cluster) due to correlations, and the clusters tend to migrate through the problem space. While the problems of undersampling and clustering are well known and well understood theoretically, there were no existing diagnostics for MC codes to determine whether a given calculation is using sufficient neutrons per generation to eliminate these problems. That is, no tools were available to diagnose biases due to undersampling or clustering. The tools described herein resolve this longstanding problem by providing 2 robust methods for detecting undersampling and clustering in MC criticality calculations. The diagnosis of undersampling and clustering is part of a larger effort to thoroughly overhaul the calculational methods for criticality problems, providing for automated sampling of the initial fission distribution, acceleration of the iteration convergence process, automated detection of convergence in the iterations and starting of the active tally cycles, and the diagnosis of undersampling. All of these new methods have been prototyped in a local modified version of mcnp6.2 [7] and tested on a variety of critical systems.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2025

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1984

Design of multivariable feedback control systems via spectral assignment using reduced-order models and reduced-order observers

The feasibility of using reduced order models and reduced order observers with eigenvalue/eigenvector assignment procedures is investigated. A review of spectral assignment synthesis procedures is presented. Then, a reduced order model which retains essential system characteristics is formulated. A constant state feedback matrix which assigns desired closed loop eigenvalues and approximates specified closed loop eigenvectors is calculated for the reduced order model. It is shown that the eigenvalue and eigenvector assignments made in the reduced order system are retained when the feedback matrix is implemented about the full order system. In addition, those modes and associated eigenvectors which are not included in the reduced order model remain unchanged in the closed loop full order system. The full state feedback design is then implemented by using a reduced order observer. It is shown that the eigenvalue and eigenvector assignments of the closed loop full order system rmain unchanged when a reduced order observer is used. The design procedure is illustrated by an actual design problem.

Mielke, R. R.↗
NASA NTRS1985

Design of multivariable feedback control systems via spectral assignment using reduced-order models and reduced-order observers

The feasibility of using reduced order models and reduced order observers with eigenvalue/eigenvector assignment procedures is investigated. A review of spectral assignment synthesis procedures is presented. Then, a reduced order model which retains essential system characteristics is formulated. A constant state feedback matrix which assigns desired closed loop eigenvalues and approximates specified closed loop eigenvectors is calculated for the reduced order model. It is shown that the eigenvalue and eigenvector assignments made in the reduced order system are retained when the feedback matrix is implemented about the full order system. In addition, those modes and associated eigenvectors which are not included in the reduced order model remain unchanged in the closed loop full order system. The fulll state feedback design is then implemented by using a reduced order observer. It is shown that the eigenvalue and eigenvector assignments of the closed loop full order system remain unchanged when a reduced order observer is used. The design procedure is illustrated by an actual design problem.

Mielke, R. R.↗
NASA NTRS1992

On adaptive weighted polynomial preconditioning for Hermitian positive definite matrices

The conjugate gradient algorithm for solving Hermitian positive definite linear systems is usually combined with preconditioning in order to speed up convergence. In recent years, there has been a revival of polynomial preconditioning, motivated by the attractive features of the method on modern architectures. Standard techniques for choosing the preconditioning polynomial are based only on bounds for the extreme eigenvalues. Here a different approach is proposed, which aims at adapting the preconditioner to the eigenvalue distribution of the coefficient matrix. The technique is based on the observation that good estimates for the eigenvalue distribution can be derived after only a few steps of the Lanczos process. This information is then used to construct a weight function for a suitable Chebyshev approximation problem. The solution of this problem yields the polynomial preconditioner. In particular, we investigate the use of Bernstein-Szego weights.

Fischer, Bernd↗
DOE OSTI2018

An inexact regularized Newton framework with a worst-case iteration complexity of $ {\mathscr O}(\varepsilon^{-3/2}) $ for nonconvex optimization

Abstract An algorithm for solving smooth nonconvex optimization problems is proposed that, in the worst-case, takes ${\mathscr O}(\varepsilon ^{-3/2})$ iterations to drive the norm of the gradient of the objective function below a prescribed positive real number $\varepsilon $ and can take ${\mathscr O}(\varepsilon ^{-3})$ iterations to drive the leftmost eigenvalue of the Hessian of the objective above $-\varepsilon $. The proposed algorithm is a general framework that covers a wide range of techniques including quadratically and cubically regularized Newton methods, such as the Adaptive Regularization using Cubics (arc) method and the recently proposed Trust-Region Algorithm with Contractions and Expansions (trace). The generality of our method is achieved through the introduction of generic conditions that each trial step is required to satisfy, which in particular allows for inexact regularized Newton steps to be used. These conditions center around a new subproblem that can be approximately solved to obtain trial steps that satisfy the conditions. A new instance of the framework, distinct from arc and trace, is described that may be viewed as a hybrid between quadratically and cubically regularized Newton methods. Numerical results demonstrate that our hybrid algorithm outperforms a cubically regularized Newton method.

Mathematics↗
NASA NTRS1983

Optimal trajectories for aeroassisted orbital transfer

Consideration is given to classical and minimax problems involved in aeroassisted transfer from high earth orbit (HEO) to low earth orbit (LEO). The transfer is restricted to coplanar operation, with trajectory control effected by means of lift modulation. The performance of the maneuver is indexed to the energy expenditure or, alternatively, the time integral of the heating rate. Firist-order optimality conditions are defined for the classical approach, as are a sequential gradient-restoration algorithm and a combined gradient-restoration algorithm. Minimization techniques are presented for the aeroassisted transfer energy consumption and time-delay integral of the heating rate, as well as minimization of the pressure. It is shown that the eigenvalues of the Jacobian matrix of the differential system is both stiff and unstable, implying that the sequential gradient restoration algorithm in its present version is unsuitable. A new method, involving a multipoint approach to the two-poing boundary value problem, is recommended.

Miele, A.↗
DOE OSTI2016

GW and Bethe-Salpeter study of small water clusters

We study within the GW and Bethe-Salpeter many-body perturbation theories the electronic and optical properties of small (H{sub 2}O){sub n} water clusters (n = 1-6). Comparison with high-level CCSD(T) Coupled-Cluster at the Single Double (Triple) levels and ADC(3) Green’s function third order algebraic diagrammatic construction calculations indicates that the standard non-self-consistent G{sub 0}W{sub 0}@PBE or G{sub 0}W{sub 0}@PBE0 approaches significantly underestimate the ionization energy by about 1.1 eV and 0.5 eV, respectively. Consequently, the related Bethe-Salpeter lowest optical excitations are found to be located much too low in energy when building transitions from a non-self-consistent G{sub 0}W{sub 0} description of the quasiparticle spectrum. Simple self-consistent schemes, with update of the eigenvalues only, are shown to provide a weak dependence on the Kohn-Sham starting point and a much better agreement with reference calculations. The present findings rationalize the theory to experiment possible discrepancies observed in previous G{sub 0}W{sub 0} and Bethe-Salpeter studies of bulk water. The increase of the optical gap with increasing cluster size is consistent with the evolution from gas to dense ice or water phases and results from an enhanced screening of the electron-hole interaction.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗