Search NASA⌕ Search

SEARCH · Search NASA

Results for “linear programming problem”

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 469 records · Page 26

Integrating event detection system operation characteristics into sensor placement optimization.

We consider the problem of placing sensors in a municipal water network when we can choose both the location of sensors and the sensitivity and specificity of the contamination warning system. Sensor stations in a municipal water distribution network continuously send sensor output information to a centralized computing facility, and event detection systems at the control center determine when to signal an anomaly worthy of response. Although most sensor placement research has assumed perfect anomaly detection, signal analysis software has parameters that control the tradeoff between false alarms and false negatives. We describe a nonlinear sensor placement formulation, which we heuristically optimize with a linear approximation that can be solved as a mixed-integer linear program. We report the results of initial experiments on a real network and discuss tradeoffs between early detection of contamination incidents, and control of false alarms.

54 ENVIRONMENTAL SCIENCES↗

Heuristic approach to Satellite Range Scheduling with Bounds using Lagrangian Relaxation

Here, this paper focuses on scheduling antennas to track satellites using a novel heuristic method. The objectives pursued in developing a schedule are two-fold: (1) minimize the priority weighted number of time periods that satellites are not tracked; and (2) equalize the percent of time each satellite is uncovered. The heuristic method is a population-based local search tailored to the unique characteristics of this problem. In order to validate the performance of the heuristic, bounds are developed using Lagrangian relaxation. The heuristic method and the bounds are applied to several test problems. In all cases, the heuristic identifies a solution that is better than the upper bound and is generally quite close (but obviously larger) than the lower bound with about an order of magnitude reduction in computation time. Lastly, a comparison with CPLEX 12.7 is provided.

97 MATHEMATICS AND COMPUTING↗

Exploiting sparsity for the min k -partition problem

The minimum k-partition problem is a challenging combinatorial problem with a diverse set of applications ranging from telecommunications to sports scheduling. It generalizes the max-cut problem and has been extensively studied since the late sixties. Strong integer formulations proposed in the literature suffer from a large number of constraints and variables. Here, we introduce two more compact integer linear and semidefinite reformulations that exploit the sparsity of the underlying graph and develop theoretical results leveraging the power of chordal decomposition. Numerical experiments show that the new formulations improve upon state-of-the-art.

97 MATHEMATICS AND COMPUTING↗

Development of stripper options for FRIB

The US Department of Energy Facility for Rare Isotope Beams (FRIB) at Michigan State University includes a heavy ion superconducting linac capable of accelerating all ions up to uranium with energies higher than 200 MeV/u and beam power up to 400 kW. To achieve these goals with present ion source performance it is necessary to accelerate simultaneously two charge states of uranium from the ion source in the first section of the linac. At an energy of approximately 16.5 MeV/u it is planned to strip the uranium beam to reduce the voltage needed in the rest of the linac to achieve the final energy. Up to five different charge states are planned to be accelerated simultaneously after the stripper. The design of the stripper is a challenging problem due to the high power deposited (approximately 0.7 kW) in the stripper media by the beam in a small spot. To assure success of the project we have established a research and development program that includes several options: carbon or diamond foils, liquid lithium films, gas strippers and plasma strippers. We present in this paper the status of the different options.

43 PARTICLE ACCELERATORS↗

Implementation of CMFD Acceleration Scheme in PROTEUS-MOC

The PROTEUS-MOC code is a three-dimensional (3D) transport code, which is being developed at Argonne National Laboratory under the DOE-NE's Nuclear Energy Advanced Modeling and Simulation (NEAMS) program. It provides a fully consistent 3D discretization of the transport equation by combining the two-dimensional (2D) method of characteristics (MOC) for the planar direction with the discontinuous Galerkin method for the treatment of the axial variable. PROTEUS-MOC uses the unstructured finite element method (FEM) and thus allows the explicit representation of any extruded geometries. It also has a capability of massively parallel computation in energy group, angle, plane, and space using a top-level GMRES linear algebra solver. For parallel computation in space, it uses an unstructured domain decomposition by adapting METIS. The computational burden for direct heterogeneous core calculations based on unstructured geometries is excessive for practical reactor problems, and hence it is essential to implement an efficient acceleration scheme in PROTEUS-MOC. Recently, the coarse mesh finite difference (CMFD) method, which was originally applied to the nodal diffusion methods, has been successfully applied to the MOC transport solvers, resulting in a remarkable reduction in the number of fission source iterations. In addition, a modified CMFD method has been developed to overcome the limitation of the conventional CMFD that is applicable only to neutronics solvers with a conservative discretization. This CMFD method was derived to be consistent with the FEM, which is based on a nonconservative discretization. In this method, the neutron balance in each coarse mesh is enforced by introducing a pseudo absorption cross section (PAXS), and the well-established alternating solution process of CMFD and transport calculations is employed to accelerate source convergence. This modified CMFD acceleration scheme was adopted in PROTEUS-MOC to accelerate the fission source iteration. Pin-cell and assembly based CMFD schemes have been implemented by defining individual pin cells or assemblies as a coarse mesh. For this, an algorithm to map the finite elements to coarse meshes was developed, and the routines were developed to determine the coupling coefficients and PAXS of the CMFD equations from the transport solution. Preliminary performance tests were carried out using the C5G7 benchmark problem. This paper presents the main features of this CMFD acceleration scheme and the preliminary test results.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Towards Automated Memory Model Generation Via Event Tracing

