Search NASA⌕ Search

SEARCH · Search NASA

Results for “MATHEMATICS - MATRICES”

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 1,099 records · Page 61

Direct comparison of using a Z -transformation instead of the traditional $Q^2$ for extraction of the proton radius from $e-p$ scattering data

A discrepancy in the determination of the proton’s charge radius, r p , between muonic hydrogen spectroscopy versus classic atomic spectroscopy and electron scattering data has become known as the proton radius puzzle. Extractions of r p from electron scattering data require determination of the slope of the proton’s charge form factor, $G$$^{p}_{E}$, in the limit of Q 2 → 0 through fitting and extrapolation. Some works have presented the Z-transformation fitting technique as the best choice for this type of extraction due to the true functional form of $G$$^{p}_{E}$ being mathematically guaranteed to exist within the parameter-space of the fit function. In this work, we test this claim by examining the mathematical bias and variances introduced by this technique as compared to the more traditional Q 2 fits using statistically sampled $G$$^{p}_{E}$ parameterizations with known input radii. Furthermore, our tests conclude that the quality of the Z-transformation technique depends on the range of data used. In the case of new experiments, the fit function and technique should be selected in advance by generating realistic pseudodata and assessing the power of different techniques.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Controlling Combinatorial Complexity in Software and Malware Behavior Computation

Virtually all software is out of intellectual control in that no one knows its full behavior. Software Behavior Computation (SBC) is a new technology for understanding everything software does. SBC applies the mathematics of denotational semantics implemented by function composition in Functional Trace Tables (FTTs) to compute the behavior of programs, expressed as disjoint cases of conditional concurrent assignments. In some circumstances, combinatorial explosions in the number of cases can occur when calculating the behavior of sequences of multiple branching structures. This paper describes computational methods that avoid combinatorial explosions. The predicates that control branching structures such as ifthenelses can be organized into three categories: 1) Independent, resulting in no behavior case explosion, 2) Coordinated, resulting in two behavior cases, or 3) Goaloriented, with potential exponential growth in the number of cases. Traditional FTT-based behavior computation can be augmented by two additional computational methods, namely, Single-Value Function Abstractions (SVFAs) and, introduced in this paper, Relational Trace Tables (RTTs). These methods can be applied to the three predicate categories to avoid combinatorial growth in behavior cases while maintaining mathematical correctness.

Hyperion system↗

On The Theory of Speculative Checkpointing: Time and Energy Considerations

Collective checkpoint-rollback is the most popular approach to dealing with fail-stop errors on high-performance computing (HPC) platforms. Prior work has focused on choosing checkpoint intervals that minimize the total cost of checkpoint-rollback. In this paper, we introduce the notion of speculative checkpointing, where we probabilistically skip some checkpoints. Careful choice of check- points to be taken or skipped has the potential to further reduce the total checkpoint-rollback overhead. We mathematically formulate the overall checkpoint-rollback cost in the presence of speculation. We consider the choice of speculation being a fixed probability or a probability distribution. We formulate two criteria to be minimized: total execution time and approximate total energy. We derive the criteria for beneficial speculative checkpointing for exponential and arbitrary failure distributions. Further, we analyze the joint optimization of energy and time to mathematically express the trade-offs.

Subasi, Omer↗

Design Principles to Govern Electrode Fabrication for the Lithium Trivanadate Cathode

A full depth of discharge mathematical model for the lithium trivanadate cathode, considering lithiation of the layered α-phase, phase change, and lithiation of the rock-salt like β-phase at lower potentials, is developed. The coupled electrode-scale and crystal-scale model is fit to electrochemical data, and additionally validated with operando EDXRD. There is good agreement between the simulated and measured spatial variation of the volume fraction of the β-phase. This mathematical model is used to guide electrode fabrication, accounting for both ionic and electronic transport effects. Values of three design parameters—electrode thickness, porosity, and volume fraction of conductor—are identified, and the sensitivity of the energy density to these design parameters is quantified. The model is also used to investigate electrode design to create electrodes that deliver the maximum achievable energy density under the constraint that the α to β-phase transition is avoided, since phase change has been demonstrated to reduce cycle life. The energy density sacrificed to avoid phase change decreases at higher discharge rates, but the target values for electrode fabrication remain the same as those when optimizing the electrode for the full depth of discharge.

