Search NASA⌕ Search

SEARCH · Search NASA

Results for “problem solving complexity”

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 397 records · Page 22

Optimal polynomial based quantum eigenstate filtering with application to solving quantum linear systems

We present a quantum eigenstate filtering algorithm based on quantum signal processing (QSP) and minimax polynomials. The algorithm allows us to efficiently prepare a target eigenstate of a given Hamiltonian, if we have access to an initial state with non-trivial overlap with the target eigenstate and have a reasonable lower bound for the spectral gap. We apply this algorithm to the quantum linear system problem (QLSP), and present two algorithms based on quantum adiabatic computing (AQC) and quantum Zeno effect respectively. Both algorithms prepare the final solution as a pure state, and achieves the near optimal $\mathcal{\tilde{O}}$(dκlog(1/ϵ)) query complexity for a d -sparse matrix, where κ is the condition number, and ϵ is the desired precision. Neither algorithm uses phase estimation or amplitude amplification.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Distributionally Robust Optimization Framework for Stochastic Assessment of Power System Flexibility in Economic Dispatch

Given the complexity of power systems, particularly the high-dimensional variability of net loads, accurately depicting the entire operational range of net loads poses a challenge. To address this, recent methodologies have sought to gauge the maximum range of net load uncertainty across all buses. In this paper, we consider the stochastic nature of the net load and introduce a distributionally robust optimization framework that assesses system flexibility stochastically, accommodating a minimal extent of system violations. We verify the proposed method by solving the flexibility of the economic dispatch problem on four distinct IEEE standard test systems. Compared to traditional deterministic flexibility evaluations, our approach consistently yields less conservative flexibility outcomes.

distributionally robust optimization↗

Sparse Approximate Multifrontal Factorization with Composite Compression Methods

This article presents a fast and approximate multifrontal solver for large sparse linear systems. In a recent work by Liu et al., we showed the efficiency of a multifrontal solver leveraging the butterfly algorithm and its hierarchical matrix extension, HODBF (hierarchical off-diagonal butterfly) compression to compress large frontal matrices. The resulting multifrontal solver can attain quasi-linear computation and memory complexity when applied to sparse linear systems arising from spatial discretization of high-frequency wave equations. To further reduce the overall number of operations and especially the factorization memory usage to scale to larger problem sizes, in this article we develop a composite multifrontal solver that employs the HODBF format for large-sized fronts, a reduced-memory version of the nonhierarchical block low-rank format for medium-sized fronts, and a lossy compression format for small-sized fronts. This allows us to solve sparse linear systems of dimension up to 2.7 × larger than before and leads to a memory consumption that is reduced by 70% while ensuring the same execution time. The code is made publicly available in GitHub.

97 MATHEMATICS AND COMPUTING↗

Sequential ensemble transform for Bayesian inverse problems

In this work, we present the Sequential Ensemble Transform (SET) method, an approach for generating approximate samples from a Bayesian posterior distribution. The method explores the posterior distribution by solving a sequence of discrete optimal transport problems to produce a series of transport plans which map prior samples to posterior samples. We prove that the sequence of Dirac mixture distributions produced by the SET method converges weakly to the true posterior as the sample size approaches infinity. Furthermore, our numerical results indicate that, when compared to standard Sequential Monte Carlo (SMC) methods, the SET approach is more robust to the choice of Markov mutation kernels and requires less computational efforts to reach a similar accuracy when used to explore complex posterior distributions. Finally, we describe adaptive schemes that allow to completely automate the use of the SET method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Biochemical Process Modeling and Simulation (BPMS)