The importance of memory performance and capacity is a growing concern for high performance computing laboratories around the world. It has long been recognized that improvements in processor speed exceed the rate of improvement in dynamic random access memory speed and, as a result, memory access times can be the limiting factor in high performance scientific codes. The use of multi-core processors exacerbates this problem with the rapid growth in the number of cores not being matched by similar improvements in memory capacity, increasing the likelihood of memory contention. In this paper, we present WMTools , a lightweight memory tracing tool and analysis framework for parallel codes, which is able to identify peak memory usage and also analyse per-function memory use over time. An evaluation of WMTools , in terms of its effectiveness and also its overheads, is performed using nine established scientific applications/benchmark codes representing a variety of programming languages and scientific domains. We also show how WMTools can be used to automatically generate a parameterized memory model for one of these applications, a two-dimensional non-linear magnetohydrodynamics application, Lare2D . Through the memory model we are able to identify an unexpected growth term which becomes dominant at scale. With a refined model we are able to predict memory consumption with under 7% error.

97 MATHEMATICS AND COMPUTING↗

Software Synthesis for High Productivity Exascale Computing

Over the three years of our project, we accomplished three key milestones: We demonstrated how ideas from generative programming and software synthesis can help support the development of bulk-synchronous distributed memory kernels. These ideas are realized in a new language called MSL, a C-like language that combines synthesis features with high level notations for array manipulation and bulk-synchronous parallelism to simplify the semantic analysis required for synthesis. We also demonstrated that these high level notations map easily to low level C code and show that the performance of this generated code matches that of handwritten Fortran. Second, we introduced the idea of solver-aided domain-specific languages (SDSLs), which are an emerging class of computer-aided programming systems. SDSLs ease the construction of programs by automating tasks such as verification, debugging, synthesis, and non-deterministic execution. SDSLs are implemented by translating the DSL program into logical constraints. Next, we developed a symbolic virtual machine called Rosette, which simplifies the construction of such SDSLs and their compilers. We have used Rosette to build SynthCL, a subset of OpenCL that supports synthesis. Third, we developed novel numeric algorithms that move as little data as possible, either between levels of a memory hierarchy or between parallel processors over a network. We achieved progress in three aspects of this problem. First we determined lower bounds on communication. Second, we compared these lower bounds to widely used versions of these algorithms, and noted that these widely used algorithms usually communicate asymptotically more than is necessary. Third, we identified or invented new algorithms for most linear algebra problems that do attain these lower bounds, and demonstrated large speed-ups in theory and practice.

97 MATHEMATICS AND COMPUTING↗

Integrated Transmission-Distribution Multi-Period Switching for Wildfire Risk Mitigation: Improving Speed and Scalability with Distributed Optimization: Preprint

With increasingly severe wildfire conditions driven by climate change, utilities must manage the risk of wildfire ignitions from electric power lines. During "public safety power shutoff'" events, utilities de-energize power lines to reduce wildfire ignition risk, which may result in load shedding. Distributed energy resources provide flexibility that can help support the system to reduce load shedding when lines are de-energized. We investigate a coordinated transmission-distribution optimization problem that balances wildfire risk mitigation and load shedding. We model distribution systems that include battery energy storage systems which may support loads when transmission lines are de-energized. This multi-period integrated transmission-distribution optimal switching problem jointly optimizes line switching decisions, the generators' setpoints, load shedding, and the batteries' states of charge, resulting in significant computational challenges. To improve scalability, we decompose the problem over both space and time and apply a distributed optimization algorithm. Using a large-scale synthetic California test case with realistic distribution models and real wildfire risk data, we show that distributed optimization can solve large-scale multi-period switching problems that are otherwise intractable for centralized solvers. We also discuss challenges and future directions for improving the distributed algorithm's convergence performance as the number of time periods increases.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Melt spreading code assessment, modifications, and application to the EPR core catcher design.

