Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear algebra”

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 847 records · Page 47
All sourcesNASA NTRSDOE OSTI
NASA NTRS1974

A Monte Carlo investigation of experimental data requirements for fitting polynomial functions

This report examines the extent to which sample size affects the accuracy of a low order polynomial approximation of an experimentally observed quantity and establishes a trend toward improvement in the accuracy of the approximation as a function of sample size. The task is made possible through a simulated analysis carried out by the Monte Carlo method, in which data are generated by using several transcendental or algebraic functions as models. Contaminated data of varying amounts are fitted to linear quadratic or cubic polynomials, and the behavior of the mean-squared error of the residual variance is determined as a function of sample size. Results indicate that the effect of the size of the sample is significant only for relatively small sample sizes and diminishes drastically for moderate and large amounts of experimental data.

Canavos, G. C.↗
NASA NTRS1973

A new approach to the design of time-varying control systems with application to the Space Shuttle Boost

A general approach to the analysis and design of closed-loop control for slowly time-varying linear systems is presented. The approach uses the method of generalized multiple scales in which slow and fast dynamics are systematically separated by employing different 'clocks' which measure time at varying rates. The clocks, which are necessarily nonlinear functions of time, are chosen in such a manner that the system dynamics are asymptotically invariant with respect to the new time scale. A transfer function relating the output to the input for general linear slowly time-varying systems is developed and represents the actual system under certain conditions. The clock function is shown to satisfy an algebraic characteristic equation and can be determined in terms of the coefficients. The approach can be viewed as an extension of time-invariant linear feedback control theory.

Ramanth, R. V.↗
NASA NTRS1977

A finite element algorithm for sound propagation in axisymmetric ducts containing compressible mean flow

The described investigation is concerned with he development of a finite element scheme which can be used in a study of the acoustics of aircraft-engine ducts. In the absence of suitable variational principles for acoustic fluctuations within an aircraft fan engine, an acoustic analysis must proceed directly from the differential equations which describe compressible flow. The derived equations cannot be solved algebraically. The numerical technique used for solving them makes use of a linear rectangular element of a type considered by Zienkiewicz (1971). Attention is given to aspects of element derivation, the global matrix assembly, the solution of the matrix equation, questions of acoustic attenuation, and illustrations of the potential of the current model in duct optimization.

Abrahamson, A. L.↗
NASA NTRS1991

Linear and circular digital spectral analysis of serial data

Two methods of digital spectral analysis of unevenly sampled data are developed and illustrated here. One method uses a linear function of time (or space), the other uses circular functions. The circular method turns out to be essentially equivalent to a least-squares sine-wave analysis. The linear, anharmonic method uses only the field of real numbers and elementary algebraic operations, and hence it can be made computationally very fast and accurate. Both methods are very general, properly handling all kinds of time series ranging from simple series consisting only of the times of events to complicated series consisting of pulses with long duty cycles. The two methods are here applied to the analysis of annual mean relative sunspot numbers.

Stothers, Richard B.↗
DOE OSTI2015

Correlation functions from a unified variational principle: Trial Lie groups

Time-dependent expectation values and correlation functions for many-body quantum systems are evaluated by means of a unified variational principle. It optimizes a generating functional depending on sources associated with the observables of interest. It is built by imposing through Lagrange multipliers constraints that account for the initial state (at equilibrium or off equilibrium) and for the backward Heisenberg evolution of the observables. The trial objects are respectively akin to a density operator and to an operator involving the observables of interest and the sources. We work out here the case where trial spaces constitute Lie groups. This choice reduces the original degrees of freedom to those of the underlying Lie algebra, consisting of simple observables; the resulting objects are labeled by the indices of a basis of this algebra. Explicit results are obtained by expanding in powers of the sources. Zeroth and first orders provide thermodynamic quantities and expectation values in the form of mean-field approximations, with dynamical equations having a classical Lie–Poisson structure. At second order, the variational expression for two-time correlation functions separates–as does its exact counterpart–the approximate dynamics of the observables from the approximate correlations in the initial state. Two building blocks are involved: (i) a commutation matrix which stems from the structure constants of the Lie algebra; and (ii) the second-derivative matrix of a free-energy function. The diagonalization of both matrices, required for practical calculations, is worked out, in a way analogous to the standard RPA. The ensuing structure of the variational formulae is the same as for a system of non-interacting bosons (or of harmonic oscillators) plus, at non-zero temperature, classical Gaussian variables. This property is explained by mapping the original Lie algebra onto a simpler Lie algebra. The results, valid for any trial Lie group, fulfill consistency properties and encompass several special cases: linear responses, static and time-dependent fluctuations, zero- and high-temperature limits, static and dynamic stability of small deviations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2019

