Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 1,729 records · Page 96

Error Convergence Characterization for Stochastic Transport Methods

There has been increased interest in reliably and efficiently solving engineering systems involving uncertainty in recent years. Characterization of the convergence of errors within the problem, including statistical and bias errors, increases confidence that chosen solution methods are appropriate for a particular problem and quantity of interest (QoI), that implementation errors have not been made, and can aid users or algorithms in solving problems within a tolerance efficiently. We demonstrate a method for characterizing error convergence in a simple stochastic transport problem. Though the approach is applicable to problems with more complicated physics, our simple problem enables analytic QoI solutions so that error convergence behavior and the identification of limiting errors can be presented with high precision. A one-dimensional, two-material, neutral-particle, and absorption-only transport problem involving uniformly distributed uncertain total cross sections is presented. Random sampling (RS) and stochastic collocation (SC) are used as stochastic solvers which sample from the uncertain space and Monte Carlo (MC) transport is employed to solve transport results on the resulting realizations. Probability density functions (PDFs) are created using either RS solutions or samples taken from a polynomial chaos expansion (PCE) constructed with SC solutions. The convergence of each solver is characterized with respect to the QoI against analytic solutions, convergence behavior is used to efficiently solve a QoI within a tolerance, and convergence plots are used to identify dominant solution errors.

42 ENGINEERING↗

Large-scale inverse model analyses employing fast randomized data reduction: INVERSE MODELING WITH DATA REDUCTION