The Evolutionary Power Reactor (EPR) is under consideration by various utilities in the United States to provide base load electrical production, and as a result the design is undergoing a certification review by the U.S. Nuclear Regulatory Commission (NRC). The severe accident design philosophy for this reactor is based upon the fact that the projected power rating results in a narrow margin for in-vessel melt retention by external cooling of the reactor vessel. As a result, the design addresses ex-vessel core melt stabilization using a mitigation strategy that includes: (1) an external core melt retention system to temporarily hold core melt released from the vessel; (2) a layer of 'sacrificial' material that is admixed with the melt while in the core melt retention system; (3) a melt plug in the lower part of the retention system that, when failed, provides a pathway for the mixture to spread to a large core spreading chamber; and finally, (4) cooling and stabilization of the spread melt by controlled top and bottom flooding. The overall concept is illustrated in Figure 1.1. The melt spreading process relies heavily on inertial flow of a low-viscosity admixed melt to a segmented spreading chamber, and assumes that the melt mass will be distributed to a uniform height in the chamber. The spreading phenomenon thus needs to be modeled properly in order to adequately assess the EPR design. The MELTSPREAD code, developed at Argonne National Laboratory, can model segmented, and both uniform and nonuniform spreading. The NRC is thus utilizing MELTSPREAD to evaluate melt spreading in the EPR design. MELTSPREAD was originally developed to support resolution of the Mark I containment shell vulnerability issue. Following closure of this issue, development of MELTSPREAD ceased in the early 1990's, at which time the melt spreading database upon which the code had been validated was rather limited. In particular, the database that was utilized for initial validation consisted of: (1) comparison to an analytical solution for the dam break problem, (2) water spreading tests in a 1/10 linear scale model of the Mark I containment by Theofanous et al., and (3) steel spreading tests by Suzuki et al. that were also conducted in a geometry similar to the Mark I. The objective of this work was to utilize the MELTSPREAD code to check the assumption of uniform melt spreading in the EPR core catcher design. As a starting point for the project, the code was validated against the worldwide melt spreading database that emerged after the code was originally written in the very early 1990's. As part of this exercise, the code was extensively modified and upgraded to incorporate findings from these various analytical and experiment programs. In terms of expanding the ability of the code to analyze various melt simulant experiments, the options to input user-specified melt and/or substrate material properties was added. The ability to perform invisicid and/or adiabatic spreading analysis was also added so that comparisons with analytical solutions and isothermal spreading tests could be carried out. In terms of refining the capability to carry out reactor material melt spreading analyses, the code was upgraded with a new melt viscosity model; the capability was added to treat situations in which solid fraction buildup between the liquidus-solidus is non-linear; and finally, the ability to treat an interfacial heat transfer resistance between the melt and substrate was incorporated. This last set of changes substantially improved the predictive capability of the code in terms of addressing reactor material melt spreading tests. Aside from improvements and upgrades, a method was developed to fit the model to the various melt spreading tests in a manner that allowed uncertainties in the model predictions to be statistically characterized. With these results, a sensitivity study was performed to investigate the assumption of uniform spreading in the EPR core catcher that addressed parametric variations in: (1) melt pour mass, (2) melt composition, (3) melt pour rate, (4) pour configuration (i.e., homogeneous vs. stratified metal-oxide phases), (5) melt temperature, (6) cavity condition (wet vs. dry), (7) spreading channel inclination angle, and finally (8) uncertainties in the melt viscosity correlation that are based on comparisons with the reactor material melt spreading database. Although differences were found in the rate of spreading and the degree to which the sacrificial concrete in the spreading room is ablated during the transients, in all cases the melt eventually (over a period of minutes) spreads to a uniform depth in the system.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

The linear and nonlinear response of infinite periodic systems to static and/or dynamic electric fields. Implementation in CRYSTAL code

