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 55 records · Page 3

On choosing a nonlinear initial iterate for solving the 2-D 3-T heat conduction equations

The 2-D 3-T heat conduction equations can be used to approximately describe the energy broadcast in materials and the energy swapping between electron and photon or ion. To solve the equations, a fully implicit finite volume scheme is often used as the discretization method. Because the energy diffusion and swapping coefficients have a strongly nonlinear dependence on the temperature, and some physical parameters are discontinuous across the interfaces between the materials, it is a challenge to solve the discretized nonlinear algebraic equations. Particularly, as time advances, the temperature varies so greatly in the front of energy that it is difficult to choose an effective initial iterate when the nonlinear algebraic equations are solved by an iterative method. In this paper, a method of choosing a nonlinear initial iterate is proposed for iterative solving this kind of nonlinear algebraic equations. Numerical results show the proposed initial iterate can improve the computational efficiency, and also the convergence behavior of the nonlinear iteration.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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

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

42 ENGINEERING↗

DS-TIDE: Harnessing Dynamical Systems for Efficient Time-Independent Differential Equation Solving

Time-Independent Differential Equations (TIDEs) are central to modeling equilibrium behavior across a wide range of scientific and engineering domains, from electrostatics to porous media flow. Conventional numerical solvers offer reliable solutions but incur significant computational costs due to fine-grained discretization and iterative procedures. Machine learning-based approaches address this by replacing iterative solving processes with one-time inference; however, their sophisticated models require extensive training resources that often exceed those of traditional solvers. Consequently, designing a TIDE solver that achieves high accuracy, broad applicability, and exceptional computational efficiency remains a fundamental challenge. In this paper, we propose DS-TIDE, a novel hardware solver that is inspired by, and subsequently leverages, the intrinsic connection between Dynamical Systems (DS) and Differential Equations (DEs) to efficiently and accurately solve TIDEs. DS-TIDE employs a CMOS-compatible DS-based processor, whose physical states evolve under carefully designed DE-driven dynamics and naturally converge to equilibrium -- the solution of the target TIDE -- within ~1µs on a ~1-watt DS-TIDE processor. To enhance expressivity, DS-TIDE incorporates Heterogeneous Dynamics with Temporal Layering (HDTL), which solves TIDEs through a three-stage DS evolution -- conditioning, solving, and decoding -- each governed by specialized dynamics. The entire evolution process is analogous to an infinitely deep neural network temporally unrolled, offering the system the capability of representing complex equations. Furthermore, DS-TIDE is equipped with an on-device DS-DE Auto-Alignment mechanism that dynamically adapts intrinsic hardware dynamics within milliseconds, effectively aligning the system’s dynamics to diverse target DEs. Experimental results across TIDEs from a wide range of scientific and engineering domains demonstrate that DS-TIDE achieves ~10^3× speedup, ~10^5× energy savings, and competitive or superior accuracy compared to state-of-the-art numerical and ML-based solvers.

Liu, Chuan↗

Solutions for Lasting, Viable Energy Infrastructure Technologies (SOLVE IT) Prize Final Technical Report

This is a final technical report for the American-Made The Solutions for Lasting, Viable Energy Infrastructure Technologies (SOLVE IT) Prize, funded by the Infrastructure Investments and Jobs Act through the Technology Commercialization Fund, administered by the U.S. Department of Energy (DOE) Office of Technology Commercialization (OTC) in collaboration with the Office of Clean Energy Demonstrations (OCED) and the Office of Energy Efficiency and Renewable Energy (EERE) with support from the National Laboratory of the Rockies (NLR). The SOLVE IT Prize aimed to enable local organizations to identify and implement innovative energy solutions in a way that works for their unique needs and challenges. The competition awarded $3,740,000 to winning teams across two phases. The prize was designed to support local stakeholders and organizations as they identified and implemented innovative energy solutions. In doing so, the SOLVE IT Prize looked to promote the commercialization of promising energy technologies that will lead to reliable, affordable energy across the U.S.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