When the number of observations is large, it is computationally challenging to apply classical inverse modeling techniques. We have developed a new computationally efficient technique for solving inverse problems with a large number of observations (e.g., on the order of 10 7 or greater). Our method, which we call the randomized geostatistical approach (RGA), is built upon the principal component geostatistical approach (PCGA). We employ a data reduction technique combined with the PCGA to improve the computational efficiency and reduce the memory usage. Specifically, we employ a randomized numerical linear algebra technique based on a so-called “sketching” matrix to effectively reduce the dimension of the observations without losing the information content needed for the inverse analysis. In this way, the computational and memory costs for RGA scale with the information content rather than the size of the calibration data. Our algorithm is coded in Julia and implemented in the MADS open-source high-performance computational framework (http://mads.lanl.gov). We apply our new inverse modeling method to invert for a synthetic transmissivity field. Compared to a standard geostatistical approach (GA), our method is more efficient when the number of observations is large. Moreover, our method is capable of solving larger inverse problems than the standard GA and PCGA approaches. Thus, our new model inversion method is a powerful tool for solving large-scale inverse problems. The method can be applied in any field and is not limited to hydrogeological applications such as the characterization of aquifer heterogeneity.

54 ENVIRONMENTAL SCIENCES↗

Number of sites-based solver for determining coverages from steady-state mean-field micro-kinetic models

Kinetic models parameterized by ab-initio calculations have led to significant improvements in understanding chemical reactions in heterogeneous catalysis. These studies have been facilitated by implementations which determine steady-state coverages and rates of mean-field micro-kinetic models. As implemented in the open-source kinetic modeling program, CatMAP, the conventional solution strategy is to use a root-finding algorithm to determine the coverage of all intermediates through the steady-state expressions, constraining all coverages to be non-negative and to properly sum to unity. Though intuitive, this root-finding strategy causes issues with convergence to solution due to these imposed constraints. In this work, we avoid explicitly imposing these constraints, solving the mean-field steady-state micro-kinetic model in the space of number of sites instead of solving it in the space of coverages. Here, we transform the constrained root-finding problem to an unconstrained least-squares minimization problem, leading to significantly improved convergence in solving micro-kinetic models and thus enabling the efficient study of more complex catalytic reactions.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Parallel Computing Framework for Finding the Supported Solutions to a Biobjective Network Optimization Problem

Abstract Solving multi‐objective combinatorial optimization problems can quickly become computationally challenging when applied to large networks generated from big data. Present‐day first‐rate Mixed Integer Programming (MIP) solvers have parallelism built‐in to take advantage of multicore architectures; but specialized network optimization algorithms that can often solve graph problems more efficiently than a general MIP solver are typically programmed serially. Thus, these network algorithm implementations do not take full advantage of modern multicore computer capabilities. Many parallel computing languages include a fork/join framework into their concurrency packages that allow for simple conversion of recursive serial algorithms to operate in parallel without having to use complicated low‐level message‐passing interfaces. Fork/join is particularly well suited to divide and conquer algorithms such as Non‐Inferior Set Estimation (NISE) method for computing the supported Pareto front of a multi‐objective optimization problem. This work develops a simple general parallel NISE (pNISE) implementation using the Java 7 concurrency tools, and then offers results from a specific implementation of solving a bi‐objective shortest path problem. The results indicate that this method is capable of sizeable speed‐ups on both small‐scale personal computers as well as large‐scale shared memory supercomputers. Finally, other network problems suitable to this method are discussed, including multi‐objective variants of the minimum spanning tree problem, transportation problem, assignment problem, maximum flow problem, and the minimum‐cost flow problem. Copyright © 2015 John Wiley & Sons, Ltd.

Medrano, Fernando Antonio↗

Implementation and verification of a user-defined element (UEL) for coupled thermal-hydraulic-mechanical-chemical (THMC) processes in saturated geological media

Efficient and accurate modeling of the coupled thermal-hydraulic-mechanical-chemical (THMC) processes in various rock formations is indispensable for designing energy geo-structures such as underground repositories for high-level nuclear wastes. Here, this work focuses on developing and verifying an implicit finite element solver for generic coupled THMC problems in geological settings. Starting from the mass, momentum, and energy balance laws, a specialized set of governing equations and a thermoporoelastic constitutive model is derived. This system is then solved by an implicit finite element (FE) scheme. Specifically, the residuals and the Jacobians are scripted in a user-defined element (UEL) subroutine which is then combined with the general-purpose FE software Abaqus Standard to solve initial-boundary value problems. Considering the complexity of the system, the UEL development follows a stepwise manner by first solving the coupled hydraulic-mechanical (HM) and thermal-hydraulic-mechanical (THM) equations before moving on to the full THMC problem. Each implementation step consists of at least one verification test by comparing computed results with closed-form analytical solutions to ensure that the various coupling effects are correctly realized. To demonstrate the robustness of the algorithm and to validate the UEL, a three-dimensional case study is performed with reference to the in-situ heating test of ATLAS at Belgium in 1980s. A hypothetical radionuclide leakage event is then simulated by activating the chemical-concentration degree of freedom and prescribing a constant high concentration at the heater's surface. The model predicts a limited contaminated regime after six years considering both diffusion and advection effects on species transport.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Topology optimization of finite strain viscoplastic systems under transient loads [Dynamic topology optimization based on finite strain visco-plasticity]

In this paper, a transient finite strain viscoplastic model is implemented in a gradient-based topology optimization framework to design impact mitigating structures. The model's kinematics relies on the multiplicative split of the deformation gradient, and the constitutive response is based on isotropic hardening viscoplasticity. To solve the mechanical balance laws, the implicit Newmark-beta method is used together with a total Lagrangian finite element formulation. The optimization problem is regularized using a partial differential equation filter and solved using the method of moving asymptotes. Sensitivities required to solve the optimization problem are derived using the adjoint method. To demonstrate the capability of the algorithm, several protective systems are designed, in which the absorbed viscoplastic energy is maximized. Finally, the numerical examples demonstrate that transient finite strain viscoplastic effects can successfully be combined with topology optimization.

42 ENGINEERING↗

Numerical methods for the inverse problem of density functional theory

Here, the inverse problem of Kohn–Sham density functional theory (DFT) is often solved in an effort to benchmark and design approximate exchange-correlation potentials. The forward and inverse problems of DFT rely on the same equations but the numerical methods for solving each problem are substantially different. We examine both problems in this tutorial with a special emphasis on the algorithms and error analysis needed for solving the inverse problem. Two inversion methods based on partial differential equation constrained optimization and constrained variational ideas are introduced. We compare and contrast several different inversion methods applied to one-dimensional finite and periodic model systems.

97 MATHEMATICS AND COMPUTING↗

John Grant and the multifaceted nature of true professionalism: Personal perspective

Consideration of the elements that contribute to professional and scientific impact is relevant in a volume honoring John Grant for two reasons. First, John has contributed in many ways to both advancing the methodology and the practical application of surface-analytical tools to understanding surfaces and interfaces of technological importance. The second reason is a little more complex. In an era when there is an effort to quantify contributions in various ways (e.g., citations, H-index, number of publications) and when social media seems, at least anecdotally, to lead a younger generation of scientists to be less involved in traditional professional activities, it is appropriate to examine the nature of the activities that make a lasting contribution to the advancement of science and technology and the professional community that makes progress possible. The multifaceted nature of John’s professional activities provides an appropriate background for exploring the nature of professionalism. With no reservations one can say that the foundation of professionalism is rooted in a scientist’s expertise in some area of research or practice. This expertise might be measured in numerous ways depending upon the field and could include numbers of publications, citations, patents, problems solved, research support obtained, or students produced. These “products” may or may not be readily visible to the community at large. Chuck Wagner – a pioneer in XPS, developer of an empirical set of XPS sensitivity factors and the modified Auger-parameter plot, and winner of the AVS Nerken Award in 1989 – observed that he could not publish or talk about 90% of the work he had done when working for Shell Oil. However, based on XPS capability developments that he could publish, he had a major impact on the development and application of XPS. To some degree John Grant’s research fits this model as well. Much of his early work at the Air Force Materials Research Laboratory was directed at solving materials problems and this important and often ground-breaking work was not published. However, a great deal of creativity and development was required to enable surface-sensitive tools such as AES and XPS to become useful for solving critical problems, and this work could be published.

Baer, Donald R.↗

Optimizing wind farm siting to reduce power system impacts of wind variability

We introduce and solve two variants of a biobjective optimization model to reduce the negative impact of wind variability on the power system by strategically locating wind farms. The first model variant considers average changes in wind power over time; the second captures extreme fluctuations in wind power. A complementary set of wind sites is selected with the aim of minimizing both residual demand and the variability in residual demand. Because exact optimization is computationally intensive, we develop two heuristics—forward and backward greedy algorithms—to find approximate solutions. The results are compared with the exact optimization results for a well-selected subset of the data as well as to the results from selecting sites based on average wind alone. The two models are solved using demand data and potential wind sites for the Southwest Power Pool. Though both objectives can be improved by adding more sites, for a fixed number of sites, minimizing residual demand and variability in residual demand are competing objectives. Here, we find an approximate efficient frontier to compare trade-offs between the two objectives. We also vary the parameter in the heuristic that controls how the two objectives are prioritized. For the case study, the backward greedy algorithm is more effective at reducing the wind power variability than the forward greedy algorithm. Furthermore, using the backward algorithm for the full dataset is more effective than solving the exact optimization on a subset of the data when the results are evaluated using the full dataset.

17 WIND ENERGY↗

Graphical models for optimal power flow

Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In this paper, we formulate the optimal power flow problem over tree networks as an inference problem over a tree-structured graphical model where the nodal variables are low-dimensional vectors. We adapt the standard dynamic programming algorithm for inference over a tree-structured graphical model to the OPF problem. Combining this with an interval discretization of the nodal variables, we develop an approximation algorithm for the OPF problem. Further, we use techniques from constraint programming (CP) to perform interval computations and adaptive bound propagation to obtain practically efficient algorithms. Compared to previous algorithms that solve OPF with optimality guarantees using convex relaxations, our approach is able to work for arbitrary tree-structured distribution networks and handle mixed-integer optimization problems. Further, it can be implemented in a distributed message-passing fashion that is scalable and is suitable for “smart grid” applications like control of distributed energy resources. In conclusion, numerical evaluations on several benchmark networks show that practical OPF problems can be solved effectively using this approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

An adaptive, multivariate partitioning algorithm for global optimization of nonconvex programs

We develop an adaptive, multivariate partitioning algorithm for solving nonconvex, Mixed-Integer Nonlinear Programs (MINLPs) with polynomial functions to global optimality. In particular, we present an iterative algorithm that exploits piecewise, convex relaxation approaches via disjunctive formulations to solve MINLPs that is different than conventional spatial branch-and-bound approaches. The algorithm partitions the domains of variables in an adaptive and non-uniform manner at every iteration to focus on productive areas of the search space. Furthermore, domain reduction techniques based on sequential, optimization-based bound-tightening and piecewise relaxation techniques, as a part of a presolve step, are integrated into the main algorithm. Finally, we demonstrate the effectiveness of the algorithm on well-known benchmark problems (including Pooling and Blending instances) from MINLPLib and compare our algorithm with state-of-the-art global optimization solvers. With our novel approach, we solve several large-scale instances, some of which are not solvable by state-of-the-art solvers. We also succeed in reducing the best known optimality gap for a hard, generalized pooling problem instance.

97 MATHEMATICS AND COMPUTING↗

Parallel-in-Time Solution of Allen-Cahn Equations by Integrating Operator Learning into the Parareal Method

While recent advances in deep learning have shown promising efficiency gains in solving time-dependent partial differential equations (PDEs), matching the accuracy of conventional numerical solvers still remains a challenge. One strategy to improve the accuracy of deep learning-based solutions for time-dependent PDEs is to use the learned model as the coarse propagator in the Parareal method and a traditional numerical method as the fine solver. However, successful integration of deep learning into the Parareal method requires consistency between the coarse and fine solvers, particularly for PDEs exhibiting rapid changes such as sharp transitions. Here, to ensure this consistency, we propose using convolutional neural networks (CNNs) to learn the fully discrete time-stepping operator defined by the same numerical scheme employed as the fine solver. We demonstrate the effectiveness of the proposed method in solving the classical and mass-conservative Allen–Cahn (AC) equations. Through iterative updates in the Parareal algorithm, our approach achieves a significant computational speedup compared to traditional fine solvers while converging to high-accuracy solutions. Our results highlight that the proposed hybrid Parareal algorithm effectively accelerates simulations, particularly when implemented on multiple GPUs, and converges to the desired accuracy in only a few iterations. Another advantage of our method is that the CNN model is trained on trajectory-based data generated from random initial conditions, such that the trained model can be used to solve the AC equations with various initial conditions without retraining. This work demonstrates the potential of integrating neural network methods into parallel-in-time frameworks for efficient and accurate simulations of time-dependent PDEs.

97 MATHEMATICS AND COMPUTING↗

Dispatch optimization of concentrating solar power with utility-scale photovoltaics

Concentrating solar power (CSP) tower technologies capture thermal radiation from the sun utilizing a field of solar-tracking heliostats. When paired with inexpensive thermal energy storage (TES), CSP technologies can dispatch electricity during peak-market-priced hours, day or night. The cost of utility-scale photovoltaic (PV) systems has dropped significantly in the last decade, resulting in inexpensive energy production during daylight hours. The hybridization of PV and CSP with TES systems has the potential to provide continuous and stable energy production at a lower cost than a PV or CSP system alone. Hybrid systems are gaining popularity in international markets as a means to increase renewable energy portfolios across the world. Typically, CSP-PV hybrid systems have been evaluated using either monthly averages of hourly PV production or scheduling algorithms that neglect the time-of-production value of electricity in the market. To more accurately evaluate a CSP-PV-battery hybrid design, we develop a profit-maximizing mixed-integer linear program ($\mathcal{H}$) that determines a dispatch schedule for the individual sub-systems with a sub-hourly time fidelity. We introduce the mathematical formulation of such a model and show that it is computationally expensive to solve. To improve model tractability and reduce solution times, we offer techniques that: (1) reduce the problem size, (2) tighten the linear programming relaxation of ($\mathcal{H}$) via reformulation and the introduction of cuts, and (3) implement an optimization-based heuristic (that can yield initial feasible solutions for (($\mathcal{H}$) and, at any rate, yields near-optimal solutions). Applying these solution techniques results in a 79% improvement in solve time, on average, for our 48-h instances of (($\mathcal{H}$); corresponding solution times for an annual model run decrease by as much as 93%, where such a run consists of solving 365 instances of (($\mathcal{H}$), retaining only the first 24 h' worth of the solution, and sliding the time window forward 24 h. We present annual system metrics for two locations and two markets that inform design practices for hybrid systems and lay the groundwork for a more exhaustive policy analysis. A comparison of alternative hybrid systems to the CSP-only system reflects that hybrid models can almost double capacity factors while resulting in a 30% improvement related to various economic metrics.

14 SOLAR ENERGY↗

Universal Method of Modeling Linear Stationary Physical Fields

The aim of this paper is to develop a method, described earlier, of solving quantum-mechanical problems into a universal numerical method of modeling fields of various physical nature. This method is based on reducing the initial equation of mathematical physics describing a given physical field to a simpler inhomogeneous equation with a known fundamental solution. This equation is then transformed into an inhomogeneous integral equation with a kernel expressed in terms of the known fundamental solution. The obtained integral equation with boundary conditions is solved numerically. To confirm the efficiency of the proposed numerical method, a two-dimensional and a three-dimensional boundary value problem with known solutions have been solved. Another important illustration of the efficiency of the proposed method is the solution of quantum-mechanical problems for one-dimensional and two-dimensional quantum oscillators. It is shown that the considered method allows one to find the energy eigenvalues and the eigenfunctions with acceptable accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SCIP-Jack—a solver for STP and variants with parallelization extensions

The Steiner tree problem in graphs is a classical problem that commonly arises in practical applications as one of many variants. While often a strong relationship between different Steiner tree problem variants can be observed, solution approaches employed so far have been prevalently problem-specific. In contrast, this paper introduces a general-purpose solver that can be used to solve both the classical Steiner tree problem and many of its variants without modification. This versatility is achieved by transforming various problem variants into a general form and solving them by using a state-of-the-art MIP-framework. The result is a high-performance solver that can be employed in massively parallel environments and is capable of solving previously unsolved instances.

90C10↗