Medical, Pharma, Engineering, Science, Technology and Business

**Stephen B Duffull ^{1*} and Gareth Hegarty^{2}**

^{1}School of Pharmacy, University of Otago, Dunedin 9054, New Zealand

^{2}Department of Mathematics and Statistics, University of Otago, Dunedin 9054, New Zealand

- *Corresponding Author:
- Stephen B Duffull

School of Pharmacy

University of Otago, P.O. Box 56

Dunedin 9054, New Zealand

**Tel:**+6434797258

**Fax:**+64 3 4797258

**E-mail:**[email protected]

**Received date:** June 17, 2014; **Accepted date:** October 06, 2014; **Published date:** October 14, 2014

**Citation:** Stephen B Duffull, Gareth Hegarty (2014) An Inductive Approximation to the Solution of Systems of Nonlinear Ordinary Differential Equations in Pharmacokinetics-Pharmacodynamics. J Theor Comput Sci 2:119. doi:10.4172/2376-130X.1000119

**Copyright:** © 2014 Stephen B Duffull, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

**Visit for more related articles at** Journal of Computer Science and Networking

Rapid and accurate solutions for nonlinear ordinary differential equations (ODEs) that arise in the **pharmaceutical** sciences are desirable. This is particularly important in the area of** pharmacokinetic**-pharmacodynamics modelling and design. We describe an iterative linearization to generate inductive approximations which converge to the solution. These approximations allow quick and accurate evaluations of the pharmacokinetic-**pharmacodynamic** PKPD models. The inductive approximations are applied to a simple nonlinear pharmacokinetic (PK) model, ie a model that is nonlinear when expressed as an ordinary differential equation, and show the utility of the method. Because the approximations depend continuously on the parameters and time, the inductive method is particularly suitable for parameter estimation and optimal design approaches.

PKPD; Nonlinear ordinary differential equations; Analytical approximations; Optimal design; Parameter estimation

Understanding the time course and extent of **drug effects** is important in order to determine the best dose and dosing regimen to meet the needs of both clinical use and drug development [1]. Pharmacokinetic-pharmacodynamic (PKPD) models are used to describe the time course of drug effects and the study of these processes has been the subject of considerable attention. Pharmacokinetics (PK) defines models used to describe the change in concentrations of the drug in the body over time and pharmacodynamics describes the relationship between concentration and effect. The combination of PK and PD (to give PKPD) therefore links drug effects to time. Recently the European Medicines Agency has instigated a working party to promote integration of PKPD modelling and simulation processes into drug development (see recent opinion piece [2]). Due to nonlinearities in the structure of PKPD models, it is common that PKPD models are expressed as ordinary differential equations. In addition, these models are generally cast in a population **framework** with random effects on the parameter and data levels. This leads to high **dimensionality** and when combined with time-stepping solvers for ordinary differential equations (ODEs) (e.g. algorithms based on the Runge Kutta technique) can be computationally intensive with many function calls required for estimation, optimisation (such as optimal design [3]) or simulation [4] processes. Rapid and accurate solutions for nonlinear differential equations would provide a valuable asset to those development and application of PKPD models.

Here we consider how to solve systems of first-order nonlinear ODEs. These have the general form:

(1)

where t is time, is a m x 1 vector of response variables (i.e. concentrations and/or effects), and where is a nonlinear function of y. Unfortunately, exact closed form **solutions** to such systems are only available in (relatively) few cases; for example, the Michaelis-Menten system for a zero order input where the exact solution may be written in terms of the Lambert-W function [5]. However, even if the solution cannot be written in closed form, there are many methods (both numerical and analytical) for generating approximate solutions which share many desirable characteristics with the exact solution and which are accurate to any order (see for example [6] for some introductory comments).

In this work we introduce an inductive method of generating approximate solutions to nonlinear systems based on an iterative linearization. We explore this method using a simple example that has no known closed form solution. Our intention is to provide a example, which in this case is given by a one-compartment first-order input Michaelis-Menten output model, for which no analytical solution exists and hence from which the methods we propose can be described as simply as possible. The proposed iterative linearization method has wide applicability to other nonlinear models, e.g. recursive systems such as the coagulation network [7] and more complicated systems of differential equations that contain Michaelis-Menten.

**Theory**

The first-order nonlinear systems (1) may be rewritten in the form:

