SEARCH · Engineering Papers
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.
The isospectral deformation of a Sturm-Liouville equation is extended to general linear time-varying systems and a method is described for determining the resulting nonlinear partial differential equations. Consideration is given to (1) isospectral deformation of I/O systems with boundary value conditions and (2) the spectral vector bundles attached to linear time-varying systems.
This paper considers the problem of decentralized control of two weakly coupled linear stochastic systems, using quadratic performance indices. The basic idea is to have each controller control independently his own system, based upon noisy measurements of his own output. To compensate for the effects of weak coupling upon the resultant performance, fake white plant noise is introduced to each system. The appropriate intensity of the fake plant noise is obtained through the solution of an off-line deterministic matrix optimal control problem. The effects of this design method upon the overall coupled system performance are analyzed as a function of the degree of intersystem coupling.
Analysis of piecewise linear system by solution of integral equations
Methods are presented that use general correlative time-response input and output data for a linear system to determine the frequency-response function of that system. These methods give an exact description of any linear system for which such transient data are available. Examples are shown of application of a method to both an underdamped and a critically damped exact second-order system, and to an exact first-order system with and without dead time. Experimental data for a turbine-propeller engine showing the response of engine speed to change in propeller-blade angle are presented and analyzed.
Quantum computers hold promise for solving problems intractable for classical computers, especially those with high time or space complexity. Practical quantum advantage can be said to exist for such problems when the end-to-end time for solving such a problem using a classical algorithm exceeds that required by a quantum algorithm. Reducing the power flow (PF) problem into a linear system of equations allows for the formulation of quantum PF (QPF) algorithms, which are based on solving methods for quantum linear systems such as the Harrow-Hassidim-Lloyd (HHL) algorithm. Speedup from using QPF algorithms is often claimed to be exponential when compared to classical PF solved by state-of-the-art algorithms. Here, we investigate the potential for practical quantum advantage in solving QPF compared to classical methods on gate-based quantum computers. Notably, this paper does not present a new QPF solving algorithm but scrutinizes the end-to-end complexity of the QPF approach, providing a nuanced evaluation of the purported quantum speedup in this problem. Our analysis establishes a best-case bound for the HHL-based quantum power flow complexity, conclusively demonstrating that the HHL-based method has higher runtime complexity compared to the classical algorithm for solving the direct current power flow (DCPF) and fast decoupled load flow (FDLF) problem. Notably, our analysis and conclusions can be extended to any quantum linear system solver with rigorous performance guarantees, based on the known complexity lower bounds for this problem. Additionally, we establish that for potential practical quantum advantage (PQA) to exist it is necessary to consider DCPF-type problems with a very narrow range of condition number values and readout requirements.
Fixed linear systems with generalized performance criteria
Identification of finite memory, time discrete linear systems by Kiefer-Wolfowitz stochastic approximation procedures, presenting two algorithms for sequential identification
Optimal control of linear systems with incomplete information
Parameter identification and state estimation for linear systems
A model of a general class of asynchronous, iterative solution methods for linear systems is developed. In the model, the system is solved by creating several cooperating tasks that each compute a portion of the solution vector. A data transfer model predicting both the probability that data must be transferred between two tasks and the amount of data to be transferred is presented. This model is used to derive an execution time model for predicting parallel execution time and an optimal number of tasks given the dimension and sparsity of the coefficient matrix and the costs of computation, synchronization, and communication. The suitability of different parallel architectures for solving randomly sparse linear systems is discussed. Based on the complexity of task scheduling, one parallel architecture, based on a broadcast bus, is presented and analyzed.
Eigenvector scalar product solutions for closed loop time optimal control of linear systems
Control-theory design package, called Optimal Regulator Algorithms for Control of Linear Systems (ORACLS), aids in design of controllers and optimal filters for systems modeled by linear, time invariant differential and difference equations. ORACLS is particularly attractive rigorous tool for dealing with multi-input and multi-output dynamic systems in both continuous and discrete forms.
The PROTEUS code developed under the DOE NEAMS program is a high-fidelity capable whole core transports solver based on unstructured finite element meshes [1]. PROTEUS includes three distinct transport solvers: SN, MOC and NODAL. Among them, the PROTEUS-MOC is the 3D method of characteristics (MOC) solver for extruded geometries. In order to accelerate the convergence of 3D MOC calculation, the CMFD acceleration method was implemented in PROTEUS-MOC [2]. For solving the CMFD linear system, the unpreconditioned GMRES algorithm was used in the previous work [3, 4] for implementing the CMFD scheme because of low computation cost of coarse mesh calculations. In the performance tests, we found that the overhead of the CMFD acceleration became non-negligible as the condition number of the CMFD linear system and the size of problem increase. This indicated that the CMFD overhead should be reduced in the preconditioning technique in order to improve the computational performance. In this work, the performance of CMFD acceleration was notably improved by developing and implementing the new formulation of CMFD linear system and preconditioning technique.
Mathematical model used in estimating statistics of randomly varying parameters of linear systems
Effect of spacewise variations in random load field on response of linear system - statistical mechanics
Adaptive state vector control - section 6, the theory of average power optimal control of linear systems
Abstract This paper investigates the quadratic optimal control problem for constrained Markov jump linear systems with incomplete mode transition probability matrix (MTPM). Considering original system mode is not accessible, observed mode is utilized for asynchronous controller design where mode observation conditional probability matrix (MOCPM), which characterizes the emission between original modes and observed modes is assumed to be partially known. An LMI optimization problem is formulated for such constrained hidden Markov jump linear systems with incomplete MTPM and MOCPM. Based on this, a feasible state-feedback controller can be designed with the application of free-connection weighting matrix method. The desired controller, dependent on observed mode, is an asynchronous one which can minimize the upper bound of quadratic cost and satisfy restrictions on system states and control variables. Furthermore, clustering observation where observed modes recast into several clusters, is explored for simplifying the computational complexity. Numerical examples are provided to illustrate the validity.
Two methods are established for identifying constant-coefficient, C to the 2n power type of noise-free linear systems if the time response data of the input-output or of all states are known. 2n response data are required to identify an nth-order transfer function or state equation for an unknown linear system. The order of the unknown system can be identified by checking a sequence of determinants. The Z transform and its inversion are mainly used.