A robust hierarchical solver for ill-conditioned systems with applications to ice sheet modeling

A hierarchical solver is proposed for solving sparse ill-conditioned linear systems in parallel. The solver is based on a modification of the LoRaSp method, but employs a deferred-compression technique, which provably reduces the approximation error and significantly improves efficiency. Moreover, the deferred-compression technique introduces minimal overhead and does not affect parallelism. As a result, the new solver achieves linear computational complexity under mild assumptions and excellent parallel scalability. To demonstrate the performance of the new solver, we focus on applying it to solve sparse linear systems arising from ice sheet modeling. The strong anisotropic phenomena associated with the thin structure of ice sheets creates serious challenges for existing solvers. To address the anisotropy, we additionally developed a customized partitioning scheme for the solver, which captures the strong-coupling direction accurately. In general, the partitioning can be computed algebraically with existing software packages, and thus the new solver is generalizable for solving other sparse linear systems. Our results show that ice sheet problems of about 300 million degrees of freedom have been solved in just a few minutes using a thousand processors.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1984

Analysis of lateral and torsional vibration characteristics of beams and shafts with end located rotational masses

Partial differential equations are derived for free lateral and torsional vibration of a uniform free-free beam with a rotational mass attached to each extremity. For appropriate boundary conditions, nonlinear algebraic equations are obtained using a symbolic manipulation computer program, the solutions of which enable the computation of the neutral frequencies and mode-shapes. The mode-shapes are linear combinations of trigonometric and hyperbolic sine and cosine functions. A computer program is written for the numerical solution of the algebraic equations mentioned above, which can compute the natural frequencies, mode-shapes, and node points for any given set of parameters, for any given number of modes.

Robertson, D. K.↗
DOE OSTI2026

Classification of dynamical Lie algebras generated by spin interactions on undirected graphs

Dynamical Lie algebras (DLAs) are a versatile tool for various topics that span from the expressibility-trainability of variational quantum algorithms (VQAs), to simulation of many body Hamiltonians. Quantum gates and most of the Hamiltonians of interest consist of local interactions; therefore, the analysis of all possible DLAs generated by 1- and 2-local operators is crucial for quantum simulation and VQAs on current hardware. Previously in [R. Wiersema et al ., npj Quantum Inf. 10 , 110 (2024)], we analyzed the DLAs on linear, circular and all-to-all topologies, and obtained results about their dimensions and algebraic structure. Here, in this work, we extend our analysis into any possible hardware topology and provide a classification of all DLAs generated by Pauli strings on any undirected interaction graph. Our results indicate that the DLAs depend solely on whether the connectivity or interaction graph is bipartite or not. In addition, we find that the non-trivial polynomially scaling DLAs appear only on 1D line or circle topologies, and all other DLAs have dimensions scaling exponentially with the system size. Together with the current VQA literature, our results imply that either the majority of VQAs are non-trainable, or we are yet to understand the role of DLAs on the trainability of VQAs.

Algebraic structures↗
DOE OSTI2012

Min-Max Spaces and Complexity Reduction in Min-Max Expansions

