Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “numerical mathematics”

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 451 records · Page 25
All sourcesNASA NTRSDOE OSTI
DOE OSTI2022

Dissecting Tensor Cores via Microbenchmarks: Latency, Throughput and Numeric Behaviors

Tensor Cores have been an important unit to accelerate Fused Matrix Multiplication Accumulation (MMA) in all NVIDIA GPUs since Volta Architecture. To program Tensor Cores, users have to use either legacy wmma APIs or current mma APIs. Legacy wmma APIs are more easy-to-use but can only exploit limited features and power of Tensor Cores. Specifically, wmma APIs support fewer operand shapes and can not leverage the new sparse matrix multiplication feature of the newest Ampere Tensor Cores. However, the performance of current programming interface has not been well explored. Furthermore, the computation numeric behaviors of low-precision floating points (TF32, BF16, and FP16) supported by the newest Ampere Tensor Cores are also mysterious. In this paper, we explore the throughput and latency of current programming APIs. Further, we intuitively study the numeric behaviors of Tensor Cores MMA and profile the intermediate operations including multiplication, addition of inner product, and accumulation. All codes used in this work can be found in https://github.com/sunlex0717/DissectingTensorCores.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1997

Numerical Modeling of HgCdTe Solidification: Effects of Phase Diagram, Double-Diffusion Convection and Microgravity Level

Melt convection, along with species diffusion and segregation on the solidification interface are the primary factors responsible for species redistribution during HgCdTe crystal growth from the melt. As no direct information about convection velocity is available, numerical modeling is a logical approach to estimate convection. Furthermore influence of microgravity level, double-diffusion and material properties should be taken into account. In the present study, HgCdTe is considered as a binary alloy with melting temperature available from a phase diagram. The numerical model of convection and solidification of binary alloy is based on the general equations of heat and mass transfer in two-dimensional region. Mathematical modeling of binary alloy solidification is still a challenging numericial problem. A Rigorous mathematical approach to this problem is available only when convection is not considered at all. The proposed numerical model was developed using the finite element code FIDAP. In the present study, the numerical model is used to consider thermal, solutal convection and a double diffusion source of mass transport.

Bune, Andris V.↗
NASA NTRS1989

Predictive Attitude Maintenance For A Space Station