Algorithm to solve a chance-constrained network capacity design problem with stochastic demands and finite support

Here, we consider the problem of determining the capacity to assign to each arc in a given network, subject to uncertainty in the supply and/or demand of each node. This design problem underlies many real-world applications, such as the design of power transmission and telecommunications networks. We first consider the case where a set of supply/demand scenarios are provided, and we must determine the minimum-cost set of arc capacities such that a feasible flow exists for each scenario. We briefly review existing theoretical approaches to solving this problem and explore implementation strategies to reduce run times. With this as a foundation, our primary focus is on a chance-constrained version of the problem in which α% of the scenarios must be feasible under the chosen capacity, where α is a user-defined parameter and the specific scenarios to be satisfied are not predetermined. We describe an algorithm which utilizes a separation routine for identifying violated cut-sets which can solve the problem to optimality, and we present computational results. We also present a novel greedy algorithm, our primary contribution, which can be used to solve for a high quality heuristic solution. We present computational analysis to evaluate the performance of our proposed approaches.

97 MATHEMATICS AND COMPUTING↗

Solving quasi‐static equations with the material‐point method

Summary The material‐point method models continua by following a set of unconnected material points throughout the deformation of a body. This set of points provides a Lagrangian description of the material and geometry. Information from the material points is projected onto a background grid where equations of motion are solved. The grid solution is then used to update the material points. This paper describes how to use this method to solve quasi‐static problems. The resulting discrete equations are a coupled set of nonlinear equations that are then solved with a Jacobian‐free, Newton–Krylov algorithm. The technique is illustrated by examining two problems. The first problem simulates a compact tension test and includes a model of material failure. The second problem computes effective, macroscopic properties of a polycrystalline thin film. Copyright © 2015 John Wiley & Sons, Ltd.

Sanchez, J.↗

Solving security constrained optimal power flow problems by a structure exploiting interior point method

In this paper we present a new approach to solve the DC (n - 1) security constrained optimal power flow (SCOPF) problem by a structure exploiting interior point solver. Our approach is based on a reformulation of the linearised SCOPF model, in which most matrices that need to be factorized are constant. Hence, most factorizations and a large number of back-solve operations only need to be performed once. However, assembling the Schur complement matrix remains expensive in this scheme. To reduce the effort, we suggest using a preconditioned iterative method to solve the corresponding linear system. We suggest two main schemes to pick a good and robust preconditioner based on combining different “active” contingency scenarios of the SCOPF model. These new schemes are implemented within the object-oriented parallel solver (OOPS), a structure-exploiting primal-dual interior-point implementation. We give results on several SCOPF test problems. The largest example contains 500 buses. We compare the results from the original interior point method (IPM) implementation in OOPS and our new reformulation.

30 DIRECT ENERGY CONVERSION↗

Solving Stochastic Inverse Problems for Property–Structure Linkages Using Data-Consistent Inversion and Machine Learning

Determining process–structure–property linkages is one of the key objectives in material science, and uncertainty quantification plays a critical role in understanding both process–structure and structure–property linkages. In this work, we seek to learn a distribution of microstructure parameters that are consistent in the sense that the forward propagation of this distribution through a crystal plasticity finite element model matches a target distribution on materials properties. This stochastic inversion formulation infers a distribution of acceptable/consistent microstructures, as opposed to a deterministic solution, which expands the range of feasible designs in a probabilistic manner. Furthermore, to solve this stochastic inverse problem, we employ a recently developed uncertainty quantification framework based on push-forward probability measures, which combines techniques from measure theory and Bayes’ rule to define a unique and numerically stable solution. This approach requires making an initial prediction using an initial guess for the distribution on model inputs and solving a stochastic forward problem. To reduce the computational burden in solving both stochastic forward and stochastic inverse problems, we combine this approach with a machine learning Bayesian regression model based on Gaussian processes and demonstrate the proposed methodology on two representative case studies in structure–property linkages.

