Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “preconditioning”

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 505 records · Page 28

Comprehensive Performance Calibration Guidance for Perovskites and Other Emerging Solar Cells

Emerging photovoltaic (PV) technologies (e.g., organic, perovskite, and solution processed quantum dot) have attracted remarkable attention with the rapid growth of their efficiencies, and their transition toward commercialization. Accurate and reliable efficiency measurements of these PV technologies are crucial, yet much more complicated than for conventional PV technologies due to the former's pronounced dynamic responses to changes in measurement conditions (e.g., current–voltage (I–V) scan rate and preconditioning) and their susceptibility to degradation. Adjustments to the measurement procedures are therefore necessary so that a reproducible “steady state” is reached during measurement. Furthermore, given the small size of many emerging cells, inappropriate device area definition and solar simulator setup can lead to measurement errors. Here, comprehensive efficiency calibration guidance is offered for emerging solar cells, including area measurement; spectral irradiance translation to standard test conditions; and steady-state electrical performance. The necessity of reporting steady-state efficiency is justified with a statistical performance comparison between conventional and steady-state I–V scans over hundreds of cells the group has received globally for efficiency certifications. The procedures described here do not require specialized measurement instrumentation; what matters most are changes to the measurement protocols. These described changes aim to enable better comparisons between reported efficiencies.

14 SOLAR ENERGY↗

Enabling 4C Fast Charging of Lithium–Ion Batteries by Coating Graphite with a Solid–State Electrolyte

Enabling fast-charging (≥4C) of lithium-ion batteries is an important challenge to accelerate the adoption of electric vehicles. However, the desire to maximize energy density has driven the use of increasingly thick electrodes, which hinders rate capability. Herein, atomic layer deposition is used to coat a single-ion conducting solid electrolyte (Li 3 BO 3 -Li 2 CO 3 ) onto postcalendered graphite electrodes, forming an artificial solid-electrolyte interphase (SEI). When compared to uncoated control electrodes, the solid electrolyte coating: 1) eliminates natural SEI formation during preconditioning; 2) decreases interphase impedance by >75% compared to the natural SEI; and 3) extends cycle life under 4C charging conditions, enabling retention of 80% capacity after 500 cycles (compared to 12 cycles in the uncoated control) in pouch cells with >3 mAh cm –2 loading. Furthermore, this work demonstrates that 4C charging without Li plating can be achieved through purely interfacial modification without sacrificing energy density and sheds new light on the role of the SEI in Li plating and fast-charge performance.

25 ENERGY STORAGE↗

Beyond ethics: The transformational power of overlapping motivations in implementing strategic sustainability actions

Abstract We develop a methodology to identify patterns between sustainability motivations, actions and engagement. We apply this methodology to analyse a 3 1/2‐year intervention that yielded 151 sustainability actions undertaken by 46 outbound tour operators. We find three aspects that can be explained by the tour operators' motivations to act sustainably, namely, a connection between: (i) the actions taken in the context of the organisation's business model, (ii) the intensity of the approach, measured by the resources invested in it and the operator's commitment level and (iii) the evolution of the response. These patterns demonstrate how ethical motivations are common and a precondition to acting sustainably, but, in themselves, these motivations are not sufficient to integrate sustainability practices into the core business or to maintain commitment over time. It is the combination of a high ethical commitment with clear strategic intent, materialised in commercial and operational motivations, that increases the connectedness, and intensity, of sustainability actions amongst ethically committed firms.

Bonilla‐Priego, Maria Jesus↗

Bootstrap AMG for spectral clustering

