An algorithm for reducing a linear, time- invariant differential system to state form.
Algorithm for reducing linear time-invariant differential systems to state form applied to systems described by transfer functions
MATRIX ANALYSIS↗
SEARCH · Engineering Papers
Results for “linearity”
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.
Some sufficient conditions for continuous- linear-programming problems.
Continuous linear programming problems with time delays in constraints, noting construction of solutions to dual problem from solution to primal problem
OPTIMIZATION↗
Evaluation of error in application of WKB METHOD to linearized post burnout equation of motion of a sounding rocket.
Error in application of WKB method to linearized postburnout equation of motion of sounding rocket
SOUNDING ROCKET↗
A closed-loop, approximately time-optimal control method for linear systems.
Eigenvector scalar product solutions for closed loop time optimal control of linear systems
LINEAR SYSTEM↗
On ''A method for simplifying linear dynamic systems.''
Equation for linear dynamic systems simplification applicable to all cases irrespective of nature of eigenvalues and eigenvectors
EIGENVALUE↗
A modified quasi-linearization method for solving trajectory optimization problems.
Modified quasi-linearization method for numerically solving trajectory optimization problems with undetermined terminal time
LINEARIZATION↗
Effective construction of linear state-variable models from input/output functions.
Algorithm for minimal realization of linear finite-dimensional dynamical system displayed by Markov parameters
DYNAMIC MODEL↗
Algorithm for worst error in linear systems with bounded input and its rate of change.
Computational worst error algorithm for linear systems and quadratic error criteria, showing flowgraph and computer execution results
ERROR DETECTING CODE↗
Further remarks on simplifying linear dynamic systems.
Approximate model for simplification of linear dynamic system, neglecting effect of higher order time constants
TIME DEPENDENCY↗
Measuring rotational motion with linear accelerometers.
Vehicle angular velocity determined, using configurations with only linear accelerometers and no gyroscopes for inertial navigation systems
INERTIAL GUIDANCE↗
On the construction of discrete approximations to linear differential expressions.
Algorithm for construction of discrete approximations to linear differential expressions in terms of ordinates
APPROXIMATION METHOD↗
On the solution of the general inhomogeneous linear differential equation of second order using Lie series representation.
Inhomogeneous second order linear differential equation solution based on Lie formalism, presenting physical applications
DIFFERENTIAL EQUATION↗
Optimal stationary control of a linear system with state-dependent noise.
Linear optimal stationary control system with state dependent white noise disturbances described by differential equation
STEADY STATE↗
Rapid identification of linear and nonlinear systems.
Rapid parameter identification system for linear time-invariant plant with only input and output measurable
TRANSFER FUNCTION↗
Linearity of a Ge
Ge/Li/ drifted gamma detector for 1/2 to 10 Mev range, measuring response deviation from linearity
RADIATION DETECTOR↗
Chebyshev solution of large linear systems.
Solution of linear system of equations with singularity and stabile with respect to small changes in matrix elements
LINEAR PROGRAMMING↗
On parameter invariance in linear control systems.
Parameter invariance problem for linear systems solved by obtaining necessary and sufficient conditions for invariance in optimal control systems
FEEDBACK CONTROL SYSTEM↗
Using parallel banded linear system solvers in generalized eigenvalue problems
Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speedup is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.
DISTRIBUTED MEMORY MULTIPROCES↗