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 433 records · Page 24

Quantum Physics without the Physics

This report explains the basic theory and common terminology of quantum physics without assuming any knowledge of physics. It was written by a group of applied mathematicians while they were reading up on the subject. The intended audience consists of applied mathematicians, computer scientists, or anyone else who wants to improve their understanding of quantum physics. We assume that the reader is familiar with fundamental concepts of linear algebra, differential equations, and to some extent the theory of Hilbert spaces. Most of the material can be found in the book by Nielsen and Chuang and in the lecture notes on open quantum systems by Lidar. Another excellent online source of information is Wikipedia, even though most of its articles on quantum physics assume a solid understanding of physics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

O(N) Quantum Molecular Dynamics (QMD) Algorithms, Code Requirements, Release Notes, and Library Deployment

The Exascale Computing Project (ECP) Co-design Center for Particle Applications (CoPA) is addressing the challenges for particle applications to run on upcoming exascale computing architectures. This includes short- and long-range molecular dynamics (MD), particle-in-cell (PIC), and quantum molecular dynamics (QMD). This document addresses $\mathcal{O}(N)$ QMD. The goal of this CoPA team is to develop $\mathcal{O}(N)$ linear scaling methods for QMD optimized for new and next generation architectures. This will provide the capability to simulate larger systems and run for longer timeframes than is possible today. Focus is initially on the density matrix construction. This requires efficient matrix formats and linear algebra operations for distributed architectures. A significant reduction in the wallclock time for an MD timestep is necessary to achieve practical large scale QMD. Equally challenging is to develop scalable distributed implementations. This requires the exploration of efficient data formats (dense, sparse, etc.), data decomposition and distribution across compute nodes using block- and graph-based methods. Traditional programming models such as MPI/OpenMP, hybrid MPI/OpenMP/Accelerator, as well as asynchronous task-based models will be explored to achieve maximum parallelism. Parallelism at the level of a matrix operation, solver, and/or application needs to be explored to gain the most benefit on new and emerging architectures. This report serves as a “living document” of the additions and enhancements throughout the ECP CoPA project for $\mathcal{O}(N)$ QMD. The following sections address the applications we are working with, the quantum chemistry libraries (BML and PROGRESS), and our co-design exploration through the use of a proxy application.

36 MATERIALS SCIENCE↗

Tensor Decompositions for Count Data that Leverage Stochastic and Deterministic Optimization

There is growing interest to extend low-rank matrix decompositions to multi-way arrays, or tensors. One fundamental low-rank tensor decomposition is the canonical polyadic decomposition (CPD). The challenge of fitting a low-rank, nonnegative CPD model to Poisson-distributed count data is of particular interest. Several popular algorithms use local search methods to approximate the global maximum likelihood estimator from local minima. Simultaneously, a recent trend in theoretical computer science and numerical linear algebra leverages randomization to solve very large, hard problems. The typical approach is to use randomization for a fast approximation and determinism for refinement to yield effective algorithms with theoretical guarantees. Two popular algorithms for Poisson CPD reflect that emergent dichotomy: CP Alternating Poisson Regression is a deterministic algorithm and Generalized Canonical Polyadic decomposition makes use of stochastic algorithms in several variants. This work extends recent work to develop two new methods that leverage randomized and deterministic algorithms for improved accuracy and performance.

97 MATHEMATICS AND COMPUTING↗

Developing ML/AI Methods for High-Throughput Characterization of Multiple-Sensor Streams of Tokamak Dynamics for High-Speed Control (Final Report)

This project evaluated and developed new mathematical and algorithmic techniques capable of handling (in real-time) the growing amounts of data generated by modern fusion research. While existing numerical linear algebra (NLA) methods provide the backbone to classical data analysis and algorithms, these methods fundamentally do not port to distributed architectures nor do they allow low-latency data reduction for control. Motivated by the needs for modern fusion reactors, this project explored and implemented new numerical methods to characterize plasma dynamics, respond in real-time to discharge evolution, and to process massive-scale data accurately and rapidly more fully. This project links expertise in multiple-sensor diagnostics of tokamak plasma dynamics from Columbia University’s Plasma Physics Laboratory with expertise in massive-scale data reduction and extreme data control algorithms at Columbia University’s Data Science Institute. This interdisciplinary project (i) applied machine learning methods, (ii) implemented a properly-trained neural-network for very fast processing of high-speed plasma videography, and (ii) developed the applied mathematical methods, based on randomized-NLA (rNLA) routines, for data analysis, reduction, and real-time control. The Columbia University High Beta Tokamak-Extended Pulse (HBT-EP) facility provided data to test new algorithms and partnership with Columbia University's Data Sciences Institute evaluated the broader use of new algorithms for many challenging control applications.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Matrix Methods for Solving Hartree-Fock Equations in Atomic Structure Calculations and Line Broadening

