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 865 records · Page 48
All sourcesNASA NTRSDOE OSTI
NASA NTRS1987

Block iterative restoration of astronomical images with the massively parallel processor

A method is described for algebraic image restoration capable of treating astronomical images. For a typical 500 x 500 image, direct algebraic restoration would require the solution of a 250,000 x 250,000 linear system. The block iterative approach is used to reduce the problem to solving 4900 121 x 121 linear systems. The algorithm was implemented on the Goddard Massively Parallel Processor, which can solve a 121 x 121 system in approximately 0.06 seconds. Examples are shown of the results for various astronomical images.

Heap, Sara R.↗
NASA NTRS1986

Compliance matrices for cracked bodies

An algorithm is developed to construct the compliance matrix for a cracked solid in the integral-equation formulation of two-dimensional linear-elastic fracture mechanics. The integral equation is reduced to a system of algebraic equations for unknown values of the dislocation-density function at discrete points on the interval from -1 to 1, using the numerical procedure described by Gerasoulis (1982). Sample numerical results are presented, and it is suggested that the algorithm is especially useful in cases where iterative solutions are required; e.g., models of fiber-reinforced concrete, rocks, or ceramics where microcracking, fiber bridging, and other nonlinear effects are treated as nonlinear springs along the crack surfaces (Ballarini et al., 1984).

Ballarini, R.↗
NASA NTRS1997

Soft-Decision Decoding of Binary Linear Block Codes Based on an Iterative Search Algorithm

This correspondence presents a suboptimum soft-decision decoding scheme for binary linear block codes based on an iterative search algorithm. The scheme uses an algebraic decoder to iteratively generate a sequence of candidate codewords one at a time using a set of test error patterns that are constructed based on the reliability information of the received symbols. When a candidate codeword is generated, it is tested based on an optimality condition. If it satisfies the optimality condition, then it is the most likely (ML) codeword and the decoding stops. If it fails the optimality test, a search for the ML codeword is conducted in a region which contains the ML codeword. The search region is determined by the current candidate codeword and the reliability of the received symbols. The search is conducted through a purged trellis diagram for the given code using the Viterbi algorithm. If the search fails to find the ML codeword, a new candidate is generated using a new test error pattern, and the optimality test and search are renewed. The process of testing and search continues until either the MEL codeword is found or all the test error patterns are exhausted and the decoding process is terminated. Numerical results show that the proposed decoding scheme achieves either practically optimal performance or a performance only a fraction of a decibel away from the optimal maximum-likelihood decoding with a significant reduction in decoding complexity compared with the Viterbi decoding based on the full trellis diagram of the codes.

Lin, Shu↗
DOE OSTI2023

Ground vehicle lane-keeping assistance system via differential flatness output feedback control and algebraic derivative estimation

Vehicle run-off-road is one of the most frequent and fatal traffic accidents in the United States. Various lane-keeping assistance (LKA) systems have been developed in the last decade to help drivers stay on the road. Most of them are built upon linear driver–vehicle–road (DVR) models and treat road curvature as a disturbance. Albeit effective, their control performance would degrade if road curvature varies rapidly. Here, this paper proposes a novel nonlinear DVR model by integrating a driver steering model into vehicle–road kinematics, which explicitly considers road curvature. Particularly, this nonlinear DVR system has been proven to be differentially flat, and a flatness-based LKA system is designed. Additionally, Model-Free Control is introduced to compensate for system modeling errors. Hardware-in-the-loop simulations and diver-in-the-loop experiments validate the proposed control framework and demonstrate the performance enhancement with respect to a representative linear robust LKA system.

42 ENGINEERING↗
DOE OSTI2017

Operator bases, S-matrices, and their partition functions

