Search NASA⌕ Search

SEARCH · Search NASA

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.

At least 307 records · Page 17
All sourcesNASA NTRSDOE OSTI
NASA NTRS1993

Quons, an interpolation between Bose and Fermi oscillators

After a brief mention of Bose and Fermi oscillators and of particles which obey other types of statistics, including intermediate statistics, parastatistics, paronic statistics, anyon statistics, and infinite statistics, I discuss the statistics of 'quons' (pronounced to rhyme with muons), particles whose annihilation and creation operators obey the q-deformed commutation relation (the quon algebra or q-mutator) which interpolates between fermions and bosons. I emphasize that the operator for interaction with an external source must be an effective Bose operator in all cases. To accomplish this for parabose, parafermi and quon operators, I introduce parabose, parafermi, and quon Grassmann numbers, respectively. I also discuss interactions of non-relativistic quons, quantization of quon fields with antiparticles, calculation of vacuum matrix elements of relativistic quon fields, demonstration of the TCP theorem, cluster decomposition, and Wick's theorem for relativistic quon fields, and the failure of local commutativity of observables for relativistic quon fields. I conclude with the bound on the parameter q for electrons due to the Ramberg-Snow experiment.

Greenberg, O. W.↗
NASA NTRS1950

General algebraic method applied to control analysis of complex engine types

A general algebraic method of attack on the problem of controlling gas-turbine engines having any number of independent variables was utilized employing operational functions to describe the assumed linear characteristics for the engine, the control, and the other units in the system. Matrices were used to describe the various units of the system, to form a combined system showing all effects, and to form a single condensed matrix showing the principal effects. This method directly led to the conditions on the control system for noninteraction so that any setting disturbance would affect only its corresponding controlled variable. The response-action characteristics were expressed in terms of the control system and the engine characteristics. The ideal control-system characteristics were explicitly determined in terms of any desired response action.

Boksenbom, Aaron S↗
NASA NTRS1977

Integration-free interval doubling for Riccati equation solutions