Paper provides mathematical basis for predictive management of angular momenta of control-moment gyroscopes (CMG's) to control attitude of orbiting space station. Numerical results presented for pitch control of proposed power-tower space station. Based on prior orbit history and mathematical model of density of atmosphere, predictions made of requirements on dumping and storage of angular momentum in relation to current loading state of CMG's and to acceptable attitude tolerances.

Hattis, Philip D.↗
DOE OSTI2020

Numerical methods for nonlocal and fractional models

Partial differential equations (PDEs) are used, with huge success, to model phenomena arising across all scientific and engineering disciplines. However, across an equally wide swath, there exist situations in which PDE models fail to adequately model observed phenomena or are not the best available model for that purpose. On the other hand, in many situations, nonlocal models that account for interaction occurring at a distance have been shown to more faithfully and effectively model observed phenomena that involve possible singularities and other anomalies. In this article, we consider a generic nonlocal model, beginning with a short review of its definition, the properties of its solution, its mathematical analysis, and specific concrete examples. We then provide extensive discussions about numerical methods, including finite element, finite difference, and spectral methods, for determining approximate solutions of the nonlocal models considered. In that discussion, we pay particular attention to a special class of nonlocal models that are the most widely studied in the literature, namely those involving fractional derivatives. The article ends with brief considerations of several modeling and algorithmic extensions which serve to show the wide applicability of nonlocal modeling.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Adopting Code Verification Methodology Based on Model Form

Code verification is an essential part of credibility analysis for computational models. It assesses whether the mathematical model is implemented correctly into the code and whether the numerical methods behave consistently, and is done before solution verification and validation. Robust guidance for code verification exists in the literature. However, there is no known, concise guide for selecting the approach based on the model form that also presents an overview of the common elements. This document was written to address this gap as an accessible reference for beginning a code-verification effort.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Adapting Code Verification Methodology to Model Form

Code verification is an essential part of credibility analysis for computational models. It assesses whether the mathematical model is implemented correctly into the code and whether the numerical methods behave consistently, and is done before solution verification and validation. Robust guidance for code verification exists in the literature. However, there is no known, concise guide for selecting the approach based on the model form that also presents an overview of the common elements. This document was written to address this gap as an accessible reference for beginning a code-verification effort.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1988

Experimental facilities for system identification

Future space vehicles will differ significantly from the space systems used in the past. The planned spacecraft configurations will include extremely large structures, up to 100-200 meters across. Because the allowable launch weights are limited, the large space structures must be constructed of lightweight, flexible elements, and active control of the shape and attitude of the spacecraft will be required. The behavior of large structures is characterized by many closely spaced natural modes, and some applications may also include large on-board disturbances. Consequently, the control and disturbance forces will invariably spill over to a large number of modes. Structural identification will be necessary for precision pointing and shape controls to be effective. An accurate mathematical model of a structure is essential for the success of precision control system design. However, the currently available analytical modeling codes, such as NASTRAN, are incapable of producing numerical models of the required precision. The favored approach for model determination is to refine the mathematical model based on experiments in the orbital environment. It is to this effect that we must develop techniques to reliably generate the accurate models required for future missions, and the arena in which these methods will be developed and proved is through ground-based system identification experiments and demonstrations. The Air Force Astronautics Laboratory (AFAL) has expanded the on-site ground-test facilities in recent years, and additional sites are planned for the immediate future. We shall review the plans for laboratory growth at AFAL with regard to the type of experiments proposed and the availability of the new facilities.

Das, Alok↗
NASA NTRS2004

Annual Research Briefs, 2004: Center for Turbulence Research

This report contains the 2004 annual progress reports of the Research Fellows and students of the Center for Turbulence Research in its eighteenth year of operation. Since its inception in 1987, the objective of the CTR has been to advance the physical understanding of turbulent flows and development of physics based predictive tools for engineering analysis and turbulence control. Turbulence is ubiquitous in nature and in engineering devices. The studies at CTR have been motivated by applications where turbulence effects are significant; these include a broad range of technical areas such as planetary boundary layers, formation of planets, solar convection, magnetohydrodynamics, environmental and eco systems, aerodynamic noise, propulsion systems and high speed transportation. Numerical simulation has been the predominant research tool at CTR which has required a critical mass of researchers in numerical analysis and computer science in addition to core disciplines such as applied mathematics, chemical kinetics and fluid mechanics. Maintaining and promoting this interdisciplinary culture has been a hallmark of CTR and has been responsible for the realization of the results of its basic research in applications. The first group of reports in this volume are directed towards development, analysis and application of novel numerical methods for ow simulations. Development of methods for large eddy simulation of complex flows has been a central theme in this group. The second group is concerned with turbulent combustion, scalar transport and multi-phase ows. The nal group is devoted to geophysical turbulence where the problem of solar convection has been a new focus of considerable attention recently at CTR.

Moin, Parviz↗
NASA NTRS1984

Advanced numerics for multi-dimensional fluid flow calculations

In recent years, there has been a growing interest in the development and use of mathematical models for the simulation of fluid flow, heat transfer and combustion processes in engineering equipment. The equations representing the multi-dimensional transport of mass, momenta and species are numerically solved by finite-difference or finite-element techniques. However despite the multiude of differencing schemes and solution algorithms, and the advancement of computing power, the calculation of multi-dimensional flows, especially three-dimensional flows, remains a mammoth task. The following discussion is concerned with the author's recent work on the construction of accurate discretization schemes for the partial derivatives, and the efficient solution of the set of nonlinear algebraic equations resulting after discretization. The present work has been jointly supported by the Ramjet Engine Division of the Wright Patterson Air Force Base, Ohio, and the NASA Lewis Research Center.

Vanka, S. P.↗
NASA NTRS2009

Application of TRMM PR and TMI Measurements to Assess Cloud Microphysical Schemes in the MM5 Model for a Winter Storm

Seen by the human eye, precipitation particles are commonly drops of rain, flakes of snow, or lumps of hail that reach the ground. Remote sensors and numerical models usually deal with information about large collections of rain, snow, and hail (or graupel --also called soft hail ) in a volume of air. Therefore, the size and number of the precipitation particles and how particles interact, evolve, and fall within the volume of air need to be represented using physical laws and mathematical tools, which are often implemented as cloud and precipitation microphysical parameterizations in numerical models. To account for the complexity of the precipitation physical processes, scientists have developed various types of such schemes in models. The accuracy of numerical weather forecasting may vary dramatically when different types of these schemes are employed. Therefore, systematic evaluations of cloud and precipitation schemes are of great importance for improvement of weather forecasts. This study is one such endeavor; it pursues quantitative assessment of all the available cloud and precipitation microphysical schemes in a weather model (MM5) through comparison with the observations obtained by National Aeronautics and Space Administration (NASA) s and Japan Aerospace Exploration Agency (JAXA) s Tropical Rainfall Measuring Mission (TRMM) precipitation radar (PR) and microwave imager (TMI). When satellite sensors (like PR or TMI) detect information from precipitation particles, they cannot directly observe the microphysical quantities (e.g., water species phase, density, size, and amount etc.). Instead, they tell how much radiation is absorbed by rain, reflected away from the sensor by snow or graupel, or reflected back to the satellite. On the other hand, the microphysical quantities in the model are usually well represented in microphysical schemes and can be converted to radiative properties that can be directly compared to the corresponding PR and TMI observations. This study employs this method to evaluate the accuracy of the simulated radiative properties by the MM5 model with different microphysical schemes. It is found that the representations of particle density, size, and mass in the different schemes in the MM5 model determine the model s performance when predicting a winter storm over the eastern Pacific Ocean. Schemes lacking moderate density particles (i.e. graupel), with snow flakes that are too large, or with excessive mass of snow or graupel lead to degraded prediction of the radiative properties as observed by the TRMM satellite. This study demonstrates the uniqueness of the combination of both an active microwave sensor (PR) and passive microwave sensor (TMI) onboard TRMM on assessing the accuracy of numerical weather forecasting. It improves our understanding of the physical and radiative properties of different types of precipitation particles and provides suggestions for better representation of cloud and precipitation processes in numerical models. It would, ultimately, contribute to answering questions like "Why did it not rain when the forecast says it would?"

Han, Mei↗
DOE OSTI2020

Method of Green’s Potentials for Elliptic PDEs in Domains with Random Apertures

Problems with topological uncertainties appear in many fields ranging from nano-device engineering to the design of bridges. In many of such problems, a part of the domains boundaries is subjected to random perturbations making inefficient conventional schemes that rely on discretization of the whole domain. Here, we study elliptic PDEs in domains with boundaries comprised of a deterministic part and random apertures, and apply the method of modified potentials with Green’s kernels defined on the deterministic part of the domain. This approach allows to reduce the dimension of the original differential problem by reformulating it as a boundary integral equation posed on the random apertures only. The multilevel Monte Carlo method is then applied to this modified integral equation and its optimal ϵ -2 asymptotical complexity is shown. Finally, we provide the qualitative analysis of the proposed technique and support it with numerical results.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

A splice method for local-to–nonlocal coupling of weak forms

Here, we propose a method to couple local and nonlocal diffusion models. By inheriting desirable properties such as patch tests, asymptotic compatibility and unintrusiveness from related splice and optimization-based coupling schemes, it enables the use of weak (or variational) formulations, is computationally efficient and straightforward to implement. We prove well-posedness of the coupling scheme and demonstrate its properties and effectiveness in a variety of numerical examples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Data-Driven Distributed Algorithms for Estimating Eigenvalues and Eigenvectors of Interconnected Dynamical Systems

Here, the paper presents data-driven algorithms to estimate in a distributed manner the eigenvalues, right and left eigenvectors of an unknown linear (or linearized) interconnected dynamic system. In particular, the proposed algorithms do not require the identification of the system model in advance before performing the estimation. As a first step, we consider interconnected dynamical system with distinct eigenvalues. The proposed strategy first estimates the eigenvalues using the well-known Prony method. The right and left eigenvectors are then estimated by solving distributively a set of linear equations. One important feature of the proposed algorithms is that the topology of communication network used to perform the distributed estimation can be chosen arbitrarily, given that it is connected, and is also independent of the structure or sparsity of the system (state) matrix. The proposed distributed algorithms are demonstrated via a numerical example.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Affine Approximation of Parametrized Kernels and Model Order Reduction for Nonlocal and Fractional Laplace Models

In this work, we consider parametrized problems driven by spatially nonlocal integral operators with parameter-dependent kernels. In particular, kernels with varying nonlocal interaction radius $\delta > 0$ and fractional Laplace kernels, parametrized by the fractional power $s\in(0,1)$, are studied. Furthermore, in order to provide an efficient and reliable approximation of the solution for different values of the parameters, we develop the reduced basis method as a parametric model order reduction approach. Major difficulties arise since the kernels are not affine in the parameters, singular, and discontinuous. Moreover, the spatial regularity of the solutions depends on the varying fractional power $s$. To address this, we derive regularity and differentiability results with respect to $\delta$ and $s$, which are of independent interest for other applications such as optimization and parameter identification. We then use these results to construct affine approximations of the kernels by local polynomials. Finally, we certify the method by providing reliable a posteriori error estimators, which account for all approximation errors, and support the theoretical findings by numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2021

Error Estimates for the Optimal Control of a Parabolic Fractional PDE

In this work, we consider the integral definition of the fractional Laplacian and analyze a linear-quadratic optimal control problem for the so-called fractional heat equation; control constraints are also considered. We derive existence and uniqueness results, first order optimality conditions, and regularity estimates for the optimal variables. To discretize the state equation we propose a fully discrete scheme that relies on an implicit finite difference discretization in time combined with a piecewise linear finite element discretization in space. We derive stability results and a novel $L^2(0,T;L^2(\Omega))$ a priori error estimate. On the basis of the aforementioned solution technique, we propose a fully discrete scheme for our optimal control problem that discretizes the control variable with piecewise constant functions, and we derive a priori error estimates for it. We illustrate the theory with one- and two-dimensional numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Learning Functions Varying along a Central Subspace

Many functions of interest are in a high-dimensional space but exhibit low-dimensional structures. This paper studies regression of an s-Hölder function in $R^D$ which varies along a central subspace of dimension $d$ while $d \ll D$. A direct approximation of $f$ in $R^D$ with an accuracy $\varepsilon$ requires the number of samples in the order of $\varepsilon^{-(2s+D)/s}$. In this paper, we analyze the generalized contour regression (GCR) algorithm for the estimation of the central subspace and use piecewise polynomials for function approximation. GCR is among the best estimators for the central subspace, but its sample complexity is an open question. In this paper, we partially answer this questions by proving that if a variance quantity is exactly known, GCR leads to a mean squared estimation error of $O(n^{-1})$ for the central subspace. The estimation error of this variance quantity is also given in this paper. The mean squared regression error of $f$ is proved to be in the order of $(n/\log n)^{-\frac{2s}{2s+d}}$, where the exponent depends on the dimension of the central subspace instead of the ambient space . This result demonstrates that GCR is effective in learning the low-dimensional central subspace. We also propose a modified GCR with improved efficiency. Here, the convergence rate is validated through several numerical experiments.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1967

CINDA - Chrysler Improved Numerical Differencing Analyzer computer program

Dimensionless multioption systems compiler computer program constructs and analyzes a mathematical model of any arbitrary one, two, or three dimensional lumped parameter representation of a physical system. It automatically optimizes the utilization of computer core space and is more general and versatile than BETA.

Gaski, J. D.↗
DOE OSTI2023

Challenging the Curse of Dimensionality in Multidimensional Numerical Integration by Using a Low-Rank Tensor-Train Format

Numerical integration is a basic step in the implementation of more complex numerical algorithms suitable, for example, to solve ordinary and partial differential equations. The straightforward extension of a one-dimensional integration rule to a multidimensional grid by the tensor product of the spatial directions is deemed to be practically infeasible beyond a relatively small number of dimensions, e.g., three or four. In fact, the computational burden in terms of storage and floating point operations scales exponentially with the number of dimensions. This phenomenon is known as the curse of dimensionality and motivated the development of alternative methods such as the Monte Carlo method. The tensor product approach can be very effective for high-dimensional numerical integration if we can resort to an accurate low-rank tensor-train representation of the integrand function. In this work, we discuss this approach and present numerical evidence showing that it is very competitive with the Monte Carlo method in terms of accuracy and computational costs up to several hundredths of dimensions if the integrand function is regular enough and a sufficiently accurate low-rank approximation is available.

97 MATHEMATICS AND COMPUTING↗