Search NASA⌕ Search

SEARCH · Search NASA

Results for “COMPUTING PROBLEMS”

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 505 records · Page 28

Quantum Zeno Monte Carlo for computing observables

The recent development of logical quantum processors marks a pivotal transition from the noisy intermediate-scale quantum (NISQ) era to the fault-tolerant quantum computing (FTQC) era. These devices have the potential to address classically challenging problems with polynomial computational time using quantum properties. However, they remain susceptible to noise, necessitating noise resilient algorithms. We introduce Quantum Zeno Monte Carlo (QZMC), a classical-quantum hybrid algorithm that demonstrates resilience to device noise and Trotter errors while showing polynomial computational cost for a gapped system. QZMC computes static and dynamic properties without requiring initial state overlap or variational parameters, offering reduced quantum circuit depth.

Han, Mancheon [Korea Institute for Advanced Study ↗

Experimental and computing strategies in advanced material characterization problems

The mechanical characterization of materials relies more and more often on sophisticated experimental methods that permit to acquire a large amount of data and, contemporarily, to reduce the invasiveness of the tests. This evolution accompanies the growing demand of non-destructive diagnostic tools that assess the safety level of components in use in structures and infrastructures, for instance in the strategic energy sector. Advanced material systems and properties that are not amenable to traditional techniques, for instance thin layered structures and their adhesion on the relevant substrates, can be also characterized by means of combined experimental-numerical tools elaborating data acquired by full-field measurement techniques. In this context, parameter identification procedures involve the repeated simulation of the laboratory or in situ tests by sophisticated and usually expensive non-linear analyses while, in some situation, reliable and accurate results would be required in real time. The effectiveness and the filtering capabilities of reduced models based on decomposition and interpolation techniques can be profitably used to meet these conflicting requirements. This communication intends to summarize some results recently achieved in this field by the author and her co-workers. The aim is to foster further interaction between engineering and mathematical communities.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Representing Operational Flexibility in Generation Expansion Planning Through Convex Relaxation of Unit Commitment

Large shares of renewable generation in electric power systems increase the need for operational flexibility. Consideration of operational flexibility in generation expansion planning (GEP) necessitates the modeling of unit commitment (UC) in system operations. However, the UC problem itself is computationally challenging. We present a GEP model in which the embedded operational problem is a convex relaxation of the UC problem. Through a large-scale example based on the Texas system, we show the tightness and tractability of our relaxation, as well as the impact of operational flexibility on GEP.

convex optimization↗

Transfer Function Design for Scientific Discovery

As computation scales beyond terascale, the scientific problems under study through computing are increasingly pushing the boundaries of human knowledge about the physical world. It is more pivotal than ever to quickly and reliably extract new knowledge from these complex simulations of ultra scale. In this project, the PI expanded the traditional notion of transfer function, which maps physical quantities to visual cues via table look-ups, to include general temporal as well as multivariate patterns that can be described procedurally through specialty mini programming languages. Their efforts aimed at answering a perpetual question of fundamental importance. That is "what a visualization should show". Instead of waiting for application scientists to initiate the process, the team at University of Tennessee worked closely with scientists at ORNL in a proactive role to envision and design elegant, powerful, and reliable tools that a user can use to specify "what is interesting". Their new techniques include visualization operators that revolve around correlation and graph properties, relative patterns in statistical distribution, temporal regular expressions, concurrent attribute subspaces and traditional compound boolean range queries. The team also paid special attention to ensure that all visualization operators are inherently designed with great parallel scalability to handle tera-scale datasets in both homogeneous and heterogeneous environments. Success has been demonstrated with leading edge computational science areas include climate modeling, combustion and systems genetics.

97 MATHEMATICS AND COMPUTING↗

Advanced numerical methods in mesh generation and mesh adaptation

Numerical solution of partial differential equations requires appropriate meshes, efficient solvers and robust and reliable error estimates. Generation of high-quality meshes for complex engineering models is a non-trivial task. This task is made more difficult when the mesh has to be adapted to a problem solution. This article is focused on a synergistic approach to the mesh generation and mesh adaptation, where best properties of various mesh generation methods are combined to build efficiently simplicial meshes. First, the advancing front technique (AFT) is combined with the incremental Delaunay triangulation (DT) to build an initial mesh. Second, the metric-based mesh adaptation (MBA) method is employed to improve quality of the generated mesh and/or to adapt it to a problem solution. We demonstrate with numerical experiments that combination of all three methods is required for robust meshing of complex engineering models. The key to successful mesh generation is the high-quality of the triangles in the initial front. We use a black-box technique to improve surface meshes exported from an unattainable CAD system. The initial surface mesh is refined into a shape-regular triangulation which approximates the boundary with the same accuracy as the CAD mesh. The DT method adds robustness to the AFT. The resulting mesh is topologically correct but may contain a few slivers. The MBA uses seven local operations to modify the mesh topology. It improves significantly the mesh quality. The MBA method is also used to adapt the mesh to a problem solution to minimize computational resources required for solving the problem. The MBA has a solid theoretical background. In the first two experiments, we consider the convection-diffusion and elasticity problems. We demonstrate the optimal reduction rate of the discretization error on a sequence of adaptive strongly anisotropic meshes. The key element of the MBA method is construction of a tensor metric from hierarchical edge-based error estimates. We conclude that the quasi-optimal mesh must be quasi-uniform in this metric. All numerical experiments are based on the publicly available Ani3D package, the collection of advanced numerical instruments.

99 GENERAL AND MISCELLANEOUS↗

Evaluation of accuracy and convergence of numerical coupling approaches for poroelasticity benchmark problems

Accurate modeling of subsurface flow and transport processes is vital as the prevalence of subsurface activities such as carbon sequestration, geothermal recovery, and nuclear waste disposal increases. Computational modeling of these problems leverages poroelasticity theory, which describes coupled fluid flow and mechanical deformation. Although fully coupled monolithic schemes are accurate for coupled problems, they can demand significant computational resources for large problems. In this work, a fixed stress scheme is implemented into the Sandia Sierra Multiphysics toolkit. Two implementation methods, along with the fully coupled method, are verified with one-dimensional (1D) Terzaghi, 2D Mandel, and 3D Cryer sphere benchmark problems. The impact of a range of material parameters and convergence tolerances on numerical accuracy and efficiency was evaluated. Overall the fixed stress schemes achieved acceptable numerical accuracy and efficiency compared to the fully coupled scheme. However, the accuracy of the fixed stress scheme tends to decrease with low permeable cases, requiring the finer tolerance to achieve a desired numerical accuracy. For the fully coupled scheme, high numerical accuracy was observed in most of cases except a low permeability case where an order of magnitude finer tolerance was required for accurate results. Finally, a two-layer Terzaghi problem and an injection–production well system were used to demonstrate the applicability of findings from the benchmark problems for more realistic conditions over a range of permeability. Simulation results suggest that the fixed stress scheme provides accurate solutions for all cases considered with the proper adjustment of the tolerance. Furthermore, this work clearly demonstrates the robustness of the fixed stress scheme for coupled poroelastic problems, while a cautious selection of numerical tolerance may be required under certain conditions with low permeable materials.

58 GEOSCIENCES↗

Accelerating Flash-X Simulations with Asynchronous I/O

Most high-fidelity physics simulation codes, such as Flash-X, need to save intermediate results (checkpoint files) to restart or gain insights into the evolution of the simulation. These simulation codes save such intermediate files synchronously, where computation is stalled while the data is written to storage. Depending on the problem size and computational requirements, this file write time can be a substantial portion of the total simulation time. In order to hide the I/O latency of checkpointing, asynchronous I/O methods have been introduced. These methods use background threads for performing I/O while the main threads continue with the simulation. The usage of background threads can compete for resources on the node as well as with communication. In this paper, we evaluate the overheads and the overall benefit of asynchronous I/O in HDF5 to simulations. Results from real-world high-fidelity simulations on the Summit supercomputer show that I/O operation is overlapped with application communication or computation or both, effectively hiding some or all of the I/O latency. Our evaluation shows that while using asynchronous I/O adds overhead to the application, the I/O time reduction is more significant, resulting in overall up to 1.5X performance speedup.

Jain, Rajeev↗

PAGOSA Mesh Block Calculator

A method for automatically generating the “mesh namelist block” portion of a PAGOSA input file, which specifies the boundaries and zone sizes of the computational mesh, has been developed. This application standardizes the mesh block for 2-, and 3-dimensional problems and is computed after the user specifies the extent and resolution of the mesh and the number of processors which will be used to run the problem. The inputs may be provided directly through a series of command-line guided questions, or a separate input file. The mesh block is written to both standard output and to disk.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantum Computing and Cryptography: Analysis, Risks, and Recommendations for Decisionmakers

Some influential American policymakers, scholars, and analysts are extremely concerned with the effects that quantum computing will have on national security. Similar to the way space technology was viewed in the context of the US-Soviet rivalry in the Cold War, they view scientific advancement in quantum computing as a race with significant national security consequences and a part of the emerging US-China rivalry. It is claimed that the winner of this race will be able to thwart all the cryptographic efforts of the loser and gain unfettered access to any state secret of the losing government. Additionally, it is suggested that the winner will be able to protect their secrets with a higher level of security than contemporary cryptography guarantees at the moment. This paper argues that these three claims are considerably overstated, and that policymakers and scholars should shift focus to a different national security problem that quantum computing will create. Maintaining the long-term security of secret information secured by contemporary cryptographic protections, which will fail against an attack by a future quantum computer, is the predominant challenge needing attention. This paper takes a technically-informed approach to this issue. It first lays out the national security problems that are envisioned in much of the current discourse surrounding quantum computing. Then, it will assess the technical advantages that quantum computers will have over classical computers in the field of cryptography. Next, it will provide an explanation of the specific ways that the technical realities of quantum computing are inconsistent with the predominant areas of concern. Following, it will highlight the more pressing national security problem posed by quantum computing that the public discussion has, for the most part, missed. The piece will conclude with recommendations for how to mitigate this issue.

97 MATHEMATICS AND COMPUTING↗

Evaluating the Computational Requirements of using SVM software to train Data-Intensive Problems

Support vector machine (SVM) technology is a growing class of computational algorithms for solving classification problems using supervised learning. There are many freely available SVM codes with implementations of varying granularity in the core optimization task. The performance of SVM implementations is related to four key elements; (1) the size and dimension of the data set on which they are operating, (2) the granularity of their core SVM optimization implementation, (3) the kernel transformation applied to the data, and the (4) underlying hardware on which the implementation is running. To assess the performance of different SVM implementations, several freely available codes representing the spectrum of optimization granularity were built on a variety of hardware—two linux clusters, and a shared memory machine. Binary classifiers were trained on datasets of varying size containing anywhere from a few hundred to over 50,000 vectors. Performance of the methods was measured in terms of wall-clock time for training, statistical quality of the resulting classifier, hardware performance (memory footprint, memory bandwidth, floating point unit usage, I/O bandwidth, and instruction stalls), robustness and portability.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Combining Hadoop with MPI to Solve Metagenomics Problems that are both Data- and Compute-intensive

Metagenomics, the study of all microbial species cohabitants in an environment, usually produces large amount of sequence data varying from several GBs to a few TBs. Analyzing metagenomics data includes both data-intensive and compute-intensive steps, making the entire process hard to scale. Here we aim to optimize a metagenomics application that partitions the shortgun metagenomics sequences based on their species of origin. Our solution combines MapReduce-based BioPig analytic toolkit with MPI to provide scalability in respective to both data and compute. We also made some improvements to the existing BioPig toolkit by using simplified data types and compressed k-mer storage. These optimizations leads up to 193× speedup for the computing-intensive step and 9.6× speedup over the entire pipeline. Our optimized application is also capable of processing datasets that are 16 times larger on the same hardware platform. These conclusions indicate integrating heterogeneous technologies such as Hadoop and MPI is quite efficient to solve large genomics problems that are both data-intensive and compute-intensive.

97 MATHEMATICS AND COMPUTING↗

Algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations with the use of parallel computations

An algorithm for solving the linear Cauchy problem for large systems of ordinary differential equations is presented. The algorithm for systems of first-order differential equations is implemented in the EDELWEISS code with the possibility of parallel computations on supercomputers employing the MPI (Message Passing Interface) standard for the data exchange between parallel processes. The solution is represented by a series of orthogonal polynomials on the interval [0, 1]. The algorithm is characterized by simplicity and the possibility to solve nonlinear problems with a correction of the operator in accordance with the solution obtained in the previous iterative process.

74 ATOMIC AND MOLECULAR PHYSICS↗

No Quantum Utility from Hadron Masses? No, Quantum Utility from Hadron Masses!

Is there a quantum utility in establishing the masses of hadrons? Here we show that the best response is that of Farrés, Capó, and Davis: perhaps, perhaps, perhaps. This is interesting given the general case that particle physics demands quantum computers. For stable hadrons, classical LQCD has achieved sub-percent precision with no sign problem, and quantum computers offer no advantage. For resonances, the Maiani-Testa theorem is an obstruction that quantum simulation is immune to. For nuclei, Wick contractions and signal-to-noise are genuine classical barriers. Underlying these cases is a unified picture connecting the sign problem to Wigner negativity and T gate cost. This manuscript was drafted from extensive interaction with \textsc{Claude}.

Lamm, Henry [Fermilab] (ORCID:0000000330330791)↗

UNEDF: Advanced Scientific Computing Transforms the Low-Energy Nuclear Many-Body Problem

The UNEDF SciDAC collaboration of nuclear theorists, applied mathematicians, and computer scientists is developing a comprehensive description of nuclei and their reactions that delivers maximum predictive power with quantified uncertainties. This paper illustrates significant milestones accomplished by UNEDF through integration of the theoretical approaches, advanced numerical algorithms, and leadership class computational resources.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

On the benefit of using both hand calculation methods and computer experiments algorithms to solve complex nuclear criticality safety problems - 14299

A companion paper shows the 'anomalies', and even the safety issues, that may be raised by the very usual problem of making safe a fissile mass inside a controlled geometry. These anomalies mainly come from the solving of such problems which belong to the mathematical family of 'robust inversion' including two inversion parameters (the fissile mass and the geometry) and one nuisance parameter (the moderation ratio of the fissile material). Since a 'brute force' method of resolution requires a lot of calculations and since a 'smart' method of resolution requires a lot of engineer time, it is tempting to solve these problems by a 'custom made' approach rather than to achieve a 'whole' resolution. The present paper shows how one can use a hand calculation method (derivation of the one-speed diffusion theory) to perform the whole resolution of such kind of problems with a minimum calculations and human efforts. The powerful capability of predicting the 'anomalies' highlighted in the companion paper is shown. Then the limitations of such a method are discussed: limitation in the geometry of the problem and bias in absolute values prediction. Finally, new algorithms of computer experiments design, dedicated to solve robust inversion problems and based on Kriging surrogates, are tested to solve these problems with limiting calculations and human efforts. The performance of these new algorithms may supplement the one-speed diffusion theory limitations. (authors)

42 ENGINEERING↗