Search NASA⌕ Search

SEARCH · Search NASA

Results for “Linear systems solvers”

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 289 records · Page 16

CanTrilBat and Cantera_apps v1.0 beta

This application can determine the performance and chemical behavior of batteries in 1D when they are cycled. With CanTrilBat, we are developing predictive phenomenological models for battery systems to predict operating performance and rate limiting steps in the performance of battery models. Particular attention is paid to primary and secondary chemistry mechanisms, such as the thermal runaway mechanisms experienced in secondary lithium ion batteries or self-discharge reaction mechanism that all batteries experience to one extent or another. The first application of this model has been for modeling the performance of thermal batteries. However, an implementation for secondary ion batteries is next. CanTrilBat applications solves transient problems involving batteries. It is a 1-D application that represents 3-D physical systems that can be reduced using the porous flow approximation for the anode, cathode, and separator. A control volume formulation is used to track conserved quantities. An operator-split approach is used to calculate the chemistry, diffusion and electronic transport that occurs within cathode and anode particles, allowing for the reduction in code complexity. All jacobian operations in CanTrilBat utilize numerical jacobians. A home grown predictor corrector scheme is used for time step control, and a home grown newton solver is used to relax the equations at each time step. Trilinos is used to solve for the resulting linear systems equation A block text input format is used to initialize options for the CanTriBat program. Within this block are the names of several XML input files, which specify the chemistry mechanism. These XML input files are read by low level Cantera routines, and serve to initialize the electrode and electrolyte chemistry mechanisms and transport properties. A GUI implementation has been contracted out to a university professor, but has not been implemented yet. It?s expected that CanTriBat will have the capability to do adaptive grid refinement in later versions. Grids will be halved based on an complicated set of heuristic criteria, based on how well the mesh captures changes to the first and second derivatives of selected solution components. Primary emphasis is given towards converged profiles for IV performance.

Moffat, HarryK.↗

CanTrilBat and Cantera_apps v1.0 beta

This application can determine the performance and chemical behavior of batteries in 1D when they are cycled. With CanTrilBat, we are developing predictive phenomenological models for battery systems to predict operating performance and rate limiting steps in the performance of battery models. Particular attention is paid to primary and secondary chemistry mechanisms, such as the thermal runaway mechanisms experienced in secondary lithium ion batteries or self-discharge reaction mechanism that all batteries experience to one extent or another. The first application of this model has been for modeling the performance of thermal batteries. However, an implementation for secondary ion batteries is next. CanTrilBat applications solves transient problems involving batteries. It is a 1-D application that represents 3-D physical systems that can be reduced using the porous flow approximation for the anode, cathode, and separator. A control volume formulation is used to track conserved quantities. An operator-split approach is used to calculate the chemistry, diffusion and electronic transport that occurs within cathode and anode particles, allowing for the reduction in code complexity. All jacobian operations in CanTrilBat utilize numerical jacobians. A home grown predictor corrector scheme is used for time step control, and a home grown newton solver is used to relax the equations at each time step. Trilinos is used to solve for the resulting linear systems equation A block text input format is used to initialize options for the CanTriBat program. Within this block are the names of several XML input files, which specify the chemistry mechanism. These XML input files are read by low level Cantera routines, and serve to initialize the electrode and electrolyte chemistry mechanisms and transport properties. A GUI implementation has been contracted out to a university professor, but has not been implemented yet. It?s expected that CanTriBat will have the capability to do adaptive grid refinement in later versions. Grids will be halved based on an complicated set of heuristic criteria, based on how well the mesh captures changes to the first and second derivatives of selected solution components. Primary emphasis is given towards converged profiles for IV performance.

Moffat, Harry K.↗

MueMat Multicrid Toolbox

MueMat is intended for the research and development of multigrid algorithms used in the solution of sparse linear systems arising from systems of partial differential equations. The software can generate example linear systems and provides short programs to demonstrate the various interfaces for creating, accessing, and applying the solvers. MueMat currently includes two types of algebraic multigrid methods and many commonly used smoothers. However, the software is intended to be extensible, and new methods can be incorporated easily. MueMat also allows for advanced usage, such as combining multiple methods and segregated solves. The library supports point and block access to matrix data. MueMat has been designed for use within the programming environment of the Mathworks program MATLAB®. All algorithms and methods in MueMat have been or will be published in the open scientific literature.

Boman, ErikG.↗

symPACK: A GPU-Capable Fan-Out Sparse Cholesky Solver

