Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear system”

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 577 records · Page 32
All sourcesNASA NTRSDOE OSTI
NASA NTRS1985

Identifiability of conservative linear mechanical systems

With a sufficiently great number of sensors and actuators, any finite dimensional dynamic system is identifiable on the basis of input-output data. It is presently indicated that, for conservative nongyroscopic linear mechanical systems, the number of sensors and actuators required for identifiability is very large, where 'identifiability' is understood as a unique determination of the mass and stiffness matrices. The required number of sensors and actuators drops by a factor of two, given a relaxation of the identifiability criterion so that identification can fail only if the system parameters being identified lie in a set of measure zero. When the mass matrix is known a priori, this additional information does not significantly affect the requirements for guaranteed identifiability, though the number of parameters to be determined is reduced by a factor of two.

Sirlin, S. W.↗
NASA NTRS1999

Method of Conjugate Radii for Solving Linear and Nonlinear Systems

This paper describes a method to solve a system of N linear equations in N steps. A quadratic form is developed involving the sum of the squares of the residuals of the equations. Equating the quadratic form to a constant yields a surface which is an ellipsoid. For different constants, a family of similar ellipsoids can be generated. Starting at an arbitrary point an orthogonal basis is constructed and the center of the family of similar ellipsoids is found in this basis by a sequence of projections. The coordinates of the center in this basis are the solution of linear system of equations. A quadratic form in N variables requires N projections. That is, the current method is an exact method. It is shown that the sequence of projections is equivalent to a special case of the Gram-Schmidt orthogonalization process. The current method enjoys an advantage not shared by the classic Method of Conjugate Gradients. The current method can be extended to nonlinear systems without modification. For nonlinear equations the Method of Conjugate Gradients has to be augmented with a line-search procedure. Results for linear and nonlinear problems are presented.

Nachtsheim, Philip R.↗
NASA NTRS1960

Analog Techniques for Measuring the Frequency Response of Linear Physical Systems Excited by Frequency-Sweep Inputs

Data-reduction methods using general-purpose analog computer equipment and compatible testing techniques for determining the frequency response of linear physical systems are examined. The techniques considered may be classed as steady state or transient depending on the method of excitation. The relative merits of periodic, slow sweep, and transient (rapid sweep) forcing functions are discussed and applications are given that relate to dynamic-response tests of aeroelastic systems. Two frequency-sweep-input methods are considered in detail. one case the sweep rate is sufficiently slow that the response is approximately the same as that for steady-state conditions. With this input the frequency response can be evaluated and displayed in real time while the test is in progress. Errors due to treating sweep data as steady state can be eliminated, when desired, by reanalyzing tape-recorded time histories of the input and output as transient rather than as periodic data. In the second method the frequency-response function is deter- mined from the system's transient response to a very rapid sweep input. The purpose of frequency sweep in this case is to provide sufficient harmonic content in the input to overcome noise while keeping the test time as short as possible. tests and limited flight-test data presented herein, it appears that a transient-type rapid-sweep forcing function offers a considerable saving in test time while preserving the accuracy possible with steady-state sinusoidal inputs.

Wilmer H. Reed III↗
NASA NTRS1973

Energy-like Liapunov functionals for linear elastic systems on a Hilbert space.

An approach is presented for generating energy-like functionals for linear elastic dynamic systems on a Hilbert space. The objective is to obtain a family of functionals which may be used for stability analysis of the equilibrium, i.e., Liapunov functionals. Although the energy functional, when one exists, is always a member of this family, the family is shown to exist even when an energy functional does not. Several discrete and distributed-parameter examples are presented, as are certain specific techniques for utilizing this approach.

Walker, J. A.↗
NASA NTRS1976

Recursive identification and tracking of parameters for linear and non-linear multivariable systems

The problem of identifying constant and variable parameters in multi-input, multi-output, linear and nonlinear systems is considered, using the maximum likelihood approach. An iterative algorithm, leading to recursive identification and tracking of the unknown parameters and the noise covariance matrix, is developed. Agile tracking and accurate and unbiased identified parameters are obtained. Necessary conditions for a globally asymptotically stable identification process are provided; the conditions proved to be useful and efficient. Among different cases studied, the stability derivatives of an aircraft were identified and some of the results are shown as examples.

Sidar, M.↗
NASA NTRS1972

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.↗
DOE OSTI2017

Stage-parallel fully implicit Runge–Kutta solvers for discontinuous Galerkin fluid simulations

