SEARCH · Engineering Papers
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.
Trajectories for launch vehicles and approximate solution for propagation of covariance matrix of errors through thrust and coast
In a previous paper Schaechter proposes using an extended Kalman filter to estimate adaptively the (slowly varying) frequencies and damping ratios of a large space structure. The time varying gains for estimating the frequencies and damping ratios can be determined in closed form so it is not necessary to integrate the matrix Riccati equations. After certain approximations, the time varying adaptive gain can be written as the product of a constant matrix times a matrix derived from the components of the estimated state vector. This is an important savings of computer resources and allows the adaptive filter to be implemented with approximately the same effort as the nonadaptive filter. The success of this new approach for adaptive filtering was demonstrated using synthetic data from a two mode system.
This grant supported research on electronic structure and materials theory, with focus on three main issues: (i) novel techniques to deal with correlation in the electronic ground-state, (ii) topological materials, (iii) the phase diagram of lattice spin models. Regarding (i), we applied to the homogeneous electron liquid an approach that we previously developed in the context of molecular systems. In this scheme the electronic occupation probabilities and the natural spin orbitals are used to construct an approximate two-body density matrix for the electronic ground-state. Regarding (ii) we used standard electronic structure methods based on density functional theory to model topological materials and interpret experimental observations. Finally, regarding (iii) we further developed a numerical approach to compute the renormalized couplings within real space renormalization group theory in the context of lattice spin models. The main findings were the following. (i) We found that with our approximate two-body density matrix, which works well for small molecules, is not sufficiently accurate for condensed phase systems. Missing a systematic way of improving on the adopted approximations, we decided not to pursue this approach. (ii) We performed two studies. In one, we investigated the influence of Te defects on the topological properties of a WTe2 monolayer, finding that while Te vacancies, even in modest concentration, destroy the topological character, Te adatoms do not, consistent with a recent experiment. In another study, we predicted Weyl semimetal character and strong anomalous Hall effect in the Heusler compensated ferrimagnet Ti2MnAl. (iii) We developed a new Monte Carlo method to do real space renormalization group calculations for lattice spin models. We subsequently extended the scheme to deal with lattice spin models in presence of quenched disorder, finding that the approach can distinguish systems with finite and strong disorder. In the finite disorder case, the method allows one to find with good approximation the critical coupling distribution and the critical exponents.
Although formal expressions for scattering matrix accounting for direct, doorway, and compound nuclear (CN) resonant reactions have been derived several decades ago in both the transition ( T -)matrix formalism and the reactance ( K -)matrix formalism, the absence of corresponding expressions in phenomenological R -matrix formalism has limited the application of the latter to CN resonant reactions only. We remove this limitation by parameterizing direct, doorway, and CN resonant reactions in a phenomenological R -matrix scattering matrix, and provide a parameterization for a corresponding Reich-Moore approximation of eliminated capture channels. Direct reactions induce (previously neglected) mixing among the incoming or outgoing R -matrix channel wave functions, parameterized by real and orthonormal channel-rotation matrix, M , whereby the original scattering matrix U is transformed into M T UM . Any real and orthonormal matrix, M , can be equivalently expressed as e η , where η is a real and skew-symmetric 2 rotation-generating matrix that subsequently yields a more intuitive parameterization of eliminated direct capture reactions in Reich-Moore approximation. A phenomenological R -matrix parameterization of doorway reactions is inferred by equating the expression for reactance ( K -)matrix, given in terms of Brune’s alternative R -matrix parameterization, to a corresponding expression derived using Feshbach’s projection operator formalism. Assuming that all doorway states, just like CN states, are confined within spheres defined by R -matrix channel radii, a new R -matrix-like term induced by doorway states is gleaned, wherein each doorway state is parameterized by its energy, width, and the strength of its coupling to each CN state. Since a Reich-Moore approximation for retained-channel scattering matrix ought to approximate the effect of eliminated capture channels taking place via direct, doorway, or CN reactions, each of the three kinds of reactions contributing to the capture entails a corresponding Reich-Moore parameterization in a first-order approximation: direct contribution is parameterized by introducing finite diagonal elements of a retained-channel rotation-generating matrix, doorway contribution is parameterized by doorway capture widths, while CN contribution is parameterized by conventional Reich-Moore capture widths. We will present evidence of direct and doorway reactions observed in recent measurements of resolved resonance cross sections at the Gaerttner LINAC Center at Rensselaer Polytechnic Institute, and will outline a path for implementing this new R -matrix parameterization into the SAMMY nuclear data evaluation code.
Recent work has shown that the (block) Lanczos algorithm can be used to extract approximate energy spectra and matrix elements from (matrices of) correlation functions in quantum field theory, and identified exact coincidences between Lanczos analysis methods and others. In this work, we note another coincidence: the Lanczos algorithm is equivalent to the well-known Rayleigh-Ritz method applied to Krylov subspaces. Rayleigh-Ritz provides optimal eigenvalue approximations within subspaces; we find that spurious-state filtering allows these optimality guarantees to be retained in the presence of statistical noise. We explore the relation between Lanczos and Prony's method, their block generalizations, generalized pencil of functions (GPOF), and methods based on the generalized eigenvalue problem (GEVP), and find they all fall into a larger "Prony-Ritz equivalence class", identified as all methods which solve a finite-dimensional spectrum exactly given sufficient correlation function (matrix) data. This equivalence allows simpler and more numerically stable implementations of (block) Lanczos analyses.
Implementation issues associated with the application of Krylov subspace iterative methods, such as Newton-GMRES, are presented within the framework of practical computational fluid dynamic (CFD) applications. This paper categorizes, evaluates, and contrasts the major ingredients (function evaluations, matrix-vector products, and preconditioners) of Newton-GMRES Krylov subspace methods in terms of their effect on the local linear and global nonlinear convergence, memory requirements, and accuracy. The discussion focuses on Newton-GMRES in both a structured multi-zone incompressible Navier-Stokes solver and an unstructured mesh finite-volume Navier-Stokes solver. Approximate versus exact matrix-vector products, effective preconditioners, and other pertinent issues are addressed.
We report that for a decade, fully ceramic microencapsulated (FCM) fuel, containing tri-structural isotropic (TRISO) fuel particles in a silicon carbide (SiC) matrix, has been investigated as an accident-tolerant fuel for light water reactors (LWRs). Other examples exist of TRISO-based concepts for LWR fuels with different matrix materials. Previous studies assumed TRISO particle volume packing of approximately 0.44 in SiC (or another) matrix, the highest realistic packing fractions possible with conventional manufacturing. Recent advances in advanced manufacturing have yielded the development and demonstration of a fuel form that consists of conventionally manufactured TRISO particles in a 3D-printed SiC matrix with significantly higher possible TRISO packing fractions (0.5–0.7). This increased uranium loading enhances the viability of using TRISO-based particle fuel forms in LWRs. The viability of high-packing-fraction TRISO-based particle fuel forms in LWRs is assessed from the perspective of fuel cycle length, achievable fuel burnup, reactivity coefficients, and fuel cycle performance. Higher-packing-fraction TRISO-based fuel enables either longer cycle lengths (by ~25% at a packing fraction of 0.55 relative to 0.44) at a constant enrichment or decreased enrichments (by ~25% at a packing fraction of 0.55 relative to 0.44) at a constant cycle length. Studies of different fuel kernel types (uranium nitride, uranium oxycarbide, and uranium carbide) yield similar results, although the cycle length of uranium oxycarbide is shorter than for uranium nitride or uranium carbide (due to the lower density of uranium oxide). This work also characterized the production of 14 C resulting from neutron absorption in 14 N during operation for uranium mononitride fuel kernels; the ratio of 14 C/N was 1–2 at. % at discharge. For the fuel cycle evaluation, the activity of spent nuclear fuel and high-level waste at 100 and 100,000 years was lower for high-packing-fraction fuels than for conventional LWR fuel. Environmental impact metrics were similar overall, but higher on the front end of the fuel cycle and lower on the back end of the fuel cycle. Reactivity coefficients of higher-packing-fraction TRISO-based fuel were reasonable compared with those of conventional fuels.
Implicit approximate factorization techniques (AF) were investigated for the solution of matrix equations resulting from finite difference approximations to the full potential equation in conservation form. For transonic flows, an artificial viscosity, required to maintain stability in supersonic regions, was introduced by an upwind bias of the density. Two implicit AF procedures are presented and their convergence performance is compared with that of the standard transonic solution procedure, successive line overrelaxation (SLOR). Subcritical and supercritical test cases are considered. The results indicate that the AF schemes are substantially faster than SLOR.
In this paper, we introduce a new algorithm for blind source signal separation for post-nonlinear mixtures. The mixtures are assumed to be linearly mixed from unknown sources first and then distorted by memoryless nonlinear functions. The nonlinear functions are assumed to be smooth and can be approximated by polynomials. Both the coefficients of the unknown mixing matrix and the coefficients of the approximated polynomials are estimated by the gradient descent method conditional on the higher order statistical requirements. The results of simulation experiments presented in this paper demonstrate the validity and usefulness of our approach for nonlinear blind source signal separation Keywords: Independent Component Analysis, Kurtosis, Higher order statistics.
In this paper, we introduce a new algorithm for blind source signal separation for post-nonlinear mixtures. The mixtures are assumed to be linearly mixed from unknown sources first and then distorted by memoryless nonlinear functions. The nonlinear functions are assumed to be smooth and can be approximated by polynomials. Both the coefficients of the unknown mixing matrix and the coefficients of the approximated polynomials are estimated by the gradient descent method conditional on the higher order statistical requirements. The results of simulation experiments presented in this paper demonstrate the validity and usefulness of our approach for nonlinear blind source signal separation.
The phenomenon of collisional transfer of intensity due to line mixing has an increasing importance for atmospheric monitoring. From a theoretical point of view, all relevant information about the collisional processes is contained in the relaxation matrix where the diagonal elements give half-widths and shifts, and the off-diagonal elements correspond to line interferences. For simple systems such as those consisting of diatom-atom or diatom-diatom, accurate fully quantum calculations based on interaction potentials are feasible. However, fully quantum calculations become unrealistic for more complex systems. On the other hand, the semi-classical Robert-Bonamy (RB) formalism, which has been widely used to calculate half-widths and shifts for decades, fails in calculating the off-diagonal matrix elements. As a result, in order to simulate atmospheric spectra where the effects from line mixing are important, semi-empirical fitting or scaling laws such as the ECS (Energy-Corrected Sudden) and IOS (Infinite-Order Sudden) models are commonly used. Recently, while scrutinizing the development of the RB formalism, we have found that these authors applied the isolated line approximation in their evaluating matrix elements of the Liouville scattering operator given in exponential form. Since the criterion of this assumption is so stringent, it is not valid for many systems of interest in atmospheric applications. Furthermore, it is this assumption that blocks the possibility to calculate the whole relaxation matrix at all. By eliminating this unjustified application, and accurately evaluating matrix elements of the exponential operators, we have developed a more capable formalism. With this new formalism, we are now able not only to reduce uncertainties for calculated half-widths and shifts, but also to remove a once insurmountable obstacle to calculate the whole relaxation matrix. This implies that we can address the line mixing with the semi-classical theory based on interaction potentials between molecular absorber and molecular perturber. We have applied this formalism to address the line mixing for Raman and infrared spectra of molecules such as N2, C2H2, CO2, NH3, and H2O. By carrying out rigorous calculations, our calculated relaxation matrices are in good agreement with both experimental data and results derived from the ECS model.
Subspace projection methods utilizing perturbative corrections have been proposed for computing the lowest few eigenvalues and corresponding eigenvectors of large Hamiltonian matrices. In this paper, we build upon these methods and introduce the term Subspace Projection with Perturbative Corrections (SPPC) method to refer to this approach. We tailor the SPPC for nuclear many-body Hamiltonians represented in a truncated configuration interaction subspace, i.e., the no-core shell model (NCSM). We use the hierarchical structure of the NCSM Hamiltonian to partition the Hamiltonian as the sum of two matrices. The first matrix corresponds to the Hamiltonian represented in a small configuration space, whereas the second is viewed as the perturbation to the first matrix. Eigenvalues and eigenvectors of the first matrix can be computed efficiently. Because of the split, perturbative corrections to the eigenvectors of the first matrix can be obtained efficiently from the solutions of a sequence of linear systems of equations defined in the small configuration space. These correction vectors can be combined with the approximate eigenvectors of the first matrix to construct a subspace from which more accurate approximations of the desired eigenpairs can be obtained. We show by numerical examples that the SPPC method can be more efficient than conventional iterative methods for solving large-scale eigenvalue problems such as the Lanczos, block Lanczos and the locally optimal block preconditioned conjugate gradient (LOBPCG) method. The method can also be combined with other methods to avoid convergence stagnation.
Krylov subspace recycling is a powerful tool when solving a long series of large, sparse linear systems that change only slowly over time. In PDE constrained shape optimization, these series appear naturally, as typically hundreds or thousands of optimization steps are needed with only small changes in the geometry. In this setting, however, applying Krylov subspace recycling can be a difficult task. As the geometry evolves, in general, so does the finite element mesh defined on or representing this geometry, including the numbers of nodes and elements and element connectivity. This is especially the case if re-meshing techniques are used. As a result, the number of algebraic degrees of freedom in the system changes, and in general the linear system matrices resulting from the finite element discretization change size from one optimization step to the next. Changes in the mesh connectivity also lead to structural changes in the matrices. In the case of re-meshing, even if the geometry changes only a little, the corresponding mesh might differ substantially from the previous one. Obviously, this prevents any straightforward mapping of the approximate invariant subspace of the linear system matrix (the focus of recycling in this work) from one optimization step to the next; similar problems arise for other selected subspaces. In this paper, we present an algorithm to map an approximate invariant subspace of the linear system matrix for the previous optimization step to an approximate invariant subspace of the linear system matrix for the current optimization step, for general meshes. This is achieved by exploiting the map from coefficient vectors to finite element functions on the mesh, combined with interpolation or approximation of functions on the finite element mesh. We demonstrate the effectiveness of our approach numerically with several proof of concept studies for a specific meshing technique.
A high temperature mechanical characterization laboratory has been assembled at NASA Lewis Research Center. One contribution of this work is to test ceramic matrix composite specimens in tension in environmental extremes. Two high temperature tensile testing systems were assembled. The systems were assembled based on the performance and experience of other laboratories and meeting projected service conditions for the materials in question. The systems use frames with an electric actuator and a center screw. A PC based data acquisition and analysis system is used to collect and analyze the data. Mechanical extensometers are used to measure specimen strain. Thermocouples, placed near the specimen, are used to measure the specimen gage section temperature. The system for testing in air has a resistance element furnace with molybdenum disilicide elements and pneumatic grips with water cooling attached to hydraulic alignment devices. The system for testing in an inert gas has a graphite resistance element furnace in a chamber with rigidly mounted, water cooled, hydraulically actuated grips. Unidirectional SiC fiber reinforced reaction bonded Si3N4 and triaxially woven, two dimensional, SiC fiber reinforced enhanced SiC composites were tested in unidirectional tension. Theories for predicting the Young's modulus, modulus near the ultimate strength, first matrix cracking stress, and ultimate strength were applied and evaluated for suitability in predicting the mechanical behavior of SiC/RBSN and enhanced SiC/SiC composites. The SiC/RBSN composite exhibited pseudo tough behavior (increased area under the stress/strain curve) from 22 C to 1500 C. The rule of mixtures provides a good estimate of the Young's modulus of the SiC/RBSN composite using the constituent properties from room temperature to 1440 C for short term static tensile tests in air or nitrogen. The rule of mixtures significantly overestimates the secondary modulus near the ultimate strength. The ACK theory provides the best approximation of the first matrix cracking stress when residual stresses are ignored. The theory of Cao and Thouless, based on Weibull statistics, gave the best prediction for the composite ultimate strength. The enhanced SiC/SiC composite exhibited nonlinear stress/strain behavior from 24 C to 1370 C in air with increased ultimate strain when compared to monolithic SiC. The theory of Yang and Chou with the assumption of a frictional fiber/matrix interface provided the best estimate of the Young's modulus. The theory of Cao and Thouless gave the best estimate for the ultimate strength.
A simple matrix polynomial approach is introduced for approximating unsteady aerodynamics in the s-plane and ultimately, after combining matrix polynomial coefficients with matrices defining the structure, a matrix polynomial of the flutter equations of motion (EOM) is formed. A technique of recasting the matrix-polynomial form of the flutter EOM into a first order form is also presented that can be used to determine the eigenvalues near the origin and everywhere on the complex plane. An aeroservoelastic (ASE) EOM have been generalized to include the gust terms on the right-hand side. The reasons for developing the new matrix polynomial approach are also presented, which are the following: first, the "workhorse" methods such as the NASTRAN flutter analysis lack the capability to consistently find roots near the origin, along the real axis or accurately find roots farther away from the imaginary axis of the complex plane; and, second, the existing s-plane methods, such as the Roger s s-plane approximation method as implemented in ISAC, do not always give suitable fits of some tabular data of the unsteady aerodynamics. A method available in MATLAB is introduced that will accurately fit generalized aerodynamic force (GAF) coefficients in a tabular data form into the coefficients of a matrix polynomial form. The root-locus results from the NASTRAN pknl flutter analysis, the ISAC-Roger's s-plane method and the present matrix polynomial method are presented and compared for accuracy and for the number and locations of roots.
We present a general class of machine learning algorithms called parametric matrix models. In contrast with most existing machine learning models that imitate the biology of neurons, parametric matrix models use matrix equations that emulate physical systems. Similar to how physics problems are usually solved, parametric matrix models learn the governing equations that lead to the desired outputs. Parametric matrix models can be efficiently trained from empirical data, and the equations may use algebraic, differential, or integral relations. While originally designed for scientific computing, we prove that parametric matrix models are universal function approximators that can be applied to general machine learning problems. After introducing the underlying theory, we apply parametric matrix models to a series of different challenges that show their performance for a wide range of problems. For all the challenges tested here, parametric matrix models produce accurate results within an efficient and interpretable computational framework that allows for input feature extrapolation.
A cosmic and solar radiation shielding structure that also has structural attributes is comprised of three layers. The first layer is 30-42 percent by volume of ultra-high molecular weight (UHMW) polyethylene fibers, 18-30 percent by volume of graphite fibers, and a remaining percent by volume of an epoxy resin matrix. The second layer is approximately 68 percent by volume of UHMW polyethylene fibers and a remaining percent by volume of a polyethylene matrix. The third layer is a ceramic material.
Here, in this paper, we present a predictor-corrector strategy for constructing rank-adaptive, dynamical low-rank approximations (DLRAs) of matrix-valued ODE systems. The strategy is a compromise between (i) low-rank step-truncation approaches that alternately evolve and compress solutions and (ii) strict DLRA approaches that augment the low-rank manifold using subspaces generated locally in time by the DLRA integrator. The strategy is based on an analysis of the error between a forward temporal update into the ambient full-rank space, which is typically computed in a step-truncation approach before recompressing, and the standard DLRA update, which is forced to live in a low-rank manifold. We use this error, without requiring its full-rank representation, to correct the DLRA solution. A key ingredient for maintaining a low-rank representation of the error is a randomized SVD, which introduces some degree of stochastic variability into the implementation. The strategy is formulated and implemented in the context of discontinuous Galerkin spatial discretizations of PDEs and applied to several versions of DLRA methods found in the literature as well as a new variant. Numerical experiments comparing the predictor-corrector strategy to other methods demonstrate robustness to overcome shortcomings of step truncation or strict DLRA approaches: The former may require more memory than is strictly needed, while the latter may miss transients solution features that cannot be recovered. The effect of randomization, tolerances, and other implementation parameters is also explored.