Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem Solving”

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 613 records · Page 34

Estimation of extreme temperatures in direct solar methane pyrolysis within a porous medium

Porous media have wide application in renewable energy conversion processes, such as solar-thermal fuels production and decarbonization. Heat transport mechanisms within porous media can be highly complex, particularly under extreme conditions encountered in concentrated solar thermal reactors in which direct measurement of temperature is challenging. Here, we implement and report an inverse heat conduction model to estimate the temperature distribution throughout a porous substrate domain in a direct solar methane pyrolysis process. By solving a two-dimensional heat transfer problem and applying an inverse optimization algorithm, we estimate the quasi-steady state spatial temperature distribution in a fibrous porous carbon substrate. The results are validated indirectly by experimentally measured graphite deposition and a simplified reaction kinetic model.

finite difference method↗

A Domain-Decomposed A-ϕ Formulation Based on Lagrange Multipliers for Low-Frequency Problems

A domain-decomposed A-ϕ formulation based on Lagrange multipliers is proposed to simulate low-frequency elec- tromagnetic problems. This method partitions the computational domain into smaller subdomains, allowing each subdomain to be independently formulated using Lagrange multipliers as Dirichlet boundary conditions, while ensuring continuity of the fields across the interfaces. A mixed finite element method, utilizing both vector and scalar basis functions, is employed to discretize the formulation, resulting in a global system to be solved. The proposed method is validated using TEAM Problem 7 at 50 Hz, demonstrating its effectiveness in handling complex geometries and addressing the low-frequency breakdown issues commonly encountered in traditional finite element methods.

Hossain, Amzad↗

Robust Optimal Experimental Design of Infinite-Dimensional Bayesian Nonlinear Inverse Problems

Abstract. We consider robust optimal experimental design (ROED) for nonlinear Bayesian inverse problems governed by partial differential equations (PDEs). An optimal design is one that maximizes some utility quantifying the quality of the solution of an inverse problem. However, the optimal design is dependent on elements of the inverse problem such as the simulation model, the prior, or the measurement error model. ROED aims to produce an optimal design that is aware of the additional uncertainties encoded in the inverse problem and remains optimal even after variations in them. We follow a worst-case scenario approach to develop a new framework for robust optimal design of nonlinear Bayesian inverse problems. The proposed framework (a) is scalable and designed for infinite-dimensional Bayesian nonlinear inverse problems constrained by PDEs; (b) develops efficient approximations of the utility, namely the expected information gain; (c) employs eigenvalue sensitivity techniques to develop analytical forms and efficient evaluation methods of the gradient of the utility with respect to the uncertainties against which we wish to be robust; and (d) employs a probabilistic optimization paradigm that properly defines and efficiently solves the resulting combinatorial max-min optimization problem. The effectiveness of the proposed approach is illustrated for optimal sensor placement problem in an inverse problem governed by an elliptic PDE.

Chowdhary, Abhijit↗

Machine learning models for PDE constrained optimization

Partial differential equation (PDE)-constrained optimization problems arise in a variety of scientific and engineering applications, such as topology optimization, electrodynamics, fluid dynamics, and structural dynamics. However, these problems are often challenging and computationally expensive to solve, due to the need to solve the PDEs within the optimization loop. One approach to reducing the computational cost of these methods while providing convergence guarantees is through inexact trust region methods; this method uses lower fidelity solutions of the PDE at early stages of the optimization and adjusts the required accuracy of inexact PDE solvers as the optimization progresses. In this work, we explore the use of machine learning based surrogate models with these inexact trust region methods. We first demonstrate the potential of this approach by using Gaussian processes as the surrogate model and test this on a simple PDE-constrained optimization problem. We then document explorations into improving the computational costs of evolutional deep neural network / neural Galerkin methods, with the eventual goal of using these methods with the inexact trust region algorithms. We are able to speed up these approaches, albeit at the cost of lower accuracy.

97 MATHEMATICS AND COMPUTING↗

Ab initio many-fermion structure calculations on a quantum computer