(2)

where A(t, y) is an m × m non-singular matrix, y(t) and f(t,y) are column vectors, and There are usually several different ways of writing (1) in this form, starting with the simple setting where A = 0 and f = F. Here we wish to focus on decompositions which reflect the linearization of the equation, i.e. Starting with an (arbitrary) initial approximation , we may inductively define a sequence of approximations as solutions now represented in a first-order linear system:

(3)

We see that A and f now depend on the previous iteration ,which is a known quantity, rather than on the current value of y(t), and hence the nonlinearity is avoided. Since (3) is a first-order linear system, we can then apply the integrating factor formula given in Appendix B to write the solution as:

(4)

Even if each integral cannot be solved algebraically, each of the integrals in this formula may be quickly and accurately estimated using Gaussian quadrature.

**Application**

Here we apply the inductive method described above to a nonlinear system that describes the concentration of a drug with first-order input and Michaelis-Menten output, i.e.

(5)

where C(t_{0}) is the initial concentration of drug in the **blood** (at time zero) with units of mg/L, D is dose (1 mg) and the parameters, k_{a} (first-order absorption rate constant), V_{max} (maximum velocity of the enzyme) and *km* (Michaelis-Menten constant – defined as the concentration for which the enzyme is at half-maximal rate). The parameters and their values are given in (**Table 1**).

Parameter | Description | Value, units |
---|---|---|

V_{max} |
Maximum elimination rate | 0.0734 mg/h |

km |
Michaelis-Menten constant | 0.3672 mg/L |

V |
Volume of distribution | 1 L |

k_{a} |
Absorption rate constant | /h |

**Table 1: **Parameters and their values for system (equation 5).

This system can obviously be written in the form (eqn 2) by letting y(t) = C(t) and

and hence, according to the inductive scheme above and starting with the naive initial estimate (for all t), we can now generate successive approximations inductively which converge to the solution of (equation 5), i.e.

(6)

For n = 1, 2, 3, .... Using the integrating factor formula in (eqn 4), we get the solution for the n^{th} iterate expressed in integral form:

(7)

We see that for n = 1 this can be evaluated exactly to give the linear approximation, i.e.

Subsequent iterates can be estimated using Gauss-Legendre quadrature, i.e.

where χ_{ij}, *w*_{ij} are Ni- point abscissas and weights for i = 1, 2 (these can be calculated using the method given in Trefethen [8]).

The convergence of the inductive estimates C^{[n]}(t) can be seen in (**Figure 1**) (using N1 = N2 = 5 in the Gaussian quadratures). The choice of 5 iterations is arbitrary and can be chosen to suit the accuracy requirements of the particular use of the model. The lower dashed line represents the linear approximationC^{[1]}(t) . It is seen that as number of iterations increase the inductive approximations approach the solution provided by the ODE45 solver in MATLAB(MATrix LABoratories R2014a,The Math Works Inc). ODE45 is a medium order non-stiff differential equation solver that is based on the 4th order Runge-Kutta solution. We show this figure to provide a sense of the relative accuracy of the method as the number of iterations increases. In this setting the time-stepping ODE solution is in itself not accurate and hence is only providing a benchmark for the approach. A more rigorous approach to considering accuracy is shown in (**Figure 2**). Here we see that the relative error between successive approximations appears to be decaying exponentially as a function of n. This is significant because it means that the series:

Will be absolutely convergent and hence the inductive** approximation** will approach the true (but unknown) solution. The accuracy of the inductive linearization can therefore be determined to any arbitrary level of accuracy. The choice used for the initial estimate C^{[0]}(t) = 0 works well when the input coefficient k_{a} D is small in comparison to the output coefficient V_{max}/km (so that C(t) <<km), but if the converse is true a different choice of C^{[0]}(t) (closer to C(t)) could be used.

Here we see how the solution to any system of first-order nonlinear ODEs can be approximated by a **sequence** of inductive approximations which are generated as solutions for first-order linear equations. This is a versatile and powerful technique of generating analytical approximations which are accurate across a broad range of times and parameter values. This means that the inductive method is particularly suitable for applications in optimal design and parameter estimation when the structural model is expressed in terms of nonlinear differential equations. We have attempted to keep the work here as simple as possible and apply the method to a simple set of differential equations, which we have written as a single differential equation. However the method can be used to solve larger sets of differential equations, including recursive systems, such as the coagulation system [6].