Atomic structure of N-electron atoms is often determined by solving the Hartree-Fock equations, which are a set of integro-differential equations. The integral part of the Hartree-Fock equations treats electron exchange, but the Hartree-Fock equations are not often treated as an integro-differential equation. The exchange term is often approximated as an inhomogeneous or an effective potential so that the Hartree-Fock equations become a set of ordinary differential equations (which can be solved using the usual shooting methods). Because the Hartree-Fock equations are an iterative-refinement method, the inhomogeneous term relies on the previous guess of the wavefunction. In addition, there are numerical complications associated with solving inhomogeneous differential equations. This work uses matrix methods to solve the Hartree-Fock equations as an integro-differential equation. It is well known that a derivative operator can be expressed as a matrix made of finite-difference coefficients; energy eigenvalues and eigenvectors can be obtained by using linear-algebra packages. The integral (exchange) part of the Hartree-Fock equation can be approximated as a sum and written as a matrix. The Hartree-Fock equations can be solved as a matrix that is the sum of the differential and integral matrices. We compare calculations using this method against experiment and standard atomic structure calculations. This matrix method can also be used to solve for free-electron wavefunctions, thus improving how the atoms and free electrons interact. This technique is important for spectral line broadening in two ways: it improves the atomic structure calculations, and it improves the motion of the plasma electrons that collide with the atom.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Revisit to the Notation of Martensitic Crystallography

As one of the most successful crystallographic theories for phase transformations, martensitic crystallography has been widely applied in understanding and predicting the microstructural features associated with structural phase transformations. In a narrow sense, it was initially developed based on the concepts of lattice correspondence and invariant plane strain condition, which is formulated in a continuum form through linear algebra. However, the scope of martensitic crystallography has since been extended; for example, group theory and graph theory have been introduced to capture the crystallographic phenomena originating from lattice discreteness. In order to establish a general and rigorous theoretical framework, we suggest a new notation system for martensitic crystallography. The new notation system combines the original formulation of martensitic crystallography and Dirac notation, which provides a concise and flexible way to understand the crystallographic nature of martensitic transformations with a potential extensionality. A number of key results in martensitic crystallography are reexamined and generalized through the new notation.

36 MATERIALS SCIENCE↗

Autodifferentiable Spectrum Model for High-dispersion Characterization of Exoplanets and Brown Dwarfs

We present an autodifferentiable spectral modeling of exoplanets and brown dwarfs. This model enables a fully Bayesian inference of the high-dispersion data to fit the ab initio line-by-line spectral computation to the observed spectrum by combining it with the Hamiltonian Monte Carlo in recent probabilistic programming languages. An open-source code, ExoJAX, developed in this study, was written in Python using the GPU/TPU compatible package for automatic differentiation and accelerated linear algebra, JAX. We validated the model by comparing it with existing opacity calculators and a radiative transfer code and found reasonable agreements for the output. As a demonstration, we analyzed the high-dispersion spectrum of a nearby brown dwarf, Luhman 16 A, and found that a model including water, carbon monoxide, and H 2 /He collision-induced absorption was well fitted to the observed spectrum (R = 10 5 and 2.28-2.30 μm). As a result, we found that T0 = 1295$^{-32}_{+35}$ K at 1 bar and C/O = 0.62 ± 0.03, which is slightly higher than the solar value. This work demonstrates the potential of a full Bayesian analysis of brown dwarfs and exoplanets as observed by high-dispersion spectrographs and also directly imaged exoplanets as observed by high-dispersion coronagraphy.

79 ASTRONOMY AND ASTROPHYSICS↗

DATeS: a highly extensible data assimilation testing suite v1.0

A flexible and highly extensible data assimilation testing suite, named DATeS, is described in this paper. DATeS aims to offer a unified testing environment that allows researchers to compare different data assimilation methodologies and understand their performance in various settings. The core of DATeS is implemented in Python and takes advantage of its object-oriented capabilities. The main components of the package (the numerical models, the data assimilation algorithms, the linear algebra solvers, and the time discretization routines) are independent of each other, which offers great flexibility to configure data assimilation applications. DATeS can interface easily with large third-party numerical models written in Fortran or in C,and with a plethora of external solvers.

97 MATHEMATICS AND COMPUTING↗

IBM system/360 assembly language interval arithmetic software

