Search NASA⌕ Search

SEARCH · Search NASA

Results for “MATHEMATICAL PROOF”

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 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2019

Finite Mathematics, Finite Quantum Theory and a Conjecture on the Nature of Time

We first give a rigorous mathematical proof that classical mathematics (involving such notions as infinitely small/large, continuity etc.) is a special degenerate case of finite one in the formal limit when the characteristic p of the field or ring in finite mathematics goes to infinity. We consider a finite quantum theory (FQT) based on finite mathematics and prove that standard continuous quantum theory is a special case of FQT in the formal limit p→∞. The description of states in standard quantum theory contains a big redundancy of elements: the theory is based on real numbers while with any desired accuracy the states can be described by using only integers, i.e. rational and real numbers play only auxiliary role. Therefore, in FQT infinities cannot exist in principle, FQT is based on a more fundamental mathematics than standard quantum theory and the description of states in FQT is much more thrifty than in standard quantum theory. Space and time are purely classical notions and are not present in FQT at all. In the present paper we discuss how classical equations of motions arise as a consequence of the fact that p changes, i.e. p is the evolution parameter. It is shown that there exist scenarios when classical equations of motion for cosmological acceleration and gravity can be formulated exclusively in terms of quantum quantities without using space, time and standard semiclassical approximation.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2021

Grid Cyber-Security Strategy in an Attacker-Defender Model

