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 1,099 records · Page 61

Coupling flux balance analysis with reactive transport modeling through machine learning for rapid and stable simulation of microbial metabolic switching

Integrating genome-scale metabolic networks with reactive transport models (RTMs) provides a detailed description of the dynamic changes in microbial growth and metabolism. Despite promising demonstrations in the past, computational inefficiency has been pointed out as a critical issue to overcome because it requires repeated application of linear programming (LP) to obtain flux balance analysis (FBA) solutions in every time step and spatial grid. To address this challenge, we propose a new simulation method where we train and validate artificial neural networks (ANNs) using randomly sampled FBA solutions and incorporate the resulting surrogate FBA model (represented as algebraic equations) into RTMs as source/sink terms. We demonstrate the efficiency of our method via a case study of Shewanella oneidensis MR-1. During aerobic growth on lactate, S. oneidensis produces metabolic byproducts (such as pyruvate and acetate), which are subsequently consumed as alternative carbon sources when the preferred nutrients are depleted. To effectively simulate these complex dynamics, we used a cybernetic approach that models metabolic switches as the outcome of dynamic competition among multiple growth options. In both zero-dimensional batch and one-dimensional column configurations, the ANN-based surrogate models achieved substantial reduction of computational time by several orders of magnitude compared to the original LP-based FBA models. Moreover, the ANN models produced robust solutions without any special measures to prevent numerical instability. These developments significantly promote our ability to utilize genome-scale networks in complex, multi-physics, and multi-dimensional ecosystem modeling.

59 BASIC BIOLOGICAL SCIENCES↗

General integrable n-level, many-mode Janes-Cummings-Dicke models and classical r-matrices with spectral parameters

Using the technique of classical r-matrices and quantum Lax operators, we construct the most general form of the quantum integrable “n-level, many-mode” spin-boson Jaynes-Cummings-Dicke-type hamiltonians describing an interaction of a molecule of N n-level atoms with many modes of electromagnetic field and containing, in general, additional non-linear interaction terms. We explicitly obtain the corresponding quantum Lax operators and spin-boson analogs of the generalized Gaudin hamiltonians and prove their quantum commutativity. We investigate symmetries of the obtained models that are associated with the geometric symmetries of the classical r-matrices and construct the corresponding algebra of quantum integrals. We consider in detail three classes of non-skew-symmetric classical r-matrices with spectral parameters and explicitly obtain the corresponding quantum Lax operators and Jaynes-Cummings-Dicke-type hamiltonians depending on the considered r-matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Covariance and the hierarchy of frame bundles

This is an essay on the general concept of covariance, and its connection with the structure of the nested set of higher frame bundles over a differentiable manifold. Examples of covariant geometric objects include not only linear tensor fields, densities and forms, but affinity fields, sectors and sector forms, higher order frame fields, etc., often having nonlinear transformation rules and Lie derivatives. The intrinsic, or invariant, sets of forms that arise on frame bundles satisfy the graded Cartan-Maurer structure equations of an infinite Lie algebra. Reduction of these gives invariant structure equations for Lie pseudogroups, and for G-structures of various orders. Some new results are introduced for prolongation of structure equations, and for treatment of Riemannian geometry with higher-order moving frames. The use of invariant form equations for nonlinear field physics is implicitly advocated.

Estabrook, Frank B.↗

On a class of unsteady three-dimensional Navier Stokes solutions relevant to rotating disc flows: Threshold amplitudes and finite time singularities

A class of exact steady and unsteady solutions of the Navier Stokes equations in cylindrical polar coordinates is given. The flows correspond to the motion induced by an infinite disc rotating with constant angular velocity about the z-axis in a fluid occupying a semi-infinite region which, at large distances from the disc, has velocity field proportional to (x,-y,O) with respect to a Cartesian coordinate system. It is shown that when the rate of rotation is large, Karman's exact solution for a disc rotating in an otherwise motionless fluid is recovered. In the limit of zero rotation rate a particular form of Howarth's exact solution for three-dimensional stagnation point flow is obtained. The unsteady form of the partial differential system describing this class of flow may be generalized to time-periodic equilibrium flows. In addition the unsteady equations are shown to describe a strongly nonlinear instability of Karman's rotating disc flow. It is shown that sufficiently large perturbations lead to a finite time breakdown of that flow whilst smaller disturbances decay to zero. If the stagnation point flow at infinity is sufficiently strong, the steady basic states become linearly unstable. In fact there is then a continuous spectrum of unstable eigenvalues of the stability equations but, if the initial value problem is considered, it is found that, at large values of time, the continuous spectrum leads to a velocity field growing exponentially in time with an amplitude decaying algebraically in time.

Hall, Philip↗