25 ENERGY STORAGE↗

An Analysis of the Impact of Particle Growth on Transport Losses in Polymer-Electrolyte Fuel Cells

Voltage cycling causes catalyst nanoparticles in polymer-electrolyte fuel cells to grow. The concomitant loss of interfacial area results in larger kinetic, transport, and possibly ohmic overpotentials. This paper uses recently published experimental data and mathematical models to investigate the evolutions of transport and ohmic resistances to platinum nanoparticles located on the surface and inside the micropores of carbon black supports. Resistance to oxygen transport rises as surface area declines primarily because the flux to each remaining larger platinum particle increases. The path lengths governing oxygen diffusion to surface and buried platinum sites also increase as nanoparticles grow. Platinum nanoparticles on the surface become relatively less favorable as voltage cycling proceeds because they grow faster than platinum in micropores. Because voltage cycling causes total interfacial area to decline, and the fraction located inside micropores to increase, nanoscale ohmic losses increase as a catalyst layer decays. The practical importance of this effect is difficult to discern because proton conductivity in carbon micropores is not well characterized.

07 ISOTOPE AND RADIATION SOURCES↗

Simplified Universal Equations for Ionic Conductivity and Transference Number

Nernst-Einstein equation can provide a reasonable estimate of the ionic conductivity of dilute solutions. For concentrated solutions, alternate methods such as Green–Kubo relations and Einstein relations are more suitable to account for ion-ion interactions. Such computations can be expensive for multicomponent systems. Simplified mathematical expressions like the Nernst-Einstein equation do not exist for concentrated multicomponent mixtures. Newman’s treatment of multicomponent concentrated solutions yields a conductivity relation in terms of species concentration and Onsager phenomenological coefficients. However, the estimation of these phenomenological coefficients is not straightforward. Here, mathematical formulations that relate the phenomenological coefficients with the friction coefficients are developed, leading to simplified, ready-to-use expressions of conductivity and transference numbers that can be used for a wide range of ionic mixtures. This approach involves spectral decomposition of the matrix of Onsager phenomenological coefficients. The general analytical expressions for conductivity and transference number are simplified for binary electrolytes, and numerical solutions are provided for ternary and quaternary mixtures with ion dissociation.

Electrochemistry↗

Efficient simulation and model reformulation of two-dimensional electrochemical thermal behavior of lithium-ion batteries

Lithium-ion batteries are an important technology to facilitate efficient energy storage and enable a shift from petroleum based energy to more environmentally benign sources. Such systems can be utilized most efficiently if good understanding of performance can be achieved for a range of operating conditions. Mathematical models can be useful to predict battery behavior to allow for optimization of design and control. An analytical solution is ideally preferred to solve the equations of a mathematical model, as it eliminates the error that arises when using numerical techniques and is usually computationally cheap. An analytical solution provides insight into the behavior of the system and also explicitly shows the effects of different parameters on the behavior. However, most engineering models, including the majority of battery models, cannot be solved analytically due to non-linearities in the equations and state dependent transport and kinetic parameters. The numerical method used to solve the system of equations describing a battery operation can have a significant impact on the computational cost of the simulation. In this paper, a model reformulation of the porous electrode pseudo three dimensional (P3D) which significantly reduces the computational cost of lithium ion battery simulation, while maintaining high accuracy, is discussed. This reformulation enables the use of the P3D model into applications that would otherwise be too computationally expensive to justify its use, such as online control, optimization, and parameter estimation. Furthermore, the P3D model has proven to be robust enough to allow for the inclusion of additional physical phenomena as understanding improves. In this study, the reformulated model is used to allow for more complicated physical phenomena to be considered for study, including thermal effects.

