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 361 records · Page 20

Atmospheric River Frequency-Category Characteristics Shape U.S. West Coast Runoff

Abstractrunoff response to atmospheric rivers (ARs) over the U.S. West Coast. We focused on runoff time series variations impacted by AR characteristics (e.g., category and frequency) and land preconditions during Northern Hemisphere cool seasons in the period of 1940–2023. Results show that high-category ARs significantly increase local runoff with higher hourly precipitation rates leading to a greater incremental rate and peak runoff. Extreme runoff increases greatly with the AR category with an increase rate up to 12.5 times stronger than non-extreme runoff. Besides the AR category, land preconditions such as soil moisture and snowpack also play crucial roles in modulating runoff response. We found that runoff induced by weak-category ARs is more sensitive to land preconditions than high-category ARs, with high peak runoff occurring when soil is nearly saturated. Additionally, more than 50% of high-peak-runoff events in snow-covered grid cells are associated with rain-on-snow events particularly for the events associated with weaker ARs. Regression analysis reveals that AR precipitation and land preconditions jointly influence runoff, emphasizing the importance of including soil moisture and snowpack levels in AR impact assessments. The study also highlights the intensified runoff response to back-to-back ARs with short intervals, which may become more frequent with climate warming, posing increased flood risks via facilitating wet soil conditions. Our findings have significant implications for AR risk predictions and the development of prediction models for AR-induced runoff.

54 ENVIRONMENTAL SCIENCES↗

Diffusion Synthetic Acceleration for Heterogeneous Domains, Compatible with Voids

A standard approach to solving the S N transport equations is to use source iteration with diffusion synthetic acceleration (DSA). Although this approach is widely used and effective on many problems, there remain some practical issues with DSA preconditioning, particularly on highly heterogeneous domains. For large-scale parallel simulation, it is critical that both (a) preconditioned source iteration converges rapidly and (b) the action of the DSA preconditioner can be applied using fast, scalable solvers, such as algebraic multigrid (AMG). For heterogeneous domains, these two interests can be at odds. In particular, there exist DSA diffusion discretizations that can be solved rapidly using AMG, but they do not always yield robust/fast convergence of the larger source iteration. Conversely, there exist robust DSA discretizations where source iteration converges rapidly on difficult heterogeneous problems, but fast parallel solvers like AMG tend to struggle applying the action of such operators. Moreover, very few current methods for the solution of deterministic transport are compatible with voids. This paper develops a new heterogeneous DSA preconditioner based on only preconditioning the optically thick subdomains. The resulting method proves robust on a variety of heterogeneous transport problems, including a linearized hohlraum mesh related to inertial confinement fusion. Moreover, the action of the preconditioner is easily computed using O(1) AMG iterations, convergence of the transport iteration typically requires 2 to 5× fewer iterations than current state-of-the-art “full” DSA, and the proposed method is trivially compatible with voids. On the hohlraum problem, rapid convergence is obtained by preconditioning less than 3% of the mesh elements with five to ten AMG iterations.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Pseudo-compressibility methods for the incompressible flow equations

Preconditioning methods to accelerate convergence to a steady state for the incompressible fluid dynamics equations are considered. The analysis relies on the inviscid equations. The preconditioning consists of a matrix multiplying the time derivatives. Thus the steady state of the preconditioned system is the same as the steady state of the original system. The method is compared to other types of pseudo-compressibility. For finite difference methods preconditioning can change and improve the steady state solutions. An application to viscous flow around a cascade with a non-periodic mesh is presented.

Turkel, Eli↗

Light-Induced Metastabilities in Highly Efficient MZO/CdSeTe/CdTe Thin Film Solar Cells

Metastability effects have been investigated in high efficiency MZO/CdSeTe/CdTe solar cells. Two different preconditioning procedures have been studied to recover the performance of the devices. These preconditioning procedures include light soaking, annealing and cooling down the device under different atmospheric conditions. J-V curves before any preconditioning showed a `S` shaped behavior and disappears after 15 minutes of light soaking under 1000 Wm-2. Both Atmospheric and Vacuum preconditioning showed similar recovery of the device performance. However, this recovery only lasts for 3 days when the devices were kept under vacuum in the dark.

14 SOLAR ENERGY↗

Parallel State Estimation Assessment with Practical Data

