Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “MATRIX NOTATION”

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.

35 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

50 Years of metabolic control analysis

It has been 50 years since the publication of the seminal works by Savageau, Kacser & Burns and Heinrich & Rapoport, on the control of biochemical networks. What is remarkable about these three publications (especially the two papers by Kacser et al. and Rapoport et al.) is that they independently developed almost the same approach and came to the same conclusions. This approach is today called metabolic control analysis (MCA), and is a body of work that uses mathematics to reason about the properties of biochemical pathways in a deductive manner. Although originally focused on metabolic pathways, it was realized early on that it could be equally applied to genetic and signalling networks. In fact anything that one could associate a stoichiometry matrix with. In recent years, others have reinvented MCA, using different notation, highlighting the fact that there has been a good deal of conceptual convergence in this area.

59 BASIC BIOLOGICAL SCIENCES↗
NASA NTRS1983

Optical systolic array processor using residue arithmetic

The use of residue arithmetic to increase the accuracy and reduce the dynamic range requirements of optical matrix-vector processors is evaluated. It is determined that matrix-vector operations and iterative algorithms can be performed totally in residue notation. A new parallel residue quantizer circuit is developed which significantly improves the performance of the systolic array feedback processor. Results are presented of a computer simulation of this system used to solve a set of three simultaneous equations.

Jackson, J.↗
NASA NTRS1991

Review of LFTs, LMIs, and mu

The authors present a tutorial overview of linear fractional transformations (LFTs) and the role of the structured singular value, mu, and linear matrix inequalities (LMIs) in solving LFT problems. The authors first introduce the notation for LFTs and briefly discuss some of their properties. They then describe mu and its connections with LFTs. They focus on two standard notions of robust stability and performance, mu stability and performance and Q stability and performance, and their relationship is discussed. Comparisons with the L1 theory of robust performance with structured uncertainty are considered.

Doyle, John↗
NASA NTRS1997

Complexity of Kronecker Operations on Sparse Matrices with Applications to the Solution of Markov Models

We present a systematic discussion of algorithms to multiply a vector by a matrix expressed as the Kronecker product of sparse matrices, extending previous work in a unified notational framework. Then, we use our results to define new algorithms for the solution of large structured Markov models. In addition to a comprehensive overview of existing approaches, we give new results with respect to: (1) managing certain types of state-dependent behavior without incurring extra cost; (2) supporting both Jacobi-style and Gauss-Seidel-style methods by appropriate multiplication algorithms; (3) speeding up algorithms that consider probability vectors of size equal to the "actual" state space instead of the "potential" state space.

Buchholz, Peter↗
NASA NTRS1978

An efficient finite element technique for sound propagation in axisymmetric hard wall ducts carrying high subsonic Mach number flows

The general non-linear three-dimensional equation for acoustic potential is derived by using a perturbation technique. The linearized axisymmetric equation is then solved by using a finite element algorithm based on the Galerkin formulation for a harmonic time dependence. The solution is carried out in complex number notation for the acoustic velocity potential. Linear, isoparametric, quadrilateral elements with non-uniform distribution across the duct section are implemented. The resultant global matrix is stored in banded form and solved by using a modified Gauss elimination technique. Sound pressure levels and acoustic velocities are calculated from post element solutions. Different duct geometries are analyzed and compared with experimental results.

Tag, I. A.↗
NASA NTRS1990

Application of symbolic computations to the constitutive modeling of structural materials