Graph Laplacian is a popular tool for analyzing graphs, particularly in graph partitioning and clustering. Given a notion of similarity (via an adjacency matrix), graph clustering refers to identifying different groups such that vertices in the same group are more similar compared to vertices across different groups. Data clustering can be reformulated in terms of a graph clustering problem when the given set of data is represented as a graph, also known as similarity graph. In this context, eigenvectors of the graph Laplacian are often used to obtain a new geometric representation of the original data set that generally enhances cluster properties and improves cluster detection. Here, we apply a bootstrap algebraic multigrid (AMG) method that constructs a set of vectors associated with the graph Laplacian. These vectors, referred to as algebraically smooth ones, span a low-dimensional Euclidean space, which we use to represent the data, enabling cluster detection both in synthetic and in realistic well-clustered graphs. We show that, in the case of a good quality bootstrap AMG, the computed smooth vectors employed in the construction of the final AMG operator, which by construction is spectrally equivalent to the originally given graph Laplacian, accurately approximate the space in the lower portion of the spectrum of the preconditioned operator. Thus, our approach can be viewed as a spectral clustering technique associated with the generalized spectral problem (Laplace operator versus the final AMG operator), and hence, it can be seen as an extension of the classical spectral clustering that employs a standard eigenvalue problem.

97 MATHEMATICS AND COMPUTING↗

Speedup of UEDGE Parameter Scans Using Machine-Learning Optimized OpenMP Parallelization and a Continuation Solver

This article presents the OpenMP parallelization of the preconditioning Jacobian assembly and right‐hand side residual evaluation in UEDGE. A continuation algorithm, utilizing the internal NKSOL implicit Jacobian‐Free Newton‐Krylov solver to efficiently scan physical parameters, is also presented. The implemented parallelization reduces the computational time for a benchmark scan run on 32 threads by compared to the serial version when using trained random forest regression models to identify the optimal decomposition of the system of equations. Random forest regression models applied to the UEDGE time‐dependent and continuation solver algorithms did not yield meaningful improvement in computational performance. A benchmark DIII‐D gas injection rate scan in the 0.35–0.75 kA interval, performed on a test cluster using the parallelized code and continuation solver, produced 1066 steady‐state solutions with a 22 s average wall‐clock computational time per steady‐state solution.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Parallel domain decomposition method for finite element approximation of 3D steady state non‐Newtonian fluids

Summary We introduce a stabilized finite element method for the 3D non‐Newtonian Navier–Stokes equations and a parallel domain decomposition method for solving the sparse system of nonlinear equations arising from the discretization. Non‐Newtonian flow problems are, generally speaking, more challenging than Newtonian flows because the nonlinearities are not only in the convection term but also in the viscosity term, which depends on the shear rate. Many good iterative methods and preconditioning techniques that work well for the Newtonian flows do not work well for the non‐Newtonian flows. We employ a Galerkin/least squares finite element method, with stabilization parameters adjusted to count the non‐Newtonian effect, to discretize the equations, and the resulting highly nonlinear system of equations is solved by a Newton–Krylov–Schwarz algorithm. In this study, we apply the proposed method to some inelastic power‐law fluid flows through the eccentric annuli with inner cylinder rotation and investigate the robustness of the method with respect to some physical parameters, including the power‐law index and the Reynolds number ratios. We then report the superlinear speedup achieved by the domain decomposition algorithm on a computer with up to 512 processors. Copyright © 2015 John Wiley & Sons, Ltd.

Shiu, Wen‐Shin↗

A third-order implicit discontinuous Galerkin method based on a Hermite WENO reconstruction for time-accurate solution of the compressible Navier-Stokes equations

Here, a space and time third-order discontinuous Galerkin method based on a Hermite weighted essentially non-oscillatory reconstruction is presented for the unsteady compressible Euler and Navier–Stokes equations. At each time step, a lower-upper symmetric Gauss–Seidel preconditioned generalized minimal residual solver is used to solve the systems of linear equations arising from an explicit first stage, single diagonal coefficient, diagonally implicit Runge–Kutta time integration scheme. The performance of the developed method is assessed through a variety of unsteady flow problems. Numerical results indicate that this method is able to deliver the designed third-order accuracy of convergence in both space and time, while requiring remarkably less storage than the standard third-order discontinous Galerkin methods, and less computing time than the lower-order discontinous Galerkin methods to achieve the same level of temporal accuracy for computing unsteady flow problems.

97 MATHEMATICS AND COMPUTING↗

New algorithms for iterative matrix‐free eigensolvers in quantum chemistry