This paper presents a full-cycle parallel state estimation (PSE) implementation using a preconditioned conjugate gradient algorithm. The developed code is able to solve large-size power system state estimation within 5 seconds using real-world data, comparable to the Supervisory Control And Data Acquisition (SCADA) rate. This achievement allows the operators to know the system status much faster to help improve grid reliability. Case study results of the Bonneville Power Administration (BPA) system with real measurements are presented. The benefits of fast state estimation are also discussed.

State Estimation, Preconditioned Conjugate Gradien↗

An adaptive scalable fully implicit algorithm based on stabilized finite element for reduced visco-resistive MHD

The magnetohydrodynamics (MHD) equations are continuum models used in the study of a wide range of plasma physics systems, including the evolution of complex plasma dynamics in tokamak disruptions. However, efficient numerical solution methods for MHD are extremely challenging due to disparate time and length scales, strong hyperbolic phenomena, and nonlinearity. Additionally, therefore the development of scalable, implicit MHD algorithms and high-resolution adaptive mesh refinement strategies is of considerable importance. In this work, we develop a high-order stabilized finite-element algorithm for the reduced visco-resistive MHD equations based on the MFEM finite element library (mfem.org). The scheme is fully implicit, solved with the Jacobian-free Newton-Krylov (JFNK) method with a physics-based preconditioning strategy. Our preconditioning strategy is a generalization of the physics-based preconditioning methods in Chacón et al. (2002) to adaptive, stabilized finite elements. Algebraic multigrid methods are used to invert sub-block operators to achieve scalability. A parallel adaptive mesh refinement scheme with dynamic load-balancing is implemented to efficiently resolve the multi-scale spatial features of the system. Our implementation uses the MFEM framework, which provides arbitrary-order polynomials and flexible adaptive conforming and non-conforming meshes capabilities. Results demonstrate the accuracy, efficiency, and scalability of the implicit scheme in the presence of large scale disparity. The potential of the AMR approach is demonstrated on an island coalescence problem in the high Lundquist-number regime (≥ 10 7 ) with the successful resolution of plasmoid instabilities and thin current sheets.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Liquid and liquid–gas flows at all speeds

All speed flows and in particular low Mach number flow algorithms are addressed for the numerical approximation of the Kapila et al. [1] multiphase flow model. This model is valid for fluid mixtures evolving in mechanical equilibrium but out of temperature equilibrium and is efficient for material interfaces computation separating miscible and non-miscible fluids. In this context, the interface is considered as a numerically diffused zone, captured as well as all present waves (shocks, expansion waves). The same flow model can be used to solve cavitating and boiling flows [2]. Many applications occurring with liquid–gas interfaces and cavitating flows involve a very wide range of Mach number, from 10{sup −3} to supersonic (and even hypersonic) conditions with respect to the mixture sound speed. It is thus important to address numerical methods free of restrictions regarding the Mach number. To do this, a preconditioned Riemann solver is built and embedded into the Godunov explicit scheme. It is shown that this method converges to exact solutions but needs too small time steps to be efficient. An implicit version is then derived, first in one dimension and second in the frame of 2D unstructured meshes. Two-phase flow preconditioning is then addressed in the frame of the Saurel et al. [3] algorithm. Modifications of the preconditioned Riemann solver are needed and detailed. Convergence of both single phase and two-phase numerical solutions are demonstrated with the help of single phase and two-phase steady nozzle flow solutions. Last, the method is illustrated by the computation of real cavitating flows in Venturi nozzles. Vapour pocket size and instability frequencies are reproduced by the model and method without using any adjustable parameter.

42 ENGINEERING↗

Nonlinear Elimination Applied to Radiation Diffusion

We apply a nonlinearly preconditioned, quasi-Newton framework to accelerate the numerical solution of the thermal radiative transfer (TRT) equations. This framework was inspired by the unpublished method that has existed for years in Teton, Lawrence Livermore National Laboratory’s deterministic TRT code. In this paper, we cast this iteration scheme within a formal nonlinear preconditioning framework and compare its performance against other iteration schemes in the framework. With proper choices of iteration controls for the various levels of the solver, we can recover the standard linearized one-step method, a full nonlinear Newton scheme, as well as the method in Teton. In brief, the nonlinear preconditioning TRT scheme formally eliminates the material temperature equation from the nonlinear system in a nonlinear analog of a Schur complement. This nonlinear elimination step involves solving a decoupled nonlinear equation for each spatial degree of freedom and is therefore inexpensive. By applying a quasi-Newton iteration scheme on the new system, we obtain a three-level iteration scheme that is at least as efficient as commonly used TRT schemes. The new method allows full convergence to the nonlinear backward Euler time-discretized system, increasing accuracy and robustness, while using a similar number of linear iterations as the more common linearized one-step methods Eq. (4).