In applications involving elevated temperatures, the derivation of mathematical expressions (constitutive equations) describing the material behavior can be quite time consuming, involved and error-prone. Therefore intelligent application of symbolic systems to faciliate this tedious process can be of significant benefit. Presented here is a problem oriented, self contained symbolic expert system, named SDICE, which is capable of efficiently deriving potential based constitutive models in analytical form. This package, running under DOE MACSYMA, has the following features: (1) potential differentiation (chain rule), (2) tensor computations (utilizing index notation) including both algebraic and calculus; (3) efficient solution of sparse systems of equations; (4) automatic expression substitution and simplification; (5) back substitution of invariant and tensorial relations; (6) the ability to form the Jacobian and Hessian matrix; and (7) a relational data base. Limited aspects of invariant theory were also incorporated into SDICE due to the utilization of potentials as a starting point and the desire for these potentials to be frame invariant (objective). The uniqueness of SDICE resides in its ability to manipulate expressions in a general yet pre-defined order and simplify expressions so as to limit expression growth. Results are displayed, when applicable, utilizing index notation. SDICE was designed to aid and complement the human constitutive model developer. A number of examples are utilized to illustrate the various features contained within SDICE. It is expected that this symbolic package can and will provide a significant incentive to the development of new constitutive theories.

Arnold, Steven M.↗
DOE OSTI2015

A Brief Summary on Formalizing Parallel Tensor Distributions, Redistributions, and Algorithm Derivations

Large-scale datasets in computational chemistry typically require distributed-memory parallel methods to perform a special operation known as tensor contraction. Tensors are multidimensional arrays, and a tensor contraction is akin to matrix multiplication with special types of permutations. Creating an efficient algorithm and optimized implementation in this domain is complex, tedious, and error-prone. To address this, we develop a notation to express data distributions so that we can apply use automated methods to find optimized implementations for tensor contractions. We consider the spin-adapted coupled cluster singles and doubles method from computational chemistry and use our methodology to produce an efficient implementation. Experiments per- formed on the IBM Blue Gene/Q and Cray XC30 demonstrate impact both improved performance and reduced memory consumption.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1991

Development of advanced control schemes for telerobot manipulators

To study space applications of telerobotics, Goddard Space Flight Center (NASA) has recently built a testbed composed mainly of a pair of redundant slave arms having seven degrees of freedom and a master hand controller system. The mathematical developments required for the computerized simulation study and motion control of the slave arms are presented. The slave arm forward kinematic transformation is presented which is derived using the D-H notation and is then reduced to its most simplified form suitable for real-time control applications. The vector cross product method is then applied to obtain the slave arm Jacobian matrix. Using the developed forward kinematic transformation and quaternions representation of the slave arm end-effector orientation, computer simulation is conducted to evaluate the efficiency of the Jacobian in converting joint velocities into Cartesian velocities and to investigate the accuracy of the Jacobian pseudo-inverse for various sampling times. In addition, the equivalence between Cartesian velocities and quaternion is also verified using computer simulation. The motion control of the slave arm is examined. Three control schemes, the joint-space adaptive control scheme, the Cartesian adaptive control scheme, and the hybrid position/force control scheme are proposed for controlling the motion of the slave arm end-effector. Development of the Cartesian adaptive control scheme is presented and some preliminary results of the remaining control schemes are presented and discussed.

Nguyen, Charles C.↗
DOE OSTI2017

Contaminant source identification using semi-supervised machine learning

Identification of the original groundwater types present in geochemical mixtures observed in an aquifer is a challenging but very important task. Frequently, some of the groundwater types are related to different infiltration and/or contamination sources associated with various geochemical signatures and origins. The characterization of groundwater mixing processes typically requires solving complex inverse models representing groundwater flow and geochemical transport in the aquifer, where the inverse analysis accounts for available site data. Usually, the model is calibrated against the available data characterizing the spatial and temporal distribution of the observed geochemical types. Numerous different geochemical constituents and processes may need to be simulated in these models which further complicates the analyses. In this paper, we propose a new contaminant source identification approach that performs decomposition of the observation mixtures based on Non-negative Matrix Factorization (NMF) method for Blind Source Separation (BSS), coupled with a custom semi-supervised clustering algorithm. Our methodology, called NMFk, is capable of identifying (a) the unknown number of groundwater types and (b) the original geochemical concentration of the contaminant sources from measured geochemical mixtures with unknown mixing ratios without any additional site information. NMFk is tested on synthetic and real-world site data. Finally, the NMFk algorithm works with geochemical data represented in the form of concentrations, ratios (of two constituents; for example, isotope ratios), and delta notations (standard normalized stable isotope ratios).

