Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear 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 1,009 records · Page 56

H(sub infinity)-type filter for spacecraft attitude estimation

A nonlinear filtering theory from a deterministic point of view is presented and an application to attitude determination is considered. The approach that is taken in this paper is motivated largely by the H(sun infinity) control and estimation theory for linear systems which has been evolved within the last decade. Rather than formulating the estimation problem as a game played by two adversaries, as has been done in the linear case, we employ in this work some notions from the theory of dissipative systems as a vehicle for arriving at certain Hamilton-Jacobi inequality, which in turn, provides a solution to the filtering problem, whenever it is satisfied. Application of this method to a linear estimation problem and to the problem of estimating a spacecraft attitude quaternion and gyro drift bias vector are presented. In limiting cases, these give the Kalman filter and the extended Kalman filter, respectively. The main advantages of this approach over its probabilistic counterpart are that this approach does not require a prior knowledge of any statistics, and that in general it is more amenable to a quantitative assessment regarding approximations such as linearization, and that in certain cases this approach yields an exact solution to the nonlinear filtering.

Markley, F. Landis↗

ORACLS: A system for linear-quadratic-Gaussian control law design

A modern control theory design package (ORACLS) for constructing controllers and optimal filters for systems modeled by linear time-invariant differential or difference equations is described. Numerical linear-algebra procedures are used to implement the linear-quadratic-Gaussian (LQG) methodology of modern control theory. Algorithms are included for computing eigensystems of real matrices, the relative stability of a matrix, factored forms for nonnegative definite matrices, the solutions and least squares approximations to the solutions of certain linear matrix algebraic equations, the controllability properties of a linear time-invariant system, and the steady state covariance matrix of an open-loop stable system forced by white noise. Subroutines are provided for solving both the continuous and discrete optimal linear regulator problems with noise free measurements and the sampled-data optimal linear regulator problem. For measurement noise, duality theory and the optimal regulator algorithms are used to solve the continuous and discrete Kalman-Bucy filter problems. Subroutines are also included which give control laws causing the output of a system to track the output of a prescribed model.

Armstrong, E. S.↗

Output Tracking for Systems with Non-Hyperbolic and Near Non-Hyperbolic Internal Dynamics: Helicopter Hover Control

A technique to achieve output tracking for nonminimum phase linear systems with non-hyperbolic and near non-hyperbolic internal dynamics is presented. This approach integrates stable inversion techniques, that achieve exact-tracking, with approximation techniques, that modify the internal dynamics to achieve desirable performance. Such modification of the internal dynamics is used (1) to remove non-hyperbolicity which an obstruction to applying stable inversion techniques and (2) to reduce large pre-actuation time needed to apply stable inversion for near non-hyperbolic cases. The method is applied to an example helicopter hover control problem with near non-hyperbolic internal dynamic for illustrating the trade-off between exact tracking and reduction of pre-actuation time.

Devasia, Santosh↗

GPU-resident sparse direct linear solvers for alternating current optimal power flow analysis

Integrating renewable resources within the transmission grid at a wide scale poses significant challenges for economic dispatch as it requires analysis with more optimization parameters, constraints, and sources of uncertainty. This motivates the investigation of more efficient computational methods, especially those for solving the underlying linear systems, which typically take more than half of the overall computation time. In this paper, we present our work on sparse linear solvers that take advantage of hardware accelerators, such as graphical processing units (GPUs), and improve the overall performance when used within economic dispatch computations. We treat the problems as sparse, which allows for faster execution but also makes the implementation of numerical methods more challenging. We present the first GPU-native sparse direct solver that can execute on both AMD and NVIDIA GPUs. We demonstrate significant performance improvements when using high-performance linear solvers within alternating current optimal power flow (ACOPF) analysis. Furthermore, we demonstrate the feasibility of getting significant performance improvements by executing the entire computation on GPU-based hardware. Finally, we identify outstanding research issues and opportunities for even better utilization of heterogeneous systems, including those equipped with GPUs.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Output feedback and generic stabilizability

Attention is given to questions of pole placement and stabilization for generic linear systems with prescribed state, input and output dimension for the case where the controller must be implemented by linear memoryless output feedback. A criterion is presented in terms of a special pole placement property for generic stabilizability, and this criterion is used to describe constraints on the dimension which are consistent with generic stabilizability. Also treated are the rationality and solvability by radicals of stabilizing or pole positioning gains, and the way in which decision algebra can theoretically handle existence questions for generic systems is described.

Byrnes, C. I.↗

Asymptotics of the General Solution of a Linear Singularly Perturbed System of Higher-Order Differential Equations with Degenerations

