On-line parsing of hand-printed mathematical expressions Final report for phase 2
Computer program for analyzing hand printed mathematical expressions
Williams, T. G.↗
SEARCH · Engineering Papers
Results for “mathematics computing”
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.
Tensor Contraction and Operation Minimization for Extreme Scale Computational Chemistry
Explore the source record for details and available documents.
97 MATHEMATICS AND COMPUTING↗
Tensor Contraction and Operation Minimization forExtreme Scale Computational Chemistry
Explore the source record for details and available documents.
97 MATHEMATICS AND COMPUTING↗
A frequency independent technique for extracting the rigid-body motion from the total motion of a large flexible launch vehicle
Mathematical model to compute rigid body motion independently of flexible body motion in launch vehicles
FLEXIBLE BODY↗
Performance Analysis of Speculative Parallel Adaptive Local Timestepping for Conservation Laws
Stable simulation of conservation laws, such as those used to model fluid dynamics and plasma physics applications, requires the satisfaction of the so-called Courant-Friedrichs-Lewy condition. By allowing regions of the mesh to advance with different timesteps that locally satisfy this stability constraint, significant work reduction can be attained when compared to a time integration scheme using a single timestep size. However, parallelizing this algorithm presents considerable difficulty. Since the stability condition depends on the state of the system, dependencies become dynamic and potentially non-local. In this article, we present an adaptive local timestepping algorithm using an optimistic (Timewarp-based) parallel discrete event simulation. We introduce waiting heuristics to limit misspeculation and a semi-static load balancing scheme to eliminate load imbalance as parts of the mesh require finer or coarser timesteps. Last, we outline an interface for separating the physics of the specific conservation law from the temporal integration allowing for productive adoption of our proposed algorithm. We present a misspeculation study for three conservation laws, demonstrating both the productivity of the local timestepping API, for which 74% of the lines of code are reused across different conservation laws, and the robustness of the waiting heuristics—at most 1.5% of element updates are rolled back. Our performance studies demonstrate up to a 2.8× speedup versus a baseline unoptimized local timestepping approach, a 4x improvement in per-node throughput compared to an MPI parallelization of synchronous timestepping, and scalability up to 3,072 cores on NERSC’s Cori Haswell partition.
97 MATHEMATICS AND COMPUTING↗
A Probabilistic Framework for the Validation and Certification of Computer Simulations
The paper presents a methodology for quantifying, propagating, and managing the uncertainty in the data required to initialize computer simulations of complex phenomena. The purpose of the methodology is to permit the quantitative assessment of a certification level to be associated with the predictions from the simulations, as well as the design of a data acquisition strategy to achieve a target level of certification. The value of a methodology that can address the above issues is obvious, specially in light of the trend in the availability of computational resources, as well as the trend in sensor technology. These two trends make it possible to probe physical phenomena both with physical sensors, as well as with complex models, at previously inconceivable levels. With these new abilities arises the need to develop the knowledge to integrate the information from sensors and computer simulations. This is achieved in the present work by tracing both activities back to a level of abstraction that highlights their commonalities, thus allowing them to be manipulated in a mathematically consistent fashion. In particular, the mathematical theory underlying computer simulations has long been associated with partial differential equations and functional analysis concepts such as Hilbert spares and orthogonal projections. By relying on a probabilistic framework for the modeling of data, a Hilbert space framework emerges that permits the modeling of coefficients in the governing equations as random variables, or equivalently, as elements in a Hilbert space. This permits the development of an approximation theory for probabilistic problems that parallels that of deterministic approximation theory. According to this formalism, the solution of the problem is identified by its projection on a basis in the Hilbert space of random variables, as opposed to more traditional techniques where the solution is approximated by its first or second-order statistics. The present representation, in addition to capturing significantly more information than the traditional approach, facilitates the linkage between different interacting stochastic systems as is typically observed in real-life situations.
Ghanem, Roger↗
Manual of phosphoric acid fuel cell stack three-dimensional model and computer program
A detailed distributed mathematical model of phosphoric acid fuel cell stack have been developed, with the FORTRAN computer program, for analyzing the temperature distribution in the stack and the associated current density distribution on the cell plates. Energy, mass, and electrochemical analyses in the stack were combined to develop the model. Several reasonable assumptions were made to solve this mathematical model by means of the finite differences numerical method.
Lu, C. Y.↗
Statistical models of lunar rocks and regolith
The mathematical, statistical, and computational approaches used in the investigation of the interrelationship of lunar fragmental material, regolith, lunar rocks, and lunar craters are described. The first two phases of the work explored the sensitivity of the production model of fragmental material to mathematical assumptions, and then completed earlier studies on the survival of lunar surface rocks with respect to competing processes. The third phase combined earlier work into a detailed statistical analysis and probabilistic model of regolith formation by lithologically distinct layers, interpreted as modified crater ejecta blankets. The fourth phase of the work dealt with problems encountered in combining the results of the entire project into a comprehensive, multipurpose computer simulation model for the craters and regolith. Highlights of each phase of research are given.
Marcus, A. H.↗
Diffusion Limit–Preserving Lumped DFEMs on AMR Meshes
Here, we present sweep-compatible, novel upwinding recipes for the bilinear discontinuous (BLD) finite element method (FEM) that allows lumped BLD to be used on adaptive mesh refinement (AMR) meshes for thick transport applications without adding additional degrees of freedom at hanging nodes that exist on refinement boundaries. We analyze the properties of the upwinding and lumping that are needed for BLD to get the thick diffusion limit on such meshes, present results demonstrating locking with the wrong recipe, and present results showing error convergence and robustness properties for two diffusive problems on a variety of AMR meshes.
42 ENGINEERING↗
Low rank approximation in simulations of quantum algorithms
Simulating quantum algorithms on classical computers is challenging when the system size, i.e., the number of qubits used in the quantum algorithm, is moderately large. However, some quantum algorithms and the corresponding quantum circuits can be simulated efficiently on a classical computer if the input quantum state is a low rank tensor and all intermediate states of the quantum algorithm can be represented or approximated by low rank tensors. Here, in this paper, we examine the possibility of simulating a few quantum algorithms by using low-rank canonical polyadic (CP) decomposition to represent the input and all intermediate states of these algorithms. Two rank reduction algorithms are used to enable efficient simulation. We show that some of the algorithms preserve the low rank structure of the input state and can thus be efficiently simulated on a classical computer. However, the rank of the intermediate states in other quantum algorithms can increase rapidly, making efficient simulation more difficult. To some extent, such difficulty reflects the advantage or superiority of a quantum computer over a classical computer. As a result, understanding the low rank structure of a quantum algorithm allows us to identify algorithms that can benefit significantly from quantum computers.
97 MATHEMATICS AND COMPUTING↗
Computing within the 2021 Snowmass process
We present different elements of the 2021–2022 Computational Frontier (CompF) effort within the Snowmass process, including organization, events, and highlights of the final report. With focus in the next 10–15 years, we analyze the impact of newly established and emerging technologies, identify challenges within theoretical, experimental and observational research programs, and present the report recommendations. We emphasize the main recommendation, which is the formation of a Coordinating Panel for Software and Computing (CPSC).
97 MATHEMATICS AND COMPUTING↗
FPGA Computing
The articles in this special section focus on cutting-edge research on topics that relate to field programmable gate arrays (FPGA) in computing.
97 MATHEMATICS AND COMPUTING↗
Advanced Methods for Immersed Domain Multi-physics Computations
This is the final report on the project, and describes the main accomplishments in the development of the Shifted Boundary Method (SBM), a new computational framework for embedded/immersed computational mechanics applications.
97 MATHEMATICS AND COMPUTING↗
Snowmass Letter of Interest - Cloud Computing - CompF4
The world currently spends more than $30B per quarter on the consumption of Cloud Computing services. This is 17 times the size of the entire FY20 budget for the Office of Science at the Department of Energy. These resources have been successfully used for scientific computing in HEP and elsewhere under a pay-as-you-go model where users are billed monthly based on the resources they have consumed. There are a wide range of Cloud services, but we categorize them into “capability” and “capacity”. Capability services represent a unique set of features that we have not provisioned on-premises for a variety of reasons (cost-effectiveness, power consumption, proprietary solutions, etc.) Capacity services are services that allow us to scale out commodity services; historically we have focused on high-throughput (batch) computing.
97 MATHEMATICS AND COMPUTING↗
Preserving Superconvergence of Spectral Elements for Curved Domains
Spectral element methods (SEM), extensions of finite element methods (FEM), have emerged as significant techniques for solving partial differential equations in physics and engineering. SEM can potentially deliver superior accuracy due to the potential superconvergence in nodal solutions for well-shaped tensor-product elements. However, the accuracy of SEM often degrades in complex geometries due to geometric inaccuracies near curved boundaries and the loss of superconvergence with simplicial or non-tensor-product elements. To overcome the first issue, we propose using geometric refinement, which both refines the mesh near high-curvature regions and increases the degree of geometric basis functions. We show that when using mixed-element meshes with tensor-product elements in the interior of the domain, curvature-based geometric refinement near boundaries can improve the accuracy of the interior elements by reducing pollution errors and preserving the superconvergence in nodal solutions. To address the second issue, we introduce ApSEM, a post-processing technique using the adaptive extended stencil finite element method (AES-FEM) to recover the accuracy near the curved boundaries. The combination of curvature-based geometric refinement and accurate post-processing offers an effective and easier-to-implement alternative to methods reliant on exact geometries. We demonstrate our techniques by solving the convection-diffusion equation in 2D and 3D and show up to two orders of magnitude of improvement in the solution accuracy, even when the elements are poorly shaped near boundaries. We also show the efficiency of ApSEM as it can recover superconvergence in nodal solutions without drastically increasing the computational cost.
97 MATHEMATICS AND COMPUTING↗
Computational Science at the National Laboratory of the Rockies
Computational methods underpin advancing the science and engineering of energy technologies and developing a knowledge base to optimize energy systems. NLR's Computational Science Center (CSC) proudly focuses on providing the service of computing, advancing the science of computing, and enabling DOE missions.
97 MATHEMATICS AND COMPUTING↗
Physics constrained unsupervised deep learning for rapid, high resolution scanning coherent diffraction reconstruction
By circumventing the resolution limitations of optics, coherent diffractive imaging (CDI) and ptychography are making their way into scientific fields ranging from X-ray imaging to astronomy. Yet, the need for time consuming iterative phase recovery hampers real-time imaging. While supervised deep learning strategies have increased reconstruction speed, they sacrifice image quality. Furthermore, these methods’ demand for extensive labeled training data is experimentally burdensome. Here, we propose an unsupervised physics-informed neural network reconstruction method, PtychoPINN, that retains the factor of 100-to-1000 speedup of deep learning-based reconstruction while improving reconstruction quality by combining the diffraction forward map with real-space constraints from overlapping measurements. In particular, PtychoPINN gains a factor of 4 in linear resolution and an 8 dB improvement in PSNR while also accruing improvements in generalizability and robustness. This blend of performance and computational efficiency offers exciting prospects for high-resolution real-time imaging in high-throughput environments such as X-ray free electron lasers (XFELs) and diffraction-limited light sources.
97 MATHEMATICS AND COMPUTING↗
Reliability model derivation of a fault-tolerant, dual, spare-switching, digital computer system
A computer based reliability projection aid, tailored specifically for application in the design of fault-tolerant computer systems, is described. Its more pronounced characteristics include the facility for modeling systems with two distinct operational modes, measuring the effect of both permanent and transient faults, and calculating conditional system coverage factors. The underlying conceptual principles, mathematical models, and computer program implementation are presented.
Source record↗