To overcome the limitations of existing algorithms for solving self-bound quantum many-body problems—such as those encountered in nuclear and particle physics—that access only a restricted subset of energy levels and provide limited structural information, we introduce and demonstrate a novel quantum-classical approach capable of resolving the complete bound-state spectrum. This method also provides the total angular momentum 𝐽 associated with each eigenstate. Here, our approach is based on expressing the Hamiltonian in second-quantized form within a novel input model combined with a scan scheme, enabling broad applicability to configuration-interaction calculations across diverse fields. We apply this hybrid method to compute, for the first time, the bound-state spectrum together with corresponding 𝐽 values of 20 O using a realistic strong-interaction Hamiltonian. Our approach applies to hadron spectra and 𝐽 values solved in the relativistic basis light-front quantization approach.

Du, Weijie [Chinese Academy of Sciences (CAS), Lan↗

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

Self-consistent mean-field quantum approximate optimization

We introduce a self-consistent mean-field quantum optimization algorithm that approximates the ground state of classical Ising Hamiltonians. The algorithm decomposes the problem into independent subproblems and treats the interactions between them in a mean-field manner. These interactions are captured by a common environment, constructed self-consistently through a variational quantum circuit, and which modifies the subproblems to account for mutual influence while maintaining computational independence. Consequently, subproblems can be solved individually, avoiding the computational cost of the full problem. We explore the properties of the generated environment and assess the algorithm's performance through extensive numerical simulations on Sherrington-Kirkpatrick spin glasses. Furthermore, we apply it experimentally to a weighted maximum clique problem applied to molecular docking. This framework enables the solution of problems that would otherwise exceed the qubit and gate counts of current quantum hardware.

Dupont, Maxime [Rigetti Computing] (ORCID:00000001↗

SUNDIALS time integrators for exascale applications with many independent systems of ordinary differential equations

Many complex systems can be accurately modeled as a set of coupled time-dependent partial differential equations (PDEs). However, solving such equations can be prohibitively expensive, easily taxing the world’s largest supercomputers. One pragmatic strategy for attacking such problems is to split the PDEs into components that can more easily be solved in isolation. This operator splitting approach is used ubiquitously across scientific domains, and in many cases leads to a set of ordinary differential equations (ODEs) that need to be solved as part of a larger “outer-loop” time-stepping approach. The SUNDIALS library provides a plethora of robust time integration algorithms for solving ODEs, and the U.S. Department of Energy Exascale Computing Project (ECP) has supported its extension to applications on exascale-capable computing hardware. In this paper, we highlight some SUNDIALS capabilities and its deployment in combustion and cosmology application codes (Pele and Nyx, respectively) where operator splitting gives rise to numerous, small ODE systems that must be solved concurrently.

97 MATHEMATICS AND COMPUTING↗

True random number generation using the spin crossover in LaCoO 3

While digital computers rely on software-generated pseudo-random number generators, hardware-based true random number generators (TRNGs), which employ the natural physics of the underlying hardware, provide true stochasticity, and power and area efficiency. Research into TRNGs has extensively relied on the unpredictability in phase transitions, but such phase transitions are difficult to control given their often abrupt and narrow parameter ranges (e.g., occurring in a small temperature window). Here we demonstrate a TRNG based on self-oscillations in LaCoO 3 that is electrically biased within its spin crossover regime. The LaCoO 3 TRNG passes all standard tests of true stochasticity and uses only half the number of components compared to prior TRNGs. Assisted by phase field modeling, we show how spin crossovers are fundamentally better in producing true stochasticity compared to traditional phase transitions. As a validation, by probabilistically solving the NP-hard max-cut problem in a memristor crossbar array using our TRNG as a source of the required stochasticity, we demonstrate solution quality exceeding that using software-generated randomness.

97 MATHEMATICS AND COMPUTING↗

Observation of the axion quasiparticle in 2D MnBi 2 Te 4

The axion is a hypothetical fundamental particle that is conjectured to correspond to the coherent oscillation of the θ field in quantum chromodynamics. Its existence would solve multiple fundamental questions, including the strong CP problem of quantum chromodynamics and dark matter, but the axion has never been detected. Electrodynamics of condensed-matter systems can also give rise to a similar θ, so far studied as a static, quantized value to characterize the topology of materials. Coherent oscillation of θ in condensed matter has been proposed to lead to physics directly analogous to the high-energy axion particle—the dynamical axion quasiparticle (DAQ). Here we report the observation of the DAQ in MnBi 2 Te 4 . By combining a two-dimensional electronic device with ultrafast pump–probe optics, we observe a coherent oscillation of θ at about 44 gigahertz, which is uniquely induced by its out-of-phase antiferromagnetic magnon. This represents direct evidence for the presence of the DAQ, which in two-dimensional MnBi 2 Te 4 is found to arise from the magnon-induced coherent modulation of the Berry curvature. The DAQ also has implications in light–matter interaction and coherent antiferromagnetic spintronics, as it might lead to axion polaritons and electric control of ultrafast spin polarization. Finally, the DAQ could be used to detect axion particles. We estimate the detection frequency range and sensitivity in the millielectronvolt regime, which has so far been poorly explored.

topological matter↗

Randomized Adiabatic Quantum Linear Solver Algorithm with Optimal Complexity Scaling and Detailed Running Costs

Solving linear systems of equations is a fundamental problem with a wide variety of applications across many fields of science, and there is increasing effort to develop quantum linear solver algorithms. Subaşı et al. [Phys. Rev. Lett. 122, 060504 (2019)] proposed a randomized algorithm inspired by adiabatic quantum computing, based on a sequence of random Hamiltonian simulation steps, with suboptimal scaling in the condition number 𝜅 of the linear system and the target error 𝜖. Here we go beyond these results in several ways. Firstly, using filtering [Lin and Tong, Quantum 4, 361 (2020)] and Poissonization techniques [Cunningham and Roland, ArXiv:2406.03972 (2024)], the algorithm complexity is improved to the optimal scaling 𝑂⁡(𝜅⁢log (1/𝜖))—an exponential improvement in 𝜖, and a shaving of a log 𝜅 scaling factor in 𝜅. Secondly, the algorithm is further modified to achieve constant factor improvements, which are vital as we progress towards hardware implementations on fault-tolerant devices. We introduce a cheaper randomized walk operator method replacing Hamiltonian simulation—which also removes the need for potentially challenging classical precomputations; randomized routines are sampled over optimized random variables; circuit constructions are improved. We obtain a closed formula rigorously upper bounding the expected number of times one needs to apply a block-encoding of the linear system matrix to output a quantum state encoding the solution to the linear system. The upper bound is 837⁢𝜅 at 𝜖 = 10 −10 for Hermitian matrices.

97 MATHEMATICS AND COMPUTING↗

Consistent Second Moment Methods with Scalable Linear Solvers for Radiation Transport

Second moment methods (SMMs) are developed that are consistent with the discontinuous Galerkin spatial discretization of the discrete ordinates (or S\(_N\)) transport equations. The low-order (LO) diffusion system of equations is discretized with fully consistent P\(_1\), local discontinuous Galerkin (LDG), and interior penalty (IP) methods. A discrete residual approach is used to derive SMM correction terms that make each of the LO systems consistent with the high-order discretization. We show that the consistent methods are more accurate and have better solution quality than independently discretized LO systems, that they preserve the diffusion limit, and that the LDG and IP consistent SMMs can be scalably solved in parallel on a challenging, multimaterial benchmark problem.

97 MATHEMATICS AND COMPUTING↗

"Forward" Projects Boost U.S. Leadership in Advanced Computing and Artificial Intelligence

High-performance computing (HPC) has been an indispensable research tool for accessing physical realms difficult, or impossible, achieve with experiment alone. For several decades, the Department of Energy’s (DOE’s) Office of Science has deployed sophisticated HPC systems for solving the nation’s most pressing grand challenge problems in energy, climate change, and human health. In addition, DOE’s National Nuclear Security Administration (NNSA) has adeptly applied HPC in support of key national security objectives, such as nuclear science and stockpile modernization and stewardship. Over time, HPC systems have become increasingly more complex and capable, and as each new machine has come online, scientists and engineers have taken advantage of vast increases in compute power to accelerate scientific discoveries and engineering innovation.

42 ENGINEERING↗

Grid Expansion Optimal Planning Tools (GridEO): Manual for Users and Developers

This report describes Grid Expansion Optimal Planning Tools (GridEO). GridEO is a Python package for electric power grid capacity expansion modeling. With GridEO, the user can build and solve instances of the Capacity Expansion Planning (CEP) problem to determine an optimal plan of investment in capacity of various types of power grid equipment.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Fast and robust strategies for large-scale mixed-integer SCOPF

This project develops scalable, computationally efficient algorithms to solve realistic large-scale power system optimization problems, including systems with more than 8,000 buses, as part of a larger series of competitions run by ARPA-E. These problems are critical because the secure and reliable operation of the power grid is becoming increasingly challenging, especially under conditions of increased uncertainty and variability. The economic feasibility of our methods is high, given that they are purely software-based solutions designed to operate power grids more efficiently. The technical effectiveness balances heuristics and approximations to provide a trade-off between speed and accuracy.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Simulating Magnetic Reconnection in ‘Two Ribbon’ Type Solar Flares

Magnetic reconnection is an astrophysical process where neighboring magnetic field lines, facing anti-parallel, are reconfigured. This reconfiguration results in built up magnetic energy being explosively released as it is being converted to plasma kinetic and thermal energies. There are various kinds of simulations used to simulation reconnection; our work begins with Athena++, a magnetohydrodynamic (MHD) simulation code typically used for astrophysical problems, and a reconnection specific code file. The resistive MHD equations are solved with Riemann solvers. There was an initial test run without modifying the code to understand the dynamics of the simulation. We expand on the original reconnection problem file by implementing a radiative cooling term specific to the corona. The radiative cooling is theorized to have an effect on solar coronal plasma and magnetic reconnection dynamics. The cooling term will be tested with various parameters and compared to the case without cooling to study these dynamics. The condensation found in only the with cooling case emphasizes the importance of implementing this feature and will be later tested with a thermal conduction term. We want to determine the parameter regime where non-equilibrium cooling will be important for the reconnection dynamics.

79 ASTRONOMY AND ASTROPHYSICS↗

Algebraic Multigrid with Filtering: An Efficient Preconditioner for Interior Point Methods in Large-Scale Contact Mechanics Optimization

Large-scale contact mechanics simulations are crucial in many engineering fields such as structural design and manufacturing. In the frictionless case, contact can be modeled by minimizing an energy functional; however, these problems are often nonlinear, nonconvex, and increasingly difficult to solve as mesh resolution increases. In this work, we employ a Newton-based interior-point (IP) filter line-search method, an effective approach for large-scale constrained optimization. While this method converges rapidly, each iteration requires solving a large saddle-point linear system that becomes ill-conditioned as the optimization process converges, largely due to IP treatment of the contact constraints. Such ill-conditioning can hinder solver scalability and increase iteration counts with mesh refinement. Here, to address this, we introduce a novel preconditioner, algebraic multigrid with filtering (AMGF), tailored to the Schur complement of the saddle-point system. Building on the classical AMG solver, commonly used for elasticity, we augment it with a specialized subspace correction that filters near null space components introduced by contact interface constraints. Through theoretical analysis and numerical experiments on a range of linear and nonlinear contact problems, we demonstrate that the proposed solver achieves mesh independent convergence and maintains robustness against the ill-conditioning that notoriously plagues IP methods. These results indicate that AMGF makes contact mechanics simulations more tractable and broadens the applicability of Newton-based IP methods in challenging engineering scenarios. More broadly, AMGF is well suited for problems, optimization or otherwise, where solver performance is limited by a low-dimensional subspace, such as those arising from localized constraints, interface conditions, or model heterogeneities. This makes the method widely applicable beyond contact mechanics and constrained optimization.

Mathematics and Computing↗