New algorithms for iterative diagonalization procedures that solve for a small set of eigen‐states of a large matrix are described. The performance of the algorithms is illustrated by calculations of low and high‐lying ionized and electronically excited states using equation‐of‐motion coupled‐cluster methods with single and double substitutions (EOM‐IP‐CCSD and EOM‐EE‐CCSD). We present two algorithms suitable for calculating excited states that are close to a specified energy shift (interior eigenvalues). One solver is based on the Davidson algorithm, a diagonalization procedure commonly used in quantum‐chemical calculations. The second is a recently developed solver, called the “Generalized Preconditioned Locally Harmonic Residual (GPLHR) method.” We also present a modification of the Davidson procedure that allows one to solve for a specific transition. The details of the algorithms, their computational scaling, and memory requirements are described. The new algorithms are implemented within the EOM‐CC suite of methods in the Q‐Chem electronic structure program. © 2014 Wiley Periodicals, Inc.

Zuev, Dmitry↗

Accuracy and convergence properties of the fixed-stress iterative solution of two-way coupled poromechanics

Here, the paper deals with the numerical solution of Biot's equations of coupled consolidation obtained by a mixed formulation combining continuous Galerkin finite–element and multipoint flux approximation finite–volume methods. The solution algorithm relies on the recently developed fixed–stress solution scheme, in which first the flow problem and then the mechanical one are addressed iteratively. We show that the algorithm can be interpreted as a particular block triangular preconditioning strategy applied within a Richardson iteration. The key component to the success of the preconditioner is the sparse approximation to the Schur complement based on a pressure space mass matrix scaled by a weighting factor that depends element–wise on the inverse of a suitable bulk modulus. The accuracy of the method is assessed, making use of well–known analytical solutions from the literature. Numerical results demonstrate robustness and low computational cost of the fixed–stress scheme in accurately capturing the two–way coupling between deformation and pressure.

58 GEOSCIENCES↗

Optimal Polynomial Smoothers and One‐Sided V‐Cycles for Poisson Problems

The solution to the Poisson equation arising from the spectral element discretization of the incompressible Navier‐Stokes equations needs robust preconditioning strategies. One such strategy is multigrid. To realize the potential of multigrid methods, effective smoothing strategies are needed. Chebyshev polynomial smoothers, in conjunction with pointwise Jacobi or additive Schwarz methods (ASMs), prove to be an effective smoother. Other polynomial smoothers, however, may provide superior convergence to the multigrid preconditioner. The authors compare the standard Chebyshev polynomial smoothers to both the novel fourth‐kind Chebyshev polynomial smoothers proposed by Lottes as well as smoothers based on the polynomial of best uniform approximation to as proposed by Kraus, Vassilevski, and Zikatanov. At the cost of symmetry, further improvements may be made. For example, a order polynomial smoother on both sides of the V‐cycle may be substituted with an order polynomial smoother on one side at no additional cost. The choice of omitting the postsmoother in favor of higher‐order polynomial presmoothing is advantageous in cases where the multigrid approximation property constant is large. The authors consider a 2D model problem based on finite differences to motivate the choice of polynomial smoother, order, and whether to apply postsmoothing for the target application of high‐order ‐geometric multigrid methods for GPU architectures. Results from both domains demonstrate the substantial improvement of these approaches over the standard Chebyshev polynomial smoother with a symmetric V‐cycle.

97 MATHEMATICS AND COMPUTING↗

Towards Adaptive Mesh Refinement for the Spectral Element Solver Nek5000

When performing computational fluid dynamics (CFD) simulations of complex flows, the a priori knowledge of the flow physics and the location of the dominant flow features are usually unknown. For this reason, the development of adaptive remeshing techniques is crucial for large-scale computational problems. Some work has been made recently to provide Nek5000 with adaptive mesh refinement (AMR) capabilities in order to facilitate the generation of the grid and push forward the limit in terms of problem size and complexity [10]. Nek5000 is an open-source, highly scalable and portable code based on the spectral element method (SEM) [4], which offers minimal dissipation and dispersion, high accuracy and exponential convergence. It is aimed at solving direct and large-eddy simulations of turbulent incompressible or low Mach-number flows with heat transfer and species transport. The approach chosen for adapting the mesh is the h-refinement method, where elements are split locally, which requires the relaxation of the conforming grid constraint currently imposed by Nek5000. Other challenges include the implementation of an efficient management of the grid as refinement is applied, the development of tools to localize the critical flow regions via error estimators and the extension of the current preconditioning strategy to non-conforming grids. In this paper, we present a new procedure to setup an algebraic multigrid solver used as part of the preconditioner for the pressure equation.

