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 19 records

A projected preconditioned conjugate gradient algorithm for computing many extreme eigenpairs of a Hermitian matrix

We present an iterative algorithm for computing an invariant subspace associated with the algebraically smallest eigenvalues of a large sparse or structured Hermitian matrix A. We are interested in the case in which the dimension of the invariant subspace is large (e.g., over several hundreds or thousands) even though it may still be small relative to the dimension of A. These problems arise from, for example, density functional theory (DFT) based electronic structure calculations for complex materials. The key feature of our algorithm is that it performs fewer Rayleigh–Ritz calculations compared to existing algorithms such as the locally optimal block preconditioned conjugate gradient or the Davidson algorithm. It is a block algorithm, and hence can take advantage of efficient BLAS3 operations and be implemented with multiple levels of concurrency. We discuss a number of practical issues that must be addressed in order to implement the algorithm efficiently on a high performance computer.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Fast inversion, preconditioned quantum linear system solvers, fast Green's-function computation, and fast evaluation of matrix functions

Preconditioning is the most widely used and effective way for treating ill-conditioned linear systems in the context of classical iterative linear system solvers. We introduce a quantum primitive called fast inversion, which can be used as a preconditioner for solving quantum linear systems. The key idea of fast inversion is to directly block encode a matrix inverse through a quantum circuit implementing the inversion of eigenvalues via classical arithmetics. We demonstrate the application of preconditioned linear system solvers for computing single-particle Green's functions of quantum many-body systems, which are widely used in quantum physics, chemistry, and materials science. We analyze the complexities in three scenarios: the Hubbard model, the quantum many-body Hamiltonian in the plane-wave-dual basis, and the Schwinger model. We also provide a method for performing Green's function calculation in second quantization within a fixed-particle manifold and note that this approach may be valuable for simulation more broadly. Aside from solving linear systems, fast inversion also allows us to develop fast algorithms for computing matrix functions, such as the efficient preparation of Gibbs states. Furthermore, we introduce two efficient approaches for such a task, based on the contour-integral formulation and the inverse transform, respectively.

97 MATHEMATICS AND COMPUTING↗

Efficient block preconditioned eigensolvers for linear response time-dependent density functional theory

We present two efficient iterative algorithms for solving the linear response eigen- value problem arising from the time dependent density functional theory. Although the matrix to be diagonalized is nonsymmetric, it has a special structure that can be exploited to save both memory and floating point operations. In particular, the nonsymmetric eigenvalue problem can be transformed into a product eigenvalue problem that is self-adjoint with respect to a K-inner product. This product eigenvalue problem can be solved efficiently by a modified Davidson algorithm and a modified locally optimal block preconditioned conjugate gradient (LOBPCG) algorithm that make use of the K-inner product. The solution of the product eigenvalue problem yields one component of the eigenvector associated with the original eigenvalue problem. However, the other component of the eigenvector can be easily recovered in a postprocessing procedure. Therefore, the algorithms we present here are more efficient than existing algorithms that try to approximate both components of the eigenvectors simultaneously. The efficiency of the new algorithms is demonstrated by numerical examples.

97 MATHEMATICS AND COMPUTING↗

Accelerating nuclear configuration interaction calculations through a preconditioned block iterative eigensolver

We describe a number of recently developed techniques for improving the performance of large-scalenuclear configuration interaction calculations on high performance parallel computers. We show thebenefit of using a preconditioned block iterative method to replace the Lanczos algorithm that hastraditionally been used to perform this type of computation. The rapid convergence of the block iterativemethod is achieved by a proper choice of starting guesses of the eigenvectors and the construction of aneffective preconditioner. These acceleration techniques take advantage of special structure of the nuclearconfiguration interaction problem which we discuss in detail. The use of a block method also allows usto improve the concurrency of the computation, and take advantage of the memory hierarchy of modernmicroprocessors to increase the arithmetic intensity of the computation relative to data movement. Wealso discuss the implementation details that are critical to achieving high performance on massivelyparallel multi-core supercomputers, and demonstrate that the new block iterative solver is two to threetimes faster than the Lanczos based algorithm for problems of moderate sizes on a Cray XC30 system.

Shao, Meiyue↗

Progress Toward a Stabilization and Preconditioning Protocol for Polycrystalline Thin-Film Photovoltaic Modules

Cadmium telluride (CdTe) and copper indium gallium diselenide (CIGS) thin-film photovoltaic (PV) modules can exhibit substantial variation in measured performance depending on prior exposure history. This study examines the metastable performance changes in these PV modules with the goal of establishing standard preconditioning or stabilization exposure procedures to mitigate measured variationsprior to current-voltage (IV) measurements.

14 SOLAR ENERGY↗

A Preconditioned Low-Rank Projection Method with a Rank-Reduction Scheme for Stochastic Partial Differential Equations