Idempotent methods have been found to be extremely helpful in the numerical solution of certain classes of nonlinear control problems. In those methods, one uses the fact that the value function lies in the space of semiconvex functions (in the case of maximizing controllers), and approximates this value using a truncated max-plus basis expansion. In some classes, the value function is actually convex, and then one specifically approximates with suprema (i.e., max-plus sums) of affine functions. Note that the space of convex functions is a max-plus linear space, or moduloid. In extending those concepts to game problems, one finds a different function space, and different algebra, to be appropriate. Here we consider functions which may be represented using infima (i.e., min-max sums) of max-plus affine functions. It is natural to refer to the class of functions so represented as the min-max linear space (or moduloid) of max-plus hypo-convex functions. We examine this space, the associated notion of duality and min-max basis expansions. In using these methods for solution of control problems, and now games, a critical step is complexity-reduction. In particular, one needs to find reduced-complexity expansions which approximate the function as well as possible. We obtain a solution to this complexity-reduction problem in the case of min-max expansions.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Homotopy approach to optimal, linear quadratic, fixed architecture compensation

Optimal linear quadratic Gaussian compensators with constrained architecture are a sensible way to generate good multivariable feedback systems meeting strict implementation requirements. The optimality conditions obtained from the constrained linear quadratic Gaussian are a set of highly coupled matrix equations that cannot be solved algebraically except when the compensator is centralized and full order. An alternative to the use of general parameter optimization methods for solving the problem is to use homotopy. The benefit of the method is that it uses the solution to a simplified problem as a starting point and the final solution is then obtained by solving a simple differential equation. This paper investigates the convergence properties and the limitation of such an approach and sheds some light on the nature and the number of solutions of the constrained linear quadratic Gaussian problem. It also demonstrates the usefulness of homotopy on an example of an optimal decentralized compensator.

Mercadal, Mathieu↗
DOE OSTI2019

Explicit Equations for Exterior Square of the General Linear Group

Several explicit systems of equations defining the exterior square of the general linear group ⋀{sup 2} GL{sub n} as affine group scheme are presented. Algebraic ingredients of the equations, so called exterior numbers, are translated to the language of weight diagrams corresponding to a Lie group of type A{sub n−1} in the representation with the highest weight ϖ{sub 2}.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Non-Gaussian wave packet dynamics in anharmonic potential: Cumulant expansion treatment

This manuscript utilizes cumulant expansion as an alternative algebraic approach to evaluating integrals and solving a system of nonlinear differential equations for probing anharmonic dynamics in condensed phase systems using Morse oscillator. These integrals and differential equations become harder to solve as the anharmonicity of the system goes beyond that of Morse oscillator description. This algebraic approach becomes critically important in case of Morse oscillator as it tends to exhibit divergent dynamics and numerical uncertainties at low temperatures. The autocorrelation function is calculated algebraically and compared to the exact one for they match perfectly. It is also compared to the approximate autocorrelation function using the differential equations technique reported in Toutounji (2014) for weak and strong electron–phonon coupling cases. It is found that the present cumulant method is more efficient, and easier to use, than the exact expression. Deviation between the approximate autocorrelation function and the exact autocorrelation function starts to arise as the electron–phonon coupling strength increases. The autocorrelation function obtained using cumulants identically matches the exact autocorrelation function, thereby surpassing the approach presented in Toutounji (2014). The advantage of the present methodology is its applicability to various types of electron–phonon coupling cases. Additionally, the herein approach only uses algebraic techniques, thereby avoiding both the divergence integral and solving a set of linear first- and second-order partial differential equations as was done in previous work. Model calculations are presented to demonstrate the accuracy of the herein work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Symmetry-preserving perturbations of the Bateman Lagrangian and dissipative systems

Perturbations of the classical Bateman Lagrangian preserving a certain subalgebra of Noether symmetries are studied, and conservative perturbations are characterized by the Lie algebra sl(2, ℝ) ⊕ so(2). Non-conservative albeit integrable perturbations are determined by the simple Lie algebra sl(2,ℝ), showing further the relation of the corresponding non-linear systems with the notion of generalized Ermakov systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

