Search NASA⌕ Search

SEARCH · Search NASA

Results for “general linear methods”

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 307 records · Page 17

Evaluating the Trustworthiness of Explainable Artificial Intelligence (XAI) Methods Applied to Regression Predictions of Arctic Sea Ice Motion

Abstract Recent advances in explainable artificial intelligence (XAI) methods show promise for understanding predictions made by machine learning (ML) models. XAI explains how the input features are relevant or important for the model predictions. We train linear regression (LR) and convolutional neural network (CNN) models to make 1-day predictions of sea ice velocity in the Arctic from inputs of present-day wind velocity and previous-day ice velocity and concentration. We apply XAI methods to the CNN and compare explanations to variance explained by LR. We confirm the feasibility of using a novel XAI method [i.e., global layerwise relevance propagation (LRP)] to understand ML model predictions of sea ice motion by comparing it to established techniques. We investigate a suite of linear, perturbation-based, and propagation-based XAI methods in both local and global forms. Outputs from different explainability methods are generally consistent in showing that wind speed is the input feature with the highest contribution to ML predictions of ice motion, and we discuss inconsistencies in the spatial variability of the explanations. Additionally, we show that the CNN relies on both linear and nonlinear relationships between the inputs and uses nonlocal information to make predictions. LRP shows that wind speed over land is highly relevant for predicting ice motion offshore. This provides a framework to show how knowledge of environmental variables (i.e., wind) on land could be useful for predicting other properties (i.e., sea ice velocity) elsewhere. Significance Statement Explainable artificial intelligence (XAI) is useful for understanding predictions made by machine learning models. Our research establishes trustability in a novel implementation of an explainable AI method known as layerwise relevance propagation for Earth science applications. To do this, we provide a comparative evaluation of a suite of explainable AI methods applied to machine learning models that make 1-day predictions of Arctic sea ice velocity. We use explainable AI outputs to understand how the input features are used by the machine learning to predict ice motion. Additionally, we show that a convolutional neural network uses nonlinear and nonlocal information in making its predictions. We take advantage of the nonlocality to investigate the extent to which knowledge of wind on land is useful for predicting sea ice velocity elsewhere.