The progression of cyber-attacks on the cyber-physical system is analyzed by the Probabilistic, Learning Attacker, and Dynamic Defender (PLADD) model. Although our research does apply to all cyber-physical systems, we focus on power grid infrastructure. The PLADD model evaluates the effectiveness of moving target defense (MTD) techniques. We consider the power grid attack scenarios in the AND configurations and OR configurations. In addition, we consider, for the first time ever, power grid attack scenarios involving both AND configurations and OR configurations simultaneously. Cyber-security managers can use the strategy introduced in this manuscript to optimize their defense strategies. Specifically, our research provides insight into when to reset access controls (such as passwords, internet protocol addresses, and session keys), to minimize the probability of a successful attack. Our mathematical proof for the OR configuration of multiple PLADD games shows that it is best if all access controls are reset simultaneously. For the AND configuration, our mathematical proof shows that it is best (in terms of minimizing the attacker's average probability of success) that the resets are equally spaced apart. We introduce a novel concept called hierarchical parallel PLADD system to cover additional attack scenarios that require combinations of AND and OR configurations.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Autonomous Operations for Advanced Reactors Utilizing Supervisory Control

Automation is a critical tenet of reactor plant operations as reliance on nuclear energy increases. Nuclear power plants require a large workforce which does not scale with output; that is, the cost per megawatt increases as reactor output becomes smaller. The economic viability of advanced reactors, particularly small modular reactors (SMRs) and microreactors, requires a significantly reduced onsite workforce. The logical solution is establishing a systematic process of elimination of reliance on human operators, and to the extent possible, replacing these actions with automated functions. In this paper, we propose a method for such transformation to establish a robust technical basis to enable transition to autonomy. Our method is based on finite state automata (FSA)—also known as finite state machines (FSMs). Relying on this method allows us to exploit the rich set of mathematical proofs available in the field of regular languages. FSA are one of the mathematical tools to model discrete event systems (DES). These properties are applied to produce an automated startup controller for the Massachusetts Institute of Technology Research Reactor (MITR). The startup procedure is captured in terms of discrete changes from one state to another while an independent supervisory control system directs the sequence of states and alerts a human in the event of an abnormal operation. First, the design and behavior of the MITR rod control system were modeled in Simulink. Then, the startup procedure was applied to the rod control system and the DES performed a startup by procedurally withdrawing rods to the subcritical position. The simulation also stops rod motion in response to an uncontrollable event and restarts rod motion once the event has been cleared.

46 - INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AN↗
DOE OSTI2021

Proof that Combining the Forced-collision and DXTRAN Monte Carlo Variance-reduction Techniques is Fair

This report provides mathematical proof that the MCNP DXTRAN (also known in other codes as forced-flight) and forced-collision variance-reduction techniques do not bias the expected value of Monte Carlo simulation estimates when combined. Proof is also provided that the techniques are unbiased when used independently. To prove that the techniques are unbiased, this report derives the first History Score Moment Equation (HSME) for non-multiplying media employing only forced collisions, only DXTRAN, and then both the variance-reduction techniques combined, as defined next. The HSMEs are found by forming the History Score Probability Density Functions (HSPDFs) and then taking the first score moment. Following its derivation, each HSME with a variance-reduction technique employed is reduced to the HSME for an analog simulation. Because the HSME represents the expected contribution to estimators in the simulation, reducing the HSME with variance reduction to the analog HSME shows that the simulation is unbiased despite the variance-reduction technique considered in the HSME. Analysis regarding higher-score moments of each technique is the subject of prior work and is not addressed herein. Throughout this work, the phase space p is defined to be the particle position x, direction-of-flight unit vector $\hat{Ω}$, energy E, and statistical weight w, $$p ≡ (x; \hat{Ω}; E; w).$$ A reduced phase-space excluding the statistical weight of the particle, $$r ≡ (x; \hat{Ω}; E),$$ is also used.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Degrees of rate control and AutoDiff-driven direct sensitivity analysis in heterogeneous catalysis

Despite the wide application and benefits of the degree of rate control (DRC) analysis, several details remain argued, particularly about the conservation of DRCs at transient (TR) and steady-state (SS) conditions, especially for complex reaction networks. This work argues that previous proofs about the conservation properties of DRCs have been incomplete, and we provide new mathematical proofs at TR and SS conditions. In addition, we use both analytical (automatic differentiation) and numerical (finite difference) approaches to compute DRCs for the case study of ethane hydrogenolysis (EH) over Pt(111). This work confirms that at both TR and SS conditions, the sum of all DRCs, i.e., sum of the degrees of kinetic (DKRC) and thermodynamic rate control (DTRC), is conserved at zero. At SS conditions, the sum of DKRC is conserved at 1 while the sum of DTRC is conserved at −1. In corroboration of previous works, we show that the DTRC for any adsorbate at SS is equal to the product of the species coverage and a constant. In contrast, at TR conditions, the individual sums of both DTRC and DKRC are not conserved and can be any real number, with potential implications for the novel field of dynamic catalysis. Finally, we show that the conventional finite difference (FD) approach, only useful at SS, is prone to inaccuracy and very sensitive to the value of the differential change applied. The optimal differential value also varies significantly with system and rate definition. Consequently, we describe and illustrate in this work the application of the automatic differentiation (AD) approach for the more accurate determination of DRCs at both TR and SS conditions.

Automatic differentiation↗
DOE OSTI2024

Identifiability and characterization of transmon qutrits through Bayesian experimental design

Robust control of a quantum system is essential to utilize the current noisy quantum hardware to its full potential, such as quantum algorithms. To achieve such a goal, a systematic search for an optimal control for any given experiment is essential. The design of optimal control pulses requires accurate numerical models and, therefore, accurate characterization of the system parameters. We present an online Bayesian approach for quantum characterization of qutrit systems, which automatically and systematically identifies optimal experiments that provide maximum information on the system parameters, thereby greatly reducing the number of experiments that need to be performed on the quantum testbed. Unlike most characterization protocols that provide point-estimates of the parameters, the proposed approach is able to estimate their probability distribution. The applicability of the Bayesian experimental design technique was demonstrated on test problems, where each experiment was defined by a parameterized control pulse. In addition to this, we also present an approach for iterative pulse extension, which is robust under uncertainties in transition frequencies and coherence times, and shot noise, despite being initialized with wide uninformative priors. Furthermore, we provide a mathematical proof of the theoretical identifiability of the model parameters and present conditions on the quantum state under which the parameters are identifiable. The proof and conditions for identifiability are presented for both closed and open quantum systems using the Schrödinger equation and the Lindblad master equation, respectively.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Boundary Corrections for Kernel Approximation to Differential Operators

The kernel-based approach to operator approximation for partial differential equations has been shown to be unconditionally stable for linear PDEs and numerically exhibit unconditional stability for non-linear PDEs. These methods have the same computational cost as an explicit finite difference scheme but can exhibit order reduction at boundaries. In previous work on periodic domains, order reduction was addressed, yielding high-order accuracy. The issue addressed in this work is the elimination of order reduction of the kernel-based approach for a more general set of boundary conditions. Further, we consider the case of both first and second order operators. To demonstrate the theory, we provide not only the mathematical proofs but also experimental results by applying various boundary conditions to different types of equations. The results agree with the theory, demonstrating a systematic path to high order for kernel-based methods on bounded domains.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

The second-generation Shifted Boundary Method and its numerical analysis

Recently, the Shifted Boundary Method (SBM) was proposed within the class of unfitted (or immersed, or embedded) finite element methods. By reformulating the original boundary value problem over a surrogate (approximate) computational domain, the SBM avoids integration over cut cells and the associated problematic issues regarding numerical stability and matrix conditioning. Accuracy is maintained by modifying the original boundary conditions using Taylor expansions. Hence the name of the method, that shifts the location and values of the boundary conditions. In this article, we present enhanced variational SBM formulations for the Poisson and Stokes problems with improved flexibility and robustness. These simplified variational forms allow to relax some of the assumptions required by the mathematical proofs of stability and convergence of earlier implementations. First, we show that these new SBM implementations can be proved asymptotically stable and convergent even without the rather restrictive assumption that the inner product between the normals to the true and surrogate boundaries is positive. Second, we show that it is not necessary to introduce a stabilization term involving the tangential derivatives of the solution at Dirichlet boundaries, therefore avoiding the calibration of an additional stabilization parameter. Finally, we prove enhanced L 2 -estimates without the cumbersome assumption – of earlier proofs – that the surrogate domain is convex. Instead we rely on a conventional assumption that the boundary of the true domain is smooth, which can also be replaced by requiring convexity of the true domain. The aforementioned improvements open the way to a more general and efficient implementation of the Shifted Boundary Method, particularly in complex three-dimensional geometries. We complement these theoretical developments with numerical experiments in two and three dimensions.

42 ENGINEERING↗
DOE OSTI2018

Review of Authentication Strategies and Trends for Distributed Energy Resources (DERs)

In this study we review literature on machine to machine (M2M) authentication and encryption pertaining to communication with grid-attached power inverters. We regard security recommendations from NIST, constrained device recommendations from CoAP, as well as influences from the existing markets. We will not focus on passwordless or multifactor schemes of user authentication, the handover/roaming authentication of mobile systems, or the group authentication of WiMAX/LTE communications. The de-facto standards for authentication and encryption are certificate-based public key cryptography and AES, respectively. While certificate-based public key cryptography is widely adopted, certificate management is seen as an Achilles heel of public key infrastructure (PKI). State of the art authentication system research includes work on certificateless authentication; however, much work in the areas of privacy preservation, efficient or lightweight systems continue to be based in public key methods. We will see efforts such as bilinear pairing, aggregate message authentication codes, one-time signatures, and Merkle trees surface and resurface with improved authentication approaches. Though research continues to produce new encryption schemes, AES prevails as a viable choice, as it can be implemented across a variety of resource constrained devices. Other lightweight encryption algorithms often employ the same fundamental addition-rotation-xor operations as AES while achieving higher efficiency, but at steep tradeoffs to security. Despite mathematical proofs of the security of cryptographic algorithms, in practice the greatest weaknesses continue to be incurred during implementation. Security researchers will find edge cases and bugs that allow unintentional behavior. In the following sections, accepted methodologies of authentication and encryption are discussed. Due diligence for securing M2M communications requires consideration during planning, design, implementation and product lifetime, as opposed to a set-it and forget-it policy. Best practices can be gleaned from published successes and failures, with no single end-all, be-all detailed solution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2016

The Gaussian CL s method for searches of new physics

Here we describe a method based on the CL s approach to present results in searches of new physics, under the condition that the relevant parameter space is continuous. Our method relies on a class of test statistics developed for non-nested hypotheses testing problems, denoted by ΔT, which has a Gaussian approximation to its parent distribution when the sample size is large. This leads to a simple procedure of forming exclusion sets for the parameters of interest, which we call the Gaussian CL s method. Our work provides a self-contained mathematical proof for the Gaussian CL s method, that explicitly outlines the required conditions. These conditions are milder than that required by the Wilks' theorem to set confidence intervals (CIs). We illustrate the Gaussian CL s method in an example of searching for a sterile neutrino, where the CL s approach was rarely used before. We also compare data analysis results produced by the Gaussian CL s method and various CI methods to showcase their differences.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
DOE OSTI2015

Singlet and triplet instability theorems

A useful definition of orbital degeneracy—form-degeneracy—is introduced, which is distinct from the usual energy-degeneracy: Two canonical spatial orbitals are form-degenerate when the energy expectation value in the restricted Hartree–Fock (RHF) wave function is unaltered upon a two-electron excitation from one of these orbitals to the other. Form-degenerate orbitals tend to have isomorphic electron densities and occur in the highest-occupied and lowest-unoccupied molecular orbitals (HOMOs and LUMOs) of strongly correlated systems. Here, we present a mathematical proof of the existence of a triplet instability in a real or complex RHF wave function of a finite system in the space of real or complex unrestricted Hartree–Fock wave functions when HOMO and LUMO are energy- or form-degenerate. We also show that a singlet instability always exists in a real RHF wave function of a finite system in the space of complex RHF wave functions, when HOMO and LUMO are form-degenerate, but have nonidentical electron densities, or are energy-degenerate. These theorems provide Hartree–Fock-theory-based explanations of Hund’s rule, a singlet instability in Jahn–Teller systems, biradicaloid electronic structures, and a triplet instability during some covalent bond breaking. They also suggest (but not guarantee) the spontaneous formation of a spin density wave (SDW) in a metallic solid. The stability theory underlying these theorems extended to a continuous orbital-energy spectrum proves the existence of an oscillating (nonspiral) SDW instability in one- and three-dimensional homogeneous electron gases, but only at low densities or for strong interactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2016

Insights into the variability of nucleated amyloid polymerization by a minimalistic model of stochastic protein assembly

Self-assembly of proteins into amyloid aggregates is an important biological phenomenon associated with human diseases such as Alzheimer’s disease. Amyloid fibrils also have potential applications in nano-engineering of biomaterials. The kinetics of amyloid assembly show an exponential growth phase preceded by a lag phase, variable in duration as seen in bulk experiments and experiments that mimic the small volumes of cells. Here, to investigate the origins and the properties of the observed variability in the lag phase of amyloid assembly currently not accounted for by deterministic nucleation dependent mechanisms, we formulate a new stochastic minimal model that is capable of describing the characteristics of amyloid growth curves despite its simplicity. We then solve the stochastic differential equations of our model and give mathematical proof of a central limit theorem for the sample growth trajectories of the nucleated aggregation process. These results give an asymptotic description for our simple model, from which closed form analytical results capable of describing and predicting the variability of nucleated amyloid assembly were derived. We also demonstrate the application of our results to inform experiments in a conceptually friendly and clear fashion. Our model offers a new perspective and paves the way for a new and efficient approach on extracting vital information regarding the key initial events of amyloid formation.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2023

On Galilean invariance of mean kinetic helicity

While kinetic helicity is not Galilean invariant locally, it is known [Moffatt, J. Fluid Mech. 35, 117 (1969)] that its spatial integral quantifies the degree of knottedness of vorticity field lines. Being a topological property of the flow, mean kinetic helicity is Galilean invariant. Here, we provide a direct mathematical proof that kinetic helicity is Galilean invariant when spatially integrated over regions enclosed by vorticity surfaces, i.e., surfaces of zero vorticity flux. Here, we also discuss so-called relative kinetic helicity, which is Galilean invariant when integrated over any region in the flow.

42 ENGINEERING↗
DOE OSTI2025

Introducing a Markov chain-based time calibration procedure for multi-channel particle detectors: application to the SuperFGD and ToF detectors of the T2K experiment

Inter-channel mis-synchronisation can be a limiting factor to the time resolution of high performance timing detectors with multiple readout channels and independent electronics units. In these systems, time calibration methods employed must be able to efficiently correct for minimal mis-synchronisation between channels and achieve the best detector performance. We present an iterative time calibration method based on Markov Chains, suitable for detector systems with multiple readout channels. Starting from correlated hit pairs alone, and without requiring an external reference time measurement, the method solves for fixed per-channel offsets, with precision limited only by the intrinsic single-channel resolution. A mathematical proof that the method is able to find the correct time offsets to be assigned to each detector channel in order to achieve inter-channel synchronisation is given, and it is shown that the number of iterations to reach convergence within the desired precision is controllable with a single parameter. Numerical studies are used to confirm unbiased recovery of true offsets. Finally, the application of the calibration method to the Super Fine-Grained Detector (SuperFGD) and the Time of Flight (TOF) detector at the upgraded T2K near detector (ND280) shows good improvement in overall timing resolution, demonstrating the effectiveness in a real-world scenario and scalability.

calibration and fitting methods↗
DOE OSTI2025

Accelerating resonant spectroscopy simulations using multishifted biconjugate gradient

Resonant spectroscopies, which involve intermediate states with finite lifetimes, provide important insights into collective excitations in quantum materials that are otherwise inaccessible. However, theoretical understanding in this area is often limited by the numerical challenges of solving Kramers-Heisenberg-type response functions for large-scale systems. To address this, we introduce a multishifted biconjugate gradient algorithm that exploits the shared structure of Krylov subspaces across spectra with varying incident energies, effectively reducing the computational complexity to that of linear spectroscopies. Both mathematical proofs and numerical benchmarks confirm that this algorithm substantially accelerates spectral simulations, achieving constant complexity independent of the number of incident energies, while ensuring accuracy and stability. This development provides a scalable, versatile framework for simulating advanced spectroscopies in quantum materials.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2025

Growth functions of periodic space tessellations

This work analyzes the rules governing the growth of the numbers of vertices, edges and faces in all possible periodic tessellations of the 2D Euclidean space, and encodes those rules in several types of polynomial growth functions. These encodings map the geometric, combinatorial and topological properties of the tessellations into sets of integer coefficients. Several general statements about these encodings are given with rigorous mathematical proof. The variation of the growth functions is represented graphically and analyzed in orphic diagrams, so named because of their similarity to orphic art. Several examples of 3D space groups are included, to emphasize the complexity of the growth functions in higher dimensions. A freely available Python library is presented to facilitate the discovery of the growth functions and the generation of orphic diagrams.

Chemistry↗
DOE OSTI2016

Quantitative properties of clustering within modern microscopic nuclear models

A method for studying cluster spectroscopic properties of nuclear fragmentation, such as spectroscopic amplitudes, cluster form factors, and spectroscopic factors, is developed on the basis of modern precision nuclear models that take into account the mixing of large-scale shell-model configurations. Alpha-cluster channels are considered as an example. A mathematical proof of the need for taking into account the channel-wave-function renormalization generated by exchange terms of the antisymmetrization operator (Fliessbach effect) is given. Examples where this effect is confirmed by a high quality of the description of experimental data are presented. By and large, the method in question extends substantially the possibilities for studying clustering phenomena in nuclei and for improving the quality of their description.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2016

Sebastien Philippe Discusses the Zero-Knowledge Protocol

A system that can compare physical objects while potentially protecting sensitive information about the objects themselves has been demonstrated experimentally at the U.S. Department of Energy’s (DOE) Princeton Plasma Physics Laboratory (PPPL). This work, by researchers at Princeton University and PPPL, marks an initial confirmation of the application of a powerful cryptographic technique in the physical world. Graduate student Sébastien Philippe discusses the experiment.

97 MATHEMATICS AND COMPUTING↗