Search NASA⌕ Search

SEARCH · Search NASA

Results for “Mathematical Foundations: Computational 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.

At least 73 records · Page 4

A general framework for substructuring‐based domain decomposition methods for models having nonlocal interactions

Abstract A mathematical framework is provided for a substructuring‐based domain decomposition (DD) approach for nonlocal problems that features interactions between points separated by a finite distance. Here, by substructuring it is meant that a traditional geometric configuration for local partial differential equation (PDE) problems is used in which a computational domain is subdivided into non‐overlapping subdomains. In the nonlocal setting, this approach is substructuring‐based in the sense that those subdomains interact with neighboring domains over interface regions having finite volume, in contrast to the local PDE setting in which interfaces are lower dimensional manifolds separating abutting subdomains. Key results include the equivalence between the global, single‐domain nonlocal problem and its multi‐domain reformulation, both at the continuous and discrete levels. These results provide the rigorous foundation necessary for the development of efficient solution strategies for nonlocal DD methods.

Capodaglio, Giacomo↗

CUDO: closed-form universal dwell-time optimization for computer-controlled optical surfacing

Precision optical figuring demands fast and accurate dwell time optimization to reach nanometer- and sub-nanometer-level accuracy in next-generation optical systems. We introduce CUDO (closed-form universal dwell-time optimization), the first, to the best of our knowledge, unified closed-form analytical framework that supports both function-form and matrix-form dwell time models in computer-controlled optical surfacing (CCOS). In contrast to traditional methods, which rely on iterative optimization and hyperparameter tuning, our framework derives direct analytical solutions with no adjustable parameters. This approach unifies the solution principles of existing methods within a single mathematical model, delivering three key advantages: (1) accuracy on par with, or superior to, iterative solvers, (2) substantial reduction in computation time, and (3) numerical robustness. Comparative studies with prior art confirm that closed-form solutions achieve equivalent residual error while removing runtime bottlenecks. By simplifying the implementation and enabling real-time, scalable deployment, CUDO establishes a practical foundation for future deterministic fabrication of large-aperture and high-performance optics.

36 MATERIALS SCIENCE↗

Evidence for the utility of quantum computing before fault tolerance

Quantum computing promises to offer substantial speed-ups over its classical counterpart for certain problems. However, the greatest impediment to realizing its full potential is noise that is inherent to these systems. The widely accepted solution to this challenge is the implementation of fault-tolerant quantum circuits, which is out of reach for current processors. Here we report experiments on a noisy 127-qubit processor and demonstrate the measurement of accurate expectation values for circuit volumes at a scale beyond brute-force classical computation. We argue that this represents evidence for the utility of quantum computing in a pre-fault-tolerant era. These experimental results are enabled by advances in the coherence and calibration of a superconducting processor at this scale and the ability to characterize and controllably manipulate noise across such a large device. We establish the accuracy of the measured expectation values by comparing them with the output of exactly verifiable circuits. In the regime of strong entanglement, the quantum computer provides correct results for which leading classical approximations such as pure-state-based 1D (matrix product states, MPS) and 2D (isometric tensor network states, isoTNS) tensor network methods break down. These experiments demonstrate a foundational tool for the realization of near-term quantum applications.

97 MATHEMATICS AND COMPUTING↗

TU-D-202-03: Gating Is the Best ITV Killer

Respiratory motion has long been recognized as an important factor affecting the precision of radiotherapy. After the introduction of the 4D CT to visualize the respiratory motion in 3D, the internal target volume (ITV) has been widely adopted as simple method to take the motion into account in treatment planning and delivery. The ITV is generated as the union of the CTVs as the patient goes through the respiratory cycle. Many issues have been identified with the ITV. In this session three alternatives for the ITV will be discussed: 1) An alternative motion-inclusive approach with better imaging and smaller margins, called mid-position CT. 2) The tracking approach and 3) The gating approach. The following topics will be addressed by Marcel van Herk (“Is ITV the correct motion encompassing strategy”): Magnitude of respiratory motion, effect of motion on radiotherapy, motion encompassing strategies, and software solutions to assist in motion encompassing strategies. Then Paul Keall (“Make margins simple: Use real-time target tracking”) will discuss tracking with: clinical drivers for tracking, current clinical status of tumor tracking, future tumor tracking technology, and margin margin challenges with and without tracking. Finally Daniel Low will discuss gating (“Gating is the best ITV killer”): why ITV in the first place, requirements for planning, requirements at the machine, benefits and costs. The session will end with a discussion and live demo of motion simulation software to illustrate the issues and explain the relative benefit and appropriate uses for the three methods. Learning Objectives: Explain the 4D imaging and treatment planning process. Summarize the various approaches to deal with respiratory motion during radiotherapy Discuss the tradeoffs involved when choosing one of the three discussed approaches. Explain in which situation each method is the best choice Research is partly funded by Elekta Oncology Systems and the Dutch Cancer Foundation; M. van Herk, Part of the research was funded by Elekta Oncology Systems and the Dutch Cancer Foundation.