In this paper, we develop new techniques for solving the large, coupled linear systems that arise from fully implicit Runge–Kutta methods. This method makes use of the iterative preconditioned GMRES algorithm for solving the linear systems, which has seen success for fluid flow problems and discontinuous Galerkin discretizations. By transforming the resulting linear system of equations, one can obtain a method which is much less computationally expensive than the untransformed formulation, and which compares competitively with other time-integration schemes, such as diagonally implicit Runge–Kutta (DIRK) methods. We develop and test several ILU-based preconditioners effective for these large systems. We additionally employ a parallel-in-time strategy to compute the Runge–Kutta stages simultaneously. Numerical experiments are performed on the Navier–Stokes equations using Euler vortex and 2D and 3D NACA airfoil test cases in serial and in parallel settings. In conclusion, the fully implicit Radau IIA Runge–Kutta methods compare favorably with equal-order DIRK methods in terms of accuracy, number of GMRES iterations, number of matrix–vector multiplications, and wall-clock time, for a wide range of time steps.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2023

A greedy Galerkin method to efficiently select sensors for linear dynamical systems

A key challenge in inverse problems is the selection of sensors to gather the most effective data. In this paper, we consider the problem of inferring the initial condition to a linear dynamical system and develop an efficient control-theoretical approach for greedily selecting sensors. Our method employs a Galerkin projection to reduce the size of the inverse problem, resulting in a computationally efficient algorithm for sensor selection. As a byproduct of our algorithm, we obtain a preconditioner for the inverse problem that enables the rapid recovery of the initial condition. Here, we analyze the theoretical performance of our greedy sensor selection algorithm as well as the performance of the associated preconditioner. Finally, we verify our theoretical results on various inverse problems involving partial differential equations.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1978

An application of the square-root information filter to large scale linear interconnected systems

The paper considers the use of numerically stable square-root information filter (SRIF) algorithms to reduce the computation and storage requirements of a certain class of large-scale linear interconnected systems (multistation satellite tracking is examined as an example). The reductions are in comparison with conventional sequential covariance type formulations. To illustrate the SRIF algorithm: a 40 subsystem, 10 state problem, for example, has its storage requirements reduced by a full order of magnitude (from 84255 to 8100).

Bierman, G. J.↗
NASA NTRS1974

Stabilization of nonlinear systems using linear observers

It is shown that a linear observer can always be employed to stabilize a nonlinear system which contains a true Popov type nonlinearity in the closed interval from 0 to k, where k is finite, provided the nonlinear function and a completely observable output of the linear portion are available as inputs to the observer. Taking into consideration the case in which a completely observable output is not available from the linear portion, stabilization is shown to be possible if the original linear approximation of the system is asymptotically stable.

Strane, R. E.↗
DOE OSTI2019

Quantum algorithms for systems of linear equations inspired by adiabatic quantum computing

We present two quantum algorithms based on evolution randomization, a simple variant of adiabatic quantum computing, to prepare a quantum state |x⟩ that is proportional to the solution of the system of linear equations $A\overrightarrow{x} = \overrightarrow{b}$. The time complexities of our algorithms are O(κ 2 log(κ)/ε) and O(κ log(κ)/ε), where κ is the condition number of A and ε is the precision. Both algorithms are constructed using families of Hamiltonians that are linear combinations of products of A, the projector onto the initial state |b⟩, and single-qubit Pauli operators. The algorithms are conceptually simple and easy to implement. They are not obtained from equivalences between the gate model and adiabatic quantum computing. They do not use phase estimation or variable-time amplitude amplification, and do not require large ancillary systems. We discuss a gate-based implementation via Hamiltonian simulation and prove that our second algorithm is almost optimal in terms of κ. Like previous methods, our techniques yield an exponential quantum speed-up under some assumptions. Our results emphasize the role of Hamiltonian-based models of quantum computing for the discovery of important algorithms.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1986

Approximating linearizations for nonlinear systems

The following problem is examined: given a nonlinear control system dot-x(t) = f(x(t)) + the sum to m terms(i=1) u sub i (t)g sub i (x(t)) on R(n) and a point x(0) in R(n), approximate the system near x(0) by a linear system. One approach is to use the usual Taylor series linearization. However, the controllability properties of both the nonlinear and linear systems depend on certain Lie brackets of the vector field under consideration. This suggests that a linear approximation based on Lie bracket matching should be constructed at x(0). In general, the linearizations based on the Taylor method and the Lie bracket approach are different. However, under certain mild assumptions, it is shown that there is a coordinate system for R(n) near x(0) in which these two types of linearizations agree. The importance of this agreement is indicated by examining the time responses of the nonlinear system and its linear approximation and comparing the lower order kernels in Volterra expansions of each.

Hunt, L. R.↗
NASA NTRS1986

Approximating linearizations for nonlinear systems

The following problem is examined: given a nonlinear control system dot-x(t) = f(x/t/) + the sum to m terms (i = 1) u sub i (t)g sub i (x/t/) on R(n) and a point x(0) in R(n), approximate the system near x(0) by a linear system. One approach is to use the usual Taylor series linearization. However, the controllability properties of both the nonlinear and linear systems depend on certain Lie brackets of the vector field under consideration. This suggests that a linear approximation based on Lie bracket matching should be constructed at x(0). In general, the linearizations based on the Taylor method and the Lie bracket approach are different. However, under certain mild assumptions, it is shown that there is a coordinate system for R(n) near x(0) in which these two types of linearizations agree. The importance of this agreement is indicated by examining the time responses of the nonlinear system and its linear approximation and comparing the lower order kernels in Volterra expansions of each.

