The field of Machine Learning Operations (MLOps)
A presentation introducing machine learning operation methods.
97 MATHEMATICS AND COMPUTING↗
SEARCH · Search NASA
Results for “Mathematical Methods”
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.
Quasi-Linear Parameter Varying Representation of General Aircraft Dynamics Over Non-Trim Region
For applying linear parameter varying (LPV) control synthesis and analysis to a nonlinear system, it is required that a nonlinear system be represented in the form of an LPV model. In this paper, a new representation method is developed to construct an LPV model from a nonlinear mathematical model without the restriction that an operating point must be in the neighborhood of equilibrium points. An LPV model constructed by the new method preserves local stabilities of the original nonlinear system at "frozen" scheduling parameters and also represents the original nonlinear dynamics of a system over a non-trim region. An LPV model of the motion of FASER (Free-flying Aircraft for Subscale Experimental Research) is constructed by the new method.
Shin, Jong-Yeob↗
Towards Automated Reasoning Chains for Verification of LLM-Generated Scientific Code
With the rise of Large Language Model (LLM) generated code, including in domains like scientific computing, ensuring not only syntactical, but also mathematical correctness, has become a critical task. Traditional formal methods approaches often struggle with the ambiguity of floating-point code, and full symbolic execution is extremely costly and limited. We propose a chain-of-reasoning approach that iteratively lifts basic semantics from code into the SPIRAL system and then establishes numerical equivalency to the desired mathematical operation. Here, we leverage the ample mathematical knowledge already formalized in SPIRAL to enable the system to recognize not just different implementations of the same algorithm but fully separate approaches to solving the given problem. The chain establishes tight error bounds on the output of given code with respect to the true continuous solution it approximates, quantifying all sources of error. We demonstrate this approach by establishing the correctness of a pseudospectral solver for a simple 1-dimensional Poisson problem.
Oschatz, Quentin [Carnegie Mellon University,Pitts↗
Summary Report Of The FY25 Reactor Physics Verification And Validation Exercises In The Advanced Reactor Technologies - Gas-cooled Reactor Program
Valdiation and verification of numerical tools is critical for ensuring reasonable predictions for design scoping, licensing, and safety analsyis. In this report, two reactor physics verification and validation exercises are presented. The first of these exercises focuses on burnup analysis with data from the Advanced Gas Reactor (AGR) program. Simulations are performed with Monte Carlo N-Particle (MCNP) and are compared with the experimental measurements for the AGR 1 and 2 experiments that utilize both UCO and UO2 fuel. The second exercises utilizes data from the HTR-Proteus experiments to perform reactor physics validation. Specifications of the experimental facility are provdied, along with a demonstration of initial modeling efforts in Serpent for one of the determistic packing experiments. Both cases are part of the Generation-IV international forum (GIF) Very High-Temperature Reactor (VHTR) Computational Methods, Validation, and Benchmarking (CMVB) program, an international collaborative organization dedicated to the verification and validation of High-Temperature Gas-Cooled Reactor (HTGR) analysis. Participation in the CMVB allows the US Department of Energy (DOE) to leverage these existing validation activities to provide extra value through benchmarking activities with other CMVB members.
and Benchmarking (CMVB) program↗
Coupling Approaches with Non-matching Grids for Classical Linear Elasticity and Bond-based Peridynamic Models in 1D
Local-nonlocal coupling approaches provide a means to combine the computational efficiency of local models and the accuracy of nonlocal models. To facilitate the coupling of the two models, non-matching grids are often desirable as nonlocal grids usually require a finer resolution than local grids. In that case, it is often convenient to resort to interpolation operators so that models can exchange information in the overlap regions when nodes from the two grids do not coincide. This paper studies three existing coupling approaches, namely 1) a method that enforces matching displacements in an overlap region, 2) a variant that enforces a constraint on the stresses instead, and 3) a method that considers a variable horizon in the vicinity of the interfaces. Further, the effect of the interpolation order and of the grid ratio on the performance of the three coupling methods with non-matching grids is carefully studied on one-dimensional examples using polynomial manufactured solutions. The numerical results show that the degree of the interpolants should be chosen with care to avoid introducing additional modeling errors, or simply minimize these errors, in the coupling approach.
97 MATHEMATICS AND COMPUTING↗
Detecting Faults By Use Of Hidden Markov Models
Frequency of false alarms reduced. Faults in complicated dynamic system (e.g., antenna-aiming system, telecommunication network, or human heart) detected automatically by method of automated, continuous monitoring. Obtains time-series data by sampling multiple sensor outputs at discrete intervals of t and processes data via algorithm determining whether system in normal or faulty state. Algorithm implements, among other things, hidden first-order temporal Markov model of states of system. Mathematical model of dynamics of system not needed. Present method is "prior" method mentioned in "Improved Hidden-Markov-Model Method of Detecting Faults" (NPO-18982).
Smyth, Padhraic J.↗
The updated statistical inversion technique to the evaluation of Umkehr observations
In the present study the standard retrieval Umkehr method to estimate the vertical distribution of ozone was updated using a statistical approach to the mathematical inversion scheme. The vertical ozone profile covariance matrix was used as a priori information for the inverse problem. A new method of the ozonesonde data organization according to air mass types helped to improve the covariance matrix quality. A retrieval method was developed using eigenvector technique. An optimal vertical ozone profile resolution was determined from the mathematical inversion scheme analysis based on the same technique. The sun radiation transfer was accounted for multiple scattering and atmospheric sphericity in this calculation. The retrievals using actual Umkehr Dobson spectrophotometer observations were also performed to provide the comparison of the standard and updated methods with concurrent ozone sound data at Boulder U.S. The comparison has revealed that the present method has some advantages in both resolution and accuracy, as compared to the standard one, especially for the atmospheric layers below ozone maximum.
Frolov, Alexander D.↗
Performance Bounds on Two Concatenated, Interleaved Codes
A method has been developed of computing bounds on the performance of a code comprised of two linear binary codes generated by two encoders serially concatenated through an interleaver. Originally intended for use in evaluating the performances of some codes proposed for deep-space communication links, the method can also be used in evaluating the performances of short-block-length codes in other applications. The method applies, more specifically, to a communication system in which following processes take place: At the transmitter, the original binary information that one seeks to transmit is first processed by an encoder into an outer code (Co) characterized by, among other things, a pair of numbers (n,k), where n (n > k)is the total number of code bits associated with k information bits and n k bits are used for correcting or at least detecting errors. Next, the outer code is processed through either a block or a convolutional interleaver. In the block interleaver, the words of the outer code are processed in blocks of I words. In the convolutional interleaver, the interleaving operation is performed bit-wise in N rows with delays that are multiples of B bits. The output of the interleaver is processed through a second encoder to obtain an inner code (Ci) characterized by (ni,ki). The output of the inner code is transmitted over an additive-white-Gaussian- noise channel characterized by a symbol signal-to-noise ratio (SNR) Es/No and a bit SNR Eb/No. At the receiver, an inner decoder generates estimates of bits. Depending on whether a block or a convolutional interleaver is used at the transmitter, the sequence of estimated bits is processed through a block or a convolutional de-interleaver, respectively, to obtain estimates of code words. Then the estimates of the code words are processed through an outer decoder, which generates estimates of the original information along with flags indicating which estimates are presumed to be correct and which are found to be erroneous. From the perspective of the present method, the topic of major interest is the performance of the communication system as quantified in the word-error rate and the undetected-error rate as functions of the SNRs and the total latency of the interleaver and inner code. The method is embodied in equations that describe bounds on these functions. Throughout the derivation of the equations that embody the method, it is assumed that the decoder for the outer code corrects any error pattern of t or fewer errors, detects any error pattern of s or fewer errors, may detect some error patterns of more than s errors, and does not correct any patterns of more than t errors. Because a mathematically complete description of the equations that embody the method and of the derivation of the equations would greatly exceed the space available for this article, it must suffice to summarize by reporting that the derivation includes consideration of several complex issues, including relationships between latency and memory requirements for block and convolutional codes, burst error statistics, enumeration of error-event intersections, and effects of different interleaving depths. In a demonstration, the method was used to calculate bounds on the performances of several communication systems, each based on serial concatenation of a (63,56) expurgated Hamming code with a convolutional inner code through a convolutional interleaver. The bounds calculated by use of the method were compared with results of numerical simulations of performances of the systems to show the regions where the bounds are tight (see figure).
Moision, Bruce↗
Optimization methods and silicon solar cell numerical models
The goal of this project is the development of an optimization algorithm for use with a solar cell model. It is possible to simultaneously vary design variables such as impurity concentrations, front junction depth, back junctions depth, and cell thickness to maximize the predicted cell efficiency. An optimization algorithm has been developed and interfaced with the Solar Cell Analysis Program in 1 Dimension (SCAPID). SCAPID uses finite difference methods to solve the differential equations which, along with several relations from the physics of semiconductors, describe mathematically the operation of a solar cell. A major obstacle is that the numerical methods used in SCAPID require a significant amount of computer time, and during an optimization the model is called iteratively until the design variables converge to the value associated with the maximum efficiency. This problem has been alleviated by designing an optimization code specifically for use with numerically intensive simulations, to reduce the number of times the efficiency has to be calculated to achieve convergence to the optimal solution. Adapting SCAPID so that it could be called iteratively by the optimization code provided another means of reducing the cpu time required to complete an optimization. Instead of calculating the entire I-V curve, as is usually done in SCAPID, only the efficiency is calculated (maximum power voltage and current) and the solution from previous calculations is used to initiate the next solution.
Girardini, K.↗
Optimization methods and silicon solar cell numerical models
An optimization algorithm for use with numerical silicon solar cell models was developed. By coupling an optimization algorithm with a solar cell model, it is possible to simultaneously vary design variables such as impurity concentrations, front junction depth, back junction depth, and cell thickness to maximize the predicted cell efficiency. An optimization algorithm was developed and interfaced with the Solar Cell Analysis Program in 1 Dimension (SCAP1D). SCAP1D uses finite difference methods to solve the differential equations which, along with several relations from the physics of semiconductors, describe mathematically the performance of a solar cell. A major obstacle is that the numerical methods used in SCAP1D require a significant amount of computer time, and during an optimization the model is called iteratively until the design variables converge to the values associated with the maximum efficiency. This problem was alleviated by designing an optimization code specifically for use with numerically intensive simulations, to reduce the number of times the efficiency has to be calculated to achieve convergence to the optimal solution.
Girardini, K.↗
Computational Methods for Structural Mechanics and Dynamics, part 1
The structural analysis methods research has several goals. One goal is to develop analysis methods that are general. This goal of generality leads naturally to finite-element methods, but the research will also include other structural analysis methods. Another goal is that the methods be amenable to error analysis; that is, given a physical problem and a mathematical model of that problem, an analyst would like to know the probable error in predicting a given response quantity. The ultimate objective is to specify the error tolerances and to use automated logic to adjust the mathematical model or solution strategy to obtain that accuracy. A third goal is to develop structural analysis methods that can exploit parallel processing computers. The structural analysis methods research will focus initially on three types of problems: local/global nonlinear stress analysis, nonlinear transient dynamics, and tire modeling.
Stroud, W. Jefferson↗
On a mathematical formulation of the constituent inversion problem for planetary atmospheres
Perturbation method for inverting radiative heat transfer equation to obtain vertical constituent distribution in planetary atmospheres
Conrath, B. J.↗
Recent advances in methods for numerical solution of O.D.E. initial value problems
In the mathematical modeling of physical systems, it is often necessary to solve an initial value problem (IVP), consisting of a system of ordinary differential equations (ODE). A typical program produces approximate solutions at certain mesh points. Almost all existing codes try to control the local truncation error, while the user is really interested in controlling the true or global error. The present investigation provides a review of recent advances regarding the solution of the IVP, giving particular attention to stiff systems. Stiff phenomena are customarily defined in terms of the eigenvalues of the Jacobian. There are, however, some difficulties connected with this approach. It is pointed out that an estimate of the Lipschitz constant proves to be a very practical way to determine the stiffness of a problem.
Bui, T. D.↗
Proceedings of the Third Annual Symposium on Mathematical Pattern Recognition and Image Analysis
Topics addressed include: multivariate spline method; normal mixture analysis applied to remote sensing; image data analysis; classifications in spatially correlated environments; probability density functions; graphical nonparametric methods; subpixel registration analysis; hypothesis integration in image understanding systems; rectification of satellite scanner imagery; spatial variation in remotely sensed images; smooth multidimensional interpolation; and optimal frequency domain textural edge detection filters.
Guseman, L. F., Jr.↗
Computational Methods for Modeling Electrospray Microdroplet Chemistry for Improved Quantitative Mass Spectrometry
This project aimed at enhancing the quantitative analysis capabilities of electrospray ionization mass spectrometry (ESI-MS) by developing advanced computational methods. The primary focus was to integrate continuum and molecular dynamics simulations to study the behavior of microdroplets in the ESI process, from formation to evaporation. Through this research, we sought to bridge significant length and time scales to provide a comprehensive understanding of how analyte concentrations evolve from bulk solutions into gas-phase ions. This understanding is crucial for addressing challenges such as ionization efficiency, solvent effects, and ion suppression, which currently limit the accuracy of quantitative ESI-MS.
37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
Image-Based Digital Twin for Assessing the Coupled Electro-Chemo-Mechanical Behavior of Li-Ion Batteries
In energy storage materials, strong electrochemical-mechanical coupling and highly anisotropic material properties contribute to the formation and propagation of micro-cracking during charge/discharge cycling, resulting in reduced performance and service life. In this work, a digital twin is created to investigate the performance of a Li-ion battery cathode and simulate degradation accumulation. Pixel-based model construction is used to represent the complex material geometries from microstructural images supplied by the National Renewable Energy Laboratory (NREL). Because of the expected large deformation and crack opening, the reproducing kernel particle method (RKPM), a meshfree method with discretization at the image pixels, is used to approximate the field variables: electrostatic potential, concentration, and displacement. An interface modified reproducing kernel (IM-RK) is constructed by scaling a smooth kernel function with an interface-distance function to achieve strategic discontinuity types (i.e. weak discontinuities for strain discontinuities and strong discontinuities for cracks) and alleviate Gibbs oscillations near these transition zones. The discrete nature of the images' pixel points is employed throughout the model and approximation construction. The mechanical model is verified using an image-based microstructure under tensile loading. A transient electro-chemo-mechanical coupled simulation is performed to evaluate the potential micro-cracking induced degradation of the battery cathode material subjected to charge/discharge cycling.
battery degradation↗
Transforming Mean and Osculating Elements Using Numerical Methods
Mean element propagation of perturbed two body orbits has as its mathematical basis averaging theory of nonlinear dynamical systems. Averaged mean elements define the long-term evolution characteristics of an orbit. Using averaging theory, a near identity transformation can be found that transforms the mean elements back to the osculating elements that contain short period terms in addition to the secular and long period mean elements. The ability to perform the conversion is necessary so that orbit design conducted in mean elements can be converted back into osculating results. In the present work, this near identity transformation is found using the Fast Fourier Transform. An efficient method is found that is capable of recovering the osculating elements to first order
averaging↗
Turbulence modeling methods for the compressible Navier-Stokes equations
Turbulence modeling methods for the compressible Navier-Stokes equations, including several zero- and two-equation eddy-viscosity models, are described and applied. Advantages and disadvantages of the models are discussed with respect to mathematical simplicity, conformity with physical theory, and numerical compatibility with methods. A new two-equation model is introduced which shows advantages over other two-equation models with regard to numerical compatibility and the ability to predict low-Reynolds-number transitional phenomena. Calculations of various transonic airfoil flows are compared with experimental results. A new implicit upwind-differencing method is used which enhances numerical stability and accuracy, and leads to rapidly convergent steady-state solutions.
Coakley, T. J.↗