Offermans, N.↗

Comparative Performance Analysis of Coarse Solvers for Algebraic Multigrid on Multicore and Manycore Architectures

In this paper, we study the performance of a two-level algebraic-multigrid algorithm, with a focus on the impact of the coarse-grid solver on performance. We consider two algorithms for solving the coarse-space systems: the preconditioned conjugate gradient method and a new robust HSS-embedded low-rank sparse-factorization algorithm. Our test data comes from the SPE Comparative Solution Project for oil-reservoir simulations. We contrast the performance of our code on one 12-core socket of a Cray XC30 machine with performance on a 60-core Intel Xeon Phi coprocessor. To obtain top performance, we optimized the code to take full advantage of fine-grained parallelism and made it thread-friendly for high thread count. We also developed a bounds-and-bottlenecks performance model of the solver which we used to guide us through the optimization effort, and also carried out performance tuning in the solver’s large parameter space. Finally, as a result, significant speedups were obtained on both machines.

97 MATHEMATICS AND COMPUTING↗

OpenSHMEM Implementation of HPCG Benchmark, In: OpenSHMEM 2016: OpenSHMEM and Related Technologies. Enhancing OpenSHMEM for Hybrid Environments

We describe the effort to implement the HPCG benchmark using OpenSHMEM and MPI one-sided communication. Unlike the High Performance LINPACK (HPL) benchmark that places emphasis on large dense matrix computations, the HPCG benchmark is dominated by sparse operations such as sparse matrix-vector product, sparse matrix triangular solve, and long vector operations. The MPI one-sided implementation is developed using the one-sided OpenSHMEM implementation. Preliminary results comparing the original MPI, OpenSHMEM, and MPI one-sided implementations on an SGI cluster, Cray XK7 and Cray XC30 are presented. The results suggest the MPI, OpenSHMEM, and MPI one-sided implementations all obtain similar overall performance but the MPI one-sided implementation seems to slightly increase the run time for multigrid preconditioning in HPCG on the Cray XK7 and Cray XC30.

Computer Science↗

Distal Pancreatectomy With En Bloc Resection of the Celiac Trunk for Extended Pancreatic Tumor Disease: An Interdisciplinary Approach

Purpose: Infiltration of the celiac trunk by adenocarcinoma of the pancreatic body has been considered a contraindication for surgical treatment, thus resulting in a very poor prognosis. The concept of distal pancreatectomy with resection of the celiac trunk offers a curative treatment option but implies the risk of relevant hepatic or gastric ischemia. We describe initial experiences in a small series of patients with left celiacopancreatectomy with or without angiographic preconditioning of arterial blood flow to the stomach and the liver. Materials and Methods: Between January 2007 and October 2009, six patients underwent simultaneous resection of the celiac trunk for adenocarcinoma of the pancreatic body involving the celiac axis. In four of these cases, angiographic occlusion of the celiac trunk before surgery was performed to enhance collateral flow from the gastroduodenal artery. Radiologic and surgical procedures, findings, and outcome were analyzed retrospectively. Results: Complete tumor removal (R0) succeeded in two patients, whereas four patients underwent R1-tumor resection. After surgery, one of the two patients without angiographic preparation experienced an ischemic stomach perforation 1 week after surgery. The other patient died from severe bleeding from an ischemic gastric ulcer. Of the four patients with celiac trunk embolization, none presented ischemic complications after surgery. Mean survival was 371 days. Conclusion: In this small series, ischemic complications after celiacopancreatectomy occurred only in those patients who did not receive preoperative celiac trunk embolization.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Geometric multigrid for an implicit-time immersed boundary method

