z-logo
Premium
A fourth‐order accurate, Numerov‐type, three‐point finite‐difference discretization of electrochemical reaction‐diffusion equations on nonuniform (exponentially expanding) spatial grids in one‐dimensional space geometry
Author(s) -
Bieniasz Lesław K.
Publication year - 2004
Publication title -
journal of computational chemistry
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.907
H-Index - 188
eISSN - 1096-987X
pISSN - 0192-8651
DOI - 10.1002/jcc.20075
Subject(s) - discretization , mathematics , finite difference , finite difference method , boundary value problem , mathematical analysis , partial differential equation , ordinary differential equation , differential equation , reaction–diffusion system
Abstract The validity for finite‐difference electrochemical kinetic simulations, of the extension of the Numerov discretization designed by Chawla and Katti [J Comput Appl Math 1980, 6, 189–196] for the solution of two‐point boundary value problems in ordinary differential equations, is examined. The discretization is adapted to systems of time‐dependent reaction‐diffusion partial differential equations in one‐dimensional space geometry, on nonuniform space grids resulting from coordinate transformations. The equations must not involve first spatial derivatives of the unknowns. Relevant discrete formulae are outlined and tested in calculations on two example kinetic models. The models describe potential step chronoamperometry under limiting current conditions, for the catalytic EC, and Reinert‐Berg CE reaction mechanisms. Exponentially expanding space grid is used. The discretization considered proves the most accurate and efficient, out of all the three‐point finite‐difference discretizations on such grids, that have been used thus far in electrochemical kinetics. Therefore, it can be recommended as a method of choice. © 2004 Wiley Periodicals, Inc. J Comput Chem 25: 1515–1521, 2004

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here