60 APPLIED LIFE SCIENCES↗

On the use of a multigrid-reduction-in-time algorithm for multiscale convergence of turbulence simulations

Simulations of turbulent flow present challenges in terms of accuracy and affordability on modern highly-parallel computer architectures. A multigrid-reduction-in-time algorithm is used to provide a framework for separately evolving different scales of turbulence and for parallelizing the temporal domain, thereby increasing the concurrency. It is hypothesized that the space–time locality of the small scales of turbulence can be used to circumvent difficulties in applying temporal multigrid to flows dominated by inertial physics. For algorithms that fall well short of spectral accuracy (fourth-order is used in this work) attention must be paid to the accuracy of features on scales transferred between multigrid levels. Numerical experiments were performed using implicit large-eddy simulation. Results from applying the approach to an infinite-Reynolds number Taylor–Green flow and a double-shear flow at a Reynolds number of 11650 provide strong evidence that the approach has merit. The multigrid-reduction-in-time framework can be used to parallelize the temporal domain of a high-Reynolds-number turbulent flow and permit independent convergence of different scales. Establishing this foundation allows for future research in reducing the wall-clock time to solve turbulent flows while retaining the same accuracy as sequential solvers. In conclusion, current performance results from parallelizing the temporal domain are not competitive with those from sequential-in-time methods.

97 MATHEMATICS AND COMPUTING↗

Lattice Boltzmann methods for multiphase flow and phase-change heat transfer

We report that over the past few decades, tremendous progress has been made in the development of particle-based discrete simulation methods versus the conventional continuum-based methods. In particular, the lattice Boltzmann (LB) method has evolved from a theoretical novelty to a ubiquitous, versatile and powerful computational methodology for both fundamental research and engineering applications. It is a kinetic-based mesoscopic approach that bridges the microscales and macroscales, which offers distinctive advantages in simulation fidelity and computational efficiency. Applications of the LB method are now found in a wide range of disciplines including physics, chemistry, materials, biomedicine and various branches of engineering. The present work provides a comprehensive review of the LB method for thermofluids and energy applications, focusing on multiphase flows, thermal flows and thermal multiphase flows with phase change. The review first covers the theoretical framework of the LB method, revealing certain inconsistencies and defects as well as common features of multiphase and thermal LB models. Recent developments in improving the thermodynamic and hydrodynamic consistency, reducing spurious currents, enhancing the numerical stability, etc., are highlighted. These efforts have put the LB method on a firmer theoretical foundation with enhanced LB models that can achieve larger liquid-gas density ratio, higher Reynolds number and flexible surface tension. Examples of applications are provided in fuel cells and batteries, droplet collision, boiling heat transfer and evaporation, and energy storage. Lastly, further developments and future prospect of the LB method are outlined for thermofluids and energy applications.

42 ENGINEERING↗

Computer prediction of large reflector antenna radiation properties

A FORTRAN program for calculating reflector antenna radiation patterns was rewritten and extended to include reflectors composed of a number of panels. These individual panels must be analytic surfaces. The theoretical foundation for the program is as follows: Geometrical optics techniques are used to trace rays from a feed antenna to the reflector surface and back to a mathematical plane just in front of the reflector. The resulting tangential electric field distribution, assumed to be the only source of forward radiation, is integrated numerically to calculate the radiation pattern for a desired set of angles. When the reflector is composed of more than one panel, each panel is treated as a separated antenna, the ray-tracing procedure and integration being repeated for each panel. The results of the individual aperture plane integrations are stored and summed to yield the relative electric field strength over the angles of interest. An example and several test cases are included to demonstrate the use of the program and verify the new method of computation.

Botula, A.↗

Movable geometry and eigenvalue search capability in the MC21 Monte Carlo code

