Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “linear algebra”

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 703 records · Page 39

Realization of non-linear coherent states by photonic lattices

In this paper, first, by introducing Holstein-Primakoff representation of α-deformed algebra, we achieve the associated non-linear coherent states, including su(2) and su(1, 1) coherent states. Second, by using waveguide lattices with specific coupling coefficients between neighbouring channels, we generate these non-linear coherent states. In the case of positive values of α, we indicate that the Hilbert size space is finite; therefore, we construct this coherent state with finite channels of waveguide lattices. Finally, we study the field distribution behaviours of these coherent states, by using Mandel Q parameter.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

On the τ-Compactness of Products of τ -Measurable Operators Adjoint to Semi-Finite Von Neumann Algebras

Let M be the von Neumann algebra of operators in a Hilbert space H and τ be an exact normal semi-finite trace on M. We obtain inequalities for permutations of products of τ-measurable operators. We apply these inequalities to obtain new submajorizations (in the sense of Hardy, Littlewood, and Pólya) of products of τ -measurable operators and a sufficient condition of orthogonality of certain nonnegative τ-measurable operators. We state sufficient conditions of the τ –compactness of products of self-adjoint τ -measurable operators and obtain a criterion of the τ -compactness of the product of a nonnegative τ-measurable operator and an arbitrary τ -measurable operator. We present an example that shows that the nonnegativity of one of the factors is substantial. We also state a criterion of the elementary nature of the product of nonnegative operators from M . All results are new for the *-algebra B(H) of all bounded linear operators in H endowed with the canonical trace τ = tr.

97 MATHEMATICS AND COMPUTING↗

Prediction of High-Lift Flows using Turbulent Closure Models

The flow over two different multi-element airfoil configurations is computed using linear eddy viscosity turbulence models and a nonlinear explicit algebraic stress model. A subset of recently-measured transition locations using hot film on a McDonnell Douglas configuration is presented, and the effect of transition location on the computed solutions is explored. Deficiencies in wake profile computations are found to be attributable in large part to poor boundary layer prediction on the generating element, and not necessarily inadequate turbulence modeling in the wake. Using measured transition locations for the main element improves the prediction of its boundary layer thickness, skin friction, and wake profile shape. However, using measured transition locations on the slat still yields poor slat wake predictions. The computation of the slat flow field represents a key roadblock to successful predictions of multi-element flows. In general, the nonlinear explicit algebraic stress turbulence model gives very similar results to the linear eddy viscosity models.

Rumsey, Christopher L.↗

On the decoupling of multivariable systems.

Necessary and sufficient conditions for decoupling time-invariant linear multivariable system by state variable feedback, discussing transfer matrix consequences

MATRIX ALGEBRA↗

Linear maps preserving maximal deviation and the Jordan structure of quantum systems

In the algebraic approach to quantum theory, a quantum observable is given by an element of a Jordan algebra and a state of the system is modelled by a normalized positive functional on the underlying algebra. Maximal deviation of a quantum observable is the largest statistical deviation one can obtain in a particular state of the system. The main result of the paper shows that each linear bijective transformation between JBW algebras preserving maximal deviations is formed by a Jordan isomorphism or a minus Jordan isomorphism perturbed by a linear functional multiple of an identity. It shows that only one numerical statistical characteristic has the power to determine the Jordan algebraic structure completely. As a consequence, we obtain that only very special maps can preserve the diameter of the spectra of elements. Nonlinear maps preserving the pseudometric given by maximal deviation are also described. The results generalize hitherto known theorems on preservers of maximal deviation in the case of self-adjoint parts of von Neumann algebras proved by Molnar.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Discretized partial differential equations - Examples of control systems defined on modules

The purpose of this paper is to show how the important problems of linear system theory can be solved concisely for a particular class of linear systems, namely block circulant systems, by exploiting the algebraic structure. This type of system arises in lumped approximations to linear partial differential equations. The computation of the transition matrix, the variation of constants formula, observability, controllability, pole allocation, realization theory, stability and quadratic optimal control are discussed. In principle, all questions which are solved here could also be solved by standard methods; the present paper clearly exposes the structure of the solution, and thus permits various savings in computational effort.

Brockett, R. W.↗

Control of nonlinear systems with applications to constrained robots and spacecraft attitude stabilization