An implementation of the vector potential approach (VPA) for treating the response of infinite periodic systems to static and dynamic electric fields has been initiated within the CRYSTAL code. The VPA method is based on the solution of a time-dependent Hartree-Fock or Kohn-Sham equation for the crystal orbitals wherein the usual scalar potential, that describes interaction with the field, is replaced by the vector potential. This equation may be solved either by perturbation theory or by finite field methods. With some modification all the computational procedures of molecular ab initio quantum chemistry can be adapted for periodic systems. Accessible properties include the linear and nonlinear responses of both the nuclei and the electrons. The programming of static field pure electronic (hyper)polarizabilities has been successfully tested. Dynamic electronic (hyper)polarizabilities, as well as infrared and Raman intensities, are in progress while the addition of finite fields for calculation of vibrational (hyper)polarizabilities, through nuclear relaxation procedures, will begin shortly.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A Scalable Solution Framework for Stochastic Transmission and Generation Planning Problems. Draft

Current commercial software tools for transmission and generation investment planning have limited stochastic modeling capabilities. Because of this limitation, electric power utilities generally rely on scenario planning heuristics to identify potentially robust and cost effective investment plans for a broad range of system, economic, and policy conditions. Several research studies have shown that stochastic models perform significantly better than deterministic or heuristic approaches, in terms of overall costs. However, there is a lack of practical solution approaches to solve such models. In this paper we propose a scalable decomposition algorithm to solve stochastic transmission and generation planning problems, respectively considering discrete and continuous decision variables for transmission and generation investments. Given stochasticity restricted to loads and wind, solar, and hydro power output, we develop a simple scenario reduction framework based on a clustering algorithm, to yield a more tractable model. The resulting stochastic optimization model is decomposed on a scenario basis and solved using a variant of the Progressive Hedging (PH) algorithm. We perform numerical experiments using a 240-bus network representation of the Western Electricity Coordinating Council in the US. Although convergence of PH to an optimal solution is not guaranteed for mixed-integer linear optimization models, we find that it is possible to obtain solutions with acceptable optimality gaps for practical applications. Our numerical simulations are performed both on a commodity workstation and on a high-performance cluster. The results indicate that large-scale problems can be solved to a high degree of accuracy in at most two hours of wall clock time.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Hybrid programming-model strategies for GPU offloading of electronic structure calculation kernels

To address the challenge of performance portability and facilitate the implementation of electronic structure solvers, we developed the basic matrix library (BML) and Parallel, Rapid O(N), and Graph-based Recursive Electronic Structure Solver (PROGRESS) library. The BML implements linear algebra operations necessary for electronic structure kernels using a unified user interface for various matrix formats (dense and sparse) and architectures (CPUs and GPUs). Focusing on density functional theory and tight-binding models, PROGRESS implements several solvers for computing the single-particle density matrix and relies on BML. In this paper, we describe the general strategies used for these implementations on various computer architectures, using OpenMP target functionalities on GPUs, in conjunction with third-party libraries to handle performance critical numerical kernels. In this study, we demonstrate the portability of this approach and its performance in benchmark problems.

36 MATERIALS SCIENCE↗

Wavelet-Smoothed Interpolation of Masked Scientific Data for JPEG 2000 Compression [Slides]

How should we manage scientific data with 'holes'? Some applications, like JPEG 2000, expect logically rectangular data, but some sources, like the Parallel Ocean Program (POP), generate data that isn't defined on certain subsets. We refer to grid points that lack well-defined, scientifically meaningful sample values as 'masked' samples. Wavelet-smoothing is a highly scalable interpolation scheme for regions with complex boundaries on logically rectangular grids. Computation is based on forward/inverse discrete wavelet transforms, so runtime complexity and memory scale linearly with respect to sample count. Efficient state-of-the-art minimal realizations yield small constants (O(10)) for arithmetic complexity scaling, and in-situ implementation techniques make optimal use of memory. Implementation in two dimensions using tensor product filter banks is straighsorward and should generalize routinely to higher dimensions. No hand-tuning required when the interpolation mask changes, making the method aeractive for problems with time-varying masks. Well-suited for interpolating undefined samples prior to JPEG 2000 encoding. The method outperforms global mean interpolation, as judged by both SNR rate-distortion performance and low-rate artifact mitigation, for data distributions whose histograms do not take the form of sharply peaked, symmetric, unimodal probability density functions. These performance advantages can hold even for data whose distribution differs only moderately from the peaked unimodal case, as demonstrated by POP salinity data. The interpolation method is very general and is not tied to any particular class of applications, could be used for more generic smooth interpolation.

42 ENGINEERING↗

Performance Improvement of the Linear System Solver for CMFD Acceleration in PROTEUS-MOC