The inductive method has some potential advantages over the commonly used numerical time-stepping methods (e.g. Runge-Kutta, Adam’s, Gear’s etc.). 1) The method provides a solution which depends continuously upon time, thus avoiding the need to interpolate the approximation which can in some circumstances result in large and unexpected inaccuracies in model predictions. 2) Since the inductive solution is based on an algebraic approximation to the nonlinear system over the whole time domain of interest (e.g. a dose interval) rather than a small fraction of the time domain that is considered by timestepping ODE solvers then it is expected that the method would work equivalently well for stiff or non-stiff systems. Although further work would be desirable to characterise this property. 3) The solutions to the derivatives of the model with respect to parameter values are available in analytical form. 4) Time-stepping methods that use adaptive step-size requires the parameters are fixed before solving, whereas the inductive method provides a closed form approximation that is valid for any arbitrary set of parameter values. This is of particular importance for subsequent inference based on evaluation of the likelihood, such as in parameter estimation or evaluation of the information matrix for design. 5) For the example considered here it was not a requirement to have informative starting conditions, i.e. parameter values, for the linearization.. The disadvantage of the inductive linearization is the need for the user to define the model to the level of a closed form integral of the linearized, time-varying, model. While this is an important initial limitation of the method automated methods to create this integral are available and can be applied to this setting.

We have provided code in** Appendix** A for the implementation of the inductive method in MATLAB for the example considered here, and this can be easily modified to apply to other nonlinear systems. Note that for any nonlinear system there will always be at most two integrals at each step in the inductive process (such as in (equation 9)), and that in some cases one or both of these integrals may be solved exactly. In this work we have made no attempt to optimize the speed or accuracy of the inductive method in order that the method can be shown in its simplest form. Here we have used Gauss-Legendre quadrature to give precise estimates to the integrals in the inductive approximations, but there are also other methods with similar accuracy that could be used, e.g. Gauss-Kronrod quadrature (which allows the error to be estimated) and Clenshaw-Curtis quadrature (see Trefethen[8]).

There are other methods of generating approximate solutions to nonlinear systems, including asymptotic approximations, methods can be found in Zwillinger [9]. In all of these cases however the behaviour of the system at local values of the parameters needs to be known in order for these approximations to work. The advantage of time-stepping ODE solvers and the inductive linearization method presented here is the limited dependence on the values of the parameters, with the caveat of the requirement for solvers of time stepping systems to be either stiff or non-stiff solvers.

In conclusion, we present a** linearization** method for converting a system of nonlinear ODEs into an iterative system of (usually timevarying) linear ODEs which can then be solved at each step using standard techniques.

**Appendix A MATLAB code**

function y = cn(t,n)

global d ka v km v_{max} N1 N2 x1 x2 w1 w2; % parameters

y = zeros(1,length(t));

if(n==1)

y = (ka*d/(v*(v_{max}/(km*v) - ka)))*(exp(-ka*t) ...- exp(-(v_{max}/(km*v))*t));

else

for j=1:N1

y1 = zeros(1,length(t)); for k=1:N2

y1 = y1 + (v_{max}/v)*(t*(1-x1(j))/4).*(w2(k)./(km + ...

cn(t*(x1(j)+3)/4 + t*(1-x1(j))*x2(k)/4,n-1)));

end

y = y + (ka*d/v)*(t/2).*w1(j).*exp(-ka*t*(x1(j)+1)/2 - y1);

end

end

**Appendix B the integrating factor formula**

Consider a system of first-order linear ODEs with time-varying coefficients, i.e. of the form:

, (8)

where ,,are (column) n-vectors, and A(t) is an n × n (non-singular) matrix. To solve the system we take the A(t)y(t) term to the left hand side (LHS) and multiply the whole equation by the integrating factor ,

We then recognise that the LHS can be written as a derivative, i.e.

Integrating this equation from t_{0} to t, we derive the solution:

Even if they cannot be done exactly, the integrals in this formula can be transformed to integrals over the interval [−1,1] and hence estimated using Gauss-Legendre quadrature, i.e.

Where x_{j}, w_{j} are the abscissas and weights respectively for Gauss- Legendre quadrature.

Dr G Hegarty was supported by a School of Pharmacy postdoctoral fellowship.