This thesis is organized in two parts. In Part 1, control systems described by a class of nonlinear differential and algebraic equations are introduced. A procedure for local stabilization based on a local state realization is developed. An alternative approach to local stabilization is developed based on a classical linearization of the nonlinear differential-algebraic equations. A theoretical framework is established for solving a tracking problem associated with the differential-algebraic system. First, a simple procedure is developed for the design of a feedback control law which ensures, at least locally, that the tracking error in the closed loop system lies within any given bound if the reference inputs are sufficiently slowly varying. Next, by imposing additional assumptions, a procedure is developed for the design of a feedback control law which ensures that the tracking error in the closed loop system approaches zero exponentially for reference inputs which are not necessarily slowly varying. The control design methodologies are used for simultaneous force and position control in constrained robot systems. The differential-algebraic equations are shown to characterize the slow dynamics of a certain nonlinear control system in nonstandard singularly perturbed form. In Part 2, the attitude stabilization (reorientation) of a rigid spacecraft using only two control torques is considered. First, the case of momentum wheel actuators is considered. The complete spacecraft dynamics are not controllable. However, the spacecraft dynamics are small time locally controllable in a reduced sense. The reduced spacecraft dynamics cannot be asymptotically stabilized using continuous feedback, but a discontinuous feedback control strategy is constructed. Next, the case of gas jet actuators is considered. If the uncontrolled principal axis is not an axis of symmetry, the complete spacecraft dynamics are small time locally controllable. However, the spacecraft attitude cannot be asymptotically stabilized using continuous feedback, but a discontinuous stabilizing feedback control strategy is constructed. If the uncontrolled principal axis is an axis of symmetry, the complete spacecraft dynamics cannot be stabilized. However, the spacecraft dynamics are small time locally controllable in a reduced sense. The reduced spacecraft dynamics cannot be asymptotically stabilized using continuous feedback, but again a discontinuous feedback control strategy is constructed.

Krishnan, Hariharan↗

Accelerated basis adaptation in homogeneous chaos spaces

Polynomial chaos expansions (PCE) provide an efficient approach to uncertainty quantification (UQ) and have been adapted to diverse applications across the spectrum of science and engineering. For situations involving large stochastic parameterizations, the curse of dimensionality renders PCE-based methods computationally prohibitive. A basis adaptation approach for PCE was proposed by Tipireddy and Ghanem (2014) which transforms the input random variables through an isometry such that sufficient probabilistic characterization of specific quantities of interest (QoI) is concentrated in an algebraic manifold embedded in the linear span of the dominant transformed variables. While quite versatile, that original version of the PCE basis adaptation exhibited slow convergence for a number of problems of practical significance. In the present paper, we propose two novel methods to accelerate the convergence of the original basis adaptation approach, thus expanding its reach while also providing insight into its performance. In the first method, information gained from a pilot PCE representation is used to correct the mean and Gaussian coefficients in the adapted space. By taking advantages of probabilistic information in higher dimensional adaptation gleaned from an initial adaptation, the second method updates the rotation matrix used to identify the dominant transformed variables. In this manner, the new rotation matrix concentrates even more probabilistic information in its first few dimensions. These two method can be combined to achieve even better performance, the combined method is referred to as sequentially optimized adaptation method. Here, the methods are demonstrated on an analytical test function and a model of a space structure with several sub-components and a non-smooth quantity of interest representing the maximum acceleration over time. Both methods achieve accelerated convergence of the basis adaptation approach with negligible additional costs.

Accelerated convergence↗

A computational method for solving stochastic Itô–Volterra integral equations based on stochastic operational matrix for generalized hat basis functions

In this paper, a new computational method based on the generalized hat basis functions is proposed for solving stochastic Itô–Volterra integral equations. In this way, a new stochastic operational matrix for generalized hat functions on the finite interval [0,T] is obtained. By using these basis functions and their stochastic operational matrix, such problems can be transformed into linear lower triangular systems of algebraic equations which can be directly solved by forward substitution. Also, the rate of convergence of the proposed method is considered and it has been shown that it is O(1/(n{sup 2}) ). Further, in order to show the accuracy and reliability of the proposed method, the new approach is compared with the block pulse functions method by some examples. The obtained results reveal that the proposed method is more accurate and efficient in comparison with the block pule functions method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

RE-INTEGRATE EMT Simulation Software: Graph Convolutional Network for Sparse Matrix Pattern Detection

