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 703 records · Page 39

An Approach to Solving Enclosure Radiation Problems in A Multi-Physics Context

Thermal protection system analysis of complex features or damage sites can sometimes require modeling of high temperature enclosures. Implementing efficient and accurate view-factor algorithms required to model such problems is complex. The current work leverages the Non-equilibrium Radiation (NERO) software, which solves the radiation transport equation in a finite-volume scheme, to alleviating challenges often faced with view-factor calculations. By assuming heat transfer occurs only between grey bodies and that the medium is non-participating, computational cost of the method is significantly reduced. The enclosure physics are modeled through emitting and reflecting boundary conditions in NERO. The emitted radiative flux is dependent on the wall temperature which is a solution to the material response, obtained from Icarus, in this context. The Ares framework manages the time-advancement and exchange of the necessary data between the solvers. The surface energy balance is modified to account for the enclosure terms within the material response boundary condition. The methodology was verified against analytical solutions including radiating parallel plates, a hollow cylinder (shown in Fig. 1), and a hemisphere. Application of the methodology to inform the design of components of the Dragonfly system will be shown.

Ablation↗

Factors impacting performance of multithreaded sparse triangular solve.

As computational science applications grow more parallel with multi-core supercomputers having hundreds of thousands of computational cores, it will become increasingly difficult for solvers to scale. Our approach is to use hybrid MPI/threaded numerical algorithms to solve these systems in order to reduce the number of MPI tasks and increase the parallel efficiency of the algorithm. However, we need efficient threaded numerical kernels to run on the multi-core nodes in order to achieve good parallel efficiency. In this paper, we focus on improving the performance of a multithreaded triangular solver, an important kernel for preconditioning. We analyze three factors that affect the parallel performance of this threaded kernel and obtain good scalability on the multi-core nodes for a range of matrix sizes.

99 GENERAL AND MISCELLANEOUS↗

Factors impacting performance of multithreaded triangular solve.

As computational science applications grow more parallel with multi-core supercomputers having hundreds of thousands of computational cores, it will become increasingly difficult for solvers to scale. Our approach is to use hybrid MPI/threaded numerical algorithms to solve these systems in order to reduce the number of MPI tasks and increase the parallel efficiency of the algorithm. However, we need efficient threaded numerical kernels to run on the multi-core nodes in order to achieve good parallel efficiency. In this paper, we focus on improving the performance of a multithreaded triangular solver, an important kernel for preconditioning. We analyze three factors that affect the parallel performance of this threaded kernel and obtain good scalability on the multi-core nodes for a range of matrix sizes.

99 GENERAL AND MISCELLANEOUS↗

A hybrid differential evolution/Levenberg-Marquardt method for solving inverse transport problems

Recently, the Differential Evolution (DE) optimization method was applied to solve inverse transport problems in finite cylindrical geometries and was shown to be far superior to the Levenberg-Marquardt optimization method at finding a global optimum for problems with several unknowns. However, while extremely adept at finding a global optimum solution, the DE method often requires a large number (hundreds or thousands) of transport calculations, making it much slower than the Levenberg-Marquardt method. In this paper, a hybridization of the Differential Evolution and Levenberg-Marquardt approaches is presented. This hybrid method takes advantage of the robust search capability of the Differential Evolution method and the speed of the Levenberg-Marquardt technique.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

PNNL applies pressure to solving global climate change issues

Scientists have been under pressure to help solve global climate change by reducing greenhouse gas emissions through methods such as carbon sequestration, the capture and long-term storage of carbon dioxide in deep geological formations. Now scientists at DOE’s Pacific Northwest National Laboratory, in conjunction with colleagues from Wright State University and Lawrence Berkeley National Laboratory, have taken a step closer with the development of a high-pressure atomic force microscope. Located at DOE’s Environmental Molecular Sciences Laboratory, this new AFM provides researchers the means to observe in real-time the mineral transformation processes arising from carbon dioxide and mineral interactions at the atomic-scale under pressures similar to those needed for carbon sequestration in geological formations.

Enderlin, Lisa K.↗

Rebecca Erikson – Solving Problems with Love for Science

Rebecca Erikson’s love for science began at a young age. Today, she’s a senior scientist at PNNL trying to solve problems that address national security concerns. Through one project, she developed a sleek, simple and inexpensive way to turn a cellphone into a high-powered, high-quality microscope that helps authorities determine if white powder that falls from an envelope is anthrax or something simple like baby powder. Listen as Rebecca describes her work in this Energy Department video.

3D PRINTER↗

Solving differential equations with unknown constitutive relations as recurrent neural networks