Hoffman, Lauren [Scripps Institution of Oceanograp↗

A Sequential Quadratic Programming Algorithm for Nonsmooth Problems with Upper- \({\boldsymbol{\mathcal{C}^2}}\) Objective

An optimization algorithm for nonsmooth nonconvex constrained optimization problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objective functions is proposed and analyzed. Upper- \({\boldsymbol{\mathcal{C}^2}}\) is a weakly concave property that exists in difference of convex (DC) functions and arises naturally in many applications, particularly certain classes of solutions to parametric optimization problems e.g., recourse of stochastic programming and projection onto closed sets. The algorithm can be viewed as an extension of sequential quadratic programming (SQP) to nonsmooth problems with upper- \({\boldsymbol{\mathcal{C}^2}}\) objectives or a simplified bundle method. It is globally convergent with bounded algorithm parameters that are updated with a trust-region criterion. The algorithm handles general smooth constraints through linearization and uses a line search to ensure progress. The potential inconsistencies from the linearization of the constraints are addressed through a penalty method. In conclusion, the capabilities of the algorithm are demonstrated by solving both simple upper- \({\boldsymbol{\mathcal{C}^2}}\) problems and a real-world optimal power flow problem used in current power grid industry practices.

97 MATHEMATICS AND COMPUTING↗

Model-Reference Adaptive Control of Distributed Lagrangian Infinite-Dimensional Systems Using Hamilton’s Principle

This paper presents a Hamilton's principle for distributed control of infinite-dimensional systems modeled by a distributed form of the Euler-Lagrange method. The distributed systems are governed by a system of linear partial differential equations in space and time. A generalized potential energy expression is developed that can capture most physical systems including those systems that have no spatial distribution. The Hamilton's principle is applied to derive distributed feedback control methods without resorting to the standard weak-form discretization approach to convert an infinite-dimensional systems to a finite-dimensional systems. It can be shown by the principle of least action that the distributed control synthesized by the Hamilton's principle is a minimum-norm control. A model-reference adaptive control framework is developed for distributed Lagrangian systems in the presence of uncertainty. The theory is demonstrated by an application of adaptive flutter suppression control of a flexible aircraft wing.

Nguyen, Nhan T.↗

A look-ahead variant of the Lanczos algorithm and its application to the quasi-minimal residual method for non-Hermitian linear systems

The Lanczos algorithm can be used both for eigenvalue problems and to solve linear systems. However, when applied to non-Hermitian matrices, the classical Lanczos algorithm is susceptible to breakdowns and potential instabilities. In addition, the biconjugate gradient (BCG) algorithm, which is the natural generalization of the conjugate gradient algorithm to non-Hermitian linear systems, has a second source of breakdowns, independent of the Lanczos breakdowns. Here, we present two new results. We propose an implementation of a look-ahead variant of the Lanczos algorithm which overcomes the breakdowns by skipping over those steps where a breakdown or a near-breakdown would occur. The new algorithm can handle look-ahead steps of any length and requires the same number of matrix-vector products and inner products per step as the classical Lanczos algorithm without look-ahead. Based on the proposed look-ahead Lanczos algorithm, we then present a novel BCG-like approach, the quasi-minimal residual (QMR) method, which avoids the second source of breakdowns in the BCG algorithm. We present details of the new method and discuss some of its properties. In particular, we discuss the relationship between QMR and BCG, showing how one can recover the BCG iterates, when they exist, from the QMR iterates. We also present convergence results for QMR, showing the connection between QMR and the generalized minimal residual (GMRES) algorithm, the optimal method in this class of methods. Finally, we give some numerical examples, both for eigenvalue computations and for non-Hermitian linear systems.

Nachtigal, Noel M.↗

Signal, Noise and Resolution in Linear and Nonlinear Structured-Illumination Microscopy

Structured-illumination microscopy allows widefield fluorescence imaging with resolution beyond the classical diffraction limit. Its linear form extends resolution by a factor of two, and its nonlinear form by an in-principle infinite factor, the effective resolution in practice being determined by noise. In this article, we analyze the noise properties and achievable resolution of the method from a frequency-space perspective. We develop an analytical theory for a general case of linear or nonlinear fluorescent imaging, and verify the analytical calculations with numerical simulation for a special case where nonlinearity is produced by photo-switching of fluorescent labels. We compare the performance of two alternative implementations, using either two-dimensional illumination patterns or sequentially rotated one-dimensional patterns. We show that one-dimensional patterns are advantageous in the linear case, and that in the nonlinear case two-dimensional patterns provide a slight signal-to-noise advantage under idealized conditions, but perform worse than one-dimensional patterns in the presence of non-switchable fluorescent background.

99 GENERAL AND MISCELLANEOUS↗

Quantum tensor network algorithms for evaluation of spectral functions on quantum computers

We investigate quantum algorithms derived from tensor networks to simulate the static and dynamic properties of quantum many-body systems. Using a sequentially prepared quantum circuit representation of a matrix product state (MPS) that we call a quantum tensor network (QTN), we demonstrate algorithms to prepare ground and excited states on a quantum computer and apply them to molecular nanomagnets (MNMs) as a paradigmatic example. In this setting, we develop two approaches for extracting the spectral correlation functions measured in neutron-scattering experiments: (a) a generalization of the SWAP test for computing wave function overlaps and, (b) a generalization of the notion of matrix product operators to the QTN setting which generates a linear combination of unitaries. The latter method is discussed in detail for translationally invariant spin-half systems, where it is shown to reduce the qubit resource requirements compared with the SWAP method and may be generalized to other systems. We demonstrate the versatility of our approaches by simulating spin-1/2 and spin-3/2 MNMs, with the latter being an experimentally relevant model of a Cr$^{3+}_{8}$ ring. Here, our approach has qubit requirements that are independent of the number of constituents of the many-body system and scale only logarithmically with the bond dimension of the MPS representation, making them appealing for implementation on near-term quantum hardware with mid-circuit measurement and reset.

Neutron scattering↗

Remote sensing of ozone in the middle ultraviolet

Earlier studies of the remote sensing of the ozone distribution from satellites in the middle ultraviolet are extended, giving particular attention to the analytic model method. After a brief introduction, the historical background of this subject is presented. This is followed by a summary and review of early work based upon the analytic model. Then a linearized approach to the problem and a linearized equation for a density correction are discussed. These indicate some of the general limitations of the inversion method. Finally the parametrized model approach is reexamined by using both simulated data and some actual satellite data.

Green, A. E. S.↗

Holistic fleet optimization incorporating system design considerations

The methodology described in this article enables a type of holistic fleet optimization that simultaneously considers the composition and activity of a fleet through time as well as the design of individual systems within the fleet. Often, real-world system design optimization and fleet-level acquisition optimization are treated separately due to the prohibitive scale and complexity of each problem. Importantly, this means that fleet-level schedules are typically limited to the inclusion of predefined system configurations and are blind to a rich spectrum of system design alternatives. Similarly, system design optimization often considers a system in isolation from the fleet and is blind to numerous, complex portfolio-level considerations. In reality, these two problems are highly interconnected. To properly address this system-fleet design interdependence, we present a general method for efficiently incorporating multi-objective system design trade-off information into a mixed-integer linear programming (MILP) fleet-level optimization. This work is motivated by the authors' experience with large-scale DOD acquisition portfolios. However, the methodology is general to any application where the fleet-level problem is a MILP and there exists at least one system having a design trade space in which two or more design objectives are parameters in the fleet-level MILP.

97 MATHEMATICS AND COMPUTING↗

Application of a generalized minimal residual method to 2D unsteady flows

A generalized minimum residual scheme (GMRES), previously developed for solving nonlinear and linear systems of equations, has been applied to the numerical solution of 2D unsteady compressible flows. It is found that the use of GMRES significantly increases the time step that may be used, compared to noniterative implicit schemes. The feasibility of reducing the memory requirements of the GMRES scheme using a multigrid strategy has also been explored. Several sample steady and unsteady viscous flow applications are presented.

Hixon, Ray↗

A Comparison of Control Allocation Methods in the Presence of Parametric Model Uncertainty

When allocating redundant effectors to virtual control commands, linear (generalized inverse) allocators have historically been used on aircraft and spacecraft. While simple to implement, generalized inverses are unable to realize a significant portion of the attainable moments. To address this drawback, the control allocation problem can also be formulated as a linear programming or quadratic programming problem and solved using convex optimization based solvers. These approaches have been shown to access a larger set of attainable moments, however, little work has been done to understand the performance of convex optimization-based control allocation in the presence of parametric model uncertainty. This paper seeks to compare the performance of several control allocation approaches, including two forms of generalized inverse allocators, the pseudo inverse and minimum-variance, and the linear programming and quadratic programming approach in the presence of parametric model uncertainty. The performance of these four allocators were tested on an aircraft model in the presence of realistic parametric model uncertainty and the convex optimization approaches were shown to outperform the generalized inverses.

Luke J Miller↗

Three-dimensional aerodynamic shape optimization using discrete sensitivity analysis

An aerodynamic shape optimization procedure based on discrete sensitivity analysis is extended to treat three-dimensional geometries. The function of sensitivity analysis is to directly couple computational fluid dynamics (CFD) with numerical optimization techniques, which facilitates the construction of efficient direct-design methods. The development of a practical three-dimensional design procedures entails many challenges, such as: (1) the demand for significant efficiency improvements over current design methods; (2) a general and flexible three-dimensional surface representation; and (3) the efficient solution of very large systems of linear algebraic equations. It is demonstrated that each of these challenges is overcome by: (1) employing fully implicit (Newton) methods for the CFD analyses; (2) adopting a Bezier-Bernstein polynomial parameterization of two- and three-dimensional surfaces; and (3) using preconditioned conjugate gradient-like linear system solvers. Whereas each of these extensions independently yields an improvement in computational efficiency, the combined effect of implementing all the extensions simultaneously results in a significant factor of 50 decrease in computational time and a factor of eight reduction in memory over the most efficient design strategies in current use. The new aerodynamic shape optimization procedure is demonstrated in the design of both two- and three-dimensional inviscid aerodynamic problems including a two-dimensional supersonic internal/external nozzle, two-dimensional transonic airfoils (resulting in supercritical shapes), three-dimensional transport wings, and three-dimensional supersonic delta wings. Each design application results in realistic and useful optimized shapes.

Burgreen, Gregory W.↗

Linear source method of characteristics in HELIOS2

The Studsvik Scandpower code HELIOS2 is a fast lattice transport code that has gained wide use for reactor fuel cycle analysis in commercial, regulatory, and research environments. It contains two transport solvers - Collision Probabilities (CP) and Method of Characteristics (MoC) - with a general geometry ability and generalized depletion for a variety of fuel types, experimental facilities, and isotope production applications. The HELIOS2 lattice code has been extended with the development of a linear source MoC option. The linear source equations are derived within the scope of the HELIOS2 general geometry and non-cyclic ray tracing. The implementation was tested for fine and coarse spatial mesh models of the 2D C5G7 MOX computational benchmark, which provides a pure and extreme test of a transport solver. The linear source yields at least comparable accuracy with reduced computational resource requirements relative to the flat-source approximation.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Ensemble Simulation Techniques and Fast Randomized Algorithms

The major goals of the project were to develop and analyze new ensemble simulation techniques, including trajectory stratification and preconditioned MCMC techniques, as well as develop fast numerical linear algebra techniques closely related to ensemble simulation ideas. The trajectory stratification techniques involve simulating in parallel short trajectory fragments of a Markov process confined to a specific region of space‐time and then patching together the statistics gathered to assemble estimates of very general dynamical properties. We have also developed this approach for rare event simulation and extended the techniques to applications requiring a more general framework (such as electronic structure calculations). The preconditioned MCMC techniques involve simulating multiple Markov chains in parallel and then using information from the ensemble to speed the mixing of each individual chain. The fast randomized linear algebra methods are motivated by the diffusion Monte Carlo technique, but are applicable to finding the dominant eigenvalue of (almost) general matrices. For most non‐negative matrices, the schemes result in an error (compared to the power method) that is constant in the dimension of the problem. For more general matrices, we see a very clear sublinear cost trend in computational tests.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Study of structural and electronic properties of ScN and ScAs in rocksalt and zincblende structure: A DFT approach

In this paper, we have studied the structural and electronic properties of ScN and ScAs in zincblende (ZB) and rocksalt (RS) phases. We have employed the full potential linearized augmented plane wave (FP-APW) method within the density functional theory (DFT). Generalized gradient approximation (GGA), due to Perdew-Burke-Ernzerhof (PBE) has been used to estimate the exchange-correlation functional. Our band structure results for ScN shows the metallic nature, whereas ScAs shows the semiconducting behavior. The obtained results are in excellent agreement with earlier reported data.

36 MATERIALS SCIENCE↗

High-pressure structural study of fluoro-perovskite CsCdF[subscript 3] up to 60 GPa: A combined experimental and theoretical study

The structural behavior of CsCdF{sub 3} under pressure is investigated by means of theory and experiment. High-pressure powder x-ray diffraction experiments were performed up to a maximum pressure of 60 GPa using synchrotron radiation. The cubic Pm{sub 3}{sup -} m crystal symmetry persists throughout this pressure range. Electronic structure calculations were carried out using the full-potential linear muffin-tin orbital method within the local-density approximation and the generalized gradient approximation for exchange and correlation effects. The calculated ground-state properties - the equilibrium lattice constant, bulk modulus and elastic constants - are in good agreement with experimental results. The calculations reveal that CsCdF{sub 3} is an indirect-gap insulator under ambient conditions, with the gap increasing under pressure.

36 MATERIALS SCIENCE↗

Algebraic Multigrid with Optimal Interpolation and Adaptive Smoothers (Final Report)

The project team continued with work on developing new bootstrap AMG techniques for solving symmetric and non-symmetric PDE systems. The focus of this work is to derive more reliable measures of the quality of the coarse space set than the convergence rate of the standard F-relaxation form of CR and a more robust form of interpolation than the so-called ideal form. We have successfully derived a sharp variant of CR that gives the precise convergence rate of the two-grid method using this optimal interpolation and, in addition, we derived a new Generalized Bootstrap AMG setup algorithm that uses as its main tool a multilevel eigensolver for the generalized eigenvalue problem involving the system matrix and the symmetrized smoother. In addition, the approach allows for general block smoothers with overlap. We have applied the method to scalar diffusion problems, linear elasticity, and Maxwell’s and the method shows marked improvements over existing AMG methods for these problems. In addition, the team worked with CASC members on new forms of ideal AMG interpolation.

97 MATHEMATICS AND COMPUTING↗