The Biochemical Process Modeling and Simulation project aims to reduce the cost and time of research by applying theory, modeling, and simulation to the most relevant bottlenecks in the biochemical process. We use molecular modeling, quantum mechanics, metabolic modeling, fluid dynamics, and reaction-diffusion methods in close collaboration with pretreatment, hydrolysis, upgrading, and TEA. The project's outcomes are increased yields and efficiency of the biochemical process, added value to products, and reduced price of fuels by specifically targeting catalytic efficiency, reactor design, enzyme efficiency, and microbial design. We work closely with experimental projects to identify problems and iterate with experiments to find and refine solutions. By working with experimentalists, we decide on problems that can be solved with simulation that could otherwise not be solved or would take too long with experiment alone to reach BETO's targets. Over the years, we have produced solutions that have resulted in determining the most likely fatty-acid derivative for passive transport out of bacteria that upgrade biomass, and we have also designed enzyme mutations for enhanced lignin upgrading. Metabolic models have been developed to tune the activity of 2,3 butanediol production for the 2030 target. A computational method to deliver understanding of how complex omics data can be interpreted in the metabolic pathways of organisms used in the Agile Biofoundry. We have found methods to overcome specific barriers and continue to develop those methods. Our reactor studies have guided the design of both the microbes and reactors for aerobic and micro-aerobic production at all scales and have been instrumental in improving the accuracy of techno-economic analysis models. This project is essential in the process of selecting the final processes for 2030 SAF production targets. More specifically, recently, we have: 1) Predicted the strength of the basic structural interactions in commodity plastics to provide guidance for plastics upcycling strategies. 2) Developed computational tool to improve the characterization of lignin-derived compounds 3) Developed new methodologies to enable Machine Learning-based Directed Evolution for protein engineering. 4) Developed Machine Learning methods to predict protein promiscuity and mutations to further improve microbial and enzymatic driven processes and demonstrated the utility of ML approaches to engineering proteins from sparse experimental datasets. 5) Developed new methods to enable high-fidelity simulation of aerobic fermentation at industrial scale and resolving mismatch of time scales through subcycling/operator splitting 7) Identified the difficulty in preventing local high-oxygen conditions in industrial bubble columns, which leads to less-desirable acetoin production, suggesting future research directions in alternative reactor configurations (e.g loop reactors, shallow-channel reactors).

BIOMASS FUELS↗

Inversion of downhole electrical measurements for proppant mapping using very fast simulated annealing

Proppant mapping is critical for optimizing fracture treatment design and improving wells’ productivity. An electrode-based resistivity tool concept was developed earlier for proppant mapping in cased-hole wells. An array of insulating gaps is installed and cemented in place as a permanent part of the casing string. The electrical measurements are performed by imposing a voltage across each insulating gap, one at a time, before and after hydraulic fracture operations. The voltages across other insulating gaps near the transmitter gap are recorded. The method relies on direct excitation of the casing, which is expected to overcome the severe limitations of induction tools in cased-hole wells. A forward model based on a finite volume method has been developed to simulate the tool’s response to one or multiple fractures. To enable the implementation of such a practical system in multistage fractured horizontal wells, a fast and robust inversion approach is required. To that end, we have developed a divide-and-conquer approach based on a global optimization algorithm very fast simulated annealing (VFSA). Specifically, the original inverse problem is divided into subproblems and each subproblem can be solved separately using VFSA. The results indicate that our approach can invert the data and output widths and radii of multiple fractures without requiring a large number of forward simulations. The robustness of the inverse solver is also tested by adding Gaussian noise to the synthetic data. We tested example cases that demonstrate that when up to 5% noise is introduced, VFSA still provides very accurate inversion results with moderate uncertainties. Inversion results with some more realistic conditions, e.g., tilted fractures, complex fractures, and so on, are also presented.

Geochemistry & Geophysics↗

A general-purpose method for Pareto optimal placement of flow rate and concentration sensors in networked systems – With application to wastewater treatment plants

The advent of affordable computing, low-cost sensor hardware, and high-speed and reliable communications have spurred installation of ubiquitous sensors in complex engineered systems. However, ensuring reliable data quality remains a challenge. Exploitation of redundancy among sensor signals can help improving the precision of measured variables, detecting the presence of gross errors, and identifying faulty sensors. The cost of sensor ownership, maintenance efforts in particular, can still be cost-prohibitive however. Maximizing the ability to assess and control data quality while minimizing the cost of ownership thus requires a careful sensor placement. To solve this challenge, in this work we develop a generally applicable method to solve the multi-objective sensor placement problem in systems governed by linear and bilinear balance equations. Importantly, the method computes all Pareto-optimal sensor layouts with conventional computational resources and requires no information about the expected sensor quality.