36 MATERIALS SCIENCE↗

A modified homotopy method for solving the principal-agent bilevel programming problem

In this paper, the principal-agent bilevel programming problem with integral operator is considered, in which the upper-level object is the agent that maximizes its expected utility with respect to an agreed compensation contract. The constraints are the principal’s participation and the agent’s incentive compatibility. The latter is a lower-level optimization problem with respect to its private action. To solve an equivalent single-level nonconvex programming problem with integral operator, a modified homotopy method for solving the Karush–Kuhn–Tucker system is proposed. This method requires only an interior point and, not necessarily, a feasible initial approximation for the constraint shifting set. Global convergence is proven under some mild conditions. Numerical experiments were performed by our homotopy method as well as by fmincon in Matlab, LOQO and MINOS. The experiments showed that: designing a piecewise linear contract is much better than designing a piecewise constant contract and only needs to solve a much lower-dimensional optimization problem and hence needs much less computation time; the optimal value of the principal-agent model with designing piecewise linear contract tends to a limitation, while the discrete segments gradually increase; and finally, the proposed modified homotopy method is feasible and effective.

97 MATHEMATICS AND COMPUTING↗

Variational multiscale element-free Galerkin method combined with the moving Kriging interpolation for solving some partial differential equations with discontinuous solutions

Solving partial differential equations with discontinuous solutions is an important challenging problem in numerical analysis. To this end, there are some methods such as finite volume method, discontinuous Galerkin approach and particle technique that are able to solve these problems. In the current paper, the moving Kriging element-free Galerkin method has been combined with the variational multiscale algorithm to obtain acceptable and high-resolution solutions. For testing this technique, we select some PDEs with discontinuous solution such as Burgers’, Sod’s shock tube, advection–reaction–diffusion, Kuramoto–Sivashinsky, Boussinesq and shallow water equations. First, we obtain a time-discrete scheme by approximating time derivative via finite difference technique. Then we introduce the moving Kriging interpolation and also obtain their shape functions. We use the element-free Galerkin method for approximating the spatial derivatives. This method uses a weak form of the considered equation that is similar to the finite element method with the difference that in the classical element-free Galerkin method test and trial functions are moving least squares approximation (MLS) shape functions. Since the shape functions of moving least squares (MLS) approximation do not have Kronecker delta property, we cannot implement the essential boundary condition, directly. Thus, we employ the shape functions of moving Kriging interpolation and radial point interpolation technique which have the mentioned property. Also, in the element-free Galekin method, we do not use any triangular, quadrangular or other type of meshes. The element-free Galerkin method is a global method while finite element method is a local one. This technique employs a background mesh for integration which makes it different from the truly mesh procedures. Several test problems are solved and numerical simulations are reported which confirm the efficiency of the proposed schemes.

97 MATHEMATICS AND COMPUTING↗

Parallel computing for power system climate resiliency: Solving a large-scale stochastic capacity expansion problem with mpi-sppy

Here we propose a nodal stochastic generation and transmission expansion planning model that incorporates the output from high-resolution global climate models through load and generation availability scenarios. We implement our model in Pyomo and perform computational studies on a realistically-sized test case of the California electric grid in a high performance computing environment. We propose model reformulations and algorithm tuning to efficiently solve this large problem using a variant of the Progressive Hedging Algorithm. We utilize the parallelization capabilities and overall versatility of mpi-sppy, exploiting its hub-and-spoke architecture to concurrently obtain inner and outer bounds on an optimal expansion plan. Initial results show that instances with 360 representative days on a system with over 8,000 buses can be solved to within 5% of optimality in under 4 h of wall clock time, a first step towards solving a large-scale power system expansion planning problem across a wide range of climate-informed operational scenarios.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A Quantitative Comparison between C0 and C1 elements for Solving the Cahn-Hilliard Equation