By using the theory of polynomial matrix pencils, we construct the asymptotics of linearly independent solutions of homogeneous singularly perturbed system of linear differential equations of any order m with matrices at higher derivatives degenerating as a small parameter approaches zero. The general case is analyzed. In this case, the limit matrix pencil has several finite and infinite elementary divisors of both the same and different multiplicities. The corresponding asymptotic estimates are presented.

97 MATHEMATICS AND COMPUTING↗

GenMod: A generative modeling approach for spectral representation of PDEs with random inputs

Here, we propose a method for quantifying uncertainty in high-dimensional PDE systems with random parameters, where the number of solution evaluations is small. Parametric PDE solutions are often approximated using a spectral decomposition based on polynomial chaos expansions. For the class of systems we consider (i.e., high dimensional with limited solution evaluations) the coefficients are given by an underdetermined linear system in a regression formulation. This implies additional assumptions, such as sparsity of the coefficient vector, are needed to approximate the solution. Here, we present an approach where we assume the coefficients are close to the range of a generative model that maps from a low to a high dimensional space of coefficients. Our approach is inspired be recent work examining how generative models can be used for compressed sensing in systems with random Gaussian measurement matrices. Using results from PDE theory on coefficient decay rates, we construct an explicit generative model that predicts the polynomial chaos coefficient magnitudes. The algorithm we developed to find the coefficients, which we call GenMod, is composed of two main steps. First, we predict the coefficient signs using Orthogonal Matching Pursuit. Then, we assume the coefficients are within a sparse deviation from the range of a sign-adjusted generative model. This allows us to find the coefficients by solving a nonconvex optimization problem, over the input space of the generative model and the space of sparse vectors. We obtain theoretical recovery results for a Lipschitz continuous generative model and for a more specific generative model, based on coefficient decay rate bounds. We examine three high-dimensional problems and show that, for all three examples, the generative model approach outperforms sparsity promoting methods at small sample sizes.

97 MATHEMATICS AND COMPUTING↗

Hierarchical off-diagonal low-rank approximation of Hessians in inverse problems, with application to ice sheet model initialization

Obtaining lightweight and accurate approximations of discretized objective functional Hessians in inverse problems governed by partial differential equations (PDEs) is essential to make both deterministic and Bayesian statistical large-scale inverse problems computationally tractable. The cubic computational complexity of dense linear algebraic tasks, such as Cholesky factorization, that provide a means to sample Gaussian distributions and determine solutions of Newton linear systems is a computational bottleneck at large-scale. These tasks can be reduced to log-linear complexity by utilizing hierarchical off-diagonal low-rank (HODLR) matrix approximations. In this work, we show that a class of Hessians that arise from inverse problems governed by PDEs are well approximated by the HODLR matrix format. In particular, we study inverse problems governed by PDEs that model the instantaneous viscous flow of ice sheets. In these problems, we seek a spatially distributed basal sliding parameter field such that the flow predicted by the ice sheet model is consistent with ice sheet surface velocity observations. Here, we demonstrate the use of HODLR Hessian approximation to efficiently sample the Laplace approximation of the posterior distribution with covariance further approximated by HODLR matrix compression. Computational studies are performed which illustrate ice sheet problem regimes for which the Gauss–Newton data-misfit Hessian is more efficiently approximated by the HODLR matrix format than the low-rank (LR) format. We then demonstrate that HODLR approximations can be favorable, when compared to global LR approximations, for large-scale problems by studying the data-misfit Hessian associated with inverse problems governed by the first-order Stokes flow model on the Humboldt glacier and Greenland ice sheet.

97 MATHEMATICS AND COMPUTING↗

Phase-space entropy cascade and irreversibility of stochastic heating in nearly collisionless plasma turbulence

We consider a nearly collisionless plasma consisting of a species of “test particles” in one spatial and one velocity dimension, stirred by an externally imposed stochastic electric field—a kinetic analog of the Kraichnan model of passive advection. The mean effect on the particle distribution function is turbulent diffusion in velocity space—known as stochastic heating. Accompanying this heating is the generation of fine-scale structure in the distribution function, which we characterize with the collisionless (Casimir) invariant C 2 ∝ ∫ ∫ d x d v 〈 f 2 〉 —a quantity that here plays the role of (negative) entropy of the distribution function. We find that C 2 is transferred from large scales to small scales in both position and velocity space via a phase-space cascade enabled by both particle streaming and nonlinear interactions between particles and the stochastic electric field. We compute the steady-state fluxes and spectrum of C 2 in Fourier space, with k and s denoting spatial and velocity wave numbers, respectively. In our model, the nonlinearity in the evolution equation for the spectrum turns into a fractional Laplacian operator in k space, leading to anomalous diffusion. Whereas even the linear phase mixing alone would lead to a constant flux of C 2 to high s (towards the collisional dissipation range) at every k , the nonlinearity accelerates this cascade by intertwining velocity and position space so that the flux of C 2 is to both high k and high s simultaneously. Integrating over velocity (spatial) wave numbers, the k -space ( s -space) flux of C 2 is constant down to a dissipation length (velocity) scale that tends to zero as the collision frequency does, even though the rate of collisional dissipation remains finite. The resulting spectrum in the inertial range is a self-similar function in the ( k , s ) plane, with power-law asymptotics at large k and s . Our model is fully analytically solvable, but the asymptotic scalings of the spectrum can also be found via a simple phenomenological theory whose key assumption is that the cascade is governed by a “critical balance” in phase space between the linear and nonlinear timescales. We argue that stochastic heating is made irreversible by this entropy cascade and that, while collisional dissipation accessed via phase mixing occurs only at small spatial scales rather than at every scale as it would in a linear system, the cascade makes phase mixing even more effective overall in the nonlinear regime than in the linear one. Published by the American Physical Society 2024

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Feedback Control Systems Loop Shaping Design with Practical Considerations