Final Report: Subcontract B623868 Algebraic Multigrid solvers for coupled PDE systems

The Pennsylvania State University (“Subcontractor”) continued to work on the design of algebraic multigrid solvers for coupled systems of partial differential equations (PDEs) arising in numerical modeling of various applications, with a main focus on solving the Dirac equation arising in Quantum Chromodynamics (QCD). The goal of the proposed work was to develop combined geometric and algebraic multilevel solvers that are robust and lend themselves to efficient implementation on massively parallel heterogeneous computers for these QCD systems. The research in these areas built on previous works, focusing on the following three topics: (1) the development of parallel full-multigrid (PFMG) and non-Galerkin coarsening techniques in this frame work for solving the Wilson Dirac system; (2) the use of these same Wilson MG solvers for preconditioning the Overlap and Domain Wall formulations of the Dirac equation; and (3) the design and analysis of algebraic coarsening algorithms for coupled PDE systems including Stokes equation, Maxwell equation and linear elasticity.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Algebraic Multigrid Solvers for Coupled PDE Systems (Final Report – B619169)

The Pennsylvania State University (“Subcontractor”) worked on the design of multigrid solvers for coupled systems of partial differential equations arising in numerical modeling of various applications, with a main emphasis on the design of new optimal algebraic multigrid interpolation. Generally, the aim of this work was to develop geometric and algebraic multilevel solvers that are robust and lend themselves to efficient implementation on massively parallel heterogeneous computers. The research in these areas built on previous works, focusing on the following topics: (1) design and analysis of algebraic coarsening algorithms for coupled PDE systems including Stokes equation, Maxwell equation and linear elasticity; (2) development of non-Galerkin coarsening techniques for the Wilson Dirac system; and (3) the use of this same Wilson MG solver for preconditioning the Overlap and Domain Wall formulations of the Dirac equation.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1969

Introduction to abstract analysis

This book, which grew out of lectures given at the NASA Lewis Research Center, introduces the scientist and engineer with the usual background in applied mathematics to the concepts of abstract analysis. The emphasis is not on preparing the reader to do research in the field but on giving him some of the background necessary for reading the literature of pure mathematics. Although the material here is by no means original, the presentation differs in some respects from texts on material of this nature. The proofs are more detailed herein and quite easy to follow. We have attempted to indicate how the material relates to and serves as a foundation for more advanced sub- jects. We have also attempted at several places to show how the material covered here relates to the more familiar “real mathematics.” Enough examples are included to illustrate the concepts. No attempt is made to indicate the original sources of the material or even to point out the originators of all the concepts. Contrary to the usual practice, the relation between convergence and continuity on the one hand and algebraic operations on the other is dis- cussed in the abstract setting of linear spaces. This is done principally to familiarize the reader with these very important concepts in a reasonably simple way.

Marvin E Goldstein↗
NASA NTRS1973

Prediction of free turbulent mixing using a turbulent kinetic energy method

Free turbulent mixing of two-dimensional and axisymmetric one- and two-stream flows is analyzed by a relatively simple turbulent kinetic energy method. This method incorporates a linear relationship between the turbulent shear and the turbulent kinetic energy and an algebraic relationship for the length scale appearing in the turbulent kinetic energy equation. Good results are obtained for a wide variety of flows. The technique is shown to be especially applicable to flows with heat and mass transfer, for which nonunity Prandtl and Schmidt numbers may be assumed.

Harsha, P. T.↗
NASA NTRS1987

Block iterative restoration of astronomical images with the massively parallel processor

A method is described for algebraic image restoration capable of treating astronomical images. For a typical 500 x 500 image, direct algebraic restoration would require the solution of a 250,000 x 250,000 linear system. The block iterative approach is used to reduce the problem to solving 4900 121 x 121 linear systems. The algorithm was implemented on the Goddard Massively Parallel Processor, which can solve a 121 x 121 system in approximately 0.06 seconds. Examples are shown of the results for various astronomical images.

Heap, Sara R.↗