Herein, we consider the numerical solution of large systems of linear equations obtained from the stochastic Galerkin formulation of stochastic partial differential equations. We propose an iterative algorithm that exploits the Kronecker product structure of the linear systems. The proposed algorithm efficiently approximates the solutions in low-rank tensor format. Using standard Krylov subspace methods for the data in tensor format is computationally prohibitive due to the rapid growth of tensor ranks during the iterations. To keep tensor ranks low over the entire iteration process, we devise a rank-reduction scheme that can be combined with the iterative algorithm. The proposed rank-reduction scheme identifies an important subspace in the stochastic domain and compresses tensors of high rank on-the-fly during the iterations. The proposed reduction scheme is a coarse-grid method in that the important subspace can be identified inexpensively in a coarse spatial grid setting. The efficiency of the present method is displayed by numerical experiments on benchmark problems.

97 MATHEMATICS AND COMPUTING↗

Involvement of SIRT1 in hypoxic down-regulation of c-Myc and β-catenin and hypoxic preconditioning effect of polyphenols

SIRT1 has been found to function as a Class III deacetylase that affects the acetylation status of histones and other important cellular nonhistone proteins involved in various cellular pathways including stress responses and apoptosis. In this study, we investigated the role of SIRT1 signaling in the hypoxic down-regulations of c-Myc and β-catenin and hypoxic preconditioning effect of the red wine polyphenols such as piceatannol, myricetin, quercetin and resveratrol. We found that the expression of SIRT1 was significantly increased in hypoxia-exposed or hypoxic preconditioned HepG2 cells, which was closely associated with the up-regulation of HIF-1α and down-regulation of c-Myc and β-catenin expression via deacetylation of these proteins. In addition, blockade of SIRT1 activation using siRNA or amurensin G, a new potent SIRT1 inhibitor, abolished hypoxia-induced HIF-1α expression but increased c-Myc and β-catenin expression. SIRT1 was also found to stabilize HIF-1α protein and destabilize c-Myc, β-catenin and PHD2 under hypoxia. We also found that myricetin, quercetin, piceatannol and resveratrol up-regulated HIF-1α and down-regulated c-Myc, PHD2 and β-catenin expressions via SIRT1 activation, in a manner that mimics hypoxic preconditioning. This study provides new insights of the molecular mechanisms of hypoxic preconditioning and suggests that polyphenolic SIRT1 activators could be used to mimic hypoxic/ischemic preconditioning. -- Graphical abstract: Polyphenols mimicked hypoxic preconditioning by up-regulating HIF-1α and SIRT1 and down-regulating c-Myc, PHD2, and β-catenin. HepG2 cells were pretreated with the indicated doses of myricetin (MYR; A), quercetin (QUR; B), or piceatannol (PIC; C) for 4 h and then exposed to hypoxia for 4 h. Levels of HIF-1α, SIRT1, c-Myc, β-catenin, and PHD2 were determined by western blot analysis. The data are representative of three individual experiments. Highlights: ► SIRT1 expression is increased in hypoxia-exposed or hypoxic preconditioned cells. ► SIRT1 deacetylates c-Myc and β-catenin ► HIF-1α is up-regulated by down-regulation of c-Myc and β-catenin expression. ► Polyphenolic SIRT1 activators mimics hypoxic preconditioning.

60 APPLIED LIFE SCIENCES↗

Preconditioned least‐squares Petrov–Galerkin reduced order models

Abstract In this article, we introduce a methodology for improving the accuracy and efficiency of reduced order models (ROMs) constructed using the least‐squares Petrov–Galerkin (LSPG) projection method through the introduction of preconditioning. Unlike prior related work, which focuses on preconditioning the linear systems arising within the ROM numerical solution procedure to improve linear solver performance, our approach leverages a preconditioning matrix directly within the minimization problem underlying the LSPG formulation. Applying preconditioning in this way has the potential to improve ROM accuracy for several reasons. First, preconditioning the LSPG formulation changes the norm defining the residual minimization, which can improve the residual‐based stability constant bounding the ROM solution's error. The incorporation of a preconditioner into the LSPG formulation can have the additional effect of scaling the components of the residual being minimized to make them roughly of the same magnitude, which can be beneficial when applying the LSPG method to problems with disparate scales (e.g., dimensional equations, multi‐physics problems). Importantly, we demonstrate that an “ideal preconditioned” LSPG ROM (a ROM in which the preconditioner is the inverse of the Jacobian of its corresponding full order model) emulates projection of the full order model solution increment onto the reduced basis. This quantity defines a lower bound on the error of a ROM solution for a given reduced basis. By designing preconditioners that approximate the Jacobian inverse—as is common in designing preconditioners for solving linear systems—it is possible to obtain a ROM whose error approaches this lower bound. The proposed approach is evaluated on several mechanical and thermo‐mechanical problems implemented within the Albany HPC code and run in the predictive regime, with prediction across material parameter space. We demonstrate numerically that the introduction of simple Jacobi, Gauss‐Seidel, and ILU preconditioners into the proper orthogonal decomposition/LSPG formulation reduces significantly the ROM solution error, the reduced Jacobian condition number, the number of nonlinear iterations required to reach convergence, and the wall time (thereby improving efficiency). Moreover, our numerical results reveal that the introduction of preconditioning can deliver a robust and accurate solution for test cases in which the unpreconditioned LSPG method fails to converge.

