Engineering PapersSearch

SEARCH · Engineering Papers

Results for “Linear Algebra Abstractions”

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.

BoBa

BoBa is a C++ software library for working with large matrices, tensors, and tensor decompositions. The library provides tools for dense matrix and tensor operations, tensor decompositions, and tensor decomposition methods that support modern CPU and GPU architectures. It includes portable abstractions for linear algebra, tensor algebra, and multidimensional computation. BoBa is intended for scientific computing applications that involve large multidimensional data sets or high dimensional mathematical models. Its capabilities support tasks such as data compression, linear algebra, efficient numerical computation, and the development of scalable algorithms for heterogeneous hardware. Tutorials, tests, and example applications are included to help users learn and apply the library.

Yao, Jin [Lawrence Livermore National Laboratory (

Surface science insight note: A linear algebraic approach to elucidate native films on Fe 3 O 4 surface

Standard materials are often used to obtain spectra that can be compared to those from unknown samples. Spectra measured from these known substances are also used as a means of computing sensitivity factors to allow quantification by X-ray photoelectron spectroscopy (XPS) of less well-defined materials. Spectra from known materials also provide line shapes suitable for inclusion in spectral models which, when fitted to spectra, permit the chemical state for a sample to be assessed. Both types of information depend on isolating photoemission signals from the inelastically scattered signal. In this Insight note, technical issues associated with the use of XPS of as received Fe 3 O 4 powder sample surface are discussed. The Insight note is designed to show how linear algebraic techniques applied to data collected from a sample marketed as pure Fe 3 O 4 powder are used to verify that XPS has been performed on chemistry representative of the sample. The methods described in this Insight note can further be utilized in elucidating complex XPS data obtained from thin films formed or evolved during cyclic/non-steady use of complex (electro)catalyst surfaces, especially in the presence of contaminants.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH

Introduction to abstract analysis

This book, which grew out of lectures given at the NASA Lewis Research Center, introduces the scientist and engineer with the usual background in applied mathematics to the concepts of abstract analysis. The emphasis is not on preparing the reader to do research in the field but on giving him some of the background necessary for reading the literature of pure mathematics. Although the material here is by no means original, the presentation differs in some respects from texts on material of this nature. The proofs are more detailed herein and quite easy to follow. We have attempted to indicate how the material relates to and serves as a foundation for more advanced sub- jects. We have also attempted at several places to show how the material covered here relates to the more familiar “real mathematics.” Enough examples are included to illustrate the concepts. No attempt is made to indicate the original sources of the material or even to point out the originators of all the concepts. Contrary to the usual practice, the relation between convergence and continuity on the one hand and algebraic operations on the other is dis- cussed in the abstract setting of linear spaces. This is done principally to familiarize the reader with these very important concepts in a reasonably simple way.

Marvin E Goldstein

Efficient computer algebra algorithms for polynomial matrices in control design

The theory of polynomial matrices plays a key role in the design and analysis of multi-input multi-output control and communications systems using frequency domain methods. Examples include coprime factorizations of transfer functions, cannonical realizations from matrix fraction descriptions, and the transfer function design of feedback compensators. Typically, such problems abstract in a natural way to the need to solve systems of Diophantine equations or systems of linear equations over polynomials. These and other problems involving polynomial matrices can in turn be reduced to polynomial matrix triangularization procedures, a result which is not surprising given the importance of matrix triangularization techniques in numerical linear algebra. Matrices with entries from a field and Gaussian elimination play a fundamental role in understanding the triangularization process. In the case of polynomial matrices, matrices with entries from a ring for which Gaussian elimination is not defined and triangularization is accomplished by what is quite properly called Euclidean elimination. Unfortunately, the numerical stability and sensitivity issues which accompany floating point approaches to Euclidean elimination are not very well understood. New algorithms are presented which circumvent entirely such numerical issues through the use of exact, symbolic methods in computer algebra. The use of such error-free algorithms guarantees that the results are accurate to within the precision of the model data--the best that can be hoped for. Care must be taken in the design of such algorithms due to the phenomenon of intermediate expressions swell.

Baras, J. S.

Stochastic control of infinite dimensional systems in Hilbert space: A factorization perspective

A factorization perspective on problems of optimal causal estimation and optimal causal control of linear stochastic systems defined on an infinite-dimensional Hilbert space is presented. A separation principle is derived for the case in which the system input/output map is generated by an abstract evolution operator. The factorization formalism allows for an essentially algebraic approach to these problems.

Milman, Mark M.

On three dimensional object recognition and pose-determination: An abstraction based approach

A method of computing reliable Gaussian and mean curvature sign-map descriptors from the polynomial approximation of surfaces was demonstrated. Such descriptors which are invariant under perspective variation are suitable for hypothesis generation. A means for determining the pose of constructed geometric forms whose algebraic surface descriptors are nonlinear in terms of their orienting parameters was developed. This was done by means of linear functions which are capable of approximating nonlinear forms and determining their parameters. It was shown that biquadratic surfaces are suitable companion linear forms for cylindrical approximation and parameter estimation. The estimates provided the initial parametric approximations necessary for a nonlinear regression stage to fine tune the estimates by fitting the actual nonlinear form to the data. A hypothesis-based split-merge algorithm for extraction and pose determination of cylinders and planes which merge smoothly into other surfaces was developed. It was shown that all split-merge algorithms are hypothesis-based. A finite-state algorithm for the extraction of the boundaries of run-length regions was developed. The computation takes advantage of the run list topology and boundary direction constraints implicit in the run-length encoding.

Quek, Kok How Francis

Extending reliability: Transformational tailoring of abstract mathematical software

Methods for automatically constructing concrete executable programs from an abstract prototype program by applying transformations based on theorems of matrix algebra and on algebraic properties of programming languages are described. These methods provide a user with highly efficient programs tailored to his environment while maintaining the advantages of high reliability and low cost associated with routines from the best mathematical software libraries. Also, the transformations which produce such programs represent a formal codification of rules for writing linear algebra programs.

Boyle, J. M.

On Hilbert-Schmidt norm convergence of Galerkin approximation for operator Riccati equations

An abstract approximation framework for the solution of operator algebraic Riccati equations is developed. The approach taken is based on a formulation of the Riccati equation as an abstract nonlinear operator equation on the space of Hilbert-Schmidt operators. Hilbert-Schmidt norm convergence of solutions to generic finite dimensional Galerkin approximations to the Riccati equation to the solution of the original infinite dimensional problem is argued. The application of the general theory is illustrated via an operator Riccati equation arising in the linear-quadratic design of an optimal feedback control law for a 1-D heat/diffusion equation. Numerical results demonstrating the convergence of the associated Hilbert-Schmidt kernels are included.

Rosen, I. G.

A spatial operator algebra for manipulator modeling and control

A spatial operator algebra for modeling the control and trajectory design of manipulation is discussed, with emphasis on its analytical formulation and implementation in the Ada programming language. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of the manipulator. Inversion is obtained using techniques of recursive filtering and smoothing. The operator alegbra provides a high-level framework for describing the dynamic and kinematic behavior of a manipulator and control and trajectory design algorithms. Implementable recursive algorithms can be immediately derived from the abstract operator expressions by inspection, thus greatly simplifying the transition from an abstract problem formulation and solution to the detailed mechanization of a specific algorithm.

Rodriguez, G.

A spatial operator algebra for manipulator modeling and control

A recently developed spatial operator algebra, useful for modeling, control, and trajectory design of manipulators is discussed. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of a manipulator. Inversion of operators can be efficiently obtained via techniques of recursive filtering and smoothing. The operator algebra provides a high level framework for describing the dynamic and kinematic behavior of a manipulator and control and trajectory design algorithms. The interpretation of expressions within the algebraic framework leads to enhanced conceptual and physical understanding of manipulator dynamics and kinematics. Furthermore, implementable recursive algorithms can be immediately derived from the abstract operator expressions by inspection. Thus, the transition from an abstract problem formulation and solution to the detailed mechanizaton of specific algorithms is greatly simplified. The analytical formulation of the operator algebra, as well as its implementation in the Ada programming language are discussed.

Rodriguez, G.

From large to small $$ \mathcal{N} $$ = (4, 4) superconformal surface defects in holographic 6d SCFTs

Abstract Two-dimensional (2d)$$ \mathcal{N} $$ N = (4, 4) Lie superalgebras can be either “small” or “large”, meaning their R-symmetry is either$$ \mathfrak{so} $$ so (4) or$$ \mathfrak{so} $$ so (4) ⊕$$ \mathfrak{so} $$ so (4), respectively. Both cases admit a superconformal extension and fit into the one-parameter family$$ \mathfrak{d} $$ d (2,1;γ) ⊕$$ \mathfrak{d} $$ d (2,1;γ), with parameterγ∈ (−∞,∞). The large algebra corresponds to generic values ofγ, while the small case corresponds to a degeneration limit withγ→ −∞. In 11d supergravity, we study known solutions with superisometry algebra$$ \mathfrak{d} $$ d (2,1;γ) ⊕$$ \mathfrak{d} $$ d (2,1;γ) that are asymptotically locally AdS 7 ×𝕊 4 . These solutions are holographically dual to the 6d maximally superconformal field theory with 2d superconformal defects invariant under$$ \mathfrak{d} $$ d (2,1;γ) ⊕$$ \mathfrak{d} $$ d (2,1;γ). We show that a limit of these solutions, in whichγ→ −∞, reproduces another known class of solutions, holographically dual tosmall$$ \mathcal{N} $$ N = (4, 4) superconformal defects. We then use this limit to generate new small$$ \mathcal{N} $$ N = (4, 4) solutions with finite Ricci scalar, in contrast to the known small$$ \mathcal{N} $$ N = (4, 4) solutions. We then use holography to compute the entanglement entropy of a spherical region centered on these small$$ \mathcal{N} $$ N = (4, 4) defects, which provides a linear combination of defect Weyl anomaly coefficients that characterizes the number of defect-localized degrees of freedom. We also comment on the generalization of our results to include$$ \mathcal{N} $$ N = (0,4) surface defects through orbifolding.

Physics