Sparse symmetric positive definite systems of equations are ubiquitous in scientific workloads and applications. Parallel sparse Cholesky factorization is the method of choice for solving such linear systems. Therefore, the development of parallel sparse Cholesky codes that can efficiently run on today’s large-scale heterogeneous distributed-memory platforms is of vital importance. Modern supercomputers offer nodes that contain a mix of CPUs and GPUs. To fully utilize the computing power of these nodes, scientific codes must be adapted to offload expensive computations to GPUs. We present symPACK, a GPU-capable parallel sparse Cholesky solver that uses one-sided communication primitives and remote procedure calls provided by the UPC++ library. We also utilize the UPC++ "memory kinds" feature to enable efficient communication of GPU-resident data. We show that on a number of large problems, symPACK outperforms comparable state-of-the-art GPU-capable Cholesky factorization codes by up to 14x on the NERSC Perlmutter supercomputer.

Bellavita, Julian↗

Reduced-Order Aerodynamic Modeling Based on CFD Frequency Responses from Multisine Inputs

A system identification analysis was performed to determine reduced-order models of a computational fluid dynamics (CFD) solver for linear aeroelastic analysis and control design. The application was to the FUN3D code and the flexible half-span wind tunnel test article, in transonic flow conditions, used in the NASA-Boeing collaboration called the Integrated Adaptive Wing Technology Maturation (IAWTM) project. Multiple inputs (structural mode displacements and control surface deflections) were simultaneously excited with orthogonal phase-optimized multisines and multiple outputs (generalized aerodynamic forces) were recorded, from which the matrix of frequency responses were computed using a single CFD run. A state-space model was then fit to the frequency response data using a maximum-likelihood estimator.

System identification↗

Discrete models of fluids: spatial averaging, closure and model reduction

We consider semidiscrete ODE models of single-phase fluids and two-fluid mixtures. In the presence of multiple fine-scale heterogeneities, the size of these ODE systems can be very large. Spatial averaging is then a useful tool for reducing computational complexity of the problem. The averages satisfy exact balance equations of mass, momentum, and energy. These equations do not form a satisfactory continuum model because evaluation of stress and heat flux requires solving the underlying ODEs. To produce continuum equations that can be simulated without resolving microscale dynamics, we recently proposed a closure method based on the use of regularized deconvolution. Here we continue the investigation of deconvolution closure with the long term objective of developing consistent computational upscaling for multiphase particle methods. The structure of the fine-scale particle solvers is reminiscent of molecular dynamics. For this reason we use nonlinear averaging introduced for atomistic systems by Noll, Hardy, and Murdoch-Bedeaux. We also consider a simpler linear averaging originally developed in large eddy simulation of turbulence. We present several simple but representative examples of spatially averaged ODEs, where the closure error can be analyzed. Based on this analysis we suggest a general strategy for reducing the relative error of approximate closure. For problems with periodic highly oscillatory material parameters we propose a spectral boosting technique that augments the standard deconvolution and helps to correctly account for dispersion effects. We also conduct several numerical experiments, one of which is a complete mesoscale simulation of a stratified two-fluid flow in a channel. In this simulation, the operation count per coarse time step scales sublinearly with the number of particles.

Multiscale modeling, discrete models, fluid flow↗

Scalable Preconditioning of Block-Structured Linear Algebra Systems using ADMM

In this paper, we study the solution of block-structured linear algebra systems arising in optimization by using iterative solution techniques. These systems are the core computational bottleneck of many problems of interest such as parameter estimation, optimal control, network optimization, and stochastic programming. Our approach uses a Krylov solver (GMRES) that is preconditioned with an alternating method of multipliers (ADMM). We show that this ADMM-GMRES approach overcomes well-known scalability issues of Schur complement decomposition in problems that exhibit a high degree of coupling. The effectiveness of the approach is demonstrated using linear systems that arise in stochastic optimal power flow problems and that contain up to 2 million total variables and 4,000 coupling variables. We find that ADMM-GMRES is nearly an order of magnitude faster than Schur complement decomposition. Moreover, we demonstrate that the approach is robust to the selection of the augmented Lagrangian penalty parameter, which is a key advantage over the direct use of ADMM.

97 MATHEMATICS AND COMPUTING↗

Potential quantum advantage for simulation of fluid dynamics