We solve a system of ordinary differential equations with an unknown functional form of a sink (reaction rate) term. We assume that the measurements (time series) of state variables are partially available, and use a recurrent neural network to “learn” the reaction rate from this data. This is achieved by including discretized ordinary differential equations as part of a recurrent neural network training problem. We extend TensorFlow’s recurrent neural network architecture to create a simple but scalable and effective solver for the unknown functions, and apply it to a fedbatch bioreactor simulation problem. Use of techniques from recent deep learning literature enables training of functions with behavior manifesting over thousands of time steps. Our networks are structurally similar to recurrent neural networks, but differ in purpose, and require modified training strategies.

deep learning↗

A Physics-Driven Deep-Learning Network for Solving Nonlinear Inverse Problems

Geosteering inversion, which can be viewed as a nonlinear inverse problem, is an important technique used by directional drilling. Traditional methods that rely on iterative procedures and regularization are sensitive to the selection of initial values and can be slow due to convergence issues. In industrial applications, a lookup table is used to produce fast predictions. However, performance is not guaranteed by this approach due to the limitation of the hardware. In this paper, we propose a novel physics-driven deep-learning framework for providing a fast, accurate surrogate to solve the inverse problem. Particularly, leveraged by the forward physical model and 1D convolutional neural network (1D-CNN), the proposed method provides more reliable solutions to the inverse problem with improved performance. In addition, a new physics-driven loss function is introduced to accommodate both the model misfit and the data misfit. In conclusion, our experiments demonstrate the effectiveness of our method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving Unit Commitment Problems with Demand Responsive Loads: Preprint

This paper focuses on using variations of the Frank-Wolfe algorithm for solving unit commitment problems with high volumes of demand responsive loads on the power grid. We present a formulation of the unit commitment problem with demand responsive loads. We then show through reformulation and relaxations of the problem that variations of the Frank-Wolfe algorithm can be used to determine the time series decisions for the demand responsive loads. We show through computational experiments on the RTS-GMLC test system that the time series of demand responsive load decisions obtained through our approach are near optimal and provide details regarding how large scale parallel implementations of our approach can be highly computationally efficient.

demand response↗

Schur-decomposition for 3D matrix equations and its application in solving radiative discrete ordinates equations discretized by Chebyshev collocation spectral method

The Schur-decomposition for three-dimensional matrix equations is developed and used to directly solve the radiative discrete ordinates equations which are discretized by Chebyshev collocation spectral method. Three methods, say, the spectral methods based on 2D and 3D matrix equation solvers individually, and the standard discrete ordinates method, are presented. The numerical results show the good accuracy of spectral method based on direct solvers. The CPU time cost comparisons against the resolutions between these three methods are made using MATLAB and FORTRAN 95 computer languages separately. The results show that the CPU time cost of Chebyshev collocation spectral method with 3D Schur-decomposition solver is the least, and almost only one thirtieth to one fiftieth CPU time is needed when using the spectral method with 3D Schur-decomposition solver compared with the standard discrete ordinates method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Solving the Bateman equations in CASMO5 using implicit ode numerical methods for stiff systems

The Bateman equations, which describe the transmutation of nuclides over time as a result of radioactive decay, absorption, and fission, are often numerically stiff. This is especially true if short-lived nuclides are included in the system. This paper describes the use of implicit numerical methods for o D Es applied to the stiff Bateman equations, specifically employing the Backward Differentiation Formulas (BDF) form of the linear multistep method. As is true in other domains, using an implicit method removes or lessens the (sometimes severe) step-length constraints by which explicit methods must abide. To gauge its accuracy and speed, the BDF method is compared to a variety of other solution methods, including Runge-Kutta explicit methods and matrix exponential methods such as the Chebyshev Rational Approximation Method (CRAM). A preliminary test case was chosen as representative of a PWR lattice depletion step and was solved with numerical libraries called from a Python front-end. The Figure of Merit (a combined measure of accuracy and efficiency) for the BDF method was nearly identical to that for CRAM, while explicit methods and other matrix exponential approximations trailed behind. The test case includes 319 nuclides, in which the shortest-lived nuclide is {sup 98}Nb with a half-life of 2.86 seconds. Finally, the BDF and CRAM methods were compared within CASMO5, where CRAM had a FOM about four times better than BDF, although the BDF implementation was not fully optimized. (authors)

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Solving implicit multi-mesh flow and conjugate heat transfer problems with RELAP-7

The fully implicit simulation capability of RELAP-7 to solve multi-mesh flow and conjugate heat transfer problems for reactor system safety analysis is presented. Compared to general single-mesh simulations, the reactor system safety analysis-type of code has unique challenges due to its highly simplified, interconnected, one-dimensional, and zero-dimensional flow network describing multiple physics with significantly different time and length scales. To use the Jacobian-free Newton Krylov-type of solver, preconditioning is generally required for the Krylov method. The uniqueness of the reactor safety analysis-type of code in treating the interconnected flow network and conjugate heat transfer also introduces challenges in providing preconditioning matrix. Typical flow and conjugate heat transfer problems involved in reactor safety analysis using RELAP-7, as well as the special treatment on the preconditioning matrix are presented in detail. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Exploiting Power Flow Manifold to Solve AC Optimal Power Flow