Applying Quantum Computing to Simulate Power System Dynamics

Power system dynamics are generally modeled by high dimensional nonlinear differential-algebraic equations due to a large number of generators, loads, and transmission lines. Thus, its computational complexity grows exponentially with the system size. This paper demonstrates the potential use of quantum computing algorithms to model the power system dynamics. Leveraging a symbolic programming framework, we equivalently convert the power system dynamics’ differential algebraic equations (DAEs) into ordinary differential equations (ODEs), where the data of the state vector can be encoded into quantum computers via amplitude encoding. The system's nonlinearity is captured by Taylor polynomial expansion, the quantum state tensor, and Hamiltonian simulation, whereas state variables can be updated by a quantum linear equation solver. Our results show that quantum computing can simulate the dynamics of the power system with high accuracy, whereas its complexity is polynomial in the logarithm of the system dimension. Our work also illustrates the use of scientific machine learning tools for implementing scientific computing concepts, e.g., Taylor expansion, DAEs/ODEs transform, and quantum computing solver, in the field of power engineering.

Tran, Huynh↗

Balanced truncation-rational Krylov methods for model reduction in large scale dynamical systems

In this paper, we consider the balanced truncation method for model reductions in large-scale linear and time-independent dynamical systems with multi-inputs and multi-outputs. The method is based on the solutions of two large coupled Lyapunov matrix equations when the system is stable or on the computation of stabilizing positive and semi-definite solutions of some continuous-time algebraic Riccati equations when the dynamical system is not stable. Using the rational block Arnoldi, we show how to compute approximate solutions to these large Lyapunov or algebraic Riccati equations. The obtained approximate solutions are given in a factored form and used to build the reduced order model. We give some theoretical results and present numerical examples with some benchmark models.

97 MATHEMATICS AND COMPUTING↗

A multigrid waveform relaxation method for solving the poroelasticity equations

In this work, a multigrid waveform relaxation method is proposed for solving a collocated finite difference discretization of the linear Biot’s model. This gives rise to the first space–time multigrid solver for poroelasticity equations in the literature. The waveform relaxation iteration is based on a point-wise Vanka smoother that couples the pressure variable at a grid-point with the displacements around it. A semi-algebraic mode analysis is proposed to theoretically analyze the convergence of the multigrid waveform relaxation algorithm. This analysis is novel since it combines the semi-algebraic analysis, suitable for parabolic problems, with the non-standard analysis for overlapping smoothers. The practical utility of the method is illustrated through several numerical experiments in one and two dimensions.

97 MATHEMATICS AND COMPUTING↗

Extending quantum operations

For a given set of input-output pairs of quantum states or observables, we ask the question whether there exists a physically implementable transformation that maps each of the inputs to the corresponding output. The physical maps on quantum states are trace-preserving completely positive maps, but we also consider variants of these requirements. We generalize the definition of complete positivity to linear maps defined on arbitrary subspaces, then formulate this notion as a semidefinite program, and relate it by duality to approximative extensions of this map. This gives a characterization of the maps which can be approximated arbitrarily well as the restriction of a map that is completely positive on the whole algebra, also yielding the familiar extension theorems on operator spaces. For quantum channel extensions and extensions by probabilistic operations we obtain semidefinite characterizations, and we also elucidate the special case of Abelian inputs or outputs. Finally, revisiting a theorem by Alberti and Uhlmann, we provide simpler and more widely applicable conditions for certain extension problems on qubits, and by using a semidefinite programming formulation we exhibit counterexamples to seemingly reasonable but false generalizations of the Alberti-Uhlmann theorem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Polyad quantum numbers and multiple resonances in anharmonic vibrational studies of polyatomic molecules

In the theory of anharmonic vibrations of a polyatomic molecule, mixing the zero-order vibrational states due to cubic, quartic and higher-order terms in the potential energy expansion leads to the appearance of more-or-less isolated blocks of states (also called polyads), connected through multiple resonances. Such polyads of states can be characterized by a common secondary integer quantum number. This polyad quantum number is defined as a linear combination of the zero-order vibrational quantum numbers, attributed to normal modes, multiplied by non-negative integer polyad coefficients, which are subject to definition for any particular molecule. According to Kellman's method [J. Chem. Phys. 93, 6630 (1990)], the corresponding formalism can be conveniently described using vector algebra. In the present work, a systematic consideration of polyad quantum numbers is given in the framework of the canonical Van Vleck perturbation theory (CVPT) and its numerical-analytic operator implementation for reducing the Hamiltonian to the quasi-diagonal form, earlier developed by the authors. It is shown that CVPT provides a convenient method for the systematic identification of essential resonances and the definition of a polyad quantum number. The method presented is generally suitable for molecules of significant size and complexity, as illustrated by several examples of molecules up to six atoms. The polyad quantum number technique is very useful for assembling comprehensive basis sets for the matrix representation of the Hamiltonian after removal of all non-resonance terms by CVPT. In addition, the classification of anharmonic energy levels according to their polyad quantum numbers provides an additional means for the interpretation of observed vibrational spectra.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Unfolded equations for current interactions of 4d massless fields as a free system in mixed dimensions

