SearcharxivSearch

arXiv · 1604.00190

Modeling battery cells under discharge using kinetic and stochastic battery models

Abstract

In this paper we review several approaches to mathematical modeling of simple battery cells and develop these ideas further with emphasis on charge recovery and the response behavior of batteries to given external load. We focus on models which use few parameters and basic battery data, rather than detailed reaction and material characteristics of a specific battery cell chemistry, starting with the coupled ODE linear dynamics of the kinetic battery model. We show that a related system of PDE with Robin type boundary conditions arises in the limiting regime of a spatial kinetic battery model, and provide a new probabilistic representation of the solution in terms of Brownian motion with drift reflected at the boundaries on both sides of a finite interval. To compare linear and nonlinear dynamics in kinetic and stochastic battery models we study Markov chains with states representing available and remaining capacities of the battery. A natural scaling limit leads to a class of nonlinear ODE, which can be solved explicitly and compared with the capacities obtained for the linear models. To indicate the potential use of the modeling we discuss briefly comparison of discharge profiles and effects on battery performance.

Explore related subjects

Keep this discovery

BibTeXRIS

Ingemar Kaj, Victorien Konané. 2016-04-01. Modeling battery cells under discharge using kinetic and stochastic battery models. https://arxiv.org/abs/1604.00190

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection

In this paper, we study averaging principles for nonautonomous multiscale stochastic Burgers equations with reflection. First, we derive a general averaging principle applicable to such equations under minimal assumptions. Subsequently, since the coefficients of the obtained averaged equation still depend on the small scaling parameter $\e$, we impose either periodic or asymptotic conditions on the coefficients, thereby obtain two distinct averaged equations whose coefficients are independent of $\e$ and establish two averaging principles. Stopping times and Khasminskii's time discretization schemes play an important role. Finally, a concrete example is provided to illustrate the applicability and validity of the theoretical results.

math.PR

Spectral properties of Random Matrices

We give the theoretical foundations of random matrix theory through the definitions of a random matrix, a random probability measure and the corresponding empirical spectral distribution. The technical tool we use is the Stieltjes transform method through which we prove optimal convergence of the empirical spectral distribution of random sample covariance matrices to the deterministic Marchenko-Pastur distribution. We also give new results about the rigidity of the eigenvalues of this random sample covariance matrix and the rate of their convergence. We then define the Dyson equation method to prove new local laws about a random matrix model that interpolates between the Marchenko-Pastur distribution, the elliptical law and the circular law. Through our work these local laws can be considered universal.

math.PR

Moments approach for the elephant random walk

We discuss the method of moments for the one-dimensional elephant random walk (ERW). We first derive a differential recurrence relation for the characteristic function of the ERW, which yields a corresponding system of recurrence relations for its moments. We then obtain asymptotic approximations for the moments in each of the three parameter regimes of the ERW. Finally, by establishing the convergence of the moments and verifying the corresponding moment-determinacy conditions, we identify the limiting distributions of the ERW in each regime.

math.PR