AC optimal power flow has proven difficult to solve with interior point methods on GPUs. This is largely due to challenging linear algebra problems that current state of the art massively parallel linear solvers struggle with. However, the advent of Riemannian optimization techniques and the fact that the power flow equations form a smooth manifold present an alternative approach. In this talk, we present the basics of Riemannian optimization techniques in which optimization is done directly on a manifold. Then we present computational results showing that Riemannian techniques are capable of producing solutions of comparable quality as interior point methods.

AC optimal power flow↗

Exploring Professor Motivations and Implementations of a Real-World Problem-Solving Project: A Case Study in Preparing Students for the Emerging Building Science Industry: Preprint

Engineering education literature offers a variety of theoretical and conceptual frameworks for project-based learning. This study explores the implementation of real-world problem-solving projects in engineering education. The research team analyzed the motivations and methods behind professors' adoption of such projects through exploratory qualitative interviews with seven professor participants who integrated a nation-wide student competition into their courses. We analyzed the resulting data using a constructivist grounded theory approach to identify key themes of professor practices. Findings reveal that the real-world aspect of the projects and alignment with values and research interests were primary motivators for implementation. While implementation methods varied significantly based on context (i.e., university setting, course type), we found that these projects could be effectively integrated into various classroom settings. The findings support the recommendation for non-academic institutions to develop and manage competitions that can be integrated into classrooms and which offer a point of engagement that is available to professors from a wide range of disciplines.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Use of Complementary Cation And Anion Heavy Atom-Atom Salt Derivatives to Solve the Structure of Cytochrome P450 46a1

Human cytochrome P450 46A1 (CYP46A1) is one of the key enzymes in cholesterol homeostasis in the brain. The crystallization and heavy-atom structure solution of an active truncated CYP46A1 in complex with the high-affinity substrate analogue cholesterol-3-sulfate (CH-3S) is reported. The 2.6 {angstrom} structure of CYP46A1-CH-3S was solved using both anion and cation heavy-atom salts. In addition to the native anomalous signal from the haem iron, an NaI anion halide salt derivative and a complementary CsCl alkali-metal cation salt derivative were used. The general implications of the use of halide and alkali-metal quick soaks are discussed. The importance of using isoionic strength buffers, the titration of heavy-atom salts into different ionic species and the role of concentration are considered. It was observed that cation/anion-binding sites will occasionally overlap, which could negatively impact upon mixed RbBr soaks used for multiple anomalous scatterer MAD (MMAD). The use of complementary cation and anion heavy-atom salt derivatives is a convenient and powerful tool for MIR(AS) structure solution.

59 BASIC BIOLOGICAL SCIENCES↗

Solving the structure of metakaolin

Metakaolin has been used extensively as a cement additive and paint extender, and recently as a geopolymer precursor. This disordered layered aluminosilicate is formed via the dehydroxylation of kaolinite. However, an accurate representation of its atomic structure has bever before been presented. Here, a novel synergy between total scattering and density functional modeling is presented to solve the structure of metakaolin. The metastable structure is elucidated by iterating between least-squares real-space refinement using neutron pair distribution function data, and geometry optimization using density functional modeling. The resulting structural representation is both energetically feasible and in excellent agreement with experimental data. This accurate structure of metakaolin provides new insight into the local environment of the aluminum atoms, with evidence of the existence of tri-coordinated aluminum. By the availability of this detailed atomic description, there exists the opportunity to tailor chemical and mechanical processes involving metakaolin at the atomic level to obtain optimal performance at the macro-scale.

36 MATERIALS SCIENCE↗

A massively parallel semi-Lagrangian algorithm for solving the transport equation

The scalar transport equation underpins many models employed in science, engineering, technology and business. Application areas include, but are not restricted to, pollution transport, weather forecasting, video analysis and encoding (the optical flow equation), options and stock pricing (the Black-Scholes equation) and spatially explicit ecological models. Unfortunately finding numerical solutions to this equation which are fast and accurate is not trivial. Moreover, finding such numerical algorithms that can be implemented on high performance computer architectures efficiently is challenging. In this paper the authors describe a massively parallel algorithm for solving the advection portion of the transport equation. We present an approach here which is different to that used in most transport models and which we have tried and tested for various scenarios. The approach employs an intelligent domain decomposition based on the vector field of the system equations and thus automatically partitions the computational domain into algorithmically autonomous regions. The solution of a classic pure advection transport problem is shown to be conservative, monotonic and highly accurate at large time steps. Additionally we demonstrate that the algorithm is highly efficient for high performance computer architectures and thus offers a route towards massively parallel application.

54 ENVIRONMENTAL SCIENCES↗