The PROTEUS code developed under the DOE NEAMS program is a high-fidelity capable whole core transports solver based on unstructured finite element meshes [1]. PROTEUS includes three distinct transport solvers: SN, MOC and NODAL. Among them, the PROTEUS-MOC is the 3D method of characteristics (MOC) solver for extruded geometries. In order to accelerate the convergence of 3D MOC calculation, the CMFD acceleration method was implemented in PROTEUS-MOC [2]. For solving the CMFD linear system, the unpreconditioned GMRES algorithm was used in the previous work [3, 4] for implementing the CMFD scheme because of low computation cost of coarse mesh calculations. In the performance tests, we found that the overhead of the CMFD acceleration became non-negligible as the condition number of the CMFD linear system and the size of problem increase. This indicated that the CMFD overhead should be reduced in the preconditioning technique in order to improve the computational performance. In this work, the performance of CMFD acceleration was notably improved by developing and implementing the new formulation of CMFD linear system and preconditioning technique.

Jung, Yeon Sang↗

Magnetic Microcalorimeter (MMC) Gamma-Ray Detectors with Ultra-High Energy Resolution. Comprehensive Technology Readiness Assessment

Magnetic Microcalorimeter (MMC) gamma ray detectors have demonstrated very high energy resolution of 38 eV FWHM for gamma ray energies below 100 keV. This is an order or magnitude better than conventional HPGe detector and can remove most line-overlap problems in NDA by gamma spectroscopy below ~130 keV. Unlike superconducting transition edge sensors (TESs), MMCs have a reproducible and almost perfectly linear response, which greatly simplifies adding spectra from different detector pixels and reduces systematic errors in quantitative assays. The instrument is currently at TRL-5 but could advance to TRL-6 by improving the signal processing software and using the system for the quantitative analysis of a safeguards sample provided by e.g. the IAEA. Making MMC detectors commercially viable and used more widely then depends on making the technology more reliable, specifically by increasing the device uniformity and yield, and by developing commercial software. This situation is often only half-jokingly referred to as the “valley of death” and could be addressed though the SBIR program. Our collaborators at STAR Cryoelectronics LLC are well qualified to further advance MMC development, and XIA LLC is well-positioned to develop the data acquisition system and write the software for MMC readout. In addition, the advance to TRL-6 would be desirable to increase the visibility and showcase the value of MMC spectrometers, e.g. by placing one of them into the Safeguards Analytical Laboratory (SAL) at the IAEA, whose NDA experts have recently started to show interest in cryogenic detector technology. As a result of this LCP, we also now have an instrument at LLNL that we will use for various applications of MMCs in nuclear safeguards and science. We are confident that as the number of high-profile results increases, so will the interest in and commercial viability of this technology.

42 ENGINEERING↗

Magnetic Microcalorimeter (MMC) Gamma-Ray Detectors with Ultra-High Energy Resolution. Comprehensive Technology Readiness Assessment

Magnetic Microcalorimeter (MMC) gamma ray detectors have demonstrated very high energy resolution of 38 eV FWHM for gamma ray energies below 100 keV. This is an order or magnitude better than conventional HPGe detector and can remove most line-overlap problems in NDA by gamma spectroscopy below ~130 keV. Unlike superconducting transition edge sensors (TESs), MMCs have a reproducible and almost perfectly linear response, which greatly simplifies adding spectra from different detector pixels and reduces systematic errors in quantitative assays. The instrument is currently at TRL-5 but could advance to TRL-6 by improving the signal processing software and using the system for the quantitative analysis of a safeguards sample provided by e.g. the IAEA. Making MMC detectors commercially viable and used more widely then depends on making the technology more reliable, specifically by increasing the device uniformity and yield, and by developing commercial software. This situation is often only half-jokingly referred to as the “valley of death” and could be addressed though the SBIR program. Our collaborators at STAR Cryoelectronics LLC are well qualified to further advance MMC development, and XIA LLC is well-positioned to develop the data acquisition system and write the software for MMC readout. In addition, the advance to TRL-6 would be desirable to increase the visibility and showcase the value of MMC spectrometers, e.g. by placing one of them into the Safeguards Analytical Laboratory (SAL) at the IAEA, whose NDA experts have recently started to show interest in cryogenic detector technology. As a result of this LCP, we also now have an instrument at LLNL that we will use for various applications of MMCs in nuclear safeguards and science. We are confident that as the number of high-profile results increases, so will the interest in and commercial viability of this technology.

42 ENGINEERING↗

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.↗