Hunt, L. R.↗
NASA NTRS1987

An error bound for a discrete reduced order model of a linear multivariable system

The design of feasible controllers for high dimension multivariable systems can be greatly aided by a method of model reduction. In order for the design based on the order reduction to include a guarantee of stability, it is sufficient to have a bound on the model error. Previous work has provided such a bound for continuous-time systems for algorithms based on balancing. In this note an L-infinity bound is derived for model error for a method of order reduction of discrete linear multivariable systems based on balancing.

Al-Saggaf, Ubaid M.↗
DOE OSTI2011

Efficient scalable algorithms for hierarchically semiseparable matrices

Hierarchically semiseparable (HSS) matrix algorithms are emerging techniques in constructing the superfast direct solvers for both dense and sparse linear systems. Here, we develope a set of novel parallel algorithms for the key HSS operations that are used for solving large linear systems. These include the parallel rank-revealing QR factorization, the HSS constructions with hierarchical compression, the ULV HSS factorization, and the HSS solutions. The HSS tree based parallelism is fully exploited at the coarse level. The BLACS and ScaLAPACK libraries are used to facilitate the parallel dense kernel operations at the ne-grained level. We have appplied our new parallel HSS-embedded multifrontal solver to the anisotropic Helmholtz equations for seismic imaging, and were able to solve a linear system with 6.4 billion unknowns using 4096 processors, in about 20 minutes. The classical multifrontal solver simply failed due to high demand of memory. To our knowledge, this is the first successful demonstration of employing the HSS algorithms in solving the truly large-scale real-world problems. Our parallel strategies can be easily adapted to the parallelization of the other rank structured methods.

01 COAL, LIGNITE, AND PEAT↗
DOE OSTI2014

Magnetic and dielectric properties of one-dimensional array of S = 1/2 linear trimer system Na{sub 2}Cu{sub 3}Ge{sub 4}O{sub 12}

Magnetic susceptibility χ, specific heat C, capacitance C{sub p}, and {sup 23}Na-NMR measurements have been carried out on polycrystalline samples of quantum spin linear trimer system Na{sub 2}Cu{sub 3}Ge{sub 4}O{sub 12}, which has the one-dimensional array of Cu{sub 3}O{sub 8} trimers formed of edge-sharing three CuO{sub 4} square planes. The exchange interactions between the Cu{sup 2+} (S = 1/2) spins have been determined by analyzing χ-T and C-T curves. By employing the isolated S = 1/2 Heisenberg trimer model above 70 K, the nearest-neighbor exchange couplings J{sub 1} and the second-neighbor one J{sub 2} in trimer have been evaluated to J{sub 1}/k{sub B} = 30 ± 20 K (antiferromagnetic) and J{sub 2}/k{sub B} = 340 ± 20 K. At low temperature region, two spins of the edge in the Cu{sub 3}O{sub 8} trimers form a nonmagnetic singlet by strong antiferromagnetic interaction J{sub 2}, and the spin left in the center of the Cu{sub 3}O{sub 8} trimer forms one-dimensional chains by the exchange interaction J{sub 3} between the trimers. By employing the S = 1/2 uniform Heisenberg chain model below 70 K, we have evaluated to J{sub 3}/k{sub B} = 18 ± 1 K. The mechanism of multiferroic behavior at T{sub c} = 2 K is discussed.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2017

Hyperentanglement concentration of nonlocal two-photon six-qubit systems with linear optics

Hyperentanglement, the entangled states in the multiple degrees of freedom (DOFs) of a photon system simultaneously, has attracted much attention recently as it can increase the capacity of quantum communication largely. Here we present the first scheme for concentrating the nonlocal two-photon six-qubit systems entangled in polarization, spatial-mode, and time-bin DOFs with linear optics. We construct the parity-check gates for the quantum states of nonlocal photon systems in all the three DOFs with linear-optical elements. Fortunately, our parity-check gate for one DOF does not affect the quantum states in the other two DOFs, which makes our hyperentanglement concentration protocol (hyper-ECP) can be implemented conveniently for polarization–spatial–time-bin partially hyperentangled states. This hyper-ECP is practical as it requires only linear-optical elements, and it can be directly generalized to improve the entanglement of nonlocal multi-photon systems entangled in three DOFs in the long-distance high-capacity quantum communication. - Highlights: • A linear hyperentanglement concentration protocol is proposed for photon systems. • Parity-check gates on one degree of freedom (DOF) will not affect the other two DOFs. • Polarization, spatial-mode, and time-bin DOFs are manipulated with linear optics. • Nonlocal maximally hyperentangled two-photon six-qubit systems are obtained. • Entanglement of multiphoton systems in three DOFs can be improved with this method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