Numerical simulation of turbulent fluid dynamics needs to either parametrize turbulence—which introduces large uncertainties—or explicitly resolve the smallest scales—which is prohibitively expensive. Here, we provide evidence through analytic bounds and numerical studies that a potential quantum speedup can be achieved to simulate fluid dynamics using quantum computing. Specifically, we provide a lattice Boltzmann formulation of fluid dynamics for which we give evidence that low-order Carleman linearization is much more accurate than previously believed for these systems. This is achieved via a combination of reformulating the Navier-Stokes nonlinearity (u·$\triangledown$u) to lattice-Boltzmann nonlinearity (u 2 ) and accurately linearizing the dynamical equations, which effectively trades nonlinearity for additional degrees of freedom that add negligible expense in the quantum solver. Based on this, we apply a quantum algorithm for simulating the Carleman-linearized lattice Boltzmann equation and provide evidence that its cost scales logarithmically with system size compared with polynomial scaling in the best known classical algorithms. In this paper, we suggest that a quantum advantage may exist for simulating fluid dynamics, paving the way for simulating nonlinear multiscale transport phenomena in a wide range of disciplines using quantum computing.

42 ENGINEERING↗

A fast implicit solver for semiconductor models in one space dimension

Several different approaches are proposed for solving fully implicit discretizations of a simplified Boltzmann-Poisson system with a linear relaxation-type collision kernel. This system models the evolution of free electrons in semiconductor devices under a low-density assumption. At each implicit time step, the discretized system is formulated as a fixed-point problem, which can then be solved with a variety of methods. A key algorithmic component in all the approaches considered here is a recently developed sweeping algorithm for Vlasov-Poisson systems. A synthetic acceleration scheme has been implemented to accelerate the convergence of iterative solvers by using the solution to a drift-diffusion equation as a preconditioner. The performance of four iterative solvers and their accelerated variants has been compared on problems modeling semiconductor devices with various electron mean-free-path.

97 MATHEMATICS AND COMPUTING↗

Implicit solvers for unstructured meshes

Implicit methods were developed and tested for unstructured mesh computations. The approximate system which arises from the Newton linearization of the nonlinear evolution operator is solved by using the preconditioned GMRES (Generalized Minimum Residual) technique. Three different preconditioners were studied, namely, the incomplete LU factorization (ILU), block diagonal factorization, and the symmetric successive over relaxation (SSOR). The preconditioners were optimized to have good vectorization properties. SSOR and ILU were also studied as iterative schemes. The various methods are compared over a wide range of problems. Ordering of the unknowns, which affects the convergence of these sparse matrix iterative methods, is also studied. Results are presented for inviscid and turbulent viscous calculations on single and multielement airfoil configurations using globally and adaptively generated meshes.

Venkatakrishnan, V.↗

Self-consistent solution of cosmological radiation-hydrodynamics and chemical ionization

We consider a PDE system comprising compressible hydrodynamics, flux-limited diffusion radiation transport and chemical ionization kinetics in a cosmologically-expanding universe. Under an operator-split framework, the cosmological hydrodynamics equations are solved through the piecewise parabolic method, as implemented in the Enzo community hydrodynamics code. The remainder of the model, including radiation transport, chemical ionization kinetics, and gas energy feedback, form a stiff coupled PDE system, which we solve using a fully-implicit inexact Newton approach, and which forms the crux of this paper. The inner linear Newton systems are solved using a Schur complement formulation, and employ a multigrid-preconditioned conjugate gradient solver for the inner Schur systems. We describe this approach and provide results on a suite of test problems, demonstrating its accuracy, robustness, and scalability to very large problems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Development of a continuous synthesis process for carbamazepine using validated in-line Raman spectroscopy and kinetic modelling for disturbance simulation

Mitigation of failure modes in the continuous synthesis (CS) of a drug substance (DS) has the potential to widen the adoption of continuous manufacturing (CM) technologies by the pharmaceutical industry. Here, this work demonstrates the development of a robust continuous process for the synthesis of carbamazepine (CBZ), an essential medicine as per the World Health Organization (WHO), facilitated by kinetic modelling and monitored by in-line Raman spectroscopy. Accurate kinetic modelling and the use of validated process analytical technology (PAT) models for quantitative measurement were found to play an important role in developing CS of drug substances. Kinetic data for the formation of CBZ from iminostilbene (ISB) were collected by batch reaction sampling and high-performance liquid chromatography (HPLC) analysis. A non-linear solver and iterative method was applied to determine two sets of Arrhenius parameters simultaneously for the reaction system by minimizing the standard error of the model fit. The start-up and dynamic equilibrium stages for the CS of CBZ using a continuous stirred tank reactor (CSTR) were modelled based on the batch kinetic data and employed to optimize conversion and simulate process disturbances. An in-line Raman spectroscopy method was successfully developed, validated, and integrated to determine the concentrations of CBZ and ISB within the operating range for the CS. The CS kinetic model was evaluated experimentally from startup to dynamic equilibrium over 10 residence times with monitoring by HPLC and in-line Raman spectroscopy. The developed kinetic model in tandem with in-line Raman spectroscopy successfully predicted disturbances due to changes in process variables and can serve as a useful tool in the future design of advanced process control strategies for the continuous synthesis of CBZ.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