- Wright D, Winter H, Duffull S (2011) Understanding the time course of pharmacological effect - a PKPD approach. Br J Clin Pharmacol 71: 815-823.
- Mentre F, Chenel M, Comets E, Grevel J, Hooker A, et al (2013) Current Use and Developments Needed for Optimal Design in Pharmacometrics: A Study Performed Among DDMoRe/'s European Federation of Pharmaceutical Industries and Associations Members. CPT: Pharmacomet Syst Pharmacol 2: e46.
- Foracchia M, Hooker A, Vicini P, Ruggeri A (2004) POPED, a software for optimal experiment design in population kinetics. Computer Methods and Programs in Biomedicine 74: 29-46.
- Kimko H, Duffull S (2002) Simulation for designing clinical trials: a pharmacokinetic-pharmacodynamicmodeling perspective. CRC Press.
- Beal S (1982) On the Solution to the Michaelis-Menten Equation. Journal of Pharmacokinetics & Biopharmaceutics 10: 109-119.
- Süli E, D Mayers (2003)An introduction to Numerical Analysis: Cambridge University Press.
- Wajima T, Isbister G, Duffull S (2009) A Comprehensive Model for the Humoral Coagulation Network in Humans. ClinPharmacolTher 86: 290-298
- Trefethen L (2008) Is Gauss Quadrature Better than Clenshaw-Curtis? SIAM Review 50: 67-87.
- Zwillinger D (1998) Handbook of Differential Equations. Academic Press.

Select your language of interest to view the total content in your interested language

- Adomian Decomposition Method
- Advances in Health Care Technology
- Applications of Bioinformatics
- Applied Mathematics
- Applied Medical Informatics
- Balance Law
- Bioinformatics Algorithms
- Bioinformatics Databases
- Bioinformatics Tools
- Biomedical Informatics
- Cancer Informatics
- Cancer Proteomics
- Clinical Informatics
- Clinical Proteomics
- Computational Chemistry
- Computational Model
- Consolidated Health Informatics
- Consumer Health Informatics
- Convection Diffusion Equations
- Current Proteomics
- Dental Informatics
- Differential Transform Method
- Experimental Physics
- Fuzzy Boundary Value
- Fuzzy Environments
- Fuzzy Quasi-Metric Space
- Health Care Informatics
- Health Care Records
- Health Information Management
- Hospital Informatics/ Pharmacy Informatics
- Human Proteome Project Applications
- Integrated Analysis
- Mass Spectrometry in Proteomics
- Mathematics for Computer Science
- Mental Health Informatics
- Methods in Medical Informatics
- Microarray Proteomics
- Mixed Initial-boundary Value
- Models of Science
- Molecular Modelling
- Molecular and Cellular Proteomics
- Nonlinear Differential Equations
- Number Theory
- Numerical Solutions
- Physics Models
- Protein Sequence Analysis
- Proteome Profiling
- Proteomic Analysis
- Proteomic Biomarkers
- Proteomics Clinical Applications
- Proteomics Research
- Proteomics Science
- Python for Bioinformatics
- Quantitative Proteomics
- Quasilinear Hyperbolic Systems
- Scientific Computing
- Semi Analytical-Solution
- Sensitivity Analysis
- Simulation Computer Science
- Smooth Complexities
- Technologies in Computer Science
- Theoretical Chemistry
- Theoretical Computer Science
- Theoretical Issues in Ergonomics Science
- Theoretical Methods
- Theoretical and Applied Science
- Three Dimensional Steady State

- European Conference on
**Computer Science**&**Engineering**

June 20-21, 2018 Oslo, Norway - International Conference on
**Big Data**, Knowledge Discovery and**Data Mining**

August 06-07, 2018 Abu Dhabi, UAE - International Conference on
**Artificial Intelligence**,**Robotics**& IoT

August 21-22, 2018 Paris, France - International Conference on
**Computational Biology**and**Bioinformatics**

Sep 05-06 2018 Tokyo, Japan - International Conference on Advancements in
**Bioinformatics**and**Drug Discovery**

November 26-27, 2018 Dublin, Ireland

- Total views:
**12179** - [From(publication date):

February-2015 - Feb 22, 2018] - Breakdown by view type
- HTML page views :
**8340** - PDF downloads :
**3839**

Peer Reviewed Journals

International Conferences
2018-19