25 ENERGY STORAGE↗

Optimizing Discharge Capacity of Li-O 2 Batteries by Design of Air-Electrode Porous Structure: Multifidelity Modeling and Optimization

We develop a new mathematical framework to study the optimal design of air electrode microstructures for lithium-oxygen (Li-O2) batteries. It can eectively reduce the number of expensive experiments for testing dierent air-electrodes, thereby minimizing the cost in the design of Li-O2 batteries. The design parameters to characterize an air-electrode microstructure include the porosity, surface-to-volume ratio, and parameters associated with the pore-size distribution. A surrogate model (also known as response surface) for discharge capacity is rst constructed as a function of these design parameters. The surrogate model is accurate and easy to evaluate such that an optimization can be performed based on it. In particular, a Gaussian process regression method, co-kriging, is employed due to its accuracy and eciency in predicting high-dimensional responses from a combination of multidelity data. Specically, a small amount of data from high-delity simulations are combined with a large number of data obtained from computationally ecient low-delity simulations. The high-delity simulation is based on a multiscale modeling approach that couples the microscale (pore-scale) and macroscale (device-scale) models. Whereas, the low-delity simulation is based on an empirical macroscale model. The constructed response surface provides quantitative understanding and prediction about how air electrode microstructures aect the discharge performance of Li-O2 batteries. The succeeding sensitivity analysis via Sobol indices and optimization via genetic algorithm ultimately oer a reliable guidance on the optimal design of air electrode microstructures. The proposed mathematical framework can be generalized to investigate other new energy storage techniques and materials.

25 ENERGY STORAGE↗

Effect of System Contaminants on the Performance of a Proton Exchange Membrane Fuel Cell

The performance loss and recovery of the fuel cell due to Balance of Plant (BOP) contaminants was identified via a combination of experimental data and a mathematical model. The experiments were designed to study the influence of organic contaminants (e.g. those from BOP materials) on the resistance of the catalyst, ionomer and membrane, and a mathematical model was developed that allowed us to separate these competing resistances from the data collected on an operating fuel cell. For this reason, based on the functional groups, four organic contaminants found in BOP materials, diethylene glycol monoethyl ether (DGMEE), diethylene glycol monoethyl ether acetate (DGMEA), benzyl alcohol (BzOH) and 2,6-diaminotoluene (2,6-DAT) were infused separately to the cathode side of the fuel cell. The cell voltage and high frequency impedance resistance was measured as a function of time. The contaminant feed was then discontinued and voltage recovery was measured. It was determined that compounds with ion exchange properties like 2,6-DAT can cause voltage loss with non-reversible recovery, so this compound was studied in more detail. Finally, the degree of voltage loss increased with an increase in concentration, and/or infusion time, and increased with a decrease in catalyst loadings.

30 DIRECT ENERGY CONVERSION↗

GlobiPack v. 1.0

GlobiPack contains a small collection of optimization globalization algorithms. These algorithms are used by optimization and various nonlinear equation solver algorithms.Used as the line-search procedure with Newton and Quasi-Newton optimization and nonlinear equation solver methods. These are standard published 1-D line search algorithms such as are described in the book Nocedal and Wright Numerical Optimization: 2nd edition, 2006. One set of algorithms were copied and refactored from the existing open-source Trilinos package MOOCHO where the linear search code is used to globalize SQP methods. This software is generic to any mathematical optimization problem where smooth derivatives exist. There is no specific connection or mention whatsoever to any specific application, period. You cannot find more general mathematical software.

Bartlett, Roscoe↗

Optipack

Used to solve basic unconstrained optimization problems that can produce smooth accurate gradients. These are standard published unconstrained optimization such as are described in the book Nocedal and Wright Numerical Optimization: 2nd edition, 2006. This software is generic to any mathematical optimization problem where smooth derivatives exist. There is no specific connection or mention whatsoever to any specific application, period. You cannot find more general mathematical software.OptiPack contains some simple optimization algorithms built on Thyra. Currently, only a few different nonlinear conjugate gradient methods are implemented.