54 ENVIRONMENTAL SCIENCES↗
DOE OSTI2018

Topological circuits of inductors and capacitors

Alternating current (ac) circuits can have electromagnetic edge modes protected by symmetries, analogous to topological band insulators or semimetals. How to make such a topological circuit? This paper illustrates a particular design idea by analyzing a series of topological circuits consisting purely of inductors (L) and capacitors (C) connected to each other by wires to form periodic lattices. All the examples are treated using a unifying approach based on Lagrangians and the dynamical H-matrix. First, the building blocks and permutation wiring are introduced using simple circuits in one dimension, the SSH transmission line and a braided ladder analogous to the ice-tray model also known as the π-flux ladder. Then, more general building blocks (loops and stars) and wiring schemes (m-shifts) are introduced. The key concepts of emergent pseudo-spin degrees of freedom and synthetic gauge fields are discussed, and the connection to quantum lattice Hamiltonians is clarified. A diagrammatic notation is introduced to simplify the design and presentation of more complicated circuits. These building blocks are then used to construct topological circuits in higher dimensions. The examples include the circuit analog of Haldane’s Chern insulator in two dimensions and quantum Hall insulator in four dimensions featuring finite second Chern numbers. The topological invariants and symmetry protection of the edge modes are discussed based on the H-matrix.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2013

The Kronecker product in terms of Hubbard operators and the Clebsch–Gordan decomposition of SU(2)×SU(2)

We review the properties of the Kronecker (direct, or tensor) product of square matrices A⊗B⊗C⋯ in terms of Hubbard operators. In its simplest form, a Hubbard operator X{sub n}{sup i,j} can be expressed as the n-square matrix which has entry 1 in position (i,j) and zero in all other entries. The algebra and group properties of the observables that define a multipartite quantum system are notably straightforward in such a framework. In particular, we use the Kronecker product in Hubbard notation to get the Clebsch–Gordan decomposition of the product group SU(2)×SU(2). Finally, the n-dimensional irreducible representations so obtained are used to derive closed forms of the Clebsch–Gordan coefficients that rule the addition of angular momenta. Our results can be further developed in many different directions. -- Highlights: •The Kronecker product is studied in terms of Hubbard operators. •Complicated calculations involving large matrices are reduced to simple relations of subscripts. •The algebraic properties of the quantum observables of multipartite systems are studied. •The Clebsch–Gordan coefficients are given in terms of hypergeometric {sub 3}F{sub 2} functions. •The results can be further developed in many different directions.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1988

Recursive mass matrix factorization and inversion: An operator approach to open- and closed-chain multibody dynamics

This report advances a linear operator approach for analyzing the dynamics of systems of joint-connected rigid bodies.It is established that the mass matrix M for such a system can be factored as M=(I+H phi L)D(I+H phi L) sup T. This yields an immediate inversion M sup -1=(I-H psi L) sup T D sup -1 (I-H psi L), where H and phi are given by known link geometric parameters, and L, psi and D are obtained recursively by a spatial discrete-step Kalman filter and by the corresponding Riccati equation associated with this filter. The factors (I+H phi L) and (I-H psi L) are lower triangular matrices which are inverses of each other, and D is a diagonal matrix. This factorization and inversion of the mass matrix leads to recursive algortihms for forward dynamics based on spatially recursive filtering and smoothing. The primary motivation for advancing the operator approach is to provide a better means to formulate, analyze and understand spatial recursions in multibody dynamics. This is achieved because the linear operator notation allows manipulation of the equations of motion using a very high-level analytical framework (a spatial operator algebra) that is easy to understand and use. Detailed lower-level recursive algorithms can readily be obtained for inspection from the expressions involving spatial operators. The report consists of two main sections. In Part 1, the problem of serial chain manipulators is analyzed and solved. Extensions to a closed-chain system formed by multiple manipulators moving a common task object are contained in Part 2. To retain ease of exposition in the report, only these two types of multibody systems are considered. However, the same methods can be easily applied to arbitrary multibody systems formed by a collection of joint-connected regid bodies.

