Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear equation systems”

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 253 records · Page 14

Chandrasekhar equations for infinite dimensional systems

Chandrasekhar equations are derived for linear time invariant systems defined on Hilbert spaces using a functional analytic technique. An important consequence of this is that the solution to the evolutional Riccati equation is strongly differentiable in time and one can define a strong solution of the Riccati differential equation. A detailed discussion on the linear quadratic optimal control problem for hereditary differential systems is also included.

Ito, K.↗

Chandrasekhar equations for infinite dimensional systems

The existence of Chandrasekhar equations for linear time-invariant systems defined on Hilbert spaces is investigated. An important consequence is that the solution to the evolutional Riccati equation is strongly differentiable in time, and that a strong solution of the Riccati differential equation can be defined. A discussion of the linear-quadratic optimal-control problem for hereditary differential systems is also included.

Ito, K.↗

PyAMG: Algebraic Multigrid Solvers in Python

PyAMG is a Python package of algebraic multigrid (AMG) solvers and supporting tools for approximating the solution to large, sparse linear systems of algebraic equations, Ax = b, where A is an n × n sparse matrix. Sparse linear systems arise in a range of problems in science, from fluid flows to solid mechanics to data analysis. While the direct solvers available in SciPy’s sparse linear algebra package (scipy.sparse.linalg) are highly efficient, in many cases iterative methods are preferred due to overall complexity. However, the iterative methods in SciPy, such as CG and GMRES, often require an efficient preconditioner in order to achieve a lower complexity. Preconditioning is a powerful tool whereby the conditioning of the linear system and convergence rate of the iterative method are both dramatically improved. PyAMG constructs multigrid solvers for use as a preconditioner in this setting. A summary of multigrid and algebraic multigrid solvers can be found in Olson (2015a), in Olson (2015b), and in Falgout (2006); a detailed description can be found in Briggs et al. (2000) and Trottenberg et al. (2001).

97 MATHEMATICS AND COMPUTING↗

Application of a stochastic inverse to the geophysical inverse problem

The inverse problem for gross earth data can be reduced to an undertermined linear system of integral equations of the first kind. A theory is discussed for computing particular solutions to this linear system based on the stochastic inverse theory presented by Franklin. The stochastic inverse is derived and related to the generalized inverse of Penrose and Moore. A Backus-Gilbert type tradeoff curve is constructed for the problem of estimating the solution to the linear system in the presence of noise. It is shown that the stochastic inverse represents an optimal point on this tradeoff curve. A useful form of the solution autocorrelation operator as a member of a one-parameter family of smoothing operators is derived.

Jordan, T. H.↗

Linearizing the BPS equations with vector and tensor multiplets

We analyse the BPS equations of N = (1, 0) supergravity theory in six dimensions coupled to a vector and tensor multiplet. We show how these BPS equations can be reduced to a set of linear differential equations. This system is triangular in that each layer of equations, while linear, is quadratically sourced by the solutions of the previous layers. We examine several explicit examples and discuss the construction of new families of microstate geometries. We expect that the result presented here will open up new branches of superstrata in which the momentum is encoded in a new class of charge carriers.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Computing Method for Sound Propagation Through a Nonuniform Jet Stream

Understanding the principles of jet noise propagation is an essential ingredient of systematic noise reduction research. High speed computer methods offer a unique potential for dealing with complex real life physical systems whereas analytical solutions are restricted to sophisticated idealized models. The classical formulation of sound propagation through a jet flow was found to be inadequate for computer solutions and a more suitable approach was needed. Previous investigations selected the phase and amplitude of the acoustic pressure as dependent variables requiring the solution of a system of nonlinear algebraic equations. The nonlinearities complicated both the analysis and the computation. A reformulation of the convective wave equation in terms of a new set of dependent variables is developed with a special emphasis on its suitability for numerical solutions on fast computers. The technique is very attractive because the resulting equations are linear in nonwaving variables. The computer solution to such a linear system of algebraic equations may be obtained by well-defined and direct means which are conservative of computer time and storage space. Typical examples are illustrated and computational results are compared with available numerical and experimental data.

Padula, S. L.↗

A computing method for sound propagation through a nonuniform jet stream

The classical formulation of sound propagation through a jet flow was found to be inadequate for computer solutions. Previous investigations selected the phase and amplitude of the acoustic pressure as dependent variables requiring the solution of a system of nonlinear algebraic equations. The nonlinearities complicated both the analysis and the computation. A reformulation of the convective wave equation in terms of a new set of dependent variables is developed with a special emphasis on its suitability for numerical solutions on fast computers. The technique is very attractive because the resulting equations are linear in nonwaving variables. The computer solution to such a linear system of algebraic equations may be obtained by well-defined and direct means which are conservative of computer time and storage space. Typical examples are illustrated and computational results are compared with available numerical and experimental data.

Padula, S. L.↗

Parallel-in-Time Solution of Hyperbolic PDE Systems via Characteristic-Variable Block Preconditioning