42 ENGINEERING↗

Bayesian optimization with active learning of design constraints using an entropy-based approach

Abstract The design of alloys for use in gas turbine engine blades is a complex task that involves balancing multiple objectives and constraints. Candidate alloys must be ductile at room temperature and retain their yield strength at high temperatures, as well as possess low density, high thermal conductivity, narrow solidification range, high solidus temperature, and a small linear thermal expansion coefficient. Traditional Integrated Computational Materials Engineering (ICME) methods are not sufficient for exploring combinatorially-vast alloy design spaces, optimizing for multiple objectives, nor ensuring that multiple constraints are met. In this work, we propose an approach for solving a constrained multi-objective materials design problem over a large composition space, specifically focusing on the Mo-Nb-Ti-V-W system as a representative Multi-Principal Element Alloy (MPEA) for potential use in next-generation gas turbine blades. Our approach is able to learn and adapt to unknown constraints in the design space, making decisions about the best course of action at each stage of the process. As a result, we identify 21 Pareto-optimal alloys that satisfy all constraints. Our proposed framework is significantly more efficient and faster than a brute force approach.

36 MATERIALS SCIENCE↗

Inferring adversarial behaviour in cyber‐physical power systems using a Bayesian attack graph approach

Abstract Highly connected smart power systems are subject to increasing vulnerabilities and adversarial threats. Defenders need to proactively identify and defend new high‐risk access paths of cyber intruders that target grid resilience. However, cyber‐physical risk analysis and defense in power systems often requires making assumptions on adversary behaviour, and these assumptions can be wrong. Thus, this work examines the problem of inferring adversary behaviour in power systems to improve risk‐based defense and detection. To achieve this, a Bayesian approach for inference of the Cyber‐Adversarial Power System (Bayes‐CAPS) is proposed that uses Bayesian networks (BNs) to define and solve the inference problem of adversarial movement in the grid infrastructure towards targets of physical impact. Specifically, BNs are used to compute conditional probabilities to queries, such as the probability of observing an event given a set of alerts. Bayes‐CAPS builds initial Bayesian attack graphs for realistic power system cyber‐physical models. These models are adaptable using collected data from the system under study. Then, Bayes‐CAPS computes the posterior probabilities of the occurrence of a security breach event in power systems. Experiments are conducted that evaluate algorithms based on time complexity, accuracy and impact of evidence for different scales and densities of network. The performance is evaluated and compared for five realistic cyber‐physical power system models of increasing size and complexities ranging from 8 to 300 substations based on computation and accuracy impacts.

Sahu, Abhijeet↗

A mortar thermomechanical contact computational framework for nuclear fuel performance simulation

Nuclear fuel performance simulations involve the modeling of complex physical phenomena, ranging from fission gas release to fuel swelling and other temperature-induced effects. For light-water reactors (LWRs), swelling of the fuel and the pressure it imposes on the clad when they come into contact causes permanent clad deformation. Accurately characterizing the fuel-cladding interaction, which involves multiple physics, is essential to accurately simulate the fuel/cladding system. Thermomechanical modeling of this problem using a variationally consistent enforcement (e.g., a mortar approach) has been shown to improve the quality of results and facilitate convergence. Here, we present a general multiphysics computational framework for solving nuclear fuel problems using a mortar approach in BISON, a nuclear fuel performance code. In this study analyses show that using the mortar approach, which enables variationally consistent constraint enforcement, improves the quality of results as compared to the more commonly used node-on-face enforcement for representative LWR nuclear fuel simulations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

An Iterative Approach for Solving the SCOPF Problem Applying LP, SOCP, and NLP Subproblems