77 NANOSCIENCE AND NANOTECHNOLOGY↗

Low-Rank Correction Methods for Algebraic Domain Decomposition Preconditioners

This study presents a parallel preconditioning method for distributed sparse linear systems, based on an approximate inverse of the original matrix, that adopts a general framework of distributed sparse matrices and exploits domain decomposition (DD) and low-rank corrections. The DD approach decouples the matrix and, once inverted, a low-rank approximation is applied by exploiting the Sherman--Morrison--Woodbury formula, which yields two variants of the preconditioning methods. The low-rank expansion is computed by the Lanczos procedure with reorthogonalizations. Numerical experiments indicate that, when combined with Krylov subspace accelerators, this preconditioner can be efficient and robust for solving symmetric sparse linear systems. Comparisons with pARMS, a DD-based parallel incomplete LU (ILU) preconditioning method, are presented for solving Poisson's equation and linear elasticity problems.

97 MATHEMATICS AND COMPUTING↗

Shape-selective catalysts for Fischer-Tropsch chemistry : atomic layer deposition of active catalytic metals. Activity report : January 1, 2005 - September 30, 2005.

Argonne National Laboratory is carrying out a research program to create, prepare, and evaluate catalysts to promote Fischer-Tropsch (FT) chemistry - specifically, the reaction of hydrogen with carbon monoxide to form long-chain hydrocarbons. In addition to needing high activity, it is desirable that the catalysts have high selectivity and stability with respect to both mechanical strength and aging properties. The broad goal is to produce diesel fraction components and avoiding excess yields of both light hydrocarbons and heavy waxes. Originally the goal was to prepare shape-selective catalysts that would limit the formation of long-chain products and yet retain the active metal sites in a protected 'cage.' Such catalysts were prepared with silica-containing fractal cages. The activity was essentially the same as that of catalysts without the cages. We are currently awaiting follow-up experiments to determine the attrition strength of these catalysts. A second experimental stage was undertaken to prepare and evaluate active FT catalysts formed by atomic-layer deposition [ALD] of active components on supported membranes and particulate supports. The concept was that of depositing active metals (i.e. ruthenium, iron or cobalt) upon membranes with well defined flow channels of small diameter and length such that the catalytic activity and product molecular weight distribution could be controlled. In order to rapidly evaluate the catalytic membranes, the ALD coating processes were performed in an 'exploratory mode' in which ALD procedures from the literature appropriate for coating flat surfaces were applied to the high surface area membranes. Consequently, the Fe and Ru loadings in the membranes were likely to be smaller than those expected for complete monolayer coverage. In addition, there was likely to be significant variation in the Fe and Ru loading among the membranes due to difficulties in nucleating these materials on the aluminum oxide surfaces. The first series of experiments using coated membranes demonstrated that the technology needed further improvement. Specifically, observed catalytic FT activity was low. This low activity appeared to be due to: (1) low available surface area, (2) atomic deposition techniques that needed improvements, and (3) insufficient preconditioning of the catalyst surface prior to FT testing. Therefore, experimentation was expanded to the use of particulate silica supports having defined channels and reasonably high surface area. This later experimentation will be discussed in the next progress report. Subsequently, we plan to evaluate membranes after the ALD techniques are improved with a careful study to control and quantify the Fe and Ru loadings. The preconditioning of these surfaces will also be further developed. (A number of improvements have been made with particulate supports; they will be discussed in the subsequent report.) In support of the above, there was an opportunity to undertake a short study of cobalt/promoter/support interaction using the Advanced Photon Source (APS) of Argonne. Five catalysts and a reference cobalt oxide were characterized during a temperature programmed EXAFS/XANES experimental study with the combined effort of Argonne and the Center for Applied Energy Research (CAER) of the University of Kentucky. This project was completed, and it resulted in an extensive understanding of the preconditioning step of reducing Co-containing FT catalysts. A copy of the resulting manuscript has been submitted and accepted for publication. A similar project was undertaken with iron-containing FT catalysts; the data is currently being studied.

08 HYDROGEN↗

Robust parallel iterative solvers for linear and least-squares problems (Final Technical Report)