Bartlett, Roscoe↗

libristra

libristra is a mathematical and computational utility and support library for codes. It includes utilities such as input parsing, commonly used mathematical routines, scientific units, etc.

Kelley, Timothy↗

Pyomo v5.0

Pyomo supports the formulation and analysis of mathematical models for complex optimization applications. This capability is commonly associated with algebraic modeling languages (AMLs), which support the description and analysis of mathematical models with a high-level language. Although most AMLs are implemented in custom modeling languages, Pyomo's modeling objects are embedded within Python, a full- featured high-level programming language that contains a rich set of supporting libraries.

Woodruff, David↗

PAO

PAO supports the formulation and analysis of mathematical models for complex optimization applications. This capability is commonly associated with algebraic modeling languages (AMLs), which support the description and analysis of mathematical models with a high-level language. PAO is derived from the Pyomo subpackage pyomo.bilevel, which has been deprecated. PAO supports the formulation and solution of optimization models that explicitly represent adversarial behavior. This includes variances of bilevel programming, including methods that represent challenging problems with discrete decisions and uncertain model parameters.

Hart, William↗

CSBCOO SPMM: Compressed Sparse Block Coordinate format sparse matrix dense vector multiply benchmark (CSBCOO SPMM) v1.0

The purpose of this microbenchmark is to provide a means to explore different programming methodologies using a simple, but not trivial, mathematical kernel. The kernel is based on the matrix vector product in the MFDn nuclear configuration interaction code's LOBPCG eigensolver. This particular mathematical operation is a key element in the solution of systems of equations and block eigensolvers.

Cook, Brandon↗

Simple Example of Backtest Overfitting (SEBO)

In the field of mathematical finance, a "backtest" is the usage of historical market data to assess the performance of a proposed trading strategy. It is a relatively simple matter for a present-day computer system to explore thousands, millions or even billions of variations of a proposed strategy, and pick the best performing variant as the "optimal" strategy "in sample" (i.e., on the input dataset). Unfortunately, such an "optimal" strategy often performs very poorly "out of sample" (i.e. on another dataset), because the parameters of the invest strategy have been oversit to the in-sample data, a situation known as "backtest overfitting". While the mathematics of backtest overfitting has been examined in several recent theoretical studies, here we pursue a more tangible analysis of this problem, in the form of an online simulator tool. Given a input random walk time series, the tool develops an "optimal" variant of a simple strategy by exhaustively exploring all integer parameter values among a handful of parameters. That "optimal" strategy is overfit, since by definition a random walk is unpredictable. Then the tool tests the resulting "optimal" strategy on a second random walk time series. In most runs using our online tool, the "optimal" strategy derived from the first time series performs poorly on the second time series, demonstrating how hard it is not to overfit a backtest. We offer this online tool, "Simple Example of Backtest Overfitting (SEBO)", to facilitate further research in this area.

Wu, K. John↗

WORM (Write One, Read Many)