Interactions of massless fields of all spins in four dimensions with currents of any spin are shown to result from a solution of the linear problem that describes a gluing between a rank-one (massless) system and a rank-two (current) system in the unfolded dynamics approach. Since the rank-two system is dual to a free rank-one higher-dimensional system that effectively describes conformal fields in six space-time dimensions, the constructed system can be interpreted as describing a mixture between linear conformal fields in four and six dimensions. An interpretation of the obtained results in the spirit of the AdS/CFT correspondence is discussed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A supernodal all-pairs shortest path algorithm

We show how to exploit graph sparsity in the Floyd-Warshall algorithm for the all-pairs shortest path (Apsp) problem. Floyd-Warshall is an attractive choice for Apsp on high-performing systems due to its structural similarity to solving dense linear systems and matrix multiplication. However, if sparsity of the input graph is not properly exploited, Floyd-Warshall will perform unnecessary asymptotic work and thus may not be a suitable choice for many input graphs. To overcome this limitation, the key idea in our approach is to use the known algebraic relationship between Floyd-Warshall and Gaussian elimination, and import several algorithmic techniques from sparse Cholesky factorization, namely, fill-in reducing ordering, symbolic analysis, supernodal traversal, and elimination tree parallelism. When combined, these techniques reduce computation, improve locality and enhance parallelism. We implement these ideas in an efficient shared memory parallel prototype that is orders of magnitude faster than an efficient multi-threaded baseline Floyd-Warshall that does not exploit sparsity. Our experiments suggest that the Floyd-Warshall algorithm can compete with Dijkstra's algorithm (the algorithmic core of Johnson's algorithm) for several classes sparse graphs.

Sao, Piyush↗

Optimal control of spin stabilized spacecraft with telescoping appendages

The control of a spin-stabilized spacecraft consisting of a rigid central hub and one or two movable offset telescoping booms (with end masses) is considered. The equations of rotational motion are linearized about either of two desired final states. A control law for the boom and mass position is sought such that a quadratic cost functional involving the weighted components of angular velocity plus the control is minimized when the final time is unspecified and involves the solution of the matrix Riccati algebraic equation. For three-axis control more than one offset boom (orthogonal to each other) is required. For two-axis control with a single boom offset from a symmetrical hub, an analytic solution is obtained; when this system is used for nutation decay the time constant is one order of magnitude smaller than previously achieved using non-optimal control logic. For the general case results are obtained numerically.

Bainum, P. M.↗

Optimal control of spin-stabilized spacecraft with telescoping appendages

The control of a spin-stabilized spacecraft consisting of a rigid central hub and one or two movable offset telescoping booms (with end masses) is considered. The equations of rotational motion are linearized about either of two desired final states. A control law for the boom end mass position is sought such that a quadratic cost functional involving the weighted components of angular velocity plus the control is minimized when the final time is unspecified and involves the solution of the matrix Riccati algebraic equation. For three axis control more than one offset boom (orthogonal to each other) is required. For two-axis control with a single boom offset from a symmetrical hub, an analytic solution is obtained; when this system is used for nutation decay the time constant is one order of magnitude smaller than previously achieved using nonoptimal control logic. For the general case results are obtained numerically.

Bainum, P. M.↗

Scaled ILU Smoothers for Navier-Stokes Pressure Projection

Incomplete LU (ILU) smoothers are effective in the algebraic multigrid (AMG) V-cycle for reducing high-frequency components of the error. However, the requisite direct triangular solves are comparatively slow on GPUs. Previous work has demonstrated the advantages of Jacobi iteration as an alternative to direct solution of these systems. Depending on the threshold and fill-level parameters chosen, the factors can be highly nonnormal and Jacobi is unlikely to converge in a low number of iterations. We demonstrate that row scaling can reduce the departure from normality, allowing us to replace the inherently sequential solve with a rapidly converging Richardson iteration. There are several advantages beyond the lower compute time. Scaling is performed locally for a diagonal block of the global matrix because it is applied directly to the factor. Further, an ILUT Schur complement smoother maintains a constant GMRES iteration count as the number of MPI ranks increases, and thus parallel strong-scaling is improved. Our algorithms have been incorporated into hypre, and we demonstrate improved time to solution for linear systems arising in the Nalu-Wind and PeleLM pressure solvers. For large problem sizes, GMRES+AMG executes at least five times faster when using iterative triangular solves compared with direct solves on massively parallel GPUs.