The Cahn–Hilliard (CH) equation is a time-dependent fourth-order partial differential equation (PDE). When solving the CH equation via the finite element method (FEM), the domain is discretized by C1-continuous basis functions or the equation is split into a pair of second-order PDEs, and discretized via C0-continuous basis functions. In the current work, a quantitative comparison between C1 Hermite and C0 Lagrange elements is carried out using a continuous Galerkin FEM formulation. The different discretizations are evaluated using the method of manufactured solutions solved with Newton’s method and Jacobian-Free Newton Krylov. It is found that the use of linear Lagrange elements provides the fastest computation time for a given number of elements, while the use of cubic Hermite elements provides the lowest error. The results offer a set of benchmarks to consider when choosing basis functions to solve the CH equation. In addition, an example of microstructure evolution demonstrates the different types of elements for a traditional phase-field model.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Computing resonant modes of accelerator cavities by solving nonlinear eigenvalue problems via rational approximation

Here, we present an efficient and reliable algorithm for solving a class of nonlinear eigenvalue problems arising from the modeling of particle accelerator cavities. The eigenvalue nonlinearity in these problems results from the use of waveguides to couple external power sources or to allow certain excited electromagnetic modes to exit the cavity. We use a rational approximation to reduce the nonlinear eigenvalue problem first to a rational eigenvalue problem. We then apply a special linearization procedure to turn the rational eigenvalue problem into a larger linear eigenvalue problem with the same eigenvalues, which can be solved by existing iterative methods. By using a compact scheme to represent both the linearized operator and the eigenvectors to be computed, we obtain a numerical method that only involves solving linear systems of equations of the same dimension as the original nonlinear eigenvalue problem. We refer to this method as a compact rational Krylov (CORK) method. We implemented the CORK method in the Omega3P module of the Advanced Computational Electromagnetic 3D Parallel (ACE3P) simulation suite and validated it by comparing the computed cavity resonant frequencies and damping Q factors of a small model problem to those obtained from a fitting procedure that uses frequency responses computed by another ACE3P module called S3P. We also used the CORK method to compute trapped modes damped in an ideal eight 9-cell SRF cavity cryomodule. This was the first time it was possible to compute these modes directly. The damping Q factors of the computed modes match well with those measured in experiments and the difference in resonant frequencies is within the range introduced by cavity imperfection. Therefore, the CORK method is an extremely valuable tool for computational cavity design.

43 PARTICLE ACCELERATORS↗

Building problem solving environments with the arches framework

The computational problems that scientists face are rapidly escalating in size and scope. Moreover, the computer systems used to solve these problems are becoming significantly more complex than the familiar, well-understood sequential model on their desktops. While it is possible to re-train scientists to use emerging high-performance computing (HPC) models, it is much more effective to provide them with a higher-level programming environment that has been specialized to their particular domain. By fostering interaction between HPC specialists and the domain scientists, problem-solving environments (PSEs) provide a collaborative environment. A PSE environment allows scientists to focus on expressing their computational problem while the PSE and associated tools support mapping that domain-specific problem to a high-performance computing system. This article describes Arches, an object-oriented framework for building domain-specific PSEs. The framework was designed to support a wide range of problem domains and to be extensible to support very different high-performance computing targets. To demonstrate this flexibility, two PSEs have been developed from the Arches framework to solve problem in two different domains and target very different computing platforms. The Coven PSE supports parallel applications that require large-scale parallelism found in cost-effective Beowulf clusters. In contrast, RCADE targets FPGA-based reconfigurable computing and was originally designed to aid NASA Earth scientists studying satellite instrument data.

99 GENERAL AND MISCELLANEOUS↗

An integrated coupling model for solving multiscale fluid-fluid coupling problems in SAM code