We propose to develop efficient algorithms and software for the SCOPF problem. We will employ an iterative approach that will: a) use linear subproblems and other active set filtering techniques to identify the most important contingencies and drastically reduce the SCOPF model size; b) solve SOCP relaxations of the reduced SCOPF to converge to the neighborhood of the global optimal solution and establish a lower bound on the solution, and; c) use a non-convex, nonlinear interior-point solver, Artelys Knitro, to converge quickly to the optimal solution. To identify the most effective approach, we will experiment with several techniques to identify the tradeoffs between contingency subproblem complexity and fast solvability.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Solving Hard Problems with AI: Dramatically Accelerating Drug Discovery Through A Unique Public-Private Partnership

Dramatic disruptions in technologies can result in the creation of new markets, the emergence of new paradigms, and the displacement of entrenched approaches and business models. This can be especially pronounced when multiple technologies converge to create something new. Today, artificial intelligence (“AI”) is acting as an accelerant for such technology transformations. Still, the scope and depth of its impact will depend in part on our ability to address challenging problems that are surfacing without solutions. Industries will pursue AI for their corporate missions and to create shareholder value. But the timescales and applications can be incongruent with important public needs and with the longer research horizons required to make real progress. Public-Private partnerships are an important mechanism for tackling these rapidly emerging new, complex, challenging problems. Finally, this paper examines our experience gained by creating a unique public-private partnership to apply AI to one example of a hard problem that is particularly timely today-- dramatically accelerating drug discovery.

59 BASIC BIOLOGICAL SCIENCES↗

Invertible neural networks for real-time control of extrusion additive manufacturing

Material extrusion additive manufacturing (AM) has enabled an elegant fabrication pathway for a vast material library. Nonetheless, each material requires optimization of printing parameters generally determined through significant trial-and-error testing. To eliminate arduous, iteration-based optimization approaches, many researchers have used machine learning (ML) algorithms which provide opportunities for automated process optimization. Here, in this work, we demonstrate the use of an ML-driven approach for real-time material extrusion print-parameter optimization through in-situ monitoring of printed line geometry. To do this, we use deep invertible neural networks (INNs) which can solve both forward and inverse, or optimization, problems using a single network. By combining in-situ computer vision and deep INNs, the printing parameters can be autonomously optimized to print a target line width in 1.2 s. Furthermore, defects that occur during printing can be rapidly identified and corrected autonomously. The methods developed and presented in this work eliminate user-intensive, time-consuming, and iterative parameter discovery approaches that currently limit accelerated implementation of extrusion-based AM processes. Furthermore, the presented approach can be generalized to provide real-time monitoring and optimization pathways for increasingly complex AM environments.

36 MATERIALS SCIENCE↗

Radiation Mapping for an Unmanned Aerial Vehicle: Development and Simulated Testing of Algorithms for Source Mapping and Navigation Path Generation

Image reconstruction algorithms were developed for radiation source mapping and used for generating the search path of a moving radiation detector, such as one onboard an unmanned aerial vehicle. Simulations consisted of first assuming radioactive sources of varying complexity and estimating the radiation fields that would then be produced by that source distribution. Next, the "measurements" that would result from a pair of adjacent spatial locations were computed. A crude estimate of the source distribution likely to have produced such "measurements" was reconstructed based upon the limited measurements. Location of the next "measurement" was then determined as halfway between the location of the estimated source and the current "measurement." With each additional sample, improved source distribution reconstructions were made and used to inform the immediate direction of detector motion. Source reconstruction or mapping was formulated as an inverse problem solved with either maximum a posteriori or least squares (LS) regression deconvolution methods. Different amounts of noise were added to the simulated "measurements," allowing evaluation of the methods' performances as functions of signal-to-noise ratio of the measured map. As expected, methods that promote sparsity were better suited in reconstructing point sources. Reliable prior information of the source distribution also improved the reconstruction results, especially with distributed sources. With a non-negative least square algorithm and the suggested paths it generated, location of sources was successfully estimated to an accuracy of 0.014 m within nine iterations in a single-source scenario and 12 iterations in a two-source scenario, given a 10% error on the integrated counts and a Poisson distribution of the noise associated with the measured counts.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Validation of NEAMS Tools Using MSRE Data