Relativistic quantum systems that admit scattering experiments are quantitatively described by effective field theories, where S-matrix kinematics and symmetry considerations are encoded in the operator spectrum of the EFT. Here in this paper we use the S-matrix to derive the structure of the EFT operator basis, providing complementary descriptions in (i) position space utilizing the conformal algebra and cohomology and (ii) momentum space via an algebraic formulation in terms of a ring of momenta with kinematics implemented as an ideal. These frameworks systematically handle redundancies associated with equations of motion (on-shell) and integration by parts (momentum conservation). We introduce a partition function, termed the Hilbert series, to enumerate the operator basis — correspondingly, the S-matrix — and derive a matrix integral expression to compute the Hilbert series. The expression is general, easily applied in any spacetime dimension, with arbitrary field content and (linearly realized) symmetries. In addition to counting, we discuss construction of the basis. Simple algorithms follow from the algebraic formulation in momentum space. We explicitly compute the basis for operators involving up to n = 5 scalar fields. This construction universally applies to fields with spin, since the operator basis for scalars encodes the momentum dependence of n-point amplitudes. We discuss in detail the operator basis for non-linearly realized symmetries. In the presence of massless particles, there is freedom to impose additional structure on the S- matrix in the form of soft limits. The most naÏve implementation for massless scalars leads to the operator basis for pions, which we confirm using the standard CCWZ formulation for non-linear realizations. Finally, although primarily discussed in the language of EFT, some of our results — conceptual and quantitative — may be of broader use in studying conformal field theories as well as the AdS/CFT correspondence.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2016

Reducing Parallel Communication in Algebraic Multigrid through Sparsification

Algebraic multigrid (AMG) is an $\mathcal{O}(n)$ solution process for many large sparse linear systems. A hierarchy of progressively coarser grids which utilize complementary relaxation and interpolation operators is constructed. High-energy error is reduced by relaxation, while low-energy error is mapped to coarse-grid matrices and reduced there. However, large parallel communication costs often limit parallel scalability. Furthermore, as the multigrid hierarchy is formed, each coarse matrix is formed through a triple matrix product. The resulting coarse grids often have significantly more nonzeros per row than the original fine-grid operator, thereby generating high parallel communication costs associated with sparse matrix-vector multiplication (SpMV) on coarse levels. In this paper, we introduce a method that systematically removes entries in coarse-grid matrices after the hierarchy is formed, leading to improved communication costs. We sparsify by removing weakly connected or unimportant entries in the matrix, leading to improved solve time. The main trade-off is that if the heuristic identifying unimportant entries is used too aggressively, then AMG convergence can suffer. To counteract this, the original hierarchy is retained, allowing entries to be reintroduced into the solver hierarchy if convergence is too slow. This enables a balance between communication cost and convergence, as necessary. In this paper we present new algorithms for reducing communication and present a number of computational experiments in support.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2013

From dynamical systems to renormalization

In this paper we study logarithmic derivatives associated to derivations on completed graded Lie algebra, as well as the existence of inverses. These logarithmic derivatives, when invertible, generalize the exp-log correspondence between a Lie algebra and its Lie group. Such correspondences occur naturally in the study of dynamical systems when dealing with the linearization of vector fields and the non linearizability of a resonant vector fields corresponds to the non invertibility of a logarithmic derivative and to the existence of normal forms. These concepts, stemming from the theory of dynamical systems, can be rephrased in the abstract setting of Lie algebra and the same difficulties as in perturbative quantum field theory (pQFT) arise here. Surprisingly, one can adopt the same ideas as in pQFT with fruitful results such as new constructions of normal forms with the help of the Birkhoff decomposition. The analogy goes even further (locality of counter terms, choice of a renormalization scheme) and shall lead to more interactions between dynamical systems and quantum field theory.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2018

Compact video content representation for video coding using low multi-linear tensor rank approximation with dynamic core tensor order