We consider the parallel-in-time solution of both linear and nonlinear hyperbolic partial differential equation (PDE) systems in one spatial dimension. In the nonlinear setting, the discretized equations are solved with a preconditioned residual iteration based on a global linearization. The linear(ized) equation systems are approximately solved parallel-in-time using a block preconditioner applied in the characteristic variables of the underlying linear(ized) hyperbolic PDE. This change of variables is motivated by the observation that intervariable coupling between characteristic variables is weak, at least locally where spatio-temporal variations in the eigenvectors of the associated flux Jacobian are sufficiently small, while that between the original variables is not. For an ℓ-dimensional system of PDEs, applying the preconditioner consists of solving a sequence of ℓ scalar linear(ized)-advection-like problems, each associated with a different characteristic wave-speed in the underlying linear(ized) PDE. Furthermore, we approximately solve these linear advection problems using multigrid reduction-in-time (MGRIT); however, any other suitable parallel-in-time method could be used. Numerical examples are shown for the (linear) acoustics equations in heterogeneous media and for the (nonlinear) shallow water equations and Euler equations of gas dynamics with shocks and rarefactions. For many test problems, the solver converges in just a handful of iterations and with mesh-independent convergence rates.

97 MATHEMATICS AND COMPUTING↗

Accuracy and convergence of a finite element algorithm for laminar boundary layer flow

The Galerkin-weighted residuals formulation is employed to derive an implicit finite element solution algorithm for a generally non-linear initial-boundary value problem. Solution accuracy and convergence with discretization refinement are quantized in several error norms, for the non-linear parabolic partial differential equation system governing laminar boundary layer flow, using linear, quadratic and cubic functions. Richardson extrapolation is used to isolate integration truncation error in all norms, and Newton iteration is employed for all equation solutions performed in double-precision. The mathematical theory supporting accuracy and convergence concepts for linear elliptic equations appears extensible to the non-linear equations characteristic of laminar boundary layer flow.

Soliman, M. O.↗

Aeroelastic stability of periodic systems with application to rotor blade flutter

The dynamics of a helicopter blade in forward flight are described by a system of linear differential equations with periodic coefficients. The stability of this periodic aeroelastic system is determined, using multivariable Floquet-Liapunov theory. The transition matrix at the end of the period is evaluated by: (1) direct numerical integration, and (2) a new, approximate method, which consists in approximating a periodic function by a series of step functions. The numerical accuracy and efficiency of the methods is compared, and the second method is shown to be superior by far. Results illustrating the effect of the periodic coefficients and various blade parameters are presented.

Friedmann, P.↗

Analytic Guidance for the First Entry in a Skip Atmospheric Entry

This paper presents an analytic method to generate a reference drag trajectory for the first entry portion of a skip atmospheric entry. The drag reference, expressed as a polynomial function of the velocity, will meet the conditions necessary to fit the requirements of the complete entry phase. The generic method proposed to generate the drag reference profile is further simplified by thinking of the drag and the velocity as density and cumulative distribution functions respectively. With this notion it will be shown that the reference drag profile can be obtained by solving a linear algebraic system of equations. The resulting drag profile is flown using the feedback linearization method of differential geometric control as guidance law with the error dynamics of a second order homogeneous equation in the form of a damped oscillator. This approach was first proposed as a revisited version of the Space Shuttle Orbiter entry guidance. However, this paper will show that it can be used to fly the first entry in a skip entry trajectory. In doing so, the gains in the error dynamics will be changed at a certain point along the trajectory to improve the tracking performance.

Garcia-Llama, Eduardo↗

Electro-optical processor for optimal control

An iterative optical processor has been developed for applications in the optimal control of advanced sensor systems. The processor is designed for the realization of the Richardson algorithm on bipolar data, using as input a linear array of LEDs. The usefulness of the processor has been demonstrated by the solution of the linear quadratic regulator problem for the optimal control signals of the F100 turbofan engine. In this case study, the algebraic Riccati equation matrix was solved by the use of a modified Kleinman algorithm along with the Richardson algorithm applied to a system of linear algebraic equations. Preliminary experimental results demonstrate the gradual convergence of the processor.

Casasent, D.↗

Engine identification for adaptive control

An attempt to obtain a dynamic model for a turbofan gas turbine engine for the purpose of adaptive control is described. The requirements for adaptive control indicate that a dynamic model should be identified from data sampled during engine operation. The dynamic model identified was of the form of linear differential equations with time varying coefficients. A turbine engine is, however, a highly nonlinear system, so the identified model would be valid only over a small area near the operating point, thus requiring frequent updating of the coefficients in the model. Therefore it is necessary that the identifier use only recent information to perform its function. The identifier selected minimized the square of the equation errors. Known linear systems were used to test the characteristics of the identifier. It was found that the performance was dependent on the number of data points used in the computations and upon the time interval over which the data points were obtained. Preliminary results using an engine deck for the quiet, clean, shorthaul experimental engine indicate that the identified model predicts the engine motion well when there is sufficient dynamic information, that is when the engine is in transient operation.

Leonard, R. G.↗

Efficient Implementation of Minimal Polynomial and Reduced Rank Extrapolation Methods

The minimal polynomial extrapolation (MPE) and reduced rank extrapolation (RRE) are two effective techniques that have been used in accelerating the convergence of vector sequences, such as those that are obtained from iterative solution of linear and nonlinear systems of equation. Their definitions involve some linear least squares problems, and this causes difficulties in their numerical implementation. Timewise efficient and numerically stable implementations for MPE and RRE are developed. A computer program written in FORTRAN 77 is also appended and applied to some model problems.

Sidi, Avram↗