In this study, an integrated coupling method has been developed for solving multiscale fluid-fluid coupling problems in plant-scale safety analysis models in SAM (System Analysis Module) code. In this method, a higher-fidelity multi-dimensional (3D) flow module is used for reactor components of complex flow features (e.g., reactor core) and a lumped parameter one-dimensional (1D) flow module for plant-scale flow loops (e.g., primary loop pipe network), respectively. In this method, the 3D fluid equation/domain and 1D fluid equation/domain are tightly coupled at the residual level and solved simultaneously using the Newton’s method to overcome the convergence issues typically seen in existing approaches like separate domain approach, where the 3D fluid equation and 1D fluid equation are solved separately. Extensive and successful code verifications and demonstrations have been performed for this newly developed method. This new modeling approach significantly simplify the work flow in developing high-fidelity plant-scale safety analysis model, e.g. for pool-type reactors and pebble-bed reactors.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Development and Verification of a Numerical Library for Solving Global Terrestrial Multiphysics Problems

Abstract Current generation Land Surface Models (LSMs) routinely simulate many nonlinear multiphysics processes. The complexity of future generation LSMs is expected to increase as critical new biophysical and biogeochemical processes are incorporated. Current generation LSMs have several shortcomings including the lack of robust numerical methods to solve discretized equations, monolithic software design that hinders testing of a process representation in isolation from other components, and absence of a flexible coupling framework to solve tightly coupled multiphysics problems. While the LSMs community vigorously evaluates the accuracy of the conceptual model to represent reality (validation), the accuracy of the numerical implementation of the conceptual model (verification) is seldom examined. Method of Manufactured Solutions is a technique for verifying complex codes when analytical solutions are unavailable. In this work, we present a stand‐alone, open source numerical library for solving global terrestrial multiphysics processes that includes a flexible coupling framework. Robust numerical solution for linear and nonlinear equations is provided via the Portable, Extensible Toolkit for Scientific Computation library. We verify the numerical library using Method of Manufactured Solutions for a range of problems comprising single and multiphysics steady state problems that are applied in one or multiple physical domains. This work provides an example of incorporating code verification as an integral part of Land Surface Model development activities.

58 GEOSCIENCES↗

Optical neural engine for solving scientific partial differential equations

Abstract Solving partial differential equations (PDEs) is the cornerstone of scientific research and development. Data-driven machine learning (ML) approaches are emerging to accelerate time-consuming and computation-intensive numerical simulations of PDEs. Although optical systems offer high-throughput and energy-efficient ML hardware, their demonstration for solving PDEs is limited. Here, we present an optical neural engine (ONE) architecture combining diffractive optical neural networks for Fourier space processing and optical crossbar structures for real space processing to solve time-dependent and time-independent PDEs in diverse disciplines, including Darcy flow equation, the magnetostatic Poisson’s equation in demagnetization, the Navier-Stokes equation in incompressible fluid, Maxwell’s equations in nanophotonic metasurfaces, and coupled PDEs in a multiphysics system. We numerically and experimentally demonstrate the capability of the ONE architecture, which not only leverages the advantages of high-performance dual-space processing for outperforming traditional PDE solvers and being comparable with state-of-the-art ML models but also can be implemented using optical computing hardware with unique features of low-energy and highly parallel constant-time processing irrespective of model scales and real-time reconfigurability for tackling multiple tasks with the same architecture. The demonstrated architecture offers a versatile and powerful platform for large-scale scientific and engineering computations.

Tang, Yingheng (ORCID:0009000153622546)↗

A Parallel Code for Solving the Molecular Time Dependent Schroedinger Equation in Cartesian Coordinates

Reproducing molecular dynamics is at the root of the basic principles of chemical change and physical properties of the matter. New insight on molecular encounters can be gained by solving the Schroedinger equation in cartesian coordinates, provided one can overcome the massive calculations that it implies. We have developed a parallel code for solving the molecular Time Dependent Schroedinger Equation (TDSE) in cartesian coordinates. Variable order Finite Difference methods result in sparse Hamiltonian matrices which can make the large scale problem solving feasible.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