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 937 records · Page 52
All sourcesNASA NTRSDOE OSTI
NASA NTRS1972

On large-scale system stability.

A large-scale system is considered as a system constituted of subsystems which may be connected or disconnected from each other during operation. A new notion of connective stability is introduced by which a large-scale system is regarded as stable if it remains stable (in the sense of Liapunov) under structural perturbations produced by the on-off participation of the subsystems. Algebraic conditions are developed that guarantee exponential connective stability in large-scale systems which may be composed of linear and nonlinear subsystems coupled by linear or nonlinear connections.

Siljak, D. D.↗
NASA NTRS1974

REDUCE 2: A computer program for the symbolic reduction of large block diagrams

REDUCE 2 is reported as a FORMAC program which symbolically calculates the transfer function(s) of any linear-block-diagram output variable to any or all input variables. The program requires as input a set of algebraic expressions representing the block diagram, the desired transfer function(s), and a string of variables indicating the desired order of reduction. The solution is presented in the compact form of a set of nested functions (super G's). The program can handle systems as large as 600 equations and is intended as a tool for the analysis of complex control and dynamic systems. A companion FORTRAN program, EVAL 2, which numerically evaluates the solution set to obtain amplitude ratio and phase angle as functions of frequency is also presented.

Lorenzo, C. F.↗
NASA NTRS1985

Simultaneous Earth observations from 2 satellites

Simultaneous co-located observations from two different orbits lead to several advantages (i.e., cross calibration of sensors and a wider range of solar-zenith and sensor look angles). The question was asked how many times per year (on the average) do the sub-satellite points of two satellites simultaneously come within D kilometers of each other?. For the Space Station (altitude: 500 km, inclination: 28 deg) and a Sun synchronous satellite (altitude 705 km, inclination 98.21 deg) the answers are 16, 41 and 82 times per year for encounter distances D of 20, 50, and 100 km espectively. The relationship between encounters per year and distance D is linear. The answers were obtained in two ways: (1) a closed form statistical approach which led to a simple algebraic expression, and (2) a Monte Carlo type computer solution. The largest difference between the two solutions was less than 12%.

Montgomery, H. E.↗
NASA NTRS1986

Spline-based distributed system identification with application to large space antennas

A parameter and state estimation technique for distributed models is demonstrated through the solution of a problem generic to large space antenna system identification. Assuming the position of the reflective surface of the maypole (hoop/column) antenna to be approximated by the static two-dimensional, stretched-membrane partial differential equation with variable-stiffness coefficient functions, a spline-based approximation procedure is described that estimates the shape and stiffness functions from data set observations. For given stiffness functions, the Galerkin projection with linear spline-based functions is applied to project the distributed problem onto a finite-dimensional subspace wherein algebraic equations exist for determining a static shape (state) prediction. The stiffness functions are then parameterized by cubic splines and the parameters estimated by an output error technique. Numerical results are presented for data descriptive of a 100-m-diameter maypole antenna.

Banks, H. T.↗
NASA NTRS1986

Simultaneous earth observations from two satellites

Simultaneous co-located observations from two different orbits lead to several advantages (i.e., cross calibration of sensors and a wider range of solar-zenith and sensor look angles). The question was asked how many times per year (on the average) do the sub-satellite points of two satellites simultaneously come within D kilometers of each other? For the Space Station (altitude: 500 km, inclination: 28 deg) and a Sun synchronous satellite (altitude 705 km, inclination 98.21 deg) the answers are 16, 41 and 82 times per year for encounter distances D of 20, 50, and 100 km respectively. The relationship between encounters per year and distance D is linear. The answers were obtained in two ways: (1) a closed form statistical approach which led to a simple algebraic expression, and (2) a Monte Carlo type computer solution. The largest difference between the two solutions was less than 12 percent.

Montgomery, H. E.↗
NASA NTRS1990

On three dimensional object recognition and pose-determination: An abstraction based approach

A method of computing reliable Gaussian and mean curvature sign-map descriptors from the polynomial approximation of surfaces was demonstrated. Such descriptors which are invariant under perspective variation are suitable for hypothesis generation. A means for determining the pose of constructed geometric forms whose algebraic surface descriptors are nonlinear in terms of their orienting parameters was developed. This was done by means of linear functions which are capable of approximating nonlinear forms and determining their parameters. It was shown that biquadratic surfaces are suitable companion linear forms for cylindrical approximation and parameter estimation. The estimates provided the initial parametric approximations necessary for a nonlinear regression stage to fine tune the estimates by fitting the actual nonlinear form to the data. A hypothesis-based split-merge algorithm for extraction and pose determination of cylinders and planes which merge smoothly into other surfaces was developed. It was shown that all split-merge algorithms are hypothesis-based. A finite-state algorithm for the extraction of the boundaries of run-length regions was developed. The computation takes advantage of the run list topology and boundary direction constraints implicit in the run-length encoding.

Quek, Kok How Francis↗
NASA NTRS2008

Simulink Model of the Ares I Upper Stage Main Propulsion System

A numerical model of the Ares I upper stage main propulsion system is formulated based on first principles. Equation's are written as non-linear ordinary differential equations. The GASP fortran code is used to compute thermophysical properties of the working fluids. Complicated algebraic constraints are numerically solved. The model is implemented in Simulink and provides a rudimentary simulation of the time history of important pressures and temperatures during re-pressurization, boost and upper stage firing. The model is validated against an existing reliable code, and typical results are shown.

Burchett, Bradley T.↗
NASA NTRS1990

Extensions of algebraic image operators: An approach to model-based vision

Researchers extend their previous research on a highly structured and compact algebraic representation of grey-level images which can be viewed as fuzzy sets. Addition and multiplication are defined for the set of all grey-level images, which can then be described as polynomials of two variables. Utilizing this new algebraic structure, researchers devised an innovative, efficient edge detection scheme. An accurate method for deriving gradient component information from this edge detector is presented. Based upon this new edge detection system researchers developed a robust method for linear feature extraction by combining the techniques of a Hough transform and a line follower. The major advantage of this feature extractor is its general, object-independent nature. Target attributes, such as line segment lengths, intersections, angles of intersection, and endpoints are derived by the feature extraction algorithm and employed during model matching. The algebraic operators are global operations which are easily reconfigured to operate on any size or shape region. This provides a natural platform from which to pursue dynamic scene analysis. A method for optimizing the linear feature extractor which capitalizes on the spatially reconfiguration nature of the edge detector/gradient component operator is discussed.

Lerner, Bao-Ting↗
DOE OSTI2016

Scalable implicit incompressible resistive MHD with stabilized FE and fully-coupled Newton–Krylov-AMG

Here, we discuss that the computational solution of the governing balance equations for mass, momentum, heat transfer and magnetic induction for resistive magnetohydrodynamics (MHD) systems can be extremely challenging. These difficulties arise from both the strong nonlinear, nonsymmetric coupling of fluid and electromagnetic phenomena, as well as the significant range of time- and length-scales that the interactions of these physical mechanisms produce. This paper explores the development of a scalable, fully-implicit stabilized unstructured finite element (FE) capability for 3D incompressible resistive MHD. The discussion considers the development of a stabilized FE formulation in context of the variational multiscale (VMS) method, and describes the scalable implicit time integration and direct-to-steady-state solution capability. The nonlinear solver strategy employs Newton–Krylov methods, which are preconditioned using fully-coupled algebraic multilevel preconditioners. These preconditioners are shown to enable a robust, scalable and efficient solution approach for the large-scale sparse linear systems generated by the Newton linearization. Verification results demonstrate the expected order-of-accuracy for the stabilized FE discretization. The approach is tested on a variety of prototype problems, that include MHD duct flows, an unstable hydromagnetic Kelvin–Helmholtz shear layer, and a 3D island coalescence problem used to model magnetic reconnection. Initial results that explore the scaling of the solution methods are also presented on up to 128K processors for problems with up to 1.8B unknowns on a CrayXK7.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2018

Determination of many-electron basis functions for a quantum Hall ground state using Schur polynomials

A method for determining the ground state of a planar interacting many-electron system in a magnetic field perpendicular to the plane is described. The ground state wave-function is expressed as a linear combination of a set of basis functions. Given only the flux and the number of electrons describing an incompressible state, we use the combinatorics of partitioning the flux among the electrons to derive the basis wave-functions as linear combinations of Schur polynomials. The procedure ensures that the basis wave-functions form representations of the angular momentum algebra. We exemplify the method by deriving the basis functions for the (5/2) quantum Hall state with a few particles. We find that one of the basis functions is precisely the Moore–Read Pfaffian wave function.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2023

Integral boundary conditions in phase field models

Modeling the chemical, electric and thermal transport as well as phase transitions and the accompanying mesoscale microstructure evolution within a material in an electronic device setting involves the solution of partial differential equations often with integral boundary conditions. Employing the familiar Poisson equation describing the electric potential evolution in a material exhibiting insulator to metal transitions, we exploit a special property of such an integral boundary condition, and we properly formulate the variational problem and establish its well-posedness. Next, we compare our method with the commonly-used Lagrange multiplier method that can also handle such boundary conditions. Numerical experiments demonstrate that our new method achieves optimal convergence rate in contrast to the conventional Lagrange multiplier method. Furthermore, the linear system derived from our method is symmetric positive definite, and can be efficiently solved by Conjugate Gradient method with algebraic multigrid preconditioning.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Complex-plane generalization of scalar Levin transforms: A robust, rapidly convergent method to compute potentials and fields in multi-layered media

We propose the complex-plane generalization of a powerful algebraic sequence acceleration algorithm, the method of weighted averages (MWA), to guarantee exponential-cum-algebraic convergence of Fourier and Fourier–Hankel (F–H) integral transforms. This “complex-plane” MWA, effected via a linear-path detour in the complex plane, results in rapid, absolute convergence of field and potential solutions in multi-layered environments regardless of the source-observer geometry and anisotropy/loss of the media present. In this work, we first introduce a new integration path used to evaluate the field contribution arising from the radiation spectra. Subsequently, we (1) exhibit the foundational relations behind the complex-plane extension to a general Levin-type sequence convergence accelerator, (2) specialize this analysis to one member of the Levin transform family (the MWA), (3) address and circumvent restrictions, arising for two-dimensional integrals associated with wave dynamics problems, through minimal complex-plane detour restrictions and a novel partition of the integration domain, (4) develop and compare two formulations based on standard/real-axis MWA variants, and (5) present validation results and convergence characteristics for one of these two formulations.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1973

Analysis and synthesis of distributed-lumped-active networks by digital computer

The use of digital computational techniques in the analysis and synthesis of DLA (distributed lumped active) networks is considered. This class of networks consists of three distinct types of elements, namely, distributed elements (modeled by partial differential equations), lumped elements (modeled by algebraic relations and ordinary differential equations), and active elements (modeled by algebraic relations). Such a characterization is applicable to a broad class of circuits, especially including those usually referred to as linear integrated circuits, since the fabrication techniques for such circuits readily produce elements which may be modeled as distributed, as well as the more conventional lumped and active ones.

Source record↗
NASA NTRS1979

A general and computationally fast formulation for radiative transfer with scattering

A general formulation of monocromatic radiative transfer with scattering has been developed for plane-parallel geometry. The inhomogeneous and nonisothermal medium absorbs, emits, and anisotropically scatters radiation. Surfaces can emit and scatter radiation in any specified manner. The solution procedure uses the fact that phase incoherent scattering is linear in radiative sources. Certain basic scattering functions are then defined and calculated by an adding computer code using matrix algebra. These scattering functions are weighted by the temperature field and summed (superimposed) to obtain the solution for any specific problem. Numerical results for exiting intensities and one-sided heat fluxes from general media bound by one arbitrary surface are presented. These parametric studies demonstrate the effects of scattering particles and surfaces on radiative transfer from inhomogeneous and nonisothermal media. Application of the formulation to radiative equilibrium is also discussed. The conclusion is that all problems in plane-parallel radiative transfer with scattering can be solved by a common and computationally fast algorithm based on this formulation.

Cogley, A. C.↗
NASA NTRS1992

Propagating Qualitative Values Through Quantitative Equations

In most practical problems where traditional numeric simulation is not adequate, one need to reason about a system with both qualitative and quantitative equations. In this paper, we address the problem of propagating qualitative values represented as interval values through quantitative equations. Previous research has produced exponential-time algorithms for approximate solution of the problem. These may not meet the stringent requirements of many real time applications. This paper advances the state of art by producing a linear-time algorithm that can propagate a qualitative value through a class of complex quantitative equations exactly and through arbitrary algebraic expressions approximately. The algorithm was found applicable to Space Shuttle Reaction Control System model.

Kulkarni, Deepak↗
DOE OSTI2014

Discontinuous diffusion synthetic acceleration for S{sub n} transport on 2D arbitrary polygonal meshes

In this paper, a Diffusion Synthetic Acceleration (DSA) technique applied to the S{sub n} radiation transport equation is developed using Piece-Wise Linear Discontinuous (PWLD) finite elements on arbitrary polygonal grids. The discretization of the DSA equations employs an Interior Penalty technique, as is classically done for the stabilization of the diffusion equation using discontinuous finite element approximations. The penalty method yields a system of linear equations that is Symmetric Positive Definite (SPD). Thus, solution techniques such as Preconditioned Conjugate Gradient (PCG) can be effectively employed. Algebraic MultiGrid (AMG) and Symmetric Gauss–Seidel (SGS) are employed as conjugate gradient preconditioners for the DSA system. AMG is shown to be significantly more efficient than SGS. Fourier analyses are carried out and we show that this discontinuous finite element DSA scheme is always stable and effective at reducing the spectral radius for iterative transport solves, even for grids with high-aspect ratio cells. Numerical results are presented for different grid types: quadrilateral, hexagonal, and polygonal grids as well as grids with local mesh adaptivity.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2017

smoothG

smoothG is a collection of parallel C++ classes/functions that algebraically constructs reduced models of different resolutions from a given high-fidelity graph model. In addition, smoothG also provides efficient linear solvers for the reduced models. Other than pure graph problem, the software finds its application in subsurface flow and power grid simulations in which graph Laplacians are found

Barker, AndrewT.↗