Lindsay, Payton↗

Osteogenic preconditioning in perfusion bioreactors improves vascularization and bone formation by human bone marrow aspirates

Cell-derived extracellular matrix (ECM) provides a niche to promote osteogenic differentiation, cell adhesion, survival, and trophic factor secretion. To determine whether osteogenic preconditioning would improve the bone-forming potential of unfractionated bone marrow aspirate (BMA), we perfused cells on ECM-coated scaffolds to generate naïve and preconditioned constructs, respectively. The composition of cells selected from BMA was distinct on each scaffold. Naïve constructs exhibited robust proangiogenic potential in vitro, while preconditioned scaffolds contained more mesenchymal stem/stromal cells (MSCs) and endothelial cells (ECs) and exhibited an osteogenic phenotype. Upon implantation into an orthotopic calvarial defect, BMA-derived ECs were present in vessels in preconditioned implants, resulting in robust perfusion and greater vessel density over the first 14 days compared to naïve implants. After 10 weeks, human ECs and differentiated MSCs were detected in de novo tissues derived from naïve and preconditioned scaffolds. These results demonstrate that bioreactor-based preconditioning augments the bone-forming potential of BMA.

59 BASIC BIOLOGICAL SCIENCES↗

Morphine preconditioning confers cardioprotection in doxorubicin-induced failing rat hearts via ERK/GSK-3β pathway independent of PI3K/Akt

Preconditioning against myocardial ischemia–reperfusion (I/R) injury can be suppressed in some pathological conditions. This study was designed to investigate whether morphine preconditioning (MPC) exerts cardioprotection in doxorubicin (DOX)-induced heart failure in rats and the mechanisms involved. Phosphatidylinositol-3 kinase/protein kinase B (PI3K/Akt), extracellular signal-regulated kinase (ERK) and glycogen synthase kinase (GSK)-3β pathways were examined. Normal and DOX-induced failing rat hearts were subjected to I/R injury using a Langendorff perfusion system with or without MPC or ischemic preconditioning (IPC). The PI3K inhibitor (wortmannin) or ERK inhibitor (PD98059) was infused before MPC. In normal hearts, both MPC and IPC significantly reduced infarct size and the rise in lactate dehydrogenase (LDH) level caused by I/R injury. Pretreatment with wortmannin or PD98059 abrogated the protective effects of MPC and suppressed the phosphorylation of Akt, ERK and GSK-3β. In failing rat hearts, however, MPC retained its cardioprotection while IPC did not. This protective effect was abolished by PD98059 but not wortmannin. MPC increased the level of p-ERK rather than p-Akt. The phosphorylation of GSK-3β induced by MPC was reversed by PD98059 only. IPC did not elevate the expression of p-ERK, p-Akt and p-GSK-3β in failing rat hearts. We conclude that MPC is cardioprotective in rats with DOX-induced heart failure while IPC is not. The effect of MPC appears to be mediated via the ERK/GSK-3β pathway independent of PI3K/Akt. - Highlights: • Morphine and ischemic preconditioning are cardioprotective in normal rat hearts. • Ischemic preconditioning fails to confer cardioprotection in rats with heart failure. • Morphine retains cardioprotection in doxorubicin-induced heart failure. • Morphine exerts cardioprotection via the ERK/GSK-β pathway independent of PI3K/Akt.

60 APPLIED LIFE SCIENCES↗

Analysis of physics-based preconditioning for single-phase subchannel equations

The (single-phase) subchannel approximations are used throughout nuclear engineering to provide an efficient flow simulation because the computational burden is much smaller than for computational fluid dynamics (CFD) simulations, and empirical relations have been developed and validated to provide accurate solutions in appropriate flow regimes. Here, the subchannel equations have been recast in a residual form suitable for a multi-physics framework. The Eigen spectrum of the Jacobian matrix, along with several potential physics-based preconditioning approaches, are evaluated, and the the potential for improved convergence from preconditioning is assessed. The physics-based preconditioner options include several forms of reduced equations that decouple the subchannels by neglecting crossflow, conduction, and/or both turbulent momentum and energy exchange between subchannels. Eigen-scopy analysis shows that preconditioning moves clusters of eigenvalues away from zero and toward one. A test problem is run with and without preconditioning. Without preconditioning, the solution failed to converge using GMRES, but application of any of the preconditioners allowed the solution to converge. (authors)