The primary goal of this project is to study and develop robust iterative methods for solving linear systems of equations and least squares systems. The focus of the Minnesota team is on algorithms development, robustness issues, and on tests and validation of the methods on realistic problems. 1. The project begun with an investigation on how to practically update a preconditioner obtained from an ILU-type factorization, when the coefficient matrix changes. 2. We investigated strategies to improve robustness in parallel preconditioners in a specific case of a PDE with discontinuous coefficients. 3. We explored ways to adapt standard preconditioners for solving linear systems arising from the Helmholtz equation. These are often difficult linear systems to solve by iterative methods. 4. We have also worked on purely theoretical issues related to the analysis of Krylov subspace methods for linear systems. 5. We developed an effective strategy for performing ILU factorizations for the case when the matrix is highly indefinite. The strategy uses shifting in some optimal way. The method was extended to the solution of Helmholtz equations by using complex shifts, yielding very good results in many cases. 6. We addressed the difficult problem of preconditioning sparse systems of equations on GPUs. 7. A by-product of the above work is a software package consisting of an iterative solver library for GPUs based on CUDA. This was made publicly available. It was the first such library that offers complete iterative solvers for GPUs. 8. We considered another form of ILU which blends coarsening techniques from Multigrid with algebraic multilevel methods. 9. We have released a new version on our parallel solver - called pARMS [new version is version 3]. As part of this we have tested the code in complex settings - including the solution of Maxwell and Helmholtz equations and for a problem of crystal growth.10. As an application of polynomial preconditioning we considered the problem of evaluating f(A)v which arises in statistical sampling. 11. As an application to the methods we developed, we tackled the problem of computing the diagonal of the inverse of a matrix. This arises in statistical applications as well as in many applications in physics. We explored probing methods as well as domain-decomposition type methods. 12. A collaboration with researchers from Toulouse, France, considered the important problem of computing the Schur complement in a domain-decomposition approach. 13. We explored new ways of preconditioning linear systems, based on low-rank approximations.

97 MATHEMATICS AND COMPUTING↗

Liquid hydrogen turbopump rapid start program

This program was to analyze, test, and evaluate methods of achieving rapid-start of a liquid hydrogen feed system (inlet duct and turbopump) using a minimum of thermal preconditioning time and propellant. The program was divided into four tasks. Task 1 includes analytical studies of the testing conducted in the other three tasks. Task 2 describes the results from laboratory testing of coating samples and the successful adherence of a KX-635 coating to the internal surfaces of the feed system tested in Task 4. Task 3 presents results of testing an uncoated feed system. Tank pressure was varied to determine the effect of flowrate on preconditioning. The discharge volume and the discharge pressure which initiates opening of the discharge valve were varied to determine the effect on deadhead (no through-flow) start transients. Task 4 describes results of testing a similar, internally coated feed system and illustrates the savings in preconditioning time and propellant resulting from the coatings.

Wong, G. S.↗

Numerical solution of large nonsymmetric eigenvalue problems

Several methods are discribed for combinations of Krylov subspace techniques, deflation procedures and preconditionings, for computing a small number of eigenvalues and eigenvectors or Schur vectors of large sparse matrices. The most effective techniques for solving realistic problems from applications are those methods based on some form of preconditioning and one of several Krylov subspace techniques, such as Arnoldi's method or Lanczos procedure. Two forms of preconditioning are considered: shift-and-invert and polynomial acceleration. The latter presents some advantages for parallel/vector processing but may be ineffective if eigenvalues inside the spectrum are sought. Some algorithmic details are provided that improve the reliability and effectiveness of these techniques.

Saad, Youcef↗

The impact of time step definition on code convergence and robustness

We have implemented preconditioning for multi-species reacting flows in two independent codes, an implicit (ADI) code developed in-house and the RPLUS code (developed at LeRC). The RPLUS code was modified to work on a four-stage Runge-Kutta scheme. The performance of both the codes was tested, and it was shown that preconditioning can improve convergence by a factor of two to a hundred depending on the problem. Our efforts are currently focused on evaluating the effect of chemical sources and on assessing how preconditioning may be applied to improve convergence and robustness in the calculation of reacting flows.

Venkateswaran, S.↗

Design of optimally smoothing multistage schemes for the Euler equations