Computer software designed to perform interval arithmetic is described. An interval is defined as the set of all real numbers between two given numbers including or excluding one or both endpoints. Interval arithmetic consists of the various elementary arithmetic operations defined on the set of all intervals, such as interval addition, subtraction, union, etc. One of the main applications of interval arithmetic is in the area of error analysis of computer calculations. For example, it has been used sucessfully to compute bounds on sounding errors in the solution of linear algebraic systems, error bounds in numerical solutions of ordinary differential equations, as well as integral equations and boundary value problems. The described software enables users to implement algorithms of the type described in references efficiently on the IBM 360 system.

Phillips, E. J.↗

The problem of an elastic stiffener bonded to a half plane.

The contact problem of an elastic stiffener bonded to an elastic half plane with different mechanical properties is considered. The governing integral equation is reduced to an infinite system of linear algebraic equations. It is shown that, depending on the value of a parameter which is a function of the elastic constants and the thickness of the stiffener, the system is either regular or quasi-regular. A complete numerical example is given for which the strength of the stress singularity and the contact stresses are tabulated.

Erdogan, F.↗

Elimination on sparse symmetric systems of a special structure.

Consideration of the problem of finding a permutation of rows and columns and an algorithm for solving ordered systems of linear algebraic equations with sparse matrices having a certain regular structure. Two approaches to the solution of this problem, in which the sparsity is used to some extent, are outlined. One of them is a very general approach where optimal (or nearly optimal) ordering is sought and the algorithm for solving the ordered system treats the matrix element by element to perform only necessary operations. The other approach involves the use of band matrices. After comparing these two approaches, a third approach is then suggested which involves the use of pipe matrices, and a means of ordering the rows and columns to obtain this type of matrix is presented. Examples of matrices reordered by the proposed procedure are cited.

Segethova, J.↗

The transonic aerofoil problem with embedded shocks.

The integral equation approach to the mixed flow problem of infinite wings at high subsonic speeds is adopted for non-circulatory and circulatory (lifting) flows. The solutions are determined from a system of non-linear algebraic equations and, to ensure always unique solutions, the method of differentiation with respect to a parameter has been applied. The resulting Cauchy problem is then solved with the linearised flow solution as the initial value vector. For the case of embedded shocks in the flow field, the method of steepest descent has been added to the calculation scheme. Results for subcritical and supercritical flows past aerofoils are given and compared with solutions obtained by finite-difference techniques.

Norstrud, H.↗

Numerical marching techniques for fluid flows with heat transfer

The finite difference formulation and method of solution is presented for a wide variety of fluid flow problems with associated heat transfer. Only a few direct results from these formulations are given as examples, since the book is intended primarily to serve a discussion of the techniques and as a starting point for further investigations; however, the formulations are sufficiently complete that a workable computer program may be written from them. In the appendixes a number of topics are discussed which are of interest with respect to the finite difference equations presented. These include a very rapid method for solving certain sets of linear algebraic equations, a discussion of numerical stability, the inherent error in flow rate for confined flow problems, and a method for obtaining high accuracy with a relatively small number of mesh points.

Hornbeck, R. W.↗

Equation solving program for aerodynamic lifting surface theory

A description of and user's manual are presented for one of a group of FORTRAN programs which, together, can be used for the analysis and design of wings in steady, subsonic flow according to a kernel function method lifting surface theory. This particular program is the one which solves the sets of simultaneous, linear, algebraic equations arising from the thin wing analysis. This program has the capability of striking out rows and columns of the aerodynamic influence matrix and rows of the associated boundary condition vectors (right hand sides). This capability significantly enhances the effectiveness of the kernel function method of lifting surface theory because studies of the convergence of solutions with the number of control points can be done with the calculation of only a single influence matrix.

Medan, R. T.↗

A Finite-Element Formulation for Subsonic Flows Around Complex Configurations

The problem of potential steady subsonic flow around complex configurations is considered. This problem requires the solution of an integral equation relating the values of the potential on the surface of the body to the values of the normal derivative, which is known from the boundary conditions. The surface of the body is divided into small (hyperboloidal quadrilateral) surface elements, which are described in terms of the Cartesian components of the four corner points. The values of the potential (and its normal derivative) within each element is assumed to be constant and equal to its value at the centroid of the element. This yields a set of linear algebraic equations. The coefficients of the equation are given by source and doublet integrals over the surface elements. Closed form evaluations of the integrals are presented.

Morino, L.↗

On the auto and cross correlation of PN sequences

The autocorrelation and crosscorrelation properties of pseudorandom (PN) sequences are analyzed by using some important properties of PN sequences. These properties make this discussion understandable without the need of linear algebraic approach. The analysis is followed by some experimental results.

Morakis, J. C.↗