The matrix algebra program. A conversational language for numerical matrix operations - Part 2 - Reference manual
Reference manual for the programming language of Matrix Algebra Program /MAP/
Newbold, P. M.↗
SEARCH · Engineering Papers
Results for “MATRIX 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.
A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs
We describe parallel algorithms for computing maximal cardinality matching in a bipartite graph on distributed-memory systems. Unlike traditional algorithms that match one vertex at a time, our algorithms process many unmatched vertices simultaneously using a matrix-algebraic formulation of maximal matching. This generic matrix-algebraic framework is used to develop three efficient maximal matching algorithms with minimal changes. The newly developed algorithms have two benefits over existing graph-based algorithms. First, unlike existing parallel algorithms, cardinality of matching obtained by the new algorithms stays constant with increasing processor counts, which is important for predictable and reproducible performance. Second, relying on bulk-synchronous matrix operations, these algorithms expose a higher degree of parallelism on distributed-memory platforms than existing graph-based algorithms. We report high-performance implementations of three maximal matching algorithms using hybrid OpenMP-MPI and evaluate the performance of these algorithm using more than 35 real and randomly generated graphs. On real instances, our algorithms achieve up to 200 × speedup on 2048 cores of a Cray XC30 supercomputer. Even higher speedups are obtained on larger synthetically generated graphs where our algorithms show good scaling on up to 16,384 cores.
97 MATHEMATICS AND COMPUTING↗
Solution of the algebraic matrix Riccati equation via Newton-Raphson iteration.
Algebraic matrix Riccati differential equation solution by Newton-Raphson iteration method
Blackburn, T. R.↗
Solution of the algebraic matrix Riccati equation via Newton-Raphson iteration.
Algebraic matrix Ricatti equation solution via Newton-Raphson iteration algorithm, noting application to quadratic optimal controller and least square state estimator
Blackburn, T. R.↗
Efficient modeling of optically-complex, non-coplanar exterior shading: Validation of matrix algebraic methods
It has long been established that shading windows with overhangs, fins, and other types of non-coplanar systems (NCS) is one of the most effective ways of controlling solar heat gains in buildings because they intercept solar radiation prior to entry into the building. Designers however often specify non-opaque materials (e.g., louvers, fritted glass, expanded metal mesh) for these systems in order to admit daylight, reduce lighting energy use, and improve indoor environmental quality. Most simulation tools rely on geometric calculations and radiosity methods to model the solar heat gain impacts of NCS and cannot model optically-complex materials or geometries. For daylighting analysis, optically-complex NCS can be modeled using matrix algebraic methods, although time-efficient parametric analysis has not yet been implemented. Determining the best design and/or material for static or operable NCS that minimize cooling, heating, and lighting energy use and peak demand requires an iterative process. This study describes and validates a matrix algebraic method that enables parametric energy analysis of NCS. Such capabilities would be useful not only for design but also for development of prescriptive energy-efficiency standards, rating and labeling systems for commercial products, development of design guidelines, and development of more optimal NCS technologies. A facade or “F” matrix, which maps the transfer of flux from the NCS to the surface of the window, is introduced and its use is explained. A field study was conducted in a full-scale outdoor testbed to measure the daylight performance of an operable drop-arm awning. Simulated data were compared to measured data in order to validate the models. Results demonstrated model accuracy: simulated workplane illuminance was within 11–13%, surface luminance was within 16–18%, and the daylight glare probability was within 6–9% of measured results. Methods used to achieve accurate results are discussed. Results of the validation of daylighting performance are applicable to solar heat gain performance. Since exterior shading can also significantly reduce peak demand, these models enable stakeholders to more accurately assess HVAC and lighting impacts in support of grid management and resiliency goals.
32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
The matrix algebra program. A conversational language for numerical matrix operations. Part 1 - User's manual
User manual for program language to execute numerical matrix operations with direct access time sharing computer systems
Newbold, P. M.↗
Hypercontractivity in finite-dimensional matrix algebras
We obtain hypercontractivity estimates for a large class of semigroups defined on finite-dimensional matrix algebras M{sub n}. These semigroups arise from Poisson-like length functions ψ on ℤ{sub n} × ℤ{sub n} and provide new hypercontractive families of quantum channels when ψ is conditionally negative. We also study the optimality of our estimates.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Optical characterization of free electron concentration in heteroepitaxial InN layers using Fourier transform infrared spectroscopy and a 2 Multiplication-Sign 2 transfer-matrix algebra
Fourier Transform Infrared (FTIR) reflectance spectroscopy has been implemented as a non-destructive, non-invasive, tool for the optical characterization of a set of c-plane InN single heteroepitaxial layers spanning a wide range of thicknesses (30-2000 nm). The c-plane (0001) InN epilayers were grown by plasma-assisted molecular beam epitaxy (PAMBE) on GaN(0001) buffer layers which had been grown on Al{sub 2}O{sub 3}(0001) substrates. It is shown that for arbitrary multilayers with homogeneous anisotropic layers having their principal axes coincident with the laboratory coordinates, a 2 Multiplication-Sign 2 matrix algebra based on a general transfer-matrix method (GTMM) is adequate to interpret their optical response. Analysis of optical reflectance in the far and mid infrared spectral range has been found capable to discriminate between the bulk, the surface and interface contributions of free carriers in the InN epilayers revealing the existence of electron accumulation layers with carrier concentrations in mid 10{sup 19} cm{sup -3} at both the InN surface and the InN/GaN interface. The spectra could be fitted with a three-layer model, determining the different electron concentration and mobility values of the bulk and of the surface and the interface electron accumulation layers in the InN films. The variation of these values with increasing InN thickness could be also sensitively detected by the optical measurements. The comparison between the optically determined drift mobility and the Hall mobility of the thickest sample reveals a value of r{sub H} = 1.49 for the Hall factor of InN at a carrier concentration of 1.11 Multiplication-Sign 10{sup 19} cm{sup -3} at 300 Degree-Sign {Kappa}.
36 MATERIALS SCIENCE↗
Fast matrix algebra for Bayesian model calibration
In Bayesian model calibration, evaluation of the likelihood function usually involves finding the inverse and determinant of a covariance matrix. When Markov Chain Monte Carlo (MCMC) methods are used to sample from the posterior, hundreds of thousands of likelihood evaluations may be required. In this paper, we demonstrate that the structure of the covariance matrix can be exploited, leading to substantial time savings in practice. Here, we also derive two simple equations for approximating the inverse of the covariance matrix in this setting, which can be computed in near-quadratic time. The practical implications of these strategies are demonstrated using a simple numerical case study and the "quack" R package. For a covariance matrix with 1000 rows, application of these strategies for a million likelihood evaluations leads to a speedup of roughly 4000 compared to the naive implementation
97 MATHEMATICS AND COMPUTING↗
Modeling the direct sun component in buildings using matrix algebraic approaches: Methods and validation
Simulation tools that enable annual energy performance analysis of optically-complex fenestration systems have been widely adopted by the building industry for use in building design, code development, and the development of rating and certification programs for commercially-available shading and daylighting products. The tools rely on a three-phase matrix operation to compute solar heat gains, using as input low-resolution bidirectional scattering distribution function (BSDF) data (10–15° angular resolution; BSDF data define the angle-dependent behavior of light-scattering materials and systems). Measurement standards and product libraries for BSDF data are undergoing development to support solar heat gain calculations. Simulation of other metrics such as discomfort glare, annual solar exposure, and potentially thermal discomfort, however, require algorithms and BSDF input data that more accurately model the spatial distribution of transmitted and reflected irradiance or illuminance from the sun (0.5° resolution). This study describes such algorithms and input data, then validates the tools (i.e., an interpolation tool for measured BSDF data and the five-phase method) through comparisons with ray-tracing simulations and field monitored data from a full-scale testbed. Simulations of daylight-redirecting films, a micro-louvered screen, and venetian blinds using variable resolution, tensor tree BSDF input data derived from interpolated scanning goniophotometer measurements were shown to agree with field monitored data to within 20% for greater than 75% of the measurement period for illuminance-based performance parameters. The three-phase method delivered significantly less accurate results. We discuss the ramifications of these findings on industry and provide recommendations to increase end user awareness of the current limitations of existing software tools and BSDF product libraries.
14 SOLAR ENERGY↗
Luneburg lens and optical matrix algebra research
Planar, as opposed to channelized, integrated optical circuits (IOCs) were stressed as the basis for computational devices. Both fully-parallel and systolic architectures are considered and the tradeoffs between the two device types are discussed. The Kalman filter approach is a most important computational method for many NASA problems. This approach to deriving a best-fit estimate for the state vector describing a large system leads to matrix sizes which are beyond the predicted capacities of planar IOCs. This problem is overcome by matrix partitioning, and several architectures for accomplishing this are described. The Luneburg lens work has involved development of lens design techniques, design of mask arrangements for producing lenses of desired shape, investigation of optical and chemical properties of arsenic trisulfide films, deposition of lenses both by thermal evaporation and by RF sputtering, optical testing of these lenses, modification of lens properties through ultraviolet irradiation, and comparison of measured lens properties with those expected from ray trace analyses.
Wood, V. E.↗
Matrix Algebra for GPU and Multicore Architectures (MAGMA) for Large Petascale Systems
The goal of the MAGMA project is to create a new generation of linear algebra libraries that achieve the fastest possible time to an accurate solution on hybrid Multicore+GPU-based systems, using all the processing power that future high-end systems can make available within given energy constraints. Our efforts at the University of Tennessee achieved the goals set in all of the five areas identified in the proposal: 1. Communication optimal algorithms; 2. Autotuning for GPU and hybrid processors; 3. Scheduling and memory management techniques for heterogeneity and scale; 4. Fault tolerance and robustness for large scale systems; 5. Building energy efficiency into software foundations. The University of Tennessee’s main contributions, as proposed, were the research and software development of new algorithms for hybrid multi/many-core CPUs and GPUs, as related to two-sided factorizations and complete eigenproblem solvers, hybrid BLAS, and energy efficiency for dense, as well as sparse, operations. Furthermore, as proposed, we investigated and experimented with various techniques targeting the five main areas outlined.
97 MATHEMATICS AND COMPUTING↗
Smoothers for Matrix-Free Algebraic Multigrid Preconditioning of High-Order Finite Elements
We investigate smoothers for use in matrix-free algebraic multigrid (AMG) preconditioning of high-order finite element problems. These AMG preconditioners are matrix-free in the sense that they are built from a related low-order refined finite element problem whose system matrix can be much more rapidly assembled than the high-order problem. Our proposed smoother, which we call distributive relaxation, is more robust to the anisotropy present in many low-order refined meshes which feature a clustering of nodes near the boundaries between high-order finite elements. For solving the low-order refined problem, we show that this new distributive relaxation smoother possesses significantly improved performance compared to more traditional smoothers.
97 MATHEMATICS AND COMPUTING↗
CSM testbed architecture
The background for the CSM Testbed Architecture and a description of the three architecture related tasks under the NASA/Langley CSM contract (NAS1-18444) are given. For each task the objectives, subtasks chosen to achieve the objectives, and the accomplishments are presented. For Task 2, Near-Term Enhancements to the CSM Testbed Architecture, the primary objectives are to quickly correct: (1) inefficiency in the GAL data manager, and (2) deficiency in the CLIP-interpreted command language, CLAMP. The corresponding modifications should preserve upward-compatibility to a reasonable extent, while at the same time increasing the flexibility and extensibility of the CSM Testbed. Researchers have increased the efficiency of GAL by a factor of 2+ and have made several improvements in CLIP. For Task 5, Matrix Algebra Methods and Utilities, the goal is to investigate the current capabilities of the CSM Testbed and the required improvements to the CSM Testbed for performing the matrix algebraic operations required for the analysis of present and future CSM focal problems using advanced methods. Researchers have made an extensive study of the matrix algebra functions in SPAR that includes documenting these routines and supplying inline comments.
Underwood, Philip↗
Component modes damping assignment methodology for articulated, multiflexible body structures
To simulate the dynamical motion of articulated, multiflexible body structures, one can use multibody simulation packages such as DISCOS. To this end, one must supply appropriate reduced-order models for all of the flexible components involved. The component modes projection and assembly model reduction (COMPARE) methodology is one way to construct these reduced-order component models, which when reassembled capture important system input-to-output mapping of the full-order model at multiple system configurations of interest. In conjunction, we must also supply component damping matrices which when reassembled generate a system damping matrix that has certain desirable properties. The problem of determining the damping factors of components' modes to achieve a given system damping matrix is addressed here. To this end, we must establish from first principles a matrix-algebraic relation between the system's modal damping matrix and the components' modal damping matrices. An unconstrained/constrained optimization problem can then be formulated to determine the component modes' damping factors that best satisfy that matrix-algebraic relation. The effectiveness of the developed methodology, called ModeDamp, has been successfully demonstrated on a high-order, finite element model of the Galileo spacecraft.
Lee, Allan Y.↗
Automatic Overset Grid Generation with Heuristic Feedback Control
An advancing front grid generation system for structured Overset grids is presented which automatically modifies Overset structured surface grids and control lines until user-specified grid qualities are achieved. The system is demonstrated on two examples: the first refines a space shuttle fuselage control line until global truncation error is achieved; the second advances, from control lines, the space shuttle orbiter fuselage top and fuselage side surface grids until proper overlap is achieved. Surface grids are generated in minutes for complex geometries. The system is implemented as a heuristic feedback control (HFC) expert system which iteratively modifies the input specifications for Overset control line and surface grids. It is developed as an extension of modern control theory, production rules systems and subsumption architectures. The methodology provides benefits over the full knowledge lifecycle of an expert system for knowledge acquisition, knowledge representation, and knowledge execution. The vector/matrix framework of modern control theory systematically acquires and represents expert system knowledge. Missing matrix elements imply missing expert knowledge. The execution of the expert system knowledge is performed through symbolic execution of the matrix algebra equations of modern control theory. The dot product operation of matrix algebra is generalized for heuristic symbolic terms. Constant time execution is guaranteed.
Robinson, Peter I.↗
An analysis of thermal response factors and how to reduce their computational time requirement
Te RESFAC2 version of the Thermal Response Factor Program (RESFAC) is the result of numerous modifications and additions to the original RESFAC. These modifications and additions have significantly reduced the program's computational time requirement. As a result of this work, the program is more efficient and its code is both readable and understandable. This report describes what a thermal response factor is; analyzes the original matrix algebra calculations and root finding techniques; presents a new root finding technique and streamlined matrix algebra; supplies ten validation cases and their results.
Wiese, M. R.↗
Time scale analysis of a closed-loop discrete optimal control system
A two-time scale discrete control system is considered. The closed-loop optimal linear quadratic (LQ) regulator for the system requires the solution of a full-order algebraic matrix Riccati equation. Alternatively, the original system is decomposed into reduced-order slow and fast subsystems. The closed-loop optimal control of the subsystems requires the solution of two algebraic matrix Riccati equations of order lower than that required for the full-order system. A composite, closed-loop suboptimal control is created from the sum of the slow and fast feedback optimal controls. Numerical results obtained for an aircraft model show a very close agreement between the exact (optimal) solutions and computationally simpler composite (suboptimal) solutions. The main advantage of the method is the considerable reduction in the overall computational requirements for the closed-loop optimal control of digital flight systems.
Naidu, D. S.↗