Rodriguez, G.↗
NASA NTRS1989

A unifying framework for rigid multibody dynamics and serial and parallel computational issues

A unifying framework for various formulations of the dynamics of open-chain rigid multibody systems is discussed. Their suitability for serial and parallel processing is assessed. The framework is based on the derivation of intrinsic, i.e., coordinate-free, equations of the algorithms which provides a suitable abstraction and permits a distinction to be made between the computational redundancy in the intrinsic and extrinsic equations. A set of spatial notation is used which allows the derivation of the various algorithms in a common setting and thus clarifies the relationships among them. The three classes of algorithms viz., O(n), O(n exp 2) and O(n exp 3) or the solution of the dynamics problem are investigated. Researchers begin with the derivation of O(n exp 3) algorithms based on the explicit computation of the mass matrix and it provides insight into the underlying basis of the O(n) algorithms. From a computational perspective, the optimal choice of a coordinate frame for the projection of the intrinsic equations is discussed and the serial computational complexity of the different algorithms is evaluated. The three classes of algorithms are also analyzed for suitability for parallel processing. It is shown that the problem belongs to the class of N C and the time and processor bounds are of O(log2/2(n)) and O(n exp 4), respectively. However, the algorithm that achieves the above bounds is not stable. Researchers show that the fastest stable parallel algorithm achieves a computational complexity of O(n) with O(n exp 4), respectively. However, the algorithm that achieves the above bounds is not stable. Researchers show that the fastest stable parallel algorithm achieves a computational complexity of O(n) with O(n exp 2) processors, and results from the parallelization of the O(n exp 3) serial algorithm.

Fijany, Amir↗
NASA NTRS1987

Nonlinear beam kinematics by decomposition of the rotation tensor

A simple matrix expression is obtained for the strain components of a beam in which the displacements and rotations are large. The only restrictions are on the magnitudes of the strain and of the local rotation, a newly-identified kinematical quantity. The local rotation is defined as the change of orientation of material elements relative to the change of orientation of the beam reference triad. The vectors and tensors in the theory are resolved along orthogonal triads of base vectors centered along the undeformed and deformed beam reference axes, so Cartesian tensor notation is used. Although a curvilinear coordinate system is natural to the beam problem, the complications usually associated with its use are circumvented. Local rotations appear explicitly in the resulting strain expressions, facilitating the treatment of beams with both open and closed cross sections in applications of the theory. The theory is used to obtain the kinematical relations for coupled bending, torsion, extension, shear deformation, and warping of an initially curved and twisted beam.

Danielson, D. A.↗
NASA NTRS1987

Nonlinear Beam Kinematics by Decomposition of the Rotation Tensor

A simple matrix expression is obtained for the strain components of a beam in which the displacements and rotations are large. The only restrictions are on the magnitudes of the strain and of the local rotation, a newly-identified kinematical quantity. The local rotation is defined as the change of orientation of material elements relative to the change of orientation of the beam reference triad. The vectors and tensors in the theory are resolved along orthogonal triads of base vectors centered along the undeformed and deformed beam reference axes, so Cartesian tensor notation is used. Although a curvilinear coordinate system is natural to the beam problem, the complications usually associated with its use are circumvented. Local rotations appear explicitly in the resulting strain expressions, facilitating the treatment of beams with both open and closed cross sections in applications of the theory. The theory is used to obtain the kinematical relations for coupled bending, torsion extension, shear deformation, and warping of an initially curved and twisted beam.

Danielson, D. A.↗