This paper describes loop shaping control design in feedback control systems, primarily from a practical stand point that considers design specifications. Classical feedback control design theory, for linear systems where the plant transfer function is known, has been around for a long time. But it s still a challenge of how to translate the theory into practical and methodical design techniques that simultaneously satisfy a variety of performance requirements such as transient response, stability, and disturbance attenuation while taking into account the capabilities of the plant and its actuation system. This paper briefly addresses some relevant theory, first in layman s terms, so that it becomes easily understood and then it embarks into a practical and systematic design approach incorporating loop shaping design coupled with lead-lag control compensation design. The emphasis is in generating simple but rather powerful design techniques that will allow even designers with a layman s knowledge in controls to develop effective feedback control designs.

Kopsakis, George↗

Calculation of Sensitivity Derivatives in an MDAO Framework

During gradient-based optimization of a system, it is necessary to generate the derivatives of each objective and constraint with respect to each design parameter. If the system is multidisciplinary, it may consist of a set of smaller "components" with some arbitrary data interconnection and process work ow. Analytical derivatives in these components can be used to improve the speed and accuracy of the derivative calculation over a purely numerical calculation; however, a multidisciplinary system may include both components for which derivatives are available and components for which they are not. Three methods to calculate the sensitivity of a mixed multidisciplinary system are presented: the finite difference method, where the derivatives are calculated numerically; the chain rule method, where the derivatives are successively cascaded along the system's network graph; and the analytic method, where the derivatives come from the solution of a linear system of equations. Some improvements to these methods, to accommodate mixed multidisciplinary systems, are also presented; in particular, a new method is introduced to allow existing derivatives to be used inside of finite difference. All three methods are implemented and demonstrated in the open-source MDAO framework OpenMDAO. It was found that there are advantages to each of them depending on the system being solved.

Moore, Kenneth T.↗

Computation of optimal output-feedback compensators for linear time-invariant systems

The control of linear time-invariant systems with respect to a quadratic performance criterion was considered, subject to the constraint that the control vector be a constant linear transformation of the output vector. The optimal feedback matrix, f*, was selected to optimize the expected performance, given the covariance of the initial state. It is first shown that the expected performance criterion can be expressed as the ratio of two multinomials in the element of f. This expression provides the basis for a feasible method of determining f* in the case of single-input single-output systems. A number of iterative algorithms are then proposed for the calculation of f* for multiple input-output systems. For two of these, monotone convergence is proved, but they involve the solution of nonlinear matrix equations at each iteration. Another is proposed involving the solution of Lyapunov equations at each iteration, and the gradual increase of the magnitude of a penalty function. Experience with this algorithm will be needed to determine whether or not it does, indeed, possess desirable convergence properties, and whether it can be used to determine the globally optimal f*.

Platzman, L. K.↗

NCCS High Performance GMRES Mixed Precision

HPG-MxP is a software package that performs a fixed number of multigrid preconditioned (using a Gauss-Seidel smoother) Generalized minimal residual (PGMRES) iterations in order to solve a possibly nonsymmetric large sparse linear system of equations. It is designed to be a benchmark to measure a computer's performance for sparse linear algebra workloads typical in scientific computing while allowing the use of mixed precision methods. The solution is required to have convergence characteristics and accuracy similar to double precision GMRES. It is based on the High Performance Conjugate Gradient Benchmark (HPCG) which restricts all implementations to use only the IEEE double precision format (FP64). The original implementation (https://github.com/hpg-mxp/hpg-mxp) was written by Ichitaro Yamazaki, Jennifer Loe, Christian Glusa, Sivasankaran Rajamanickam, Piotr Luszczek, and Jack Dongarra. Please refer to that repository for documentation on the original implementation. This version is maintained by the National Center for Computational Sciences at Oak Ridge National Laboratory. It is highly scalable and optimized for Oak Ridge Leadership Computing Facility (OLCF) systems, particularly Frontier.