A description of a robust and flexible movable geometry implementation in the Monte Carlo code MC21 is described along with a search algorithm that can be used in conjunction with the movable geometry capability to perform eigenvalue searches based on the position of some geometric component. The natural use of the combined movement and search capability is searching to critical through variation of control rod (or control drum) position. The movable geometry discussion provides the mathematical framework for moving surfaces in the MC21 combinatorial solid geometry description. A discussion of the interface between the movable geometry system and the user is also described, particularly the ability to create a hierarchy of movable groups. Combined with the hierarchical geometry description in MC21 the movable group framework provides a very powerful system for inline geometry modification. The eigenvalue search algorithm implemented in MC21 is also described. The foundations of this algorithm are a regula falsi search though several considerations are made in an effort to increase the efficiency of the algorithm for use with Monte Carlo. Specifically, criteria are developed to determine after each batch whether the Monte Carlo calculation should be continued, the search iteration can be rejected, or the search iteration has converged. These criteria seek to minimize the amount of time spent per iteration. Results for the regula falsi method are shown, illustrating that the method as implemented is indeed convergent and that the optimizations made ultimately reduce the total computational expense. (authors)

97 MATHEMATICS AND COMPUTING↗

Phase retrieval using radiation and matter-wave fields: Validity of Teague's method for solution of the transport-of-intensity equation

Although originally developed for coherent paraxial scalar electromagnetic radiation in the visible-light regime, phase retrieval using the transport-of-intensity equation has been successfully applied to a range of paraxial radiation and matter-wave fields. Such applications include using electron wave fields to quantitatively image magnetic skyrmions and spin ices, propagation-based phase-contrast imaging using cold neutrons and hard x-rays, and visible-light refractive imaging of the projected column density of cold-atom clouds. Teague's method for phase retrieval using the transport-of-intensity equation, which renders the phase of a paraxial complex wave indirectly measurable via the existence of a conserved current, has been applied to a broad variety of situations which include all of the experiments described above. However, these applications have been undertaken without a thorough analysis of the underlying validity of the method. Here we derive sufficient conditions for the phase-retrieval solution provided by Teague's method to coincide with the true phase of the paraxial radiation or matter-wave field. We also present a sufficient condition guaranteeing that the discrepancy between the true phase function and that reconstructed using Teague's solution is small. These conditions demonstrate that, in most practical cases, for phase-amplitude retrieval using the transport-of-intensity equation, the Teague solution is very close to the exact solution. However, we also describe a counter example in the context of phase-amplitude retrieval using hard x-rays, in which the relative root-mean-square difference between the exact solution and that obtained using Teague's method is 9%. These findings clarify the foundations of one of the most widely applied methods for propagation-based phase retrieval of both paraxial matter and radiation wave fields and define a region for its applicability.

74 ATOMIC AND MOLECULAR PHYSICS↗

Reliable and Efficient Machine Learning (Final Technical Report)

Modern scientific experiments generate massive amounts of data at a pace much faster than humans can manually analyze. While machine learning has revolutionized commercial data analysis (such as recommending movies or recognizing faces), applying these tools to complex scientific discovery is challenging because scientific answers must be precise, interpretable, and adhere to physical laws. The research under this project aims to develop new mathematical tools and computer algorithms specifically designed for scientific applications. Major progress has been made in automatically cleaning and deconstructing messy experimental data, analyzing the visual information of physical phenomena, determining the underlying physical variables, and providing rig orous mathematical analysis of interesting algorithms and concepts widely used in machine learning. This project addressed the critical gap between our ability to generate massive scientific data and our ability to extract interpretable information from it. We established mathematical foundations for Scientific Machine Learning (SciML) aimed at effective data analytics and automated discovery. Our work focused on three core objectives: (1) developing reliable feature extraction methods for dynamic high-dimensional data, (2) establishing mathematical foundations for discovering dynamics via neural networks, and (3) creating rigorous optimization techniques for these models. Key outcomes come from two fronts. On the practical side, they include the development of algorithms that significantly enhance the extraction of signals from field data, as well as the capability to handle situations that exhibit smooth variations or physical stretching due to temperature changes. They also include the creation of an automated framework for discovering fundamental state variables from raw experimental data, demonstrating the ability to identify intrinsic physical dimensions without prior knowledge of the governing laws. On the theoretical front, the research results in theoretical advances in Optimal Transport, a widely used notion in SciML, specifically regarding functions with fixed-size nodal sets, provide sharp bounds relevant to uncertainty quantification. Meanwhile, the outcomes also include the establishment of convergence theories for nonlocal gradient descent methods, enabling robust optimization with noisy data in high-dimensional settings commonly encountered in scientific modeling. The project also helps creating opportunities to train the next generation of researchers, equipping them with the necessary technical skills for today’s workplace and preparing them for future advances.