Starting with certain identities obtained by Reid (1972) and Redheffer (1962) for general matrix Riccati equations (RE's), we give various algorithms for the case of constant coefficients. The algorithms are based on two ideas - first, relate the RE solution with general initial conditions to anchored RE solutions; and second, when the coefficients are constant, the anchored solutions have a basic shift-invariance property. These ideas are used to construct an integration-free, superlinearly convergent iterative solution to the algebraic RE. Preliminary numerical experiments show that our algorithms, arranged in square-root form, provide a method that is numerically stable and appears to be competitive with other methods of solving the algebraic RE.

Sidhu, G. S.↗
NASA NTRS1986

Modified Denavit-Hartenberg parameters for better location of joint axis systems in robot arms

The Denavit-Hartenberg parameters define the relative location of successive joint axis systems in a robot arm. A recent justifiable criticism is that one of these parameters becomes extremely large when two successive joints have near-parallel rotational axes. Geometrically, this parameter then locates a joint axis system at an excessive distance from the robot arm and, computationally, leads to an ill-conditioned transformation matrix. In this paper, a simple modification (which results from constraining a transverse vector between successive joint rotational axes to be normal to one of the rotational axes, instead of both) overcomes this criticism and favorably locates the joint axis system. An example is given for near-parallel rotational axes of the elbow and shoulder joints in a robot arm. The regular and modified parameters are extracted by an algebraic method with simulated measurement data. Unlike the modified parameters, extracted values of the regular parameters are very sensitive to measurement accuracy.

Barker, L. K.↗
NASA NTRS1985

Performance of direct and iterative algorithms on an optical systolic processor

The frequency-multiplexed optical linear algebra processor (OLAP) is treated in detail with attention to its performance in the solution of systems of linear algebraic equations (LAEs). General guidelines suitable for most OLAPs, including digital-optical processors, are advanced concerning system and component error source models, guidelines for appropriate use of direct and iterative algorithms, the dominant error sources, and the effect of multiple simultaneous error sources. Specific results are advanced on the quantitative performance of both direct and iterative algorithms in the solution of systems of LAEs and in the solution of nonlinear matrix equations. Acoustic attenuation is found to dominate iterative algorithms and detector noise to dominate direct algorithms. The effect of multiple spatial errors is found to be additive. A theoretical expression for the amount of acoustic attenuation allowed is advanced and verified. Simulations and experimental data are included.

Ghosh, A. K.↗
NASA NTRS1975

A triangular thin shell finite element: Nonlinear analysis

Aspects of the formulation of a triangular thin shell finite element which pertain to geometrically nonlinear (small strain, finite displacement) behavior are described. The procedure for solution of the resulting nonlinear algebraic equations combines a one-step incremental (tangent stiffness) approach with one iteration in the Newton-Raphson mode. A method is presented which permits a rational estimation of step size in this procedure. Limit points are calculated by means of a superposition scheme coupled to the incremental side of the solution procedure while bifurcation points are calculated through a process of interpolation of the determinants of the tangent-stiffness matrix. Numerical results are obtained for a flat plate and two curved shell problems and are compared with alternative solutions.

Thomas, G. R.↗
DOE OSTI2024

Bringing randomized algorithms to mainstream numerical linear algebra

Numerical linear algebra (NLA) underpins huge swaths of computational science and engineering. For scientists and engineers to make the most of the DOE’s computing resources, it is essential that they have access to high-performance implementations of algorithms with best-in-class scalability and reliability. Despite this, prevailing NLA libraries have little to no support for breakthrough algorithms from the field of randomized numerical linear algebra (RandNLA) that have been developed over the past twenty years. The goal of this LDRD was to break a log-jam that had prevented broad adoption of RandNLA. Our work had two thrusts. The first was to develop RandBLAS: a trustworthy and high-performance C++ library for randomized dimension reduction (an operation widely known as sketching). The second was the development of a novel randomized algorithm for computing a challenging type of matrix decomposition known as Householder QR with column pivoting (Householder QRCP). In this one-year late-start LDRD we successfully delivered RandBLAS 1.0 and new CPU and GPU codes for Householder QRCP. RandBLAS has extensive documentation at https://randblas.readthedocs.io/en/stable/. Papers on RandBLAS and and our high-performance QRCP codes are forthcoming.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

Accuracy of least-squares methods for the Navier-Stokes equations

Recently there has been substantial interest in least-squares finite element methods for velocity-vorticity-pressure formulations of the incompressible Navier-Stokes equations. The main cause for this interest is the fact that algorithms for the resulting discrete equations can be devised which require the solution of only symmetric, positive definite systems of algebraic equations. On the other hand, it is well-documented that methods using the vorticity as a primary variable often yield very poor approximations. Thus, here we study the accuracy of these methods through a series of computational experiments, and also comment on theoretical error estimates. It is found, despite the failure of standard methods for deriving error estimates, that computational evidence suggests that these methods are, at the least, nearly optimally accurate. Thus, in addition to the desirable matrix properties yielded by least-squares methods, one also obtains accurate approximations.

Bochev, Pavel B.↗
NASA NTRS1993

Accuracy of least-squares methods for the Navier-Stokes equations

Recently there has been substantial interest in least-squares finite element methods for velocity-vorticity-pressure formulations of the incompressible Navier-Stokes equations. The main cause for this interest is the fact that algorithms for the resulting discrete equations can be devised which require the solution of only symmetric, positive definite systems of algebraic equations. On the other hand, it is well-documented that methods using the vorticity as a primary variable often yield very poor approximations. Thus, here we study the accuracy of these methods through a series of computational experiments, and also comment on theoretical error estimates. It is found, despite the failure of standard methods for deriving error estimates, that computational evidence suggests that these methods are, at the least, nearly optimally accurate. Thus, in addition to the desirable matrix properties yielded by least-squares methods, one also obtains accurate approximations.

Bochev, Pavel B.↗
NASA NTRS1986

Exact formulas for multipole moments using Slater-type molecular orbitals

A triple infinite sum of formulas expressed as an expansion in Legendre polynomials is generated by use of computer algebra to represent the potential from the midpoint of two Slater-type orbitals; the charge density that determines the potential is given as the product of the two orbitals. An example using 1s orbitals shows that only a few terms are needed to obtain four-figure accuracy. Exact formulas are obtained for multipole moments by means of a careful study of expanded formulas, allowing an 'extrapolation to infinity'. This Loewdin alpha-function approach augmented by using a C matrix to characterize Slater-type orbitals can be readily generalized to all cases.

Jones, H. W.↗
DOE OSTI2025

PETSc/TAO developments for GPU-based early exascale systems

The Portable Extensible Toolkit for Scientific Computation (PETSc) library provides scalable solvers for nonlinear time-dependent differential and algebraic equations and for numerical optimization via the Toolkit for Advanced Optimization (TAO). PETSc is used in dozens of scientific fields and is an important building block for many simulation codes. During the U.S. Department of Energy’s Exascale Computing Project, the PETSc team has made substantial efforts to enable efficient utilization of the massive fine-grain parallelism present within exascale compute nodes and to enable performance portability across exascale architectures. We recap some of the challenges that designers of numerical libraries face in such an endeavor, and then discuss the many developments we have made, which include the addition of new GPU backends, features supporting efficient on-device matrix assembly, better support for asynchronicity and GPU kernel concurrency, and new communication infrastructure. In conclusion, we evaluate the performance of these developments on some pre-exascale systems as well as the early exascale systems Frontier and Aurora, using compute kernel, communication layer, solver, and mini-application benchmark studies, and then close with a few observations drawn from our experiences on the tension between portable performance and other goals of numerical libraries.

Exascale Computing Project (ECP)↗
NASA NTRS1973

Research on unsteady transonic flow theory

A two-dimensional theory is considered for the unsteady flow disturbances caused by aeroelastic deformations of a thick wing at high subsonic freestream Mach numbers, having a single, internally embedded supercritical (locally supersonic) steady flow region adjacent to the low pressure side of the wing. The theory develops a matrix of unsteady aerodynamic influence coefficients (AICs) suitable as a strip theory for aeroelastic analysis of large aspect ratio thick wings of moderate sweep, typical of a wide class of current and future aircraft. The theory derives the linearized unsteady flow solutions separately for both the subcritical and supercritical regions. These solutions are coupled together to give the requisite (wing pressure-downwash) AICs by the intermediate step of defining flow disturbances on the sonic line, and at the shock wave; these intermediate quantities are then algebraically eliminated by expressing them in terms of the wing surface downwash.

Revell, J. D.↗
DOE OSTI2024

CFT and lattice correlators near an RG domain wall between minimal models

Conformal interfaces separating two conformal field theories (CFTs) provide maps between different CFTs, and naturally exist in nature as domain walls between different phases. One particularly interesting construction of a conformal interface is the renormalization group (RG) domain wall between CFTs. For a given Virasoro minimal model \mathcal{M}_{k+3,k+2} ℳ k + 3 , k + 2 , an RG domain wall can be generated by a specific deformation which triggers an RG flow towards its adjacent Virasoro minimal model \mathcal{M}_{k+2,k+1} ℳ k + 2 , k + 1 with the deformation turned on over part of the space. An algebraic construction of this domain wall was proposed by Gaiotto in [J. High Energy Phys. 12, 103 (2012)]. In this paper, we will provide a study of this RG domain wall for the minimal case k=2 k = 2 , which can be thought of as a nonperturbative check of the construction. In this case the wall is separating the Tricritical Ising Model (TIM) CFT and the Ising Model (IM) CFT. We will check the analytical results of correlation functions from the RG brane construction with the numerical density matrix renormalization group (DMRG) calculation using a lattice model proposed in [arXiv.1206.1332, Science 344, 280 (2014)], and find a perfect agreement. We comment on possible experimental realizations of this RG domain wall.

Cogburn, Cameron V.↗
DOE OSTI2025

Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters

We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.

Applied Dynamical Systems↗
NASA NTRS1979

NASF transposition network: A computing network for unscrambling p-ordered vectors

The viewpoints of design, programming, and application of the transportation network (TN) is presented. The TN is a programmable combinational logic network that connects 521 memory modules to 512 processors. The unscrambling of p-ordered vectors to 1-ordered vectors in one cycle is described. The TN design is based upon the concept of cyclic groups from abstract algebra and primitive roots and indices from number theory. The programming of the TN is very simple, requiring only 20 bits: 10 bits for offset control and 10 bits for barrel switch shift control. This simple control is executed by the control unit (CU), not the processors. Any memory access by a processor must be coordinated with the CU and wait for all other processors to come to a synchronization point. These wait and synchronization events can be a degradation in performance to a computation. The TN application is for multidimensional data manipulation, matrix processing, and data sorting, and can also perform a perfect shuffle. Unlike other more complicated and powerful permutation networks, the TN cannot, if possible at all, unscramble non-p-ordered vectors in one cycle.

Lim, R. S.↗
NASA NTRS1992

Rational approximations from power series of vector-valued meromorphic functions

Let F(z) be a vector-valued function, F: C yields C(sup N), which is analytic at z = 0 and meromorphic in a neighborhood of z = 0, and let its Maclaurin series be given. In this work we developed vector-valued rational approximation procedures for F(z) by applying vector extrapolation methods to the sequence of partial sums of its Maclaurin series. We analyzed some of the algebraic and analytic properties of the rational approximations thus obtained, and showed that they were akin to Pade approximations. In particular, we proved a Koenig type theorem concerning their poles and a de Montessus type theorem concerning their uniform convergence. We showed how optical approximations to multiple poles and to Laurent expansions about these poles can be constructed. Extensions of the procedures above and the accompanying theoretical results to functions defined in arbitrary linear spaces was also considered. One of the most interesting and immediate applications of the results of this work is to the matrix eigenvalue problem. In a forthcoming paper we exploited the developments of the present work to devise bona fide generalizations of the classical power method that are especially suitable for very large and sparse matrices. These generalizations can be used to approximate simultaneously several of the largest distinct eigenvalues and corresponding eigenvectors and invariant subspaces of arbitrary matrices which may or may not be diagonalizable, and are very closely related with known Krylov subspace methods.

Sidi, Avram↗
DOE OSTI2024

Field redefinitions and infinite field anomalous dimensions

Field redefinitions are commonly used to reduce the number of operators in the Lagrangian by removing redundant operators and transforming to a minimal operator basis. We give a general argument that such field redefinitions, while leaving the S-matrix invariant and consequently finite, lead not only to infinite Green’s functions, but also to infinite field anomalous dimensions γ ϕ . These divergences cannot be removed by counterterms without reintroducing redundant operators.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1988

A general-purpose approach to computer-aided dynamic analysis of a flexible helicopter

A general purpose mathematical formulation is described for dynamic analysis of a helicopter consisting of flexible and/or rigid bodies that undergo large translations and rotations. Rigid body and elastic sets of generalized coordinates are used. The rigid body coordinates define the location and the orientation of a body coordinate frame (global frame) with respect to an inertial frame. The elastic coordinates are introduced using a finite element approach in order to model flexible components. The compatibility conditions between two adjacent elements in a flexible body are imposed using a Boolean matrix, whereas the compatibility conditions between two adjacent bodies are imposed using the Lagrange multiplier approach. Since the form of the constraint equations depends upon the type of kinematic joint and involves only the generalized coordinates of the two participating elements, then a library of constraint elements can be developed to impose the kinematic constraint in an automated fashion. For the body constraints, the Lagrange multipliers yield the reaction forces and torques of the bodies at the joints. The virtual work approach is used to derive the equations of motion, which are a system of differential and algebraic equations that are highly nonlinear. The formulation presented is general and is compared with hard-wired formulations commonly used in helicopter analysis.

Agrawal, Om P.↗