algebraic multigrid↗

Closed-form solutions for linear regulator design of mechanical systems including optimal weighting matrix selection

Vibration in modern structural and mechanical systems can be reduced in amplitude by increasing stiffness, redistributing stiffness and mass, and/or adding damping if design techniques are available to do so. Linear Quadratic Regulator (LQR) theory in modern multivariable control design, attacks the general dissipative elastic system design problem in a global formulation. The optimal design, however, allows electronic connections and phase relations which are not physically practical or possible in passive structural-mechanical devices. The restriction of LQR solutions (to the Algebraic Riccati Equation) to design spaces which can be implemented as passive structural members and/or dampers is addressed. A general closed-form solution to the optimal free-decay control problem is presented which is tailored for structural-mechanical system. The solution includes, as subsets, special cases such as the Rayleigh Dissipation Function and total energy. Weighting matrix selection is a constrained choice among several parameters to obtain desired physical relationships. The closed-form solution is also applicable to active control design for systems where perfect, collocated actuator-sensor pairs exist.

Hanks, Brantley R.↗

BootCMatch: A Software Package for Bootstrap AMG Based on GraphWeighted Matching

This article has two main objectives: one is to describe some extensions of an adaptive Algebraic Multigrid (AMG) method of the form previously proposed by the first and third authors, and a second one is to present a new software framework, named BootCMatch, which implements all the components needed to build and apply the described adaptive AMG both as a stand-alone solver and as a preconditioner in a Krylov method. The adaptive AMG presented is meant to handle general symmetric and positive definite (SPD) sparse linear systems, without assuming any a priori information of the problem and its origin; the goal of adaptivity is to achieve a method with a prescribed convergence rate. The presented method exploits a general coarsening process based on aggregation of unknowns, obtained by a maximum weight matching in the adjacency graph of the system matrix. More specifically, a maximum product matching is employed to define an effective smoother subspace (complementary to the coarse space), a process referred to as compatible relaxation, at every level of the recursive two-level hierarchical AMG process. Results on a large variety of test cases and comparisons with related work demonstrate the reliability and efficiency of the method and of the software.

97 MATHEMATICS AND COMPUTING↗

Metastring theory and modular space-time

String theory is canonically accompanied with a space-time interpretation which determines S-matrix-like observables, and connects to the standard physics at low energies in the guise of local effective field theory. Recently, we have introduced a reformulation of string theory which does not rely on an a priori space-time interpretation or a pre-assumption of locality. This metastring theory is formulated in such a way that stringy symmetries (such as T-duality) are realized linearly. In this paper, we study metastring theory on a flat background and develop a variety of technical and interpretational ideas. These include a formulation of the moduli space of Lorentzian worldsheets, a careful study of the symplectic structure and consequently consistent closed and open boundary conditions, and the string spectrum and operator algebra. What emerges from these studies is a new quantum notion of space-time that we refer to as a quantum Lagrangian or equivalently a modular space-time. This concept embodies the standard tenets of quantum theory and implements in a precise way a notion of relative locality. The usual string backgrounds (non-compact space-time along with some toroidally compactified spatial directions) are obtained from modular space-time by a limiting procedure that can be thought of as a correspondence limit.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Preserving nonlinear constraints in variational flow filtering data assimilation

Data assimilation aims to estimate the states of a dynamical system by optimally combining sparse and noisy observations of the physical system with uncertain forecasts produced by a computational model. The states of many dynamical systems of interest obey nonlinear physical constraints, and the corresponding dynamics is confined to a certain sub-manifold of the state space. Standard data assimilation techniques applied to such systems yield posterior states lying outside the manifold, violating the physical constraints. This work focuses on particle flow filters which use stochastic differential equations to evolve state samples from a prior distribution to samples from an observation-informed posterior distribution. The variational Fokker-Planck (VFP)—a generic particle flow filtering framework—is extended to incorporate non-linear, equality state constraints in the analysis. To this end, two algorithmic approaches that modify the VFP stochastic differential equation are discussed: (i) VFPSTAB, to inexactly preserve constraints with the addition of a stabilizing drift term, and (ii) VFPDAE, to exactly preserve constraints by treating the VFP dynamics as a stochastic differential-algebraic equation (SDAE). Additionally, an implicit-explicit time integrator is developed to evolve the VFPDAE dynamics. The strength of the proposed approach for constraint preservation in data assimilation is demonstrated on three test problems: the double pendulum, Korteweg-de-Vries, and the incompressible Navier-Stokes equations.

97 MATHEMATICS AND COMPUTING↗