A recently derived local preconditioning of the Euler equations is shown to be useful in developing multistage schemes suited for multigrid use. The effect of the preconditioning matrix on the spatial Euler operator is to equalize the characteristic speeds. When applied to the discretized Euler equations, the preconditioning has the effect of strongly clustering the operator's eigenvalues in the complex plane. This makes possible the development of explicit marching schemes that effectively damp most high-frequency Fourier modes, as desired in multigrid applications. The technique is the same as developed earlier for scalar convection schemes: placement of the zeros of the amplification factor of the multistage scheme in locations where eigenvalues corresponding to high-frequency modes abound.

Van Leer, Bram↗

Using Correlation to Compute Better Probability Estimates in Plan Graphs

Plan graphs are commonly used in planning to help compute heuristic "distance" estimates between states and goals. A few authors have also attempted to use plan graphs in probabilistic planning to compute estimates of the probability that propositions can be achieved and actions can be performed. This is done by propagating probability information forward through the plan graph from the initial conditions through each possible action to the action effects, and hence to the propositions at the next layer of the plan graph. The problem with these calculations is that they make very strong independence assumptions - in particular, they usually assume that the preconditions for each action are independent of each other. This can lead to gross overestimates in probability when the plans for those preconditions interfere with each other. It can also lead to gross underestimates of probability when there is synergy between the plans for two or more preconditions. In this paper we introduce a notion of the binary correlation between two propositions and actions within a plan graph, show how to propagate this information within a plan graph, and show how this improves probability estimates for planning. This notion of correlation can be thought of as a continuous generalization of the notion of mutual exclusion (mutex) often used in plan graphs. At one extreme (correlation=0) two propositions or actions are completely mutex. With correlation = 1, two propositions or actions are independent, and with correlation > 1, two propositions or actions are synergistic. Intermediate values can and do occur indicating different degrees to which propositions and action interfere or are synergistic. We compare this approach with another recent approach by Bryce that computes probability estimates using Monte Carlo simulation of possible worlds in plan graphs.

Bryce, Daniel↗

Integrated Demand Management: Concepts and Procedures

This report provides a comprehensive description of the Integrated Demand Management concept. Motivation: NASA’s Integrated Demand Management (IDM) research explores the idea that, under certain conditions, time-based flow management (TBFM) arrival operations can benefit from the coordinated use of a strategic traffic management initiative (TMI) to “precondition” the inbound demand. The research was motivated by the observation that TBFM was usually turned off during convective weather, even in facilities where it was routinely used. Our hypothesis was that strategic adjustments to the inbound traffic so that it provided a better match to the off-nominal changes in capacity observed during these conditions could enable TBFM scheduling to continue to provide effective support for arrival traffic management. Concept: IDM proposes that a TMI (e.g., a Collaborative Trajectory Options Program, or CTOP) be used to adjust the rate and/or geographic distribution across flows of the traffic inbound to a high-demand, TBFM-managed airport before that traffic reaches the TBFM planning horizon. After this strategic preconditioning, TBFM can then tactically fine-tune the demand to deliver a well-managed, orderly feed to the destination airport. Coordinated use of these two flow management capabilities is intended to improve system performance in terms of: • Equity of ground delay assignment, avoiding excessive ground delay for TBFM-scheduled departures, without penalizing longer flights; • Throughput, by distributing traffic to maximize use of available capacity; • Predictability for operators, providing advance notice about the impact on individual flights; • Increased flexibility, supporting operator mitigation strategies such as slot swapping or trajectory options; • Efficiency of flight operations, using ground delay more effectively and reducing airborne delay. The operational description in this document highlights how the IDM concept builds upon already existing tools and procedures, and also indicates where tool enhancements could facilitate conduct of IDM operations. However, enhanced tools are not a requirement for concept introduction. In fact, initial deployment that focused on training procedures and rationale for coordinated use of TFMS and TBFM, without changes to existing tools, might be a simpler way to introduce and to familiarize traffic managers with the idea of preconditioning. The concept and procedures described in this document can hopefully provide useful guidance for introduction of IDM into field operations..

IDM↗

Surface stabilized electrodes for lithium batteries

An uncycled, preconditioned positive metal-oxide or lithium-metal-oxide electrode for a non-aqueous lithium electrochemical cell, the electrode being preconditioned in an aqueous or a non-aqueous solution containing stabilizing cations and anions that are etched into the electrode surface to form a protective layer. Methods of preconditioning the electrodes are disclosed as are electrochemical cells and batteries containing the electrodes.

Thackeray, Michael M.↗