97 MATHEMATICS AND COMPUTING↗

Polynomial Preconditioned Arnoldi with Stability Control

Polynomial preconditioning can improve the convergence of the Arnoldi method for computing eigenvalues. Such preconditioning significantly reduces the cost of orthogonalization; for difficult problems, it can also reduce the number of matrix-vector products. Parallel computations can particularly benefit from the reduction of communication-intensive operations. Additoinally, the GMRES algorithm provides a simple and effective way of generating the preconditioning polynomial. For some problems high degree polynomials are especially effective, but they can lead to stability problems that must be mitigated. A two-level “double polynomial preconditioning” strategy provides an effective way to generate high-degree preconditioners.

97 MATHEMATICS AND COMPUTING↗

A comparison of preconditioned Krylov subspace methods for large‐scale nonsymmetric linear systems

Summary Preconditioned Krylov subspace (KSP) methods are widely used for solving large‐scale sparse linear systems arising from numerical solutions of partial differential equations (PDEs). These linear systems are often nonsymmetric due to the nature of the PDEs, boundary or jump conditions, or discretization methods. While implementations of preconditioned KSP methods are usually readily available, it is unclear to users which methods are the best for different classes of problems. In this work, we present a comparison of some KSP methods, including GMRES, TFQMR, BiCGSTAB, and QMRCGSTAB, coupled with three classes of preconditioners, namely, Gauss–Seidel, incomplete LU factorization (including ILUT, ILUTP, and multilevel ILU), and algebraic multigrid (including BoomerAMG and ML). Theoretically, we compare the mathematical formulations and operation counts of these methods. Empirically, we compare the convergence and serial performance for a range of benchmark problems from numerical PDEs in two and three dimensions with up to millions of unknowns and also assess the asymptotic complexity of the methods as the number of unknowns increases. Our results show that GMRES tends to deliver better performance when coupled with an effective multigrid preconditioner, but it is less competitive with an ineffective preconditioner due to restarts. BoomerAMG with a proper choice of coarsening and interpolation techniques typically converges faster than ML, but both may fail for ill‐conditioned or saddle‐point problems, whereas multilevel ILU tends to succeed. We also show that right preconditioning is more desirable. This study helps establish some practical guidelines for choosing preconditioned KSP methods and motivates the development of more effective preconditioners.

Ghai, Aditi↗

Ischemic preconditioning enhances integrity of coronary endothelial tight junctions

Highlights: Black-Right-Pointing-Pointer Cardiac tight junctions are present between coronary endothelial cells. Black-Right-Pointing-Pointer Ischemic preconditioning preserves the structural and functional integrity of tight junctions. Black-Right-Pointing-Pointer Myocardial edema is prevented in hearts subjected to ischemic preconditioning. Black-Right-Pointing-Pointer Ischemic preconditioning enhances translocation of ZO-2 from cytosol to cytoskeleton. -- Abstract: Ischemic preconditioning (IPC) is one of the most effective procedures known to protect hearts against ischemia/reperfusion (IR) injury. Tight junction (TJ) barriers occur between coronary endothelial cells. TJs provide barrier function to maintain the homeostasis of the inner environment of tissues. However, the effect of IPC on the structure and function of cardiac TJs remains unknown. We tested the hypothesis that myocardial IR injury ruptures the structure of TJs and impairs endothelial permeability whereas IPC preserves the structural and functional integrity of TJs in the blood-heart barrier. Langendorff hearts from C57BL/6J mice were prepared and perfused with Krebs-Henseleit buffer. Cardiac function, creatine kinase release, and myocardial edema were measured. Cardiac TJ function was evaluated by measuring Evans blue-conjugated albumin (EBA) content in the extravascular compartment of hearts. Expression and translocation of zonula occludens (ZO)-2 in IR and IPC hearts were detected with Western blot. A subset of hearts was processed for the observation of ultra-structure of cardiac TJs with transmission electron microscopy. There were clear TJs between coronary endothelial cells of mouse hearts. IR caused the collapse of TJs whereas IPC sustained the structure of TJs. IR increased extravascular EBA content in the heart and myocardial edema but decreased the expression of ZO-2 in the cytoskeleton. IPC maintained the structure of TJs. Cardiac EBA content and edema were reduced in IPC hearts. IPC enhanced the translocation of ZO-2 from cytosol to cytoskeleton. In conclusion, TJs occur in normal mouse heart. IPC preserves the integrity of TJ structure and function that are vulnerable to IR injury.

60 APPLIED LIFE SCIENCES↗