The immersed boundary (IB) method is an approach to fluid-structure interaction that uses Lagrangian variables to describe the deformations and resulting forces of the structure and Eulerian variables to describe the motion and forces of the fluid. Explicit time stepping schemes for the IB method require solvers only for Eulerian equations, for which fast Cartesian grid solution methods are available. Such methods are relatively straightforward to develop and are widely used in practice but often require very small time steps to maintain stability. Implicit-time IB methods permit the stable use of large time steps, but efficient implementations of such methods require significantly more complex solvers that effectively treat both Lagrangian and Eulerian variables simultaneously. Moreover, several different approaches to solving the coupled Lagrangian-Eulerian equations have been proposed, but a complete understanding of this problem is still emerging. This paper presents a geometric multigrid method for an implicit-time discretization of the IB equations. This multigrid scheme uses a generalization of box relaxation that is shown to handle problems in which the physical stiffness of the structure is very large. Numerical examples are provided to illustrate the effectiveness and efficiency of the algorithms described herein. Finally, these tests show that using multigrid as a preconditioner for a Krylov method yields improvements in both robustness and efficiency as compared to using multigrid as a solver. They also demonstrate that with a time step 100–1000 times larger than that permitted by an explicit IB method, the multigrid-preconditioned implicit IB method is approximately 50–200 times more efficient than the explicit method.

97 MATHEMATICS AND COMPUTING↗

Analysis of Coastal Fog from a Ship During the C-FOG Campaign

This work presents ship-based measurements of fog off St John’s Newfoundland on 13 September 2018 during the Coastal Fog (C-FOG) field campaign. The measurements included cloud-particle spectra, cloud-base height and aerosol backscatter, radiation, turbulence, visibility, and sea surface temperature. Radiosonde soundings were made at intervals less than 2 hours. Fog occurred in two episodes under the center of eastward-moving synoptic low-pressure system. The boundary layer structure during the first fog episode consisted of 3 layers, separated by 2 saturated air temperature inversions and capped by a subsidence inversion. The lowest layer was fog and the upper layers were cloud. The second fog episode consisted of one well-mixed fog layer capped by a subsidence inversion. Low wind speeds and stable stratification maintained low surface-layer turbulence during fog. Droplet size distributions had typical bimodal distributions. The visibility correlated with the droplet number concentration and liquid water content. The air temperature was higher than the sea surface temperature for the first 30 minutes of the first fog episode but was colder than the sea for the remainder of all fog. The sensible heat flux was upward, from sea to air, for the first 62 % of the first fog episode and then reversed to downward, from air to sea, for the remainder of the first fog episode and the second fog episode. Here, the counter-gradient heat fluxes observed (i.e., opposite to what is expected from the instantaneous air-sea temperature difference) appear to be related to turbulence, entrainment and stratification in the fog layer that overwhelmed the influence of air-sea temperature difference. While the synoptic-scale dynamics preconditioned the area for fog formation, the final step of fog appearance in this case was nuanced by stratification-turbulence interactions, local advective processes and microphysical environment.

54 ENVIRONMENTAL SCIENCES↗

Multiscale two-stage solver for Biot’s poroelasticity equations in subsurface media

In this paper, we propose a two-stage preconditioner for accelerating the iterative solution by a Krylov subspace method of Biot’s poroelasticity equations based on a displacement-pressure formulation. The spatial discretization combines a finite element method for mechanics and a finite volume approach for flow. The fully implicit backward Euler scheme is used for time integration. The result is a 2 × 2 block linear system for each timestep. The preconditioning operator is obtained by applying a two-stage scheme. The first stage is a global preconditioner that employs multiscale basis functions to construct coarse-scale coupled systems using a Galerkin projection. This global stage is effective at damping low-frequency error modes associated with long-range coupling of the unknowns. The second stage is a local block-triangular smoothing preconditioner, which is aimed at high-frequency error modes associated with short-range coupling of the variables. Lastly, various numerical experiments are used to demonstrate the robustness of the proposed solver.

58 GEOSCIENCES↗