Tensor is a multi-way representation of an entity that is widely used in many applications of mathematics and physics. The wide range of tensor algebra operations attract the researchers of graphical and vision field to identify unique methods for various applications such as segmentation, compression, indexing and so on. In this paper, low multi-linear rank approximation of a tensor is used for decomposition so as to perform compression on a video that is represented as a 4D tensor. Thus, the encoder has blocks for (1) multilinear rank approximation method so as to aid decomposition, (2) sparsity removal of residual data to reduce the required memory storage to a small level, (3) quantization on the sparse less residual data and (4) LZ77 dictionary coding for the video. The decoder uses a tensor reconstruction block along with residual error correction block that reduces loss/error in the reconstructed video. The size of core tensor is an important factor in rank approximation. It is identified at run time depending on the video contents. This size is determined adaptively using Tikhonov’s regularization method. The best value of core tensor size is identified with the corner of L-curve which preserves the video contents from heavy loss/error. Experimental results of the proposed work on comparison with H.264/AVC compression method indicate that the proposed method achieves up to 10% improvement in compression ratio with the least amount of loss and a maximum signal to noise ratio of 0.14. The proposed system gives better compression ratio than H.265 for videos with more number of frames without compromising quality.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1993

Large-scale computation of incompressible viscous flow by least-squares finite element method

The least-squares finite element method (LSFEM) based on the velocity-pressure-vorticity formulation is applied to large-scale/three-dimensional steady incompressible Navier-Stokes problems. This method can accommodate equal-order interpolations and results in symmetric, positive definite algebraic system which can be solved effectively by simple iterative methods. The first-order velocity-Bernoulli function-vorticity formulation for incompressible viscous flows is also tested. For three-dimensional cases, an additional compatibility equation, i.e., the divergence of the vorticity vector should be zero, is included to make the first-order system elliptic. The simple substitution of the Newton's method is employed to linearize the partial differential equations, the LSFEM is used to obtain discretized equations, and the system of algebraic equations is solved using the Jacobi preconditioned conjugate gradient method which avoids formation of either element or global matrices (matrix-free) to achieve high efficiency. To show the validity of this scheme for large-scale computation, we give numerical results for 2D driven cavity problem at Re = 10000 with 408 x 400 bilinear elements. The flow in a 3D cavity is calculated at Re = 100, 400, and 1,000 with 50 x 50 x 50 trilinear elements. The Taylor-Goertler-like vortices are observed for Re = 1,000.

Jiang, Bo-Nan↗
NASA NTRS1987

Precise computer controlled positioning of robot end effectors using force sensors

A major problem in space applications of robotics and docking of spacecraft is the development of technology for automated precise positioning of mating components with smooth motion and soft contact. To achieve the above objective, a design method was developed for optimally placing the closed-loop poles of a discretized robotic control system at exact prescribed locations inside the unit circle of the complex z-plane. The design method combines the merits of the pole placement and the linear quadratic design approaches. The proposed design procedure is based on the assignment of one real eigenvalue or two complex conjugate (or real) eigenvalues at each design step. The method involves solutions of simple algebraic equations and this is considered to be efficient for on-line or off-line computations. Also, two methods for the linearization of the nonlinear model of a robotic manipulator were presented. Since automatic control of multi-degree freedom robotic manipulators involves high nonlinear equations of systems, a pilot project was proposed involving the control of a one-dimensional system. This simple system can be readily implemented for testing the concepts and algorithms.

Shieh, Leang S.↗
DOE OSTI2018

A unified approach to Plasmon–Polariton and Brewster mode dynamics in media with interfacial surface-admittance

In this article we develop an ab-initio formulation for the analysis of certain solutions to the macroscopic Maxwell equations in bulk homogeneous materials that are separated by a planar interface that may sustain field-dependent electric currents induced by a surface admittance tensor. Based on Clemmow’s description of complex inhomogeneous plane time-harmonic waves, a systematic procedure is given that yields particular global solutions in terms of solutions to a system of bivariate polynomial and linear eigen-value equations for a set of six complex dimensionless scalars. This algebraic system is amenable to rapid numerical analysis using Maple or Matlab on a laptop. From the resulting solutions, analytic formulae for the electromagnetic fields can be expressed in terms of values for these six scalars and the electromagnetic phenomenological properties of the bulk media and their interface. We show explicitly how general properties of Surface Plasmon–Polariton (SPP) and Brewster modes follow from this unified viewpoint without appeal to any reflections in a Fresnel formulation. In particular we emphasise that endowing the material interface with (in general) anisotropic admittance properties can lead to new global electromagnetic field characteristics offering new possibilities for the control of surface characteristics by using recent advances in the fabrication of meta-materials. We illustrate our results by showing how a mono-layer of graphene in a normal magneto-static field can be used to construct a tunable meta-surface for SPP generation and how a simple conducting Ohmic interface can be used to excite both transverse electric and transverse magnetic Brewster modes as a function of the interface admittance.