This report documents the benchmarks developed and performed for the tools and codes developed under the Nuclear Energy Advanced Modeling and Simulation (NEAMS) program utilizing the MSRE experiment data. There are three focus areas explored in this work: fuel evolution, CFD, and system transient analyses. Fuel depletion is important for MSR reactor physics and fuel cycle analysis. Fuel depletion capability is currently being developed in the Griffin reactor physics code. To support this, a benchmark problem is developed using the MSRE data and an existing depletion code with flowing fuel analysis functionality (ADDER) to validate this new capability in Griffin. The ADDER calculation is compared with the TRITON-MSR results as well as the MSRE experimental data. This benchmark can be directly used to verify and validate the Griffin fuel depletion capability in future years. For CFD simulation, the MSRE CAD model is obtained from the Copenhagen Atomics and a mesh is generated for the MSRE inlet plenum. The Nek5000 code will be employed to find the flow distribution in the MSRE inlet plenum based on the mesh generated. For system analysis, a simple benchmark problem for three types of MSR system transients is developed. The SAM and SPECTRA codes are used to solve the simple problem, and the results from the two codes agree well. The SAM code is also employed to obtain the frequency response of the MSRE system at the 5 and 8 MWt power levels. The results agree well with the experiment measurements. These verification and validation efforts gives SAM users more confidence in MSR system transient simulations using SAM. Lastly, the SAM-Griffin Multiphysics coupling work is initiated. A simple one-way coupling of evaluating the precursor drift effect on the MSRE k-eff is demonstrated. This preliminary coupling work serves as the basis for future more complex Multiphysics simulation and modelling.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Foundations of Molecular 'Isotomics'

The naturally occurring rare isotopes are versions of common elements, such as hydrogen, carbon and oxygen, that contain a larger than usual number of neutrons in their atomic nuclei and therefore are higher in mass than the common atoms of that element. Isotopes exist for most elements and are found in most natural and synthetic materials, but are uneven in their distribution because chemical and physical processes are isotope-selective (e.g., a chemical reaction may proceed more rapidly for one isotope than for another). For this reason, abundances of isotopes in a material of interest can provide a record, or ‘signature’ of various features of that material’s origin and history. These signatures have been used in the geo, life, chemical and physical sciences in a wide variety of ways over close to 8 decades. However, many such applications struggle to reach unique interpretations of isotopic data because multiple factors combine to control a given sample’s overall isotopic content. That is, the factors controlling isotopic content are too numerous and complex to fully constrain from a simple measurement of a material’s isotope abundances. However, the distribution of isotopes within materials, at molecular scales potentially provides a vastly larger number and diversity of constraints on the chemical and physical processes that comprise a material’s history. The rare isotopes may be concentrated into one atomic position in a molecule relative to another, some proportion of molecules in a sample may contain two or more rare isotopes, and those multiply-isotope-substituted forms of molecules may also have uneven distributions of those isotopes across individual atomic sites. For these reasons, even small, seemingly simple molecules, such as sugars, amino acids or drug compounds, actually exist in a vast number of isotopically unique forms (often millions or more), and each one of those forms is in some sense an independent ‘vote’ on that sample’s history. This project has focused on opening this rich archive of information by enabling the creation of routinely and widely applicable ways of measuring and interpreting isotopic structures of molecules. This work has included the development of core technologies and analytical methods, advancing fundamental understanding of the physical and chemical properties of isotopic versions of molecules, and conducting proof of concept studies of illustrative geochemical, cosmochemical and forensic problems in order to show how these technologies, methods and principles come together to solve problems in new ways. A key to the success of this project was the adaptation of ‘Fourier transform mass spectrometry’ (FTMS) to the task of precisely measuring proportions of the rare, naturally occurring isotopic forms of molecules. FTMS is a highly specialized form of mass spectrometry that traps ions within magnetic or electrostatic cavities and, effectively, ‘listens’ (through registering of subtle electrical signals) to the harmonic signals they make while rapidly orbiting within those cavities. These signals have periods that are a function of their mass and strength (or ‘loudness’) that is proportional to their abundances. Thus, these signals constrain relative amounts of molecules that differ in their mass due to various isotopic substitutions. This technology has been essential to the identification of organic molecules in the life, chemical and environmental sciences for over 4 decades, but generally has lacked the control, stability and precision to meaningfully measure rare isotope forms of molecules. This project’s most fundamental contribution has been to modify FTMS, both in terms of hardware and methods, to enable such measurements. The raw data of molecular isotopic structure is tremendously voluminous and complex, so another important activity of this project has been developing the theoretical and data-science tools needed to interpret the data generated by this new form of isotopic measurement. A particularly challenging part of this task has been predicting molecular isotopic structure, as only through the comparison of measurements with predictions can we make progress on hypothesis driven research questions. We have attacked this this prediction task through a combination of first-principles chemical-physics models of the effects of isotope substitution on molecule properties and data-science models that permit us to generalize that chemical physics to cases that have not yet been studied by detailed chemical physics theory. The proof of concept applications we have pursued over the course of this study include biological reactions of amino acids and other biomolecules, non-biological synthesis of organic molecules in extra-terrestrial settings such as meteorites, petroleum geoscience questions concerning the origin and evolution of natural gas, oil and kerogen compounds, and forensic questions such as the sourcing of chemical weapons. The successes of these applications have laid the groundwork for the next phase of this field’s development, which will include larger scale and more ambitious studies of molecular isotopic structure as a means of diagnosing human diseases, such as cancer, and reconstructing detailed interpretations of the origin and evolution of organic molecules in modern and geological environments.