The increasing complexity of power networks, driven by proliferation of inverters, presents analytical challenges that simplified models often fail to capture, necessitating Electromagnetic Transient (EMT) simulations. EMT models are represented as discretized differential-algebraic equations (DAEs), forming a linear system Ax = b that is computationally intensive to solve. Due to inherent sparsity of adjacency matrix A, distinct patterns emerge that, when accurately identified, enable efficient solver selection to minimize computation time. However, identifying ideal pattern is complicated by numerous reordering algorithms and limited structural insights. To address this, we introduce a Graph Convolutional Network (GCN) model for classifying sparse matrix patterns common in power system analysis. The model, achieving 96% test accuracy, is validated using PV plant models of 125 MW capacities connected to New England 39-bus transmission system (TS), and further scaled to a 4,992-bus network with 384 PV plants, yielding 191, 616 × 191, 616 sized A matrix. For all cases, the GCN model accurately identifies the matrix’s intrinsic sparse pattern, demonstrating its potential to enhance solver performance in EMT analysis.

Hossain, Md Rifat [Florida International Universit↗

Optimal Scheduling of an Isolated Microgrid With Battery Storage Considering Load and Renewable Generation Uncertainties

By modeling the uncertainty of spinning reserves provided by energy storage with probabilistic constraints, a new optimal scheduling mode is proposed in this paper for minimizing the operating costs of an isolated microgrid (MG) by using chance-constrained programming. The model is transformed into a readily solvable mixed integer linear programming formulation in general algebraic modeling system (GAMS) via a proposed discretized step transformation approach and finally solved by applying the CPLEX solver. By properly setting the confidence levels of the spinning reserve probability constraints, the MG operation can achieve a tradeoff between reliability and economy. The test results on the modified Oak Ridge National Laboratory Distributed Energy Control and Communication lab MG test system reveal that the proposal significantly exceeds the commonly used hybrid intelligent algorithm with much better and more stable optimization results and significantly reduced calculation times.

Li, Yang↗

Large-scale 3D geoelectromagnetic modeling using parallel adaptive high-order finite element method

Here, we have investigated the use of the adaptive high-order finite-element method (FEM) for geoelectromagnetic modeling. Because high-order FEM is challenging from the numerical and computational points of view, most published finite-element studies in geoelectromagnetics use the lowest order formulation. Solution of the resulting large system of linear equations poses the main practical challenge. We have developed a fully parallel and distributed robust and scalable linear solver based on the optimal block-diagonal and auxiliary space preconditioners. The solver was found to be efficient for high finite element orders, unstructured and nonconforming locally refined meshes, a wide range of frequencies, large conductivity contrasts, and number of degrees of freedom (DoFs). Furthermore, the presented linear solver is in essence algebraic; i.e., it acts on the matrix-vector level and thus requires no information about the discretization, boundary conditions, or physical source used, making it readily efficient for a wide range of electromagnetic modeling problems. To get accurate solutions at reduced computational cost, we have also implemented goal-oriented adaptive mesh refinement. The numerical tests indicated that if highly accurate modeling results were required, the high-order FEM in combination with the goal-oriented local mesh refinement required less computational time and DoFs than the lowest order adaptive FEM.

58 GEOSCIENCES↗

A Model Predictive Control to Improve Grid Resilience

The following article details a model predictive control (MPC) to improve grid resilience when faced with variable generation resources. This topic is of significant interest to utility power systems where distributed intermittent energy sources will increase significantly and be relied on for electric grid ancillary services. Previous work on MPCs has focused on narrowly targeted control applications such as improving electric vehicle (EV) charging infrastructure or reducing the cost of integrating Energy Storage Systems (ESSs) into the grid. In contrast, this article develops a comprehensive treatment of the construction of an MPC tailored to electric grids and then applies it integration of intermittent energy resources. To accomplish this, the following article includes a description of a reduced order model (ROM) of an electric power grid based on a circuit model, an optimization formulation that describes the MPC, a collocation method for solving linear time-dependent differential algebraic equations (DAEs) that result from the ROM, and an overall strategy for iteratively refining the behavior of the MPC. Next, the algorithm is validated using two separate numerical experiments. First, the algorithm is compared to an existing MPC code and the results are verified by a numerically precise simulation. It is shown that this algorithm produces a control comparable to existing algorithms and the behavior of the control carefully respects the bounds specified. Second, the MPC is applied to a small nine bus system that contains a mix of turbine-spinning-machine-based and intermittent generation in order to demonstrate the algorithm’s utility for resource planning and control of intermittent resources. This study demonstrates how the MPC can be tuned to change the behavior of the control, which can then assist with the integration of intermittent resources into the grid. The emphasis throughout the paper is to provide systematic treatment of the topic and produce a novel nonlinear control compatible design framework applicable to electric grids and the control of variable resources. This differs from the more targeted application-based focus in most presentations.

microgrid↗

Albany/FELIX: A parallel, scalable and robust, finite element, first-order Stokes approximation ice sheet solver built for advanced analysis

This paper describes a new parallel, scalable and robust finite element based solver for the first-order Stokes momentum balance equations for ice flow. The solver, known as Albany/FELIX , is constructed using the component-based approach to building application codes, in which mature, modular libraries developed as a part of the Trilinos project are combined using abstract interfaces and template-based generic programming, resulting in a final code with access to dozens of algorithmic and advanced analysis capabilities. Following an overview of the relevant partial differential equations and boundary conditions, the numerical methods chosen to discretize the ice flow equations are described, along with their implementation. The results of several verification studies of the model accuracy are presented using (1) new test cases for simplified two-dimensional (2-D) versions of the governing equations derived using the method of manufactured solutions, and (2) canonical ice sheet modeling benchmarks. Model accuracy and convergence with respect to mesh resolution are then studied on problems involving a realistic Greenland ice sheet geometry discretized using hexahedral and tetrahedral meshes. Also explored as a part of this study is the effect of vertical mesh resolution on the solution accuracy and solver performance. The robustness and scalability of our solver on these problems is demonstrated. Lastly, we show that good scalability can be achieved by preconditioning the iterative linear solver using a new algebraic multilevel preconditioner, constructed based on the idea of semi-coarsening.

54 ENVIRONMENTAL SCIENCES↗

The weight distribution and randomness of linear codes

Finding the weight distributions of block codes is a problem of theoretical and practical interest. Yet the weight distributions of most block codes are still unknown except for a few classes of block codes. Here, by using the inclusion and exclusion principle, an explicit formula is derived which enumerates the complete weight distribution of an (n,k,d) linear code using a partially known weight distribution. This expression is analogous to the Pless power-moment identities - a system of equations relating the weight distribution of a linear code to the weight distribution of its dual code. Also, an approximate formula for the weight distribution of most linear (n,k,d) codes is derived. It is shown that for a given linear (n,k,d) code over GF(q), the ratio of the number of codewords of weight u to the number of words of weight u approaches the constant Q = q(-)(n-k) as u becomes large. A relationship between the randomness of a linear block code and the minimum distance of its dual code is given, and it is shown that most linear block codes with rigid algebraic and combinatorial structure also display certain random properties which make them similar to random codes with no structure at all.

Cheung, K.-M.↗

CMFD and coarse-mesh DSA

The Coarse Mesh Finite Difference (CMFD) and Diffusion Synthetic Acceleration (DSA) methods are two widely-used, independently-developed acceleration methods for iteratively solving deterministic particle transport simulations. In this paper we show that these methods are related in the following way: if the standard notion of DSA as a 'fine mesh' method is generalized to that of a coarse mesh method, then the linearized form of CMFD is algebraically equivalent to a coarse mesh form of DSA. Also, we demonstrate theoretically (via Fourier analysis) and computationally that CMFD and coarse mesh DSA have nearly the same convergence properties. (authors)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multiscale Simulation Framework for Coupled Fluid Flow and Mechanical Deformation

A multiscale linear-solver framework for the pressure equation associated with flow in highly heterogeneous porous formations was developed. The multiscale based approach is cast in a general algebraic form, which facilitates integration of the new scalable linear solver in existing flow simulators. The Algebraic Multiscale Solver (AMS) is employed as a preconditioner within a multi-stage strategy. The formulations investigated include the standard MultiScale Finite-Element (MSFE) andMultiScale Finite-Volume (MSFV) methods. The local-stage solvers include incomplete factorization and the so-called Correction Functions (CF) associated with the MSFV approach. Extensive testing of AMS, as an iterative linear solver, indicate excellent convergence rates and computational scalability. AMS compares favorably with advanced Algebraic MultiGrid (AMG) solvers for highly detailed three-dimensional heterogeneous models. Moreover, AMS is expected to be especially beneficial in solving time-dependent problems of coupled multiphase flow and transport in large-scale subsurface formations.

02 PETROLEUM↗