Further remarks on simplifying linear dynamic systems.
Approximate model for simplification of linear dynamic system, neglecting effect of higher order time constants
TIME DEPENDENCY↗
SEARCH · Search NASA
Results for “Linear approximation”
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.
Estimation of time- and state-dependent delays and other parameters in functional differential equations
A parameter estimation algorithm is developed which can be used to estimate unknown time- or state-dependent delays and other parameters (e.g., initial condition) appearing within a nonlinear nonautonomous functional differential equation. The original infinite dimensional differential equation is approximated using linear splines, which are allowed to move with the variable delay. The variable delays are approximated using linear splines as well. The approximation scheme produces a system of ordinary differential equations with nice computational properties. The unknown parameters are estimated within the approximating systems by minimizing a least-squares fit-to-data criterion. Convergence theorems are proved for time-dependent delays and state-dependent delays within two classes, which say essentially that fitting the data by using approximations will, in the limit, provide a fit to the data using the original system. Numerical test examples are presented which illustrate the method for all types of delay.
Murphy, K. A.↗
Estimation of time- and state-dependent delays and other parameters in functional differential equations
A parameter estimation algorithm is developed which can be used to estimate unknown time- or state-dependent delays and other parameters (e.g., initial condition) appearing within a nonlinear nonautonomous functional differential equation. The original infinite dimensional differential equation is approximated using linear splines, which are allowed to move with the variable delay. The variable delays are approximated using linear splines as well. The approximation scheme produces a system of ordinary differential equations with nice computational properties. The unknown parameters are estimated within the approximating systems by minimizing a least-squares fit-to-data criterion. Convergence theorems are proved for time-dependent delays and state-dependent delays within two classes, which say essentially that fitting the data by using approximations will, in the limit, provide a fit to the data using the original system. Numerical test examples are presented which illustrate the method for all types of delay.
Murphy, K. A.↗
An approximation theory for the identification of linear thermoelastic systems
An abstract approximation framework and convergence theory for the identification of thermoelastic systems is developed. Starting from an abstract operator formulation consisting of a coupled second order hyperbolic equation of elasticity and first order parabolic equation for heat conduction, well-posedness is established using linear semigroup theory in Hilbert space, and a class of parameter estimation problems is then defined involving mild solutions. The approximation framework is based upon generic Galerkin approximation of the mild solutions, and convergence of solutions of the resulting sequence of approximating finite dimensional parameter identification problems to a solution of the original infinite dimensional inverse problem is established using approximation results for operator semigroups. An example involving the basic equations of one dimensional linear thermoelasticity and a linear spline based scheme are discussed. Numerical results indicate how the approach might be used in a study of damping mechanisms in flexible structures.
Rosen, I. G.↗
Approximation theory for LQG (Linear-Quadratic-Gaussian) optimal control of flexible structures
An approximation theory is presented for the LQG (Linear-Quadratic-Gaussian) optimal control problem for flexible structures whose distributed models have bounded input and output operators. The main purpose of the theory is to guide the design of finite dimensional compensators that approximate closely the optimal compensator. The optimal LQG problem separates into an optimal linear-quadratic regulator problem and an optimal state estimation problem. The solution of the former problem lies in the solution to an infinite dimensional Riccati operator equation. The approximation scheme approximates the infinite dimensional LQG problem with a sequence of finite dimensional LQG problems defined for a sequence of finite dimensional, usually finite element or modal, approximations of the distributed model of the structure. Two Riccati matrix equations determine the solution to each approximating problem. The finite dimensional equations for numerical approximation are developed, including formulas for converting matrix control and estimator gains to their functional representation to allow comparison of gains based on different orders of approximation. Convergence of the approximating control and estimator gains and of the corresponding finite dimensional compensators is studied. Also, convergence and stability of the closed-loop systems produced with the finite dimensional compensators are discussed. The convergence theory is based on the convergence of the solutions of the finite dimensional Riccati equations to the solutions of the infinite dimensional Riccati equations. A numerical example with a flexible beam, a rotating rigid body, and a lumped mass is given.
Gibson, J. S.↗
Semigroup theory and numerical approximation for equations in linear viscoelasticity
A class of abstract integrodifferential equations used to model linear viscoelastic beams is investigated analytically, applying a Hilbert-space approach. The basic equation is rewritten as a Cauchy problem, and its well-posedness is demonstrated. Finite-dimensional subspaces of the state space and an estimate of the state operator are obtained; approximation schemes for the equations are constructed; and the convergence is proved using the Trotter-Kato theorem of linear semigroup theory. The actual convergence behavior of different approximations is demonstrated in numerical computations, and the results are presented in tables.
Fabiano, R. H.↗
Galactic oscillator symmetry
Riemann ellipsoids model rotating galaxies when the galactic velocity field is a linear function of the Cartesian coordinates of the galactic masses. In nuclear physics, the kinetic energy in the linear velocity field approximation is known as the collective kinetic energy. But, the linear approximation neglects intrinsic degrees of freedom associated with nonlinear velocity fields. To remove this limitation, the theory of symplectic dynamical symmetry is developed for classical systems. A classical phase space for a self-gravitating symplectic system is a co-adjoint orbit of the noncompact group SP(3,R). The degenerate co-adjoint orbit is the 12 dimensional homogeneous space Sp(3,R)/U(3), where the maximal compact subgroup U(3) is the symmetry group of the harmonic oscillator. The Hamiltonian equations of motion on each orbit form a Lax system X = (X,F), where X and F are elements of the symplectic Lie algebra. The elements of the matrix X are the generators of the symplectic Lie algebra, viz., the one-body collective quadratic functions of the positions and momenta of the galactic masses. The matrix F is composed from the self-gravitating potential energy, the angular velocity, and the hydostatic pressure. Solutions to the hamiltonian dynamical system on Sp(3,R)/U(3) are given by symplectic isospectral deformations. The Casimirs of Sp(3,R), equal to the traces of powers of X, are conserved quantities.
Rosensteel, George↗
Polynomial compensation, inversion, and approximation of discrete time linear systems
The least-squares transformation of a discrete-time multivariable linear system into a desired one by convolving the first with a polynomial system yields optimal polynomial solutions to the problems of system compensation, inversion, and approximation. The polynomial coefficients are obtained from the solution to a so-called normal linear matrix equation, whose coefficients are shown to be the weighting patterns of certain linear systems. These, in turn, can be used in the recursive solution of the normal equation.
Baram, Yoram↗
Comparison of dynamical approximation schemes for non-linear gravitational clustering
We have recently conducted a controlled comparison of a number of approximations for gravitational clustering against the same n-body simulations. These include ordinary linear perturbation theory (Eulerian), the adhesion approximation, the frozen-flow approximation, the Zel'dovich approximation (describable as first-order Lagrangian perturbation theory), and its second-order generalization. In the last two cases we also created new versions of approximation by truncation, i.e., smoothing the initial conditions by various smoothing window shapes and varying their sizes. The primary tool for comparing simulations to approximation schemes was crosscorrelation of the evolved mass density fields, testing the extent to which mass was moved to the right place. The Zel'dovich approximation, with initial convolution with a Gaussian e(exp -k(exp 2)/k(exp 2, sub G)) where k(sub G) is adjusted to be just into the nonlinear regime of the evolved model (details in text) worked extremely well. Its second-order generalization worked slightly better. All other schemes, including those proposed as generalizations of the Zel'dovich approximation created by adding forces, were in fact generally worse by this measure. By explicitly checking, we verified that the success of our best-choice was a result of the best treatment of the phases of nonlinear Fourier components. Of all schemes tested, the adhesion approximation produced the most accurate nonlinear power spectrum and density distribution, but its phase errors suggest mass condensations were moved to slightly the wrong location. Due to its better reproduction of the mass density distribution function and power spectrum, it might be preferred for some uses. We recommend either n-body simulations or our modified versions of the Zel'dovich approximation, depending upon the purpose. The theoretical implication is that pancaking is implicit in all cosmological gravitational clustering, at least from Gaussian initial conditions, even when subcondensations are present.
Melott, Adrian L.↗
Quasi-linear regime of gravitational instability: Implication to density-velocity relation
The well known linear relation between density and peculiar velocity distributions is a powerful tool for studying the large-scale structure in the Universe. Potentially it can test the gravitational instability theory and measure Omega. At present it is used in both ways: the velocity is reconstructed, provided the density is given, and vice versa. Reconstructing the density from the velocity field usually makes use of the Zel'dovich approximation. However, the standard linear approximation in Eulerian space is used when the velocity is reconstructed from the density distribution. I show that the linearized Zel'dovich approximation, in other words the linear approximation in the Lagrangian space, is more accurate for reconstructing velocity. In principle, a simple iteration technique can recover both the density and velocity distributions in Lagrangian space, but its practical application may need an additional study.
Shandarin, Sergei F.↗
Recursive inversion of externally defined linear systems
The approximate inversion of an internally unknown linear system, given by its impulse response sequence, by an inverse system having a finite impulse response, is considered. The recursive least squares procedure is shown to have an exact initialization, based on the triangular Toeplitz structure of the matrix involved. The proposed approach also suggests solutions to the problems of system identification and compensation.
Bach, Ralph E., Jr.↗
Model reduction using new optimal Routh approximant technique
An optimal Routh approximant of a single-input single-output dynamic system is a reduced-order transfer function of which the denominator is obtained by the Routh approximation method while the numerator is determined by minimizing a time-response integral-squared-error (ISE) criterion. In this paper, a new elegant approach is presented for obtaining the optimal Routh approximants for linear time-invariant continuous-time systems. The approach is based on the Routh canonical expansion, which is a finite-term orthogonal series of rational basis functions, and minimization of the ISE criterion. A procedure for combining the above approach with the bilinear transformation is also presented in order to obtain the optimal bilinear Routh approximants of linear time-invariant discrete-time systems. The proposed technique is simple in formulation and is amenable to practical implementation.
Hwang, Chyi↗
On approximating hereditary dynamics by systems of ordinary differential equations
The paper deals with methods of obtaining approximate solutions to linear retarded functional differential equations (hereditary systems). The basic notion is to project the infinite dimensional space of initial functions for the hereditary system onto a finite dimensional subspace. Within this framework, two particular schemes are discussed. The first uses well-known piecewise constant approximations, while the second is a new method based on piecewise linear approximating functions. Numerical results are given.
Cliff, E. M.↗
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↗
Bounded phase coordinate control second quarterly progress report, 15 sep. - 14 dec. 1964
Approximation to linear bounded phase coordinate control problems
APPROXIMATION METHOD↗
Spinning mode acoustic radiation from the flight inlet
A mathematical model was developed for spinning mode acoustic radiation from a thick wall duct without flow. This model is based on a series of experiments (with and without flow). A nearly pure azimuthal spinning mode was isolated and then reflection coefficients and far field pressure (amplitude and phase) were measured. In our model the governing boundary value problem for the Helmholtz equation is first converted into an integral equation for the unknown acoustic pressure over a disk, S1, near the mouth of the duct and over the exterior surface, S2, of the duct. Assuming a pure azimuthal mode excitation, the azimuthal dependence is integrated out which yields an integral equation over the generator C1 of S1 and the generator C2 of S2. The sound pressure on C1 was approximated by a truncated modal expansion of the interior acoustic pressure. Piecewise linear spline approximation on C2 was used.
Moss, W. F.↗
A new finite element formulation for computational fluid dynamics. IX - Fourier analysis of space-time Galerkin/least-squares algorithms
A Fourier stability and accuracy analysis of the space-time Galerkin/least-squares method as applied to a time-dependent advective-diffusive model problem is presented. Two time discretizations are studied: a constant-in-time approximation and a linear-in-time approximation. Corresponding space-time predictor multi-corrector algorithms are also derived and studied. The behavior of the space-time algorithms is compared to algorithms based on semidiscrete formulations.
Shakib, Farzin↗
Multigrid approaches to non-linear diffusion problems on unstructured meshes
The efficiency of three multigrid methods for solving highly non-linear diffusion problems on two-dimensional unstructured meshes is examined. The three multigrid methods differ mainly in the manner in which the nonlinearities of the governing equations are handled. These comprise a non-linear full approximation storage (FAS) multigrid method which is used to solve the non-linear equations directly, a linear multigrid method which is used to solve the linear system arising from a Newton linearization of the non-linear system, and a hybrid scheme which is based on a non-linear FAS multigrid scheme, but employs a linear solver on each level as a smoother. Results indicate that all methods are equally effective at converging the non-linear residual in a given number of grid sweeps, but that the linear solver is more efficient in cpu time due to the lower cost of linear versus non-linear grid sweeps.
Mavriplis, Dimitri J.↗