WORM (Write One, Run Many) is an easy to use, cross platform, embedded and extensible, functional programming language designed to facilitate the creation of input-decks for computer codes that use standard ASCII text files for input. WORM makes it easy to create generic (yet, complex and powerful) reusable models. Additionally its nature allows for complex calculations and routines to be coded once and easily reused, further simplifying the creation of input decks. WORM (Write One, Run Many) is a powerful and versatile tool designed to improve the efficiency of today’s criticality safety analyst by allowing: + input decks for parametric studies to be created quickly and easily, + calculations and variables to be imbedded into any input deck, thus allowing for meaningful parameter specifications, + problems to be specified using any combination of units, and + complex mathematically defined models to be created. A very simple syntax is employed, and therefore the WORM is easy to learn. A WORM model is essentially a standard input deck with some of its numerical values replaced by WORM code. WORM code may include and evaluate the following mathematical operators and functions: addition, subtraction, multiplication, division, exponentiation, modulus, sine, cosine, tangent, arcsine, arccosine, arctangent, the natural logarithm, logarithm base 10, integer truncation, absolute value, and random number. Several common constants, e.g., pi, e, and Avogadros’s Number (both as 6.022e23 and 0.6022), are predefined in WORM. Additionally, many unit conversion factors are also predefined: millimeters, meters, inches, feet, yards, and mils to centimeters; kilograms, pounds, and ounces to grams; liters, milliliters, gallons, and fluid ounces to cubic centimeters; and angular degrees to radians. For parametric studies, WORM supports various shorthand list specifications: the explicit step size, linear interpolation, and logarithmic interpolation. The list notation sequentially assigns multiple values to a name. WORM creates an input deck for each value of the name. If multiple lists are used, WORM steps through each list individually, i.e., WORM creates input decks corresponding to each and every permutation of the list values. Additionally, a library of standard material definitions and Perl subroutines are included. Any one of these files can be incorporated into the subject model with a simple WORM read command. WORM is completely written in Perl, the Practical Extraction and Reporting Language. Perl is one of the most portable programming languages available today. As such, the WORM works on practically any computer platform.

Sartor, Raymond↗

EI_MS_ML

The unambiguous identification of compounds from their electron ionization mass (EI-MS) spectra remains a significant unsolved problem in the field of metabolomics and analytical chemistry as a whole. Typically EI-MS spectra are compared using various mathematical operations that convert the spectral similarity or differences into a distance-like metric that roughly approximates the similarity of any two spectra. A commonly used metric for this is the cosine similarity metric which has values close to one for very similar spectra and a value of zero for very dissimilar spectra; however, no metric is perfect. Due to the prevalence of structurally-similar compounds such as isomers and the prevalence of certain fragmentation patterns across structurally-dissimilar compounds, the unambiguous assignment of EI-MS spectra compounds remains difficult. Frequently, querying an observed EI-MS spectrum against a large database such as the NIST17 library yields multiple possible assignments requiring the end user to distinguish between multiple high scoring hits, or multiple low scoring hits while keeping in mind that the correct hit may not be in the database at all. Although techniques such as orthogonal information from techniques such as chromatography can greatly aid in unambiguous assignment, this also requires more complicated experimental designs and access to more complicated analytical instrumentation. Substructures can be trivially detected and represented as strings using a previously published technique called node coloring from a known chemical structure. However, for experimentally-derived EI-MS spectra this information must be derived from the spectra itself (i.e., because we do not know what compound it represents). To achieve this, the software uses techniques from the field of machine learning and a large training dataset of EI-MS spectra corresponding to known structures annotated with substructure strings, to build models that can predict the presence of a given chemical substructure from an EI-MS spectrum directly.If these predictions are of high-quality (i.e., are unlikely to be false positives), the presence of one or more predicted substructures can be used to constrain the number of possible hits for a query spectrum. Mathematically, this restriction could be expressed in many forms, but the most straight-forward implementation is to weight the cosine similarity of a query spectrum and a plausible database match with a Tanimoto-like coefficient based on the ratio of the number of substructures predicted to the number of substructures present in the potential database hit. Determining which combination of models best reduces assignment ambiguity will be achieved using a combination of manual curation and optimization techniques such as genetic algorithms. This software will perform all the steps necessary to construct said models from a training dataset and evaluate them using a holdout dataset. Various statistical analyses can be performed to determine if this approach does decrease assignment ambiguity. For example, if this approach works, on average, the rank-order of the correct assignment for the holdout set of EI-MS spectra should decrease and the weighted cosine similarities for most of the possible matches in the database should be better than the unweighted cosine similarities. Furthermore, this same pipeline can be used on real experimental data to generate less ambiguous assignments.

Mitchell, Joshua↗