An Inviscid Decoupled Method for the Roe FDS Scheme in the Reacting Gas Path of FUN3D

An approach is described to decouple the species continuity equations from the mixture continuity, momentum, and total energy equations for the Roe flux difference splitting scheme. This decoupling simplifies the implicit system, so that the flow solver can be made significantly more efficient, with very little penalty on overall scheme robustness. Most importantly, the computational cost of the point implicit relaxation is shown to scale linearly with the number of species for the decoupled system, whereas the fully coupled approach scales quadratically. Also, the decoupled method significantly reduces the cost in wall time and memory in comparison to the fully coupled approach. This work lays the foundation for development of an efficient adjoint solution procedure for high speed reacting flow.

Thompson, Kyle B.↗

High-resolution Wave Propagation Method for Stratified Flows

The implementation of the multidimensional f-waves Riemann solver for the time-dependent, three-dimensional, nonhydrostatic, meso- and microscale atmospheric flows is described in detail. The Riemann solver employs flux-based wave decomposition (f-waves) for the calculation of Godunov fluxes in which the flux differences are written directly as the linear combination of the right eigenvectors of the hyperbolic system. The scheme incorporates the source term due to gravity without introducing discretization errors which is an important property in the context of atmospheric flows. The resulting flow solver is conservative, accurate, stable, and well-balanced. The implementation of the solver is evaluated using benchmark test cases for atmospheric dynamics.

Riemann problem↗

Parallel linear equation solvers for finite element computations

The overall objective of this research is to develop efficient methods for the solution of linear and nonlinear systems of equations on parallel and supercomputers, and to apply these methods to the solution of problems in structural analysis. Attention has been given so far only to linear equations. The methods considered for the solution of the stiffness equation Kx=f have been Choleski factorization and the conjugate gradient iteration with SSOR and Incomplete Choleski preconditioning. More detail on these methods will be given on subsequent slides. These methods have been used to solve for the static displacements for the mast and panel focus problems in conjunction with the CSM testbed system based on NICE/SPAR.

Ortega, James M.↗

Implicit solvers for unstructured meshes

Implicit methods for unstructured mesh computations are developed and tested. The approximate system which arises from the Newton-linearization of the nonlinear evolution operator is solved by using the preconditioned generalized minimum residual technique. These different preconditioners are investigated: the incomplete LU factorization (ILU), block diagonal factorization, and the symmetric successive over-relaxation (SSOR). The preconditioners have been optimized to have good vectorization properties. The various methods are compared over a wide range of problems. Ordering of the unknowns, which affects the convergence of these sparse matrix iterative methods, is also investigated. Results are presented for inviscid and turbulent viscous calculations on single and multielement airfoil configurations using globally and adaptively generated meshes.

Venkatakrishnan, V.↗

Aerodynamic shape optimization via sensitivity analysis on decomposed computational domains

Direct and iterative method considered to be most applicable to large systems of linear equations arising in discrete sensitivity analysis are assessed. Based on a single-domain grid, computations are performed using a banded matrix solver and an iterative solver, the generalized minimum residual (GMRES) method. The banded matrix solver is found to be generally the most economical method for those applications where the number of right-hand sides is large (i.e., a large number of design variables or a large number of adjoint vectors). For systems of equations that are too large to be solved by direct methods, an approach is proposed whereby the computational domain is divided into small subdomains, and each subdomain is solved separately.

Eleshaky, Mohamed E.↗

Multigrid approaches to non-linear diffusion problems on unstructured meshes

The efficiency of three multigrid methods for solving highly non-linear diffusion problems on two-dimensional unstructured meshes is examined. The three multigrid methods differ mainly in the manner in which the nonlinearities of the governing equations are handled. These comprise a non-linear full approximation storage (FAS) multigrid method which is used to solve the non-linear equations directly, a linear multigrid method which is used to solve the linear system arising from a Newton linearization of the non-linear system, and a hybrid scheme which is based on a non-linear FAS multigrid scheme, but employs a linear solver on each level as a smoother. Results indicate that all methods are equally effective at converging the non-linear residual in a given number of grid sweeps, but that the linear solver is more efficient in cpu time due to the lower cost of linear versus non-linear grid sweeps.

Mavriplis, Dimitri J.↗