Optimal Scaling Quantum Linear-Systems Solver via Discrete Adiabatic Theorem
Not Available
SEARCH · Search NASA
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.
Not Available
Model reduction for dynamical systems is a promising approach for reducing the computational cost of large-scale physics-based simulations to enable high-fidelity models to be used in many- query (e.g., Bayesian inference) and near-real-time (e.g., fast-turnaround simulation) contexts. While model reduction works well for specialized problems such as linear time-invariant systems, it is much more difficult to obtain accurate, stable, and efficient reduced-order models (ROMs) for systems with general nonlinearities. This report describes several advances that enable nonlinear reduced-order models (ROMs) to be deployed in a variety of time-critical settings. First, we present an error bound for the Gauss-Newton with Approximated Tensors (GNAT) nonlinear model reduction technique. This bound allows the state-space error for the GNAT method to be quantified when applied with the backward Euler time-integration scheme. Second, we present a methodology for preserving classical Lagrangian structure in nonlinear model reduction. This technique guarantees that important properties--such as energy conservation and symplectic time-evolution maps--are preserved when performing model reduction for models described by a Lagrangian formalism (e.g., molecular dynamics, structural dynamics). Third, we present a novel technique for decreasing the temporal complexity --defined as the number of Newton-like iterations performed over the course of the simulation--by exploiting time-domain data. Fourth, we describe a novel method for refining projection-based reduced-order models a posteriori using a goal-oriented framework similar to mesh-adaptive h -refinement in finite elements. The technique allows the ROM to generate arbitrarily accurate solutions, thereby providing the ROM with a 'failsafe' mechanism in the event of insufficient training data. Finally, we present the reduced-order model error surrogate (ROMES) method for statistically quantifying reduced- order-model errors. This enables ROMs to be rigorously incorporated in uncertainty-quantification settings, as the error model can be treated as a source of epistemic uncertainty. This work was completed as part of a Truman Fellowship appointment. We note that much additional work was performed as part of the Fellowship. One salient project is the development of the Trilinos-based model-reduction software module Razor , which is currently bundled with the Albany PDE code and currently allows nonlinear reduced-order models to be constructed for any application supported in Albany. Other important projects include the following: 1. ROMES-equipped ROMs for Bayesian inference: K. Carlberg, M. Drohmann, F. Lu (Lawrence Berkeley National Laboratory), M. Morzfeld (Lawrence Berkeley National Laboratory). 2. ROM-enabled Krylov-subspace recycling: K. Carlberg, V. Forstall (University of Maryland), P. Tsuji, R. Tuminaro. 3. A pseudo balanced POD method using only dual snapshots: K. Carlberg, M. Sarovar. 4. An analysis of discrete v. continuous optimality in nonlinear model reduction: K. Carlberg, M. Barone, H. Antil (George Mason University). Journal articles for these projects are in progress at the time of this writing.
McCormick envelopes are a standard tool for deriving convex relaxations of optimization problems that involve polynomial terms. Such McCormick relaxations provide lower bounds, for example, in branch-and-bound procedures for mixed-integer nonlinear programs but have not gained much attention in PDE-constrained optimization so far. This lack of attention may be due to the distributed nature of such problems, which on the one hand leads to infinitely many linear constraints (generally state constraints that may be difficult to handle) in addition to the state equation for a pointwise formulation of the McCormick envelopes and renders bound-tightening procedures that successively improve the resulting convex relaxations computationally intractable. We analyze McCormick envelopes for a model problem class that is governed by a semilinear PDE involving a bilinearity and integrality constraints. We approximate the nonlinearity and in turn the McCormick envelopes by averaging the involved terms over the cells of a partition of the computational domain on which the PDE is defined. This yields convex relaxations that underestimate the original problem up to an a priori error estimate that depends on the mesh size of the discretization. These approximate McCormick relaxations can be improved by means of an optimization-based bound-tightening procedure. We show that their minimizers converge to minimizers to a limit problem with a pointwise formulation of the McCormick envelopes when driving the mesh size to zero. We provide a computational example, for which we certify all of our imposed assumptions. The results point to both the potential of the methodology and the gaps in the research that need to be closed. Our methodology provides a framework first for obtaining pointwise underestimators for nonconvexities and second for approximating them with finitely many linear inequalities in an infinite-dimensional setting.
Powder spreading precedes creation of every new layer in powder bed additive manufacturing (AM). The powder spreading process can lead to powder layer defects such as porosity, poor surface roughness and particle segregation. Therefore, the creation of homogeneous layers is the first task for optimal part printing. Discrete element methods (DEM) powder spreading simulations are typically limited to a single layer and/or small number of particles. Therefore, results from such model configurations may not be generalized to multiple layer processes. In this study, a computationally efficient multi-layer powder spreading DEM simulation model is proposed. The model is calibrated experimentally using static Angle of Repose measurements. The adhesion model parameter, cohesive energy density is related to adhesive surface energy and strain energy release rate parameters. The model results show that interaction between particle and the powder spreading rake leads to noticeable variation in packing density, surface roughness, dynamic angle of repose (AOR), particle size distribution, and particle segregation. Finally, the powder model is experimentally validated using a recoater spreading rig to measure the dynamic AOR at spreading speeds consistent with recoating speeds and layer heights used in AM processes.
Toroidal symmetry is an important concept for plasma confinement; it allows the existence of nested flux surface MHD equilibria and conserved invariants for particle motion. However, perfect symmetry is unachievable in realistic toroidal plasma devices. For example, tokamaks have toroidal ripple due to discrete field coils, optimized stellarators do not achieve exact quasi-symmetry, the plasma itself continually seeks lower energy states through helical 3D deformations, and reactors will likely have non-uniform distributions of ferritic steel near the plasma. Also, some level of designed-in 3D magnetic field structure is now anticipated for most concepts in order to provide the plasma control needed for a stable, steady-state fusion reactor. Such planned 3D field structures can take many forms, ranging from tokamaks with weak 3D edge localized mode suppression fields to stellarators with more dominant 3D field structures. This motivates the development of physics models that are applicable across the full range of 3D devices. Ultimately, the questions of how much symmetry breaking can be tolerated and how to optimize its design must be addressed for all fusion concepts. A closely coupled program of simulation, experimental validation, and design optimization is required to determine what forms and amplitudes of 3D shaping and symmetry breaking will be compatible with the requirements of future fusion reactors.
We present an approach in momentum (P) space for the accurate study of multiphoton and above-threshold ionization (ATI) dynamics of atomic systems driven by intense laser fields. In this approach, the electron wave function is calculated by solving the P-space time-dependent Schroedinger equation (TDSE) in a finite P-space volume under a simple zero asymptotic boundary condition. The P-space TDSE is propagated accurately and efficiently by means of the time-dependent generalized pseudospectral method with optimal momentum grid discretization and a split-operator time propagator in the energy representation. The differential ionization probabilities are calculated directly from the continuum-state wave function obtained by projecting the total electron wave function onto the continuum-state subspace using the projection operator constructed by the continuum eigenfunctions of the unperturbed Hamiltonian. As a case study, we apply this approach to the nonperturbative study of the multiphoton and ATI dynamics of a hydrogen atom exposed to intense short-wavelength laser fields. High-resolution photoelectron energy-angular distribution and ATI spectra have been obtained. We find that with the increase of the laser intensity, the photoelectron energy-angular distribution changes from circular to dumbbell shaped and is squeezed along the laser field direction. We also explore the change of the maximum photoelectron energy with laser intensity and strong-field atomic stabilization phenomenon in detail.
ParFELAG is a parallel distributed memory C++ library for numerical upscaling of finite element discretizations. It provides optimal complesity algorithms ro build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured mesh (under the assumption that the topology of the agglomerated entities is correct). Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.
The Testbed Environment for Space Situational Awareness (TESSA) is a modeling and simulation environment designed for efficient exploration of scenarios involving satellites and space debris and their detection by both ground and space-based radars and optical sensors. TESSA is a Parallelized Discrete Event Simulator optimized for deployment on a large cluster of high-performance computers running Linux. TESSA includes capabilities for predicting the future location of a satellite using the satellite’s current location and velocity, determining an object’s orbit from sensor data, finding new orbital objects, predicting close approaches, determining the probability of collisions, modeling radar and optical and dynamic sensors, and modeling the generation of debris. TESSA also includes a scalable visualization environment implemented as a post-processor on workstation-class platforms.
The virtual element method (VEM) is a numerical methodology for solving partial differential equations on unstructured polytopal meshes. In this work, we extend the nonconforming high-order formulation suitable to time-dependent diffusion problems with possibly nonlinear forcing terms. Coupling high-order virtual element formulations in space with time-marching schemes based on Backward Differention Formulas (BDFs) makes a fully discrete method with optimal order of convergence in the Method of Lines framework. We investigate and assess the performance of the method through theoretical analysis and a set of numerical experiments.
This report summarizes results from the fifteenth year (2006) of nutrient additions to the North Arm of Kootenay Lake and three years of nutrient additions to the South Arm. Experimental fertilization of the lake has been conducted using an adaptive management approach in an effort to restore lake productivity lost as a result of nutrient uptake in upstream reservoirs. The primary objective of the experiment is to restore kokanee (Oncorhynchus nerka) populations, which are the main food source for Gerrard rainbow trout (Oncorhynchus mykiss) and bull trout (Salvelinus confluentus). The quantity of agricultural grade liquid fertilizer (10-34-0, ammonium polyphosphate and 28-0-0, urea ammonium nitrate) added to the North Arm in 2006 was 44.7 tonnes of P and 248.4 tonnes of N. The total fertilizer load added to the South Arm was 257 tonnes of nitrogen; no P was added. Kootenay Lake has an area of 395 km{sup 2}, a maximum depth of 150 m, a mean depth of 94 m, and a water renewal time of approximately two years. Kootenay Lake is a monomictic lake, generally mixing from late fall to early spring and stratifying during the summer. Surface water temperatures generally exceed 20 C for only a few weeks in July. Results of oxygen profiles were similar to previous years with the lake being well oxygenated from the surface to the bottom depths at all stations. Similar to past years, Secchi disc measurements at all stations in 2006 indicate a typical seasonal pattern of decreasing depths associated with the spring phytoplankton bloom, followed by increasing depths as the bloom gradually decreases by the late summer and fall. Total phosphorus (TP) ranged from 2-7 {micro}g/L and tended to decrease as summer advanced. Over the sampling season dissolved inorganic nitrogen (DIN) concentrations decreased, with the decline corresponding to nitrate (the dominant component of DIN) being utilized by phytoplankton during summer stratification. Owing to the importance of epilimnetic nitrate that is required for optimal phytoplankton growth discrete depth water sampling occurred in 2006 to measure more accurately changes in the nitrate concentrations. As expected there was a seasonal decline in nitrate concentrations, thus supporting the strategy of increasing the nitrogen loading in both arms. These in-season changes emphasize the need for an adaptive management approach to ensure the nitrogen to phosphorus (N:P) ratio does not decrease below 15:1 (weight:weight) during the fertilizer application period. Phytoplankton composition determined from the integrated samples (0-20m) was dominated by diatoms, followed by cryptophytes and chrysophytes. The contribution of cryptophytes to total biomass was higher in 2006 than in 2005. Cryptophytes, considered being edible biomass for zooplankton and Daphnia spp., increased in 2006. Phytoplankton in the discrete depth samples (2, 5, 10, 15 and 20m) demonstrated a clear north to south gradient in average phytoplankton density and biomass among the three stations sampled, with highest values at the North Arm station (KLF 2) and lowest values in the most southern station in the South Arm (KLF 7). Populations were dominated by flagellates at all stations and depths in June and July, then dominated by diatoms in August and September in the North and South arms of the lake. There were no large bluegreen (cyanobacteria) populations in either arm of the lake in 2006. Seasonal average zooplankton abundance and biomass in both the main body of the lake and in the West Arm increased in 2006 compared to 2005. Zooplankton density was numerically dominated by copepods and biomass was dominated by Daphnia spp. The annual average mysid biomass data at deep stations indicated that the North Arm of Kootenay Lake was more productive than the South Arm in 2006. Mysid densities increased through the summer and declined in the winter; mean whole lake values remain within prefertilization densities. Kokanee escapement to Meadow Creek declined in 2006 to approximately 400,000 spawners. The Lardeau River escapement also declined with approximately 100,000 spawners. Escapement in the South Arm tributaries in 2006 was similar to 2005 with virtually no spawners. The mean size of female and male kokanee from Meadow Creek was larger than the past three years (24.9 cm and 25.2 cm, respectively) and larger than the long term average (25.2 cm). This is indicative of a density dependent growth response as a decline in in-lake abundance and returning spawners occurred. Spring hydroacoustic estimates indicated low densities of South Arm kokanee with most of the North Arm fry remaining at the most northerly stations. By the fall, the distribution of kokanee from the North Arm to the South Arm was fairly uniform, a normal occurrence in Kootenay Lake. Fall hydroacoustic estimates in 2006 increased to approximately 22 million kokanee.
ParFELAG is a parallel distributed memory C++ library for numerical upscaling of finite element discretizations. It provides optimal complesity algorithms ro build multilevel hierarchies and solvers that can be used for solving a wide class of partial differential equations (elliptic, hyperbolic, saddle point problems) on general unstructured mesh (under the assumption that the topology of the agglomerated entities is correct). Additionally, a novel multilevel solver for saddle point problems with divergence constraint is implemented.
We present an efficient computational approach to perform real-space electronic structure calculations using an adaptive higher-order finite-element discretization of Kohn–Sham density-functional theory (DFT). To this end, we develop an a priori mesh-adaption technique to construct a close to optimal finite-element discretization of the problem. We further propose an efficient solution strategy for solving the discrete eigenvalue problem by using spectral finite-elements in conjunction with Gauss–Lobatto quadrature, and a Chebyshev acceleration technique for computing the occupied eigenspace. The proposed approach has been observed to provide a staggering 100–200-fold computational advantage over the solution of a generalized eigenvalue problem. Using the proposed solution procedure, we investigate the computational efficiency afforded by higher-order finite-element discretizations of the Kohn–Sham DFT problem. Our studies suggest that staggering computational savings—of the order of 1000-fold—relative to linear finite-elements can be realized, for both all-electron and local pseudopotential calculations, by using higher-order finite-element discretizations. On all the benchmark systems studied, we observe diminishing returns in computational savings beyond the sixth-order for accuracies commensurate with chemical accuracy, suggesting that the hexic spectral-element may be an optimal choice for the finite-element discretization of the Kohn–Sham DFT problem. A comparative study of the computational efficiency of the proposed higher-order finite-element discretizations suggests that the performance of finite-element basis is competing with the plane-wave discretization for non-periodic local pseudopotential calculations, and compares to the Gaussian basis for all-electron calculations to within an order of magnitude. Further, we demonstrate the capability of the proposed approach to compute the electronic structure of a metallic system containing 1688 atoms using modest computational resources, and good scalability of the present implementation up to 192 processors.
Not Available
Explore the source record for details and available documents.
Recent developments have shown pressure/vacuum swing adsorption (PSA/VSA) to be a promising option to effectively capture CO2 from flue gas streams. In most commercial PSA cycles, the weakly adsorbed component in the mixture is the desired product, and enriching the strongly adsorbed CO2 is not a concern. On the other hand, it is necessary to concentrate CO2 to high purity to reduce CO2 sequestration costs and minimize safety and environmental risks. Thus, it is necessary to develop PSA processes specifically targeted to obtain pure strongly adsorbed component. A multitude of PSA/VSA cycles have been developed in the literature for CO2 capture from feedstocks low in CO2 concentration. However, no systematic methodology has been suggested to develop, evaluate, and optimize PSA cycles for high purity CO2 capture. This study presents a systematic optimization-based formulation to synthesize novel PSA cycles for a given application. In particular, a novel PSA superstructure is presented to design optimal PSA cycle configurations and evaluate CO2 capture strategies. The superstructure is rich enough to predict a number of different PSA operating steps. The bed connections in the superstructure are governed by time-dependent control variables, which can be varied to realize most PSA operating steps. An optimal sequence of operating steps is achieved through the formulation of an optimal control problem with the partial differential and algebraic equations of the PSA system and the cyclic steady state condition. Large-scale optimization capabilities have enabled us to adopt a complete discretization methodology to solve the optimal control problem as a largescale nonlinear program, using the nonlinear optimization solver IPOPT. The superstructure approach is demonstrated for case studies related to post-combustion CO2 capture. In particular, optimal PSA cycles were synthesized, which maximize CO2 recovery for a given purity, and minimize overall power consumption. The results show the potential of the superstructure to predict PSA cycles with up to 98% purity and recovery of CO2. Moreover, for recovery of around 85% and purity of over 90%, these cycles can recover CO2 from atmospheric flue gas with a low power consumption of 465 kWh tonne 1 CO2. The approach presented is, therefore, very promising and quite useful for evaluating the suitability of different adsorbents, feedstocks, and operating strategies for PSA, and assessing its usefulness for CO2 capture.
Physics-informed neural networks (PINNs), introduced, are effective in solving integer-order partial differential equations (PDEs) based on scattered and noisy data. PINNs employ standard feedforward neural networks (NNs) with the PDEs explicitly encoded into the NN using automatic differentiation, while the sum of the mean-squared PDE residuals and the mean-squared error in initial-boundary conditions is minimized with respect to the NN parameters. Here we extend PINNs to fractional PINNs (fPINNs) to solve space-time fractional advection-diffusion equations (fractional ADEs), and we study systematically their convergence, hence explaining both fPINNs and PINNs for the first time. Specifically, we demonstrate their accuracy and effectiveness in solving multidimensional forward and inverse problems with forcing terms whose values are only known at randomly scattered spatio-temporal coordinates (black-box (BB) forcing terms). A novel element of the fPINNs is the hybrid approach that we introduce for constructing the residual in the loss function using both automatic differentiation for the integer-order operators and numerical discretization for the fractional operators. This approach bypasses the difficulties stemming from the fact that automatic differentiation is not applicable to fractional operators because the standard chain rule in integer calculus is not valid in fractional calculus. To discretize the fractional operators, we employ the Grünwald--Letnikov (GL) formula in one-dimensional fractional ADEs and the vector GL formula in conjunction with the directional fractional Laplacian in two- and three-dimensional fractional ADEs. We first consider the one-dimensional fractional Poisson equation and compare the convergence of the fPINNs against the finite difference method (FDM). We present the solution convergence using both the mean L 2 error as well as the standard deviation due to sensitivity to NN parameter initializations. Using different GL formulas we observe first-, second-, and third-order convergence rates for small size training sets but the error saturates for larger training sets. We explain these results by analyzing the four sources of numerical errors due to discretization, sampling, NN approximation, and optimization. The total error decays monotonically (below 10 –5 for a third-order GL formula) but it saturates beyond that point due to the optimization error. We also analyze the relative balance between discretization and sampling errors and observe that the sampling size and the number of discretization points (auxiliary points) should be comparable to achieve the highest accuracy. As we increase the depth of the NN up to certain value, the mean error decreases and the standard deviation increases, whereas the width has essentially no effect unless its value is either too small or too large. We next consider time-dependent fractional ADEs and compare white-box (WB) and BB forcing. We observe that for the WB forcing, our results are similar to the aforementioned cases; however, for the BB forcing fPINNs outperform FDM. Subsequently, we consider multidimensional time-, space-, and space-time-fractional ADEs using the directional fractional Laplacian and we observe relative errors of 10 –3 ~ 10 –4 . Lastly, we solve several inverse problems in one, two, and three dimensions to identify the fractional orders, diffusion coefficients, and transport velocities and obtain accurate results given proper initializations even in the presence of significant noise.
Uncertainty is pervasive in all science and engineering applications. Incorporating uncertainty in physical models is therefore both natural and vital. In doing so, we often arrive at parametric systems of partial differential equations (PDEs). When passing from simulation to optimization, we obtain (typically nonconvex) infinite-dimensional optimization problems that, upon discretization, result in extremely large-scale nonlinear programs. For example, consider a linear elliptic PDE on a two- dimensional domain with a single random coeffcient. If we sampled the random input with 10,000 realizations of the coeffcient, the resulting optimization problem would have 10,000 PDE constraints. Furthermore, discretizing each PDE with piecewise linear finite elements on a 100X100 uni- form quadrilateral mesh results in 100,000,000 degrees of freedom. As a result, the critical components for ensuring mesh-independent performance of numerical optimization methods in the deterministic setting, for example, solution regularity and generalized differentiability, are even more critical in the stochastic setting.
With large-scale distributed photovoltaics (PVs) being integrated into distribution networks (DNs), coordinated optimal power flow (OPF) of high voltage (HV) and medium voltage (MV) DNs should be investigated to optimally dispatch the distributed PVs and other network devices. Here, this paper presents a hierarchical distributed OPF method for HV and MV DNs with on-load tap changers, reactive power compensators, feeder switches and distributed PVs. A hierarchical master-slave control architecture is applied to implement coordinated OPF of two-layer DNs. The HV master problem and MV subproblems are transformed into mixed-integer convex problems respectively with second order cone programming and LinDistFlow approximation. Since there is no efficient distributed algorithm to solve such OPF models with integer subproblems, a novel distributed algorithm is proposed in this paper to efficiently solve the hierarchical coordinated OPF model with integer subproblems in a distributed manner. In the proposed algorithm, the coordinated OPF model is solved in a branch-and-bound framework, where in each branch node generalized Benders decomposition (GBD) algorithm is applied to decompose the coordinated OPF model into a master problem and relaxed subproblems and solves them iteratively to get optimal solution. The GBD optimal and feasible cutting planes generated in a branch node are proved to be valid for its descendants. Moreover, three acceleration techniques are introduced into the proposed algorithm to improve computational efficiency. Finally, the effectiveness and accuracy of the proposed method are verified via simulation tests in Jinzhai DNs of China.