97 MATHEMATICS AND COMPUTING↗

Nonlinear Optimization Methods for Large-Scale Learning

Future advances in large-scale machine learning depend heavily on the availability of new and more powerful nonlinear optimization methods. The goal of this project is to address this challenge by designing new optimization algorithms that can deal with the scale, nonlinearity and stochasticity arising in machine learning models. Our research will provide the theoretical foundations for the new methods, and will involve intensive numerical testing on state-of-the-art machine learning systems. The project is organized into three interrelated projects that constitute a broad research agenda in the area of large-scale stochastic optimization for data science.

97 MATHEMATICS AND COMPUTING↗

Exemplifying Quantum Systems in a Finite Element Basis

This paper presents a description of the abstractions required for the expression and solution of the linear single-particle Schroedinger equation in a finite element basis. This paper consists of two disparate themes: First, to layout and establish the foundations of finite element analysis as an approximate numerical solution to extendable quantum mechanical systems; and second, to promote a high-performance open-source computational model for the approximate numerical solution to quantum mechanical systems. The structural foundation of the one-and two-dimensional time-independent Schroedinger equation describing an infinite potential well is explored and a brief overview of the hierarchal design of the computational library written in C++ is given.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Recent advances in computational mathematics and applications

We are honored to bring you this special issue dedicated to recent advances in computational mathematics and applications in science and engineering. The papers in this special issue were presented in ”Conference on Computational Mathematics and Applications (CCMA)” held at the University of Nevada Las Vegas (UNLV) during October 25–27, 2019. The conference has attracted about 90 attendees from six countries. The 15 papers in the special issue comprise a diverse collection of theoretical numerical analysis as well as applications in various subjects. Topics cover optimal control of PDEs, discontinuous Galerkin methods, fluid flow in porous media, turbulence flow, static and moving interface problems, complex fluids composed by the mixture of Newtonian fluid and nematic (liquid crystal) flows, modeling of ocean–atmosphere system, image segmentation algorithm, uncertainty quantification problems for turbulence model and Maxwell’s equations, iterative solver for systems resulting from mixed methods, and novel methods for solving systems of nonlinear equations. As the Guest Editors we would like to thank Dr. Leland Jameson at NSF (National Science Foundation) for kindly supporting our conference proposal which made this conference possible. We would also like to thank Darren Sugrue from Elsevier who provided partial support for our conference, and Thennarasu Gunasekaran and his production team from Elsevier who produced this nice special issue. We are grateful to many people (Dr. Zhijian Wu, Lori Ornelas, Elsa Juarez, and many Ph.D. students) at the Department of Mathematical Sciences of UNLV who provided tremendous support for the conference. Finally, we very much appreciate all authors who contributed their precious results to this special issue.

97 MATHEMATICS AND COMPUTING↗

Uncertainty quantification for neural network potential foundation models

Abstract For neural network potentials (NNPs) to gain widespread use, researchers must be able to trust model outputs. However, the blackbox nature of neural networks and their inherent stochasticity are often deterrents, especially for foundation models trained over broad swaths of chemical space. Uncertainty information provided at the time of prediction can help reduce aversion to NNPs. In this work, we detail two uncertainty quantification (UQ) methods. Readout ensembling, by finetuning the readout layers of an ensemble of foundation models, provides information about model uncertainty, while quantile regression, by replacing point predictions with distributional predictions, provides information about uncertainty within the underlying training data. We demonstrate our approach with the MACE-MP-0 model, applying UQ to the foundation model and a series of finetuned models. The uncertainties produced by the readout ensemble and quantile methods are demonstrated to be distinct measures by which the quality of the NNP output can be judged.

36 MATERIALS SCIENCE↗

CFD-DEM Onset of Motion Analysis for Application to Bed Scour Risk Assessment