77 NANOSCIENCE AND NANOTECHNOLOGY↗
NASA NTRS1976

Evaluation of out-of-core computer programs for the solution of symmetric banded linear equations

FORTRAN coded out-of-core equation solvers that solve using direct methods symmetric banded systems of simultaneous algebraic equations. Banded, frontal and column (skyline) solvers were studied as well as solvers that can partition the working area and thus could fit into any available core. Comparison timings are presented for several typical two dimensional and three dimensional continuum type grids of elements with and without midside nodes. Extensive conclusions are also given.

Dunham, R. S.↗
NASA NTRS1981

Closed form evaluation of symmetric two-sided complex integrals

Evaluation of two-sided complex integrals is often required when analyzing linear systems to determine signal variances resulting from stochastic inputs and system noise bandwidths. Algebraic solutions of integrals in a closed matrix equation form, using coefficients of the numerator and denominator polynomials, are presented. The closed forms provide the possibility of obtaining some insight into parameter sensitivity in addition to greatly reducing the computational complexity required by the normal method of evaluation by residues.

Winkelstein, R.↗
NASA NTRS1993

Proteus two-dimensional Navier-Stokes computer code, version 2.0. Volume 2: User's guide

A computer code called Proteus 2D was developed to solve the two-dimensional planar or axisymmetric, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort was to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The governing equations are solved in generalized nonorthogonal body-fitted coordinates, by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. This is the User's Guide, and describes the program's features, the input and output, the procedure for setting up initial conditions, the computer resource requirements, the diagnostic messages that may be generated, the job control language used to run the program, and several test cases.

Towne, Charles E.↗
NASA NTRS1993

Proteus three-dimensional Navier-Stokes computer code, version 1.0. Volume 2: User's guide

A computer code called Proteus 3D was developed to solve the three-dimensional, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort was to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The governing equations are solved in generalized nonorthogonal body-fitted coordinates, by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. This User's Guide describes the program's features, the input and output, the procedure for setting up initial conditions, the computer resource requirements, the diagnostic messages that may be generated, the job control language used to run the program, and several test cases.

Towne, Charles E.↗
NASA NTRS1993

Proteus three-dimensional Navier-Stokes computer code, version 1.0. Volume 3: Programmer's reference

A computer code called Proteus 3D was developed to solve the three-dimensional, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort was to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The governing equations are solved in generalized nonorthogonal body fitted coordinates, by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. The Programmer's Reference contains detailed information useful when modifying the program. The program structure, the Fortran variables stored in common blocks, and the details of each subprogram are described.

Towne, Charles E.↗
NASA NTRS1993

Proteus two-dimensional Navier-Stokes computer code, version 2.0. Volume 3: Programmer's reference

A computer code called Proteus 2D was developed to solve the two-dimensional planar or axisymmetric, Reynolds-averaged, unsteady compressible Navier-Stokes equations in strong conservation law form. The objective in this effort was to develop a code for aerospace propulsion applications that is easy to use and easy to modify. Code readability, modularity, and documentation were emphasized. The governing equations are solved in generalized nonorthogonal body-fitted coordinates, by marching in time using a fully-coupled ADI solution procedure. The boundary conditions are treated implicitly. All terms, including the diffusion terms, are linearized using second-order Taylor series expansions. Turbulence is modeled using either an algebraic or two-equation eddy viscosity model. The thin-layer or Euler equations may also be solved. The energy equation may be eliminated by the assumption of constant total enthalpy. Explicit and implicit artificial viscosity may be used. Several time step options are available for convergence acceleration. The documentation is divided into three volumes. The Programmer's Reference contains detailed information useful when modifying the program. The program structure, the Fortran variables stored in common blocks, and the details of each subprogram are described.

Towne, Charles E.↗