Cesar, Jaime↗

A Scalable Space-Time Domain Decomposition Approach for Solving Large Scale Nonlinear Regularized Inverse Ill Posed Problems in 4D Variational Data Assimilation

We address the development of innovative algorithms designed to solve the strong-constraint Four Dimensional Variational Data Assimilation (4DVar DA) problems in large scale applications. We present a space-time decomposition approach which employs the whole domain decomposition, i.e. both along the spacial and temporal direction in the overlapping case, and the partitioning of both the solution and the operator. Starting from the global functional defined on the entire domain, we get to a sort of regularized local functionals on the set of sub domains providing the order reduction of both the predictive and the Data Assimilation models. The algorithm convergence is developed. Performance in terms of reduction of time complexity and algorithmic scalability is discussed on the Shallow Water Equations on the sphere. The number of state variables in the model, the number of observations in an assimilation cycle, as well as numerical parameters as the discretization step in time and in space domain are defined on the basis of discretization grid used by data available at repository Ocean Synthesis/Reanalysis Directory of Hamburg University.

97 MATHEMATICS AND COMPUTING↗

An Efficient Numerical Algorithm for Solving Coupled Time-Dependent Ginzburg-Landau Equation for Superconductivity and Elasticity

A decoupled finite element algorithm is developed for simulating the vortex dynamics on an elastic superconductor which couples the time-dependent Ginzburg- Landau equation with the complex-valued superconducting order parameter and the vector-valued magnetic potential, and the elasticity equation. We present an iterative algorithm for the decoupled system arising from the time and spatial discretization using a combination of preconditioner, algebraic multigrid method (AMG) and preconditioned conjugate gradient method (PCG). The iterative algorithm allows us to perform large-scale three-dimensional simulations of mesoscale pattern formation during superconducting phase transitions with arbitrary elastic boundary conditions. Here, the performance and efficiency of the algorithm are numerically verified by several benchmark problems, exhibiting up to two orders of magnitude improvement depending on the scale of discrete system compared to the exact solver.

Efficiency↗