Kashi, Aditya [Oak Ridge National Laboratory (ORNL↗

Modal control of an unstable periodic orbit

Floquet theory is applied to the problem of designing a control system for a satellite in an unstable periodic orbit. Expansion about a periodic orbit produces a time-periodic linear system, which is augmented by a time-periodic control term. It is shown that this can be done such that (1) the application of control produces only inertial accelerations, (2) positive real Poincareexponents are shifted into the left half-plane, and (3) the shift of the exponent is linear with control gain. These developments are applied to an unstable orbit near the earth-moon L(3) point pertubed by the sun. Finally, it is shown that the control theory can be extended to include first order perturbations about the periodic orbit without increase in control cost.

Wiesel, W.↗

Scalable implicit incompressible resistive MHD with stabilized FE and fully-coupled Newton–Krylov-AMG

Here, we discuss that the computational solution of the governing balance equations for mass, momentum, heat transfer and magnetic induction for resistive magnetohydrodynamics (MHD) systems can be extremely challenging. These difficulties arise from both the strong nonlinear, nonsymmetric coupling of fluid and electromagnetic phenomena, as well as the significant range of time- and length-scales that the interactions of these physical mechanisms produce. This paper explores the development of a scalable, fully-implicit stabilized unstructured finite element (FE) capability for 3D incompressible resistive MHD. The discussion considers the development of a stabilized FE formulation in context of the variational multiscale (VMS) method, and describes the scalable implicit time integration and direct-to-steady-state solution capability. The nonlinear solver strategy employs Newton–Krylov methods, which are preconditioned using fully-coupled algebraic multilevel preconditioners. These preconditioners are shown to enable a robust, scalable and efficient solution approach for the large-scale sparse linear systems generated by the Newton linearization. Verification results demonstrate the expected order-of-accuracy for the stabilized FE discretization. The approach is tested on a variety of prototype problems, that include MHD duct flows, an unstable hydromagnetic Kelvin–Helmholtz shear layer, and a 3D island coalescence problem used to model magnetic reconnection. Initial results that explore the scaling of the solution methods are also presented on up to 128K processors for problems with up to 1.8B unknowns on a CrayXK7.

97 MATHEMATICS AND COMPUTING↗

Efficient shallow Ritz method for 1D diffusion problems

This paper studies the shallow Ritz method for solving the one-dimensional diffusion problem. It is shown that the shallow Ritz method improves the order of approximation dramatically for non-smooth problems. To realize this optimal or nearly optimal order of the shallow Ritz approximation, we develop a damped block Newton (dBN) method that alternates between updates of the linear and non-linear parameters. Per each iteration, the linear and the non-linear parameters are updated by exact inversion and one step of a modified, damped Newton method applied to a reduced non-linear system, respectively. The computational cost of each dBN iteration is $\mathcal{O}$(n). Starting with the non-linear parameters as a uniform partition of the interval, numerical experiments show that the dBN is capable of efficiently moving mesh points to nearly optimal locations. In conclusion, to improve the efficiency of the dBN further, we propose an adaptive damped block Newton (AdBN) method by combining the dBN with the adaptive neuron enhancement (ANE) method [28].

Diffusion problems↗

Noise adding radiometer performance analysis

The DSN noise adding radiometer (NAR) measurement accuracy is analyzed. The NAR capability is part of the precision power monitor function recently introduced in the DSN. The potential system noise temperature measurement accuracy is estimated to be about 1.5% with the 1 kelvin noise diode. Performance verification requires comparison noise temperature measurements with the manual Y factor method and routine monitoring of critical elements in the NAR system such as system linearity and noise diode calibration. A technique is presented to calibrate and reduce the effects of the receiving system nonlinearity. Unsatisfactory performance or degradation of these critical NAR elements would require appropriate system upgrading.

Stelzried, C.↗

Fusion techniques using distributed Kalman filtering for detecting changes in systems

A comparison is made of the performances of two detection strategies that are based on different data fusion techniques. The strategies detect changes in a linear system. One detection strategy involves combining the estimates and error covariance matrices of distributed Kalman filters, generating a residual from the used estimates, comparing this residual to a threshold, and making a decision. The other detection strategy involves a distributed decision process in which estimates from distributed Kalman filters are used to generate distributed residuals which are compared locally to a threshold. Local decisions are made and these decisions are then fused into a global decision. The performances of each of these detection schemes are compared, and it is concluded that better performance is achieved when local decisions are made and then fused into a global decision.

Belcastro, Celeste M.↗