This CFD study with DEM was done as a part of the Federal Highway Administration’s (FHWA’s) effort to improve scour design procedures. The Computational Fluid Dynamics-Discrete Element Method (CFD-DEM) model, available in CD-Adapco’s StarCCM+ software, was used to simulate multiphase systems, mainly those which combine fluids and solids. In this method the motion of discrete solids is accounted for by DEM, which applies Newton's laws of motion to every particle. The flow of the fluid is determined by the local averaged Navier–Stokes equations that can be solved using the traditional CFD approach. The interactions between the fluid phase and solids phase are modeled by use of Newton's third law. The inter-particle contact forces are included in the equations of motion. Soft-particle formulation is used, which allows particles to overlap. In this study DEM was used to model separate sediment grains and spherical particles laying on the bed with the aim to analyze their movement due to flow conditions. Critical shear stress causing the incipient movement of the sediment was established and compared to the available experimental data. An example of scour around a cylindrical pier is considered. Various depths of the scoured bed and flow conditions were taken into account to gain a better understanding of the erosion forces existing around bridge foundations. The decay of these forces with increasing scour depth was quantified with a ‘decay function’, which shows that particles become increasingly less likely to be set in motion by flow forces as a scour hole increases in depth. Computational and experimental examples of the scoured bed around a cylindrical pier are presented.

97 MATHEMATICS AND COMPUTING↗

A mathematical assessment of the isolation random forest method for anomaly detection in big data

We present the mathematical analysis of the Isolation Random Forest Method (IRF Method) for anomaly detection, proposed by Liu F.T., Ting K.M. and Zhou Z. H. in their seminal work as a heuristic method for anomaly detection in Big Data. We prove that the IRF space can be endowed with a probability induced by the Isolation Tree algorithm (iTree). In this setting, the convergence of the IRF method is proved, using the Law of Large Numbers. Here, a couple of counterexamples are presented to show that the method is inconclusive and no certificate of quality can be given, when using it as a means to detect anomalies. Hence, an alternative version of the method is proposed whose mathematical foundation is fully justified. Furthermore, a criterion for choosing the number of sampled trees needed to guarantee confidence intervals of the numerical results is presented. Finally, numerical experiments are presented to compare the performance of the classic method with the proposed one.

97 MATHEMATICS AND COMPUTING↗

2016 Final Reports from the Los Alamos National Laboratory Computational Physics Student Summer Workshop

The two primary purposes of LANL’s Computational Physics Student Summer Workshop are (1) To educate graduate and exceptional undergraduate students in the challenges and applications of computational physics of interest to LANL, and (2) Entice their interest toward those challenges. Computational physics is emerging as a discipline in its own right, combining expertise in mathematics, physics, and computer science. The mathematical aspects focus on numerical methods for solving equations on the computer as well as developing test problems with analytical solutions. The physics aspects are very broad, ranging from low-temperature material modeling to extremely high temperature plasma physics, radiation transport and neutron transport. The computer science issues are concerned with matching numerical algorithms to emerging architectures and maintaining the quality of extremely large codes built to perform multi-physics calculations. Although graduate programs associated with computational physics are emerging, it is apparent that the pool of U.S. citizens in this multi-disciplinary field is relatively small and is typically not focused on the aspects that are of primary interest to LANL. Furthermore, more structured foundations for LANL interaction with universities in computational physics is needed; historically interactions rely heavily on individuals’ personalities and personal contacts. Thus a tertiary purpose of the Summer Workshop is to build an educational network of LANL researchers, university professors, and emerging students to advance the field and LANL’s involvement in it.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Sequential Monte Carlo sampling in hidden Markov models of nonlinear dynamical systems

We investigate the issue of which state functionals can have their uncertainty estimated efficiently in dynamical systems with uncertainty. Because of the high dimensionality and complexity of the problem, sequential Monte Carlo (SMC) methods are used. We investigate SMC methods where the proposal distribution is computed by maximum likelihood or by a linearization approach. We prove that the variance of the SMC method is bounded linearly in the number of time steps when the proposal distribution is truncated normal distribution. We also show that for a moderate large number of steps the error produced by approximation of dynamical systems linearly accumulates on the condition that the logarithm of the density function of noise is Lipschitz continuous. This finding is significant because the uncertainty in many dynamical systems, in particular, in chemical engineering systems, can be assumed to have this nature. We demonstrate our findings for a simple test case from chemical engineering. The theoretical findings provide a foundation for the parallel software SISTOS.

97 MATHEMATICS AND COMPUTING↗