Gompertz Models

This chapter discusses the two Gompertz models that are used in RGA. The standard Gompertz and the modified Gompertz.

=The Standard Gompertz Model= The Gompertz reliability growth model is often used when analyzing reliability data. It is most applicable when the data set follows a smooth curve, as shown in the plot below.



The Gompertz model is mathematically given by Virene [1]:


 * $$R=a{{b}^}\,\!$$

where:


 * $$00\,\!$$
 * $$R=\,\!$$ the system's reliability at development time, launch number or stage number, $$T\,\!$$.
 * $$a=\,\!$$ the upper limit that the reliability approaches asymptotically as $$T\to \infty \,\!$$, or the maximum reliability that can be attained.
 * $$ab=\,\!$$ initial reliability at $$T=0.\,\!$$
 * $$c=\,\!$$ the growth pattern indicator (small values of $$c\,\!$$ indicate rapid early reliability growth and large values of $$c\,\!$$ indicate slow reliability growth).

As it can be seen from the mathematical definition, the Gompertz model is a 3-parameter model with the parameters $$a\,\!$$, $$b\,\!$$ and $$c\,\!$$. The solution for the parameters, given $${{T}_{i}}\,\!$$ and $${{R}_{i}}\,\!$$, is accomplished by fitting the best possible line through the data points. Many methods are available; all of which tend to be numerically intensive. When analyzing reliability data in the RGA software, you have the option to enter the reliability values in percent or in decimal format. However, $$a\,\!$$ will always be returned in decimal format and not in percent. The estimated parameters in the RGA software are unitless. The next section presents an overview and background on some of the most commonly used algorithms/methods for obtaining these parameters.

Linear Regression
The method of least squares requires that a straight line be fitted to a set of data points. If the regression is on $$Y\,\!$$, then the sum of the squares of the vertical deviations from the points to the line is minimized. If the regression is on $$X\,\!$$, the line is fitted to a set of data points such that the sum of the squares of the horizontal deviations from the points to the line is minimized. To illustrate the method, this section presents a regression on $$Y\,\!$$. Consider the linear model given by Seber and Wild [2]:


 * $${{Y}_{i}}={{\widehat{\beta }}_{0}}+{{\widehat{\beta }}_{1}}{{X}_{i1}}+{{\widehat{\beta }}_{2}}{{X}_{i2}}+...+{{\widehat{\beta }}_{p}}{{X}_{ip}}\,\!$$

or in matrix form where bold letters indicate matrices:


 * $$\begin{align}

Y=X\beta \end{align}\,\!$$


 * where:


 * $$Y=\left[ \begin{matrix}

{{Y}_{1}} \\ {{Y}_{2}} \\ \vdots  \\ {{Y}_{N}} \\ \end{matrix} \right]\,\!$$


 * $$X=\left[ \begin{matrix}

1 & {{X}_{1,1}} & \cdots & {{X}_{1,p}}  \\ 1 & {{X}_{2,1}} & \cdots & {{X}_{2,p}}  \\ \vdots & \vdots  & \ddots  & \vdots   \\ 1 & {{X}_{N,1}} & \cdots & {{X}_{N,p}}  \\ \end{matrix} \right]\,\!$$
 * and:


 * $$\beta =\left[ \begin{matrix}

{{\beta }_{0}} \\ {{\beta }_{1}} \\ \vdots  \\ {{\beta }_{p}} \\ \end{matrix} \right]\,\!$$

The vector $$\beta \,\!$$ holds the values of the parameters. Now let $$\widehat{\beta }\,\!$$ be the estimates of these parameters, or the regression coefficients. The vector of estimated regression coefficients is denoted by:


 * $$\widehat{\beta }=\left[ \begin{matrix}

{{\widehat{\beta }}_{0}} \\ {{\widehat{\beta }}_{1}} \\ \vdots  \\ {{\widehat{\beta }}_{p}} \\ \end{matrix} \right]\,\!$$

Solving for $$\beta \,\!$$ in the matrix form of the equation requires the analyst to left multiply both sides by the transpose of $$X\,\!$$, $${{X}^{T}}\,\!$$, or :


 * $$\begin{align}

Y&=X\beta \\ ({{X}^{T}}X)\widehat{\beta }&={{X}^{T}}Y \\ \end{align}\,\!$$

Now the term $$({{X}^{T}}X)\,\!$$ becomes a square and invertible matrix. Then taking it to the other side of the equation gives:


 * $$\widehat{\beta }=({{X}^{T}}X)^{-1}{{X}^{T}}Y\,\!$$

Non-linear Regression
Non-linear regression is similar to linear regression, except that a curve is fitted to the data set instead of a straight line. Just as in the linear scenario, the sum of the squares of the horizontal and vertical distances between the line and the points are to be minimized. In the case of the non-linear Gompertz model $$R=a{{b}^}\,\!$$, let:


 * $${{Y}_{i}}=f({{T}_{i}},\delta )=a{{b}^}\,\!$$


 * where:


 * $${{T}_{i}}=\left[ \begin{matrix}

{{T}_{1}} \\ {{T}_{2}} \\ \vdots  \\ {{T}_{N}} \\ \end{matrix} \right],\quad i=1,2,...,N\,\!$$


 * and:


 * $$\delta =\left[ \begin{matrix}

a \\ b \\ c \\ \end{matrix} \right]\,\!$$

The Gauss-Newton method can be used to solve for the parameters $$a\,\!$$, $$b\,\!$$ and $$c\,\!$$ by performing a Taylor series expansion on $$f({{T}_{i}},\delta ).\,\!$$ Then approximate the non-linear model with linear terms and employ ordinary least squares to estimate the parameters. This procedure is performed in an iterative manner and it generally leads to a solution of the non-linear problem.

This procedure starts by using initial estimates of the parameters $$a\,\!$$, $$b\,\!$$ and $$c\,\!$$, denoted as $$g_{1}^{(0)},\,\!$$ $$g_{2}^{(0)}\,\!$$ and $$g_{3}^{(0)},\,\!$$ where $$^{(0)}\,\!$$ is the iteration number. The Taylor series expansion approximates the mean response, $$f({{T}_{i}},\delta )\,\!$$, around the starting values, $$g_{1}^{(0)},\,\!$$ $$g_{2}^{(0)}\,\!$$ and $$g_{3}^{(0)}.\,\!$$ For the $${{i}^{th}}\,\!$$ observation:


 * $$f({{T}_{i}},\delta )\simeq f({{T}_{i}},{{g}^{(0)}})+\underset{k=1}{\overset{p}{\mathop \sum }}\,{{\left[ \frac{\partial f({{T}_{i}},\delta )}{\partial {{\delta }_{k}}} \right]}_{\delta ={{g}^{(0)}}}}({{\delta }_{k}}-g_{k}^{(0)})\,\!$$

where:


 * $${{g}^{(0)}}=\left[ \begin{matrix}

g_{1}^{(0)} \\ g_{2}^{(0)} \\ g_{3}^{(0)} \\ \end{matrix} \right]\,\!$$

Let:


 * $$\begin{align}

f_{i}^{(0)}= & f({{T}_{i}},{{g}^{(0)}}) \\ \nu _{k}^{(0)}= & ({{\delta }_{k}}-g_{k}^{(0)}) \\ D_{ik}^{(0)}= & {{\left[ \frac{\partial f({{T}_{i}},\delta )}{\partial {{\delta }_{k}}} \right]}_{\delta ={{g}^{(0)}}}} \end{align}\,\!$$

So the equation $${{Y}_{i}}=f({{T}_{i}},\delta )=a{{b}^} \,\!$$ becomes:


 * $${{Y}_{i}}\simeq f_{i}^{(0)}+\underset{k=1}{\overset{p}{\mathop \sum }}\,D_{ik}^{(0)}\nu _{k}^{(0)}\,\!$$

or by shifting $$f_{i}^{(0)}\,\!$$ to the left of the equation:


 * $$Y_{i}^{(0)}\simeq \underset{k=1}{\overset{p}{\mathop \sum }}\,D_{ik}^{(0)}\nu _{k}^{(0)}\,\!$$

In matrix form this is given by:


 * $${{Y}^{(0)}}\simeq {{D}^{(0)}}{{\nu }^{(0)}}\,\!$$

where:


 * $${{Y}^{(0)}}=\left[ \begin{matrix}

{{Y}_{1}}-f_{1}^{(0)} \\ {{Y}_{2}}-f_{2}^{(0)} \\ \vdots  \\ {{Y}_{N}}-f_{N}^{(0)} \\ \end{matrix} \right]=\left[ \begin{matrix} {{Y}_{1}}-g_{1}^{(0)}g_{2}^{(0)g_{3}^{(0){{T}_{1}}}} \\ {{Y}_{1}}-g_{1}^{(0)}g_{2}^{(0)g_{3}^{(0){{T}_{2}}}} \\ \vdots  \\ {{Y}_{N}}-g_{1}^{(0)}g_{2}^{(0)g_{3}^{(0){{T}_{N}}}} \\ \end{matrix} \right]\,\!$$


 * $$\begin{align}

{{D}^{(0)}}= & \left[ \begin{matrix} D_{11}^{(0)} & D_{12}^{(0)} & D_{13}^{(0)} \\ D_{21}^{(0)} & D_{22}^{(0)} & D_{23}^{(0)} \\ . & . & . & . \\   . & . & . & .  \\   D_{N1}^{(0)} & D_{N2}^{(0)} & D_{N3}^{(0)}  \\ \end{matrix} \right] \\ = & \left[ \begin{matrix} g_{2}^{(0)g_{3}^{(0){{T}_{1}}}} & \tfrac{g_{1}^{(0)}}{g_{2}^{(0)}}g_{3}^{(0){{T}_{1}}}g_{2}^{(0)g_{3}^{(0){{T}_{1}}}} & \tfrac{g_{1}^{(0)}}{g_{3}^{(0)}}g_{3}^{(0){{T}_{1}}}\ln (g_{2}^{(0)}){{T}_{1}}g_{2}^{(0)g_{3}^{(0){{T}_{1}}}} & 1 \\ g_{2}^{(0)g_{3}^{(0){{T}_{2}}}} & \tfrac{g_{1}^{(0)}}{g_{2}^{(0)}}g_{3}^{(0){{T}_{2}}}g_{2}^{(0)g_{3}^{(0){{T}_{2}}}} & \tfrac{g_{1}^{(0)}}{g_{3}^{(0)}}g_{3}^{(0){{T}_{2}}}\ln (g_{2}^{(0)}){{T}_{2}}g_{2}^{(0)g_{3}^{(0){{T}_{2}}}} & 1 \\ . & . & . & . \\   . & . & . & .  \\   g_{2}^{(0)g_{3}^{(0){{T}_{N}}}} & \tfrac{g_{1}^{(0)}}{g_{2}^{(0)}}g_{3}^{(0){{T}_{N}}}g_{2}^{(0)g_{3}^{(0){{T}_{N}}}} & \tfrac{g_{1}^{(0)}}{g_{3}^{(0)}}g_{3}^{(0){{T}_{N}}}\ln (g_{2}^{(0)}){{T}_{N}}g_{2}^{(0)g_{3}^{(0){{T}_{N}}}} & 1  \\ \end{matrix} \right] \end{align}\,\!$$


 * and:


 * $${{\nu }^{(0)}}=\left[ \begin{matrix}

g_{1}^{(0)} \\ g_{2}^{(0)} \\ g_{3}^{(0)} \\ \end{matrix} \right]\,\!$$

Note that the equation $${{Y}^{(0)}}\simeq {{D}^{(0)}}{{\nu }^{(0)}}\,\!$$ is in the form of the general linear regression model given in the Linear Regression section. Therefore, the estimate of the parameters $${{\nu }^{(0)}}\,\!$$ is given by:


 * $${{\widehat{\nu }}^{(0)}}={{\left( {{D}^}{{D}^{(0)}} \right)}^{-1}}{{D}^}{{Y}^{(0)}}\,\!$$

The revised estimated regression coefficients in matrix form are:


 * $${{g}^{(1)}}={{g}^{(0)}}+{{\widehat{\nu }}^{(0)}}\,\!$$

The least squares criterion measure, $$Q,\,\!$$ should be checked to examine whether the revised regression coefficients will lead to a reasonable result. According to the Least Squares Principle, the solution to the values of the parameters are those values that minimize $$Q\,\!$$. With the starting coefficients, $${{g}^{(0)}}\,\!$$, $$Q\,\!$$ is:


 * $${{Q}^{(0)}}=\underset{i=1}{\overset{N}{\mathop \sum }}\,{{\left[ {{Y}_{i}}-f\left( {{T}_{i}},{{g}^{(0)}} \right) \right]}^{2}}\,\!$$

And with the coefficients at the end of the first iteration, $${{g}^{(1)}}\,\!$$, $$Q\,\!$$ is:


 * $${{Q}^{(1)}}=\underset{i=1}{\overset{N}{\mathop \sum }}\,{{\left[ {{Y}_{i}}-f\left( {{T}_{i}},{{g}^{(1)}} \right) \right]}^{2}}\,\!$$

For the Gauss-Newton method to work properly and to satisfy the Least Squares Principle, the relationship $${{Q}^{(k+1)}}<{{Q}^{(k)}}\,\!$$ has to hold for all $$k\,\!$$, meaning that $${{g}^{(k+1)}}\,\!$$ gives a better estimate than $${{g}^{(k)}}\,\!$$. The problem is not yet completely solved. Now $${{g}^{(1)}}\,\!$$ are the starting values, producing a new set of values $${{g}^{(2)}}\,\!$$. The process is continued until the following relationship has been satisfied:


 * $${{Q}^{(s-1)}}-{{Q}^{(s)}}\simeq 0\,\!$$

When using the Gauss-Newton method or some other estimation procedure, it is advisable to try several sets of starting values to make sure that the solution gives relatively consistent results.

Choice of Initial Values
The choice of the starting values for the nonlinear regression is not an easy task. A poor choice may result in a lengthy computation with many iterations. It may also lead to divergence, or to a convergence due to a local minimum. Therefore, good initial values will result in fast computations with few iterations, and if multiple minima exist, it will lead to a solution that is a minimum.

Various methods were developed for obtaining valid initial values for the regression parameters. The following procedure is described by Virene [1] in estimating the Gompertz parameters. This procedure is rather simple. It will be used to get the starting values for the Gauss-Newton method, or for any other method that requires initial values. Some analysts use this method to calculate the parameters when the data set is divisible into three groups of equal size. However, if the data set is not equally divisible, it can still provide good initial estimates.

Consider the case where $$m\,\!$$ observations are available in the form shown next. Each reliability value, $${{R}_{i}}\,\!$$, is measured at the specified times, $${{T}_{i}}\,\!$$.


 * $$\begin{matrix}

{{T}_{i}} & {{R}_{i}} \\ {{T}_{0}} & {{R}_{0}} \\ {{T}_{1}} & {{R}_{1}} \\ {{T}_{2}} & {{R}_{2}} \\ \vdots & \vdots   \\ {{T}_{m-1}} & {{R}_{m-1}} \\ \end{matrix}\,\!$$

where:
 * $$m=3n,\,\!$$ $$n\,\!$$ is equal to the number of items in each equally sized group
 * $${{T}_{i}}-{{T}_{i-1}}=const\,\!$$
 * $$i=0,1,...,m-1\,\!$$

The Gompertz reliability equation is given by:


 * $$R=a{{b}^}\,\!$$

and:


 * $$\begin{align}

\ln (R)=\ln (a)+{{c}^{T}}\ln (b) \end{align}\,\!$$

Define:
 * $$S_1=\sum_{i=0}^{n-1} ln(R_i)= n ln(a)+ln(b)\sum_{i=0}^{n-1} c^{T_i}\,\!$$
 * $$S_2=\sum_{i=n}^{2n-1} ln(R_i)= n ln(a)+ln(b)\sum_{i=n}^{2n-1} c^{T_i}\,\!$$
 * $$S_3=\sum_{i=2n}^{m-1} ln(R_i)= n ln(a)+ln(b)\sum_{i=2n}^{m-1} c^{T_i}\,\!$$

Then:
 * $$\frac{S_3-S_2}{S_2-S_1}=\frac{\sum_{i=2n}{m-1} c^{T_i}-\sum_{i=n}^{2n-1} c^T_i}{\sum_{i=0}^{n-1} c^{T_i}}\,\!$$
 * $$\frac{S_3-S_2}{S_2-S_1}=c^T_{2n}\frac{\sum_{i=0}{n-1} c^{T_i}-c^{T_n}\sum_{i=0}^{n-1} c^T_i}{c^{T_n}\sum_{i=0}^{n-1} c^{T_i}}\,\!$$
 * $$\frac{S_3 - S_2}{S_2-S_1}=\frac{c^{T_2n}-c^{T_n}}{c^{T_n}-1}=c^{T_{a_n}}=c^{n\cdot I+T_0}\,\!$$

Without loss of generality, take $${{T}_}=0\,\!$$ ; then:


 * $$\frac{{{S}_{3}}-{{S}_{2}}}{{{S}_{2}}-{{S}_{1}}}={{c}^{n\cdot I}}\,\!$$

Solving for $$c\,\!$$ yields:


 * $$c=\left ( \frac{S_{3}-S_{2}}{S_{2}-S_{1}} \right )^\frac{1}{n\cdot I}$$

Considering the definitions for $$S_{1}\,\!$$ and $$S_{2}\,\!$$, given above, then:


 * $$\begin{align}

{{S}_{1}}-n\cdot \ln (a)= & \ln (b)\underset{i=0}{\overset{n-1}{\mathop \sum }}\,{{c}^} \\ {{S}_{2}}-n\cdot \ln (a)= & \ln (b)\underset{i=n}{\overset{2n-1}{\mathop \sum }}\,{{c}^} \end{align}\,\!$$

or:


 * $$\frac{{{S}_{1}}-n\cdot \ln (a)}{{{S}_{2}}-n\cdot \ln (a)}=\frac{1}\,\!$$

Reordering the equation yields:


 * $$\begin{align}

\ln (a)= & \frac{1}{n}\left( {{S}_{1}}+\frac{{{S}_{2}}-{{S}_{1}}}{1-{{c}^{n\cdot I}}} \right) \\ a= & {{e}^{\left[ \tfrac{1}{n}\left( {{S}_{1}}+\tfrac{{{S}_{2}}-{{S}_{1}}}{1-{{c}^{n\cdot I}}} \right) \right]}} \end{align}\,\!$$

If the reliability values are in percent then $$a\,\!$$ needs to be divided by 100 to return the estimate in decimal format. Consider the definitions for $$S_{1}\,\!$$ and $$S_{2}\,\!$$ again, where:


 * $$\begin{align}

S_{1}-ln(b)\sum_{i=0}^{n-1}c^{T_{i}}&=nln(a) \\ S_{2}-ln(b)\sum_{i=n}^{2n-1}c^{T_{i}}&=nln(a) \\ \frac{S_{1}-ln(b)\sum_{i=0}^{n-1}c^{T_{i}}}{S_{2}-ln(b)\sum_{i=n}^{2n-1}c^{T_{i}}}&=1 \\ S_{1}-ln(b)\sum_{i=0}^{n-1}c^{T_{i}}&=S_{2}-ln(b)\sum_{i=n}^{2n-1}c^{T_{i}} \\ \end{align}$$

Reordering the equation above yields:


 * $$\begin{align}

\ln (b)= & \frac{({{S}_{2}}-{{S}_{1}})({{c}^{I}}-1)} \\ b= & {{e}^{\left[ \tfrac{\left( {{S}_{2}}-{{S}_{1}} \right)\left( {{c}^{I}}-1 \right)} \right]}} \end{align}\,\!$$

Therefore, for the special case where $$I=1\,\!$$, the parameters are:


 * $$\begin{align}

c= & {{\left( \frac{{{S}_{3}}-{{S}_{2}}}{{{S}_{2}}-{{S}_{1}}} \right)}^{\tfrac{1}{n}}} \\ a= & {{e}^{\left[ \tfrac{1}{n}\left( {{S}_{1}}+\tfrac{{{S}_{2}}-{{S}_{1}}}{1-{{c}^{n}}} \right) \right]}} \\ b= & {{e}^{\left[ \tfrac{({{S}_{2}}-{{S}_{1}})(c-1)} \right]}} \end{align}\,\!$$

To estimate the values of the parameters $$a,b\,\!$$ and $$c\,\!$$, do the following:

 Arrange the currently available data in terms of $$T\,\!$$ and $$R\,\!$$ as in the table below. The $$T\,\!$$ values should be chosen at equal intervals and increasing in value by 1, such as one month, one hour, etc.

 Calculate the natural log $$R\,\!$$.  Divide the column of values for log $$R\,\!$$ into three groups of equal size, each containing $$n\,\!$$ items. There should always be three groups. Each group should always have the same number, $$n\,\!$$, of items, measurements or values.  Add the values of the natural log $$R\,\!$$ in each group, obtaining the sums identified as $${{S}_{1}}\,\!$$, $${{S}_{2}}\,\!$$ and $${{S}_{3}}\,\!$$, starting with the lowest values of the natural log $$R\,\!$$.  Calculate $$c\,\!$$ using the following equation:
 * $$c={{\left( \frac{{{S}_{3}}-{{S}_{2}}}{{{S}_{2}}-{{S}_{1}}} \right)}^{\tfrac{1}{n}}}\,\!$$

 Calculate $$a\,\!$$ using the following equation:
 * $$a={{e}^{\left[ \tfrac{1}{n}\left( {{S}_{1}}+\tfrac{{{S}_{2}}-{{S}_{1}}}{1-{{c}^{n}}} \right) \right]}}\,\!$$

 Calculate $$b\,\!$$ using the following equation:
 * $$b={{e}^{\left[ \tfrac{({{S}_{2}}-{{S}_{1}})(c-1)} \right]}}\,\!$$

 Write the Gompertz reliability growth equation. </li> Substitute the value of $$T\,\!$$, the time at which the reliability goal is to be achieved, to see if the reliability is indeed to be attained or exceeded by $$T\,\!$$. </li> </ol>

Confidence Bounds
The approximate reliability confidence bounds under the Gompertz model can be obtained with non-linear regression. Additionally, the reliability is always between 0 and 1. In order to keep the endpoints of the confidence interval, the logit transformation is used to obtain the confidence bounds on reliability.


 * $$CB=\frac{{{{\hat{R}}}_{i}}+(1-{{{\hat{R}}}_{i}}){{e}^{\pm {{z}_{\alpha }}{{{\hat{\sigma }}}_{R}}/\left[ {{{\hat{R}}}_{i}}(1-{{{\hat{R}}}_{i}}) \right]}}}\,\!$$


 * $${{\hat{\sigma }}^{2}}=\frac{SSE}{n-p}\,\!$$

where $$p\,\!$$ is the total number of groups (in this case 3) and $$n\,\!$$ is the total number of items in each group.

Cumulative Reliability
For many kinds of equipment, especially missiles and space systems, only success/failure data (also called discrete or attribute data) is obtained. Conservatively, the cumulative reliability can be used to estimate the trend of reliability growth. The cumulative reliability is given by Kececioglu [3]:


 * $$\bar{R}(N)=\frac{N-r}{N}\,\!$$

where:


 * $$N\,\!$$ is the current number of trials
 * $$r\,\!$$ is the number of failures

It must be emphasized that the instantaneous reliability of the developed equipment is increasing as the test-analyze-fix-and-test process continues. In addition, the instantaneous reliability is higher than the cumulative reliability. Therefore, the reliability growth curve based on the cumulative reliability can be thought of as the lower bound of the true reliability growth curve.

=The Modified Gompertz Model= Sometimes, reliability growth data with an S-shaped trend cannot be described accurately by the Standard Gompertz or Logistic curves. Because these two models have fixed values of reliability at the inflection points, only a few reliability growth data sets following an S-shaped reliability growth curve can be fitted to them. A modification of the Gompertz curve, which overcomes this shortcoming, is given next [5].

If we apply a shift in the vertical coordinate, then the Gompertz model is defined by:


 * $$R=d+a{{b}^}\,\!$$

where:


 * $$0<a+d\le 1\,\!$$
 * $$0<b<1,0<c<1,\text{and}T\ge 0\,\!$$


 * $$R\,\!$$ is the system's reliability at development time $$T\,\!$$ or at launch number $$T\,\!$$, or stage number $$T\,\!$$.
 * $$d\,\!$$ is the shift parameter.
 * $$d+a\,\!$$ is the upper limit that the reliability approaches asymptotically as $$T\to\infty\,\!$$
 * $$d+ab\,\!$$ is the initial reliability at $$T=0\,\!$$
 * $$c\,\!$$ is the growth pattern indicator (small values of $$c\,\!$$ indicate rapid early reliability growth and large values of $$c\,\!$$ indicate slow reliability growth).

The modified Gompertz model is more flexible than the original, especially when fitting growth data with S-shaped trends.

Parameter Estimation
To implement the modified Gompertz growth model, initial values of the parameters $$a\,\!$$, $$b\,\!$$, $$c\,\!$$ and $$d\,\!$$ must be determined. When analyzing reliability data in RGA, you have the option to enter the reliability values in percent or in decimal format. However, $$a\,\!$$ and $$d\,\!$$ will always be returned in decimal format and not in percent. The estimated parameters in RGA are unitless.

Given that $$R=d+a{{b}^}\,\!$$ and $$\ln (R-d)=\ln (a)+{{c}^{T}}\ln (b)\,\!$$, it follows that $${{S}_{1}}\,\!$$, $${{S}_{2}}\,\!$$ and $${{S}_{3}}\,\!$$, as defined in the derivation of the Standard Gompertz model, can be expressed as functions of $$d\,\!$$.


 * $$\begin{align}

{{S}_{1}}(d)= & \underset{i=0}{\overset{n-1}{\mathop \sum }}\,\ln ({{R}_{i}}-d)=n\ln (a)+\ln (b)\underset{i=0}{\overset{n-1}{\mathop \sum }}\,{{c}^} \\ {{S}_{2}}(d)= & \underset{i=n}{\overset{2n-1}{\mathop \sum }}\,\ln ({{R}_{i}}-d)=n\ln (a)+\ln (b)\underset{i=n}{\overset{2n-1}{\mathop \sum }}\,{{c}^} \\ {{S}_{3}}(d)= & \underset{i=2n}{\overset{m-1}{\mathop \sum }}\,\ln ({{R}_{i}}-d)=n\ln (a)+\ln (b)\underset{i=2n}{\overset{m-1}{\mathop \sum }}\,{{c}^} \end{align}\,\!$$

Modifying the equations for estimating parameters $$c\,\!$$, $$a\,\!$$, $$b\,\!$$, as functions of $$d\,\!$$, yields:


 * $$\begin{align}

c(d)= & {{\left[ \frac{{{S}_{3}}(d)-{{S}_{2}}(d)}{{{S}_{2}}(d)-{{S}_{1}}(d)} \right]}^{\tfrac{1}{n\cdot I}}} \\ a(d)= & {{e}^{\left[ \tfrac{1}{n}\left( {{S}_{1}}(d)+\tfrac{{{S}_{2}}(d)-{{S}_{1}}(d)}{1-{{[c(d)]}^{n\cdot I}}} \right) \right]}} \\ b(d)= & {{e}^{\left[ \tfrac{\left[ {{S}_{2}}(d)-{{S}_{1}}(d) \right]\left[ {{[c(d)]}^{I}}-1 \right]} \right]}} \end{align}\,\!$$

where $$I\,\!$$ is the time interval increment. At this point, you can use the initial constraint of:


 * $$d+ab=\text{original level of reliability at }T=0 \,\!$$

Now there are four unknowns, $$a\,\!$$, $$b\,\!$$, $$c\,\!$$ and $$d\,\!$$, and four corresponding equations. The simultaneous solution of these equations yields the four initial values for the parameters of the modified Gompertz model. This procedure is similar to the one discussed before. It starts by using initial estimates of the parameters, $$a\,\!$$, $$b\,\!$$, $$c\,\!$$ and $$d\,\!$$, denoted as $$g_{1}^{(0)},\,\!$$ $$g_{2}^{(0)},\,\!$$ $$g_{3}^{(0)},\,\!$$ and $$g_{4}^{(0)},\,\!$$ where $$^{(0)}\,\!$$ is the iteration number.

The Taylor series expansion approximates the mean response, $$f({{T}_{i}},\delta )\,\!$$, around the starting values, $$g_{1}^{(0)},\,\!$$ $$g_{2}^{(0)},\,\!$$ $$g_{3}^{(0)}\,\!$$ and $$g_{4}^{(0)}\,\!$$. For the $${{i}^{th}}\,\!$$ observation:


 * $$f({{T}_{i}},\delta )\simeq f({{T}_{i}},{{g}^{(0)}})+\underset{k=1}{\overset{p}{\mathop \sum }}\,{{\left[ \frac{\partial f({{T}_{i}},\delta )}{\partial {{\delta }_{k}}} \right]}_{\delta ={{g}^{(0)}}}}\cdot ({{\delta }_{k}}-g_{k}^{(0)})\,\!$$

where:


 * $${{g}^{(0)}}=\left[ \begin{matrix}

g_{1}^{(0)} \\ g_{2}^{(0)} \\ g_{3}^{(0)} \\ g_{4}^{(0)} \\ \end{matrix} \right]\,\!$$

Let:


 * $$\begin{align}

f_{i}^{(0)}= & f({{T}_{i}},{{g}^{(0)}}) \\ \nu _{k}^{(0)}= & ({{\delta }_{k}}-g_{k}^{(0)}) \\ D_{ik}^{(0)}= & {{\left[ \frac{\partial f({{T}_{i}},\delta )}{\partial {{\delta }_{k}}} \right]}_{\delta ={{g}^{(0)}}}} \end{align}\,\!$$

Therefore:


 * $${{Y}_{i}}=f_{i}^{(0)}+\underset{k=1}{\overset{p}{\mathop \sum }}\,D_{ik}^{(0)}\nu _{k}^{(0)}\,\!$$

or by shifting $$f_{i}^{(0)}\,\!$$ to the left of the equation:


 * $$Y_{i}^{(0)}-f_{i}^{(0)}=\underset{k=1}{\overset{p}{\mathop \sum }}\,D_{ik}^{(0)}\nu _{k}^{(0)}\,\!$$

In matrix form, this is given by:


 * $${{Y}^{(0)}}\simeq {{D}^{(0)}}{{\nu }^{(0)}}\,\!$$

where:


 * $${{Y}^{(0)}}=\left[ \begin{matrix}

{{Y}_{1}}-f_{1}^{(0)} \\ . \\   .  \\   {{Y}_{N}}-f_{N}^{(0)}  \\ \end{matrix} \right]=\left[ \begin{matrix} {{Y}_{1}}-g_{4}^{(0)}+g_{1}^{(0)}g_{2}^{(0)g_{3}^{(0){{T}_{1}}}} \\ . \\   .  \\   {{Y}_{N}}-g_{4}^{(0)}+g_{1}^{(0)}g_{2}^{(0)g_{3}^{(0){{T}_{N}}}}  \\ \end{matrix} \right]\,\!$$


 * $$\begin{align}

{{D}^{(0)}}= & \left[ \begin{matrix} D_{11}^{(0)} & D_{12}^{(0)} & D_{13}^{(0)} & D_{14}^{(0)} \\ . & . & . & . \\   . & . & . & .  \\   D_{N1}^{(0)} & D_{N2}^{(0)} & D_{N3}^{(0)} & D_{N4}^{(0)}  \\ \end{matrix} \right] \\ = & \left[ \begin{matrix} g_{2}^{(0)g_{3}^{(0){{T}_{1}}}} & \tfrac{g_{1}^{(0)}}{g_{2}^{(0)}}g_{3}^{(0){{T}_{1}}}g_{2}^{(0)g_{3}^{(0){{T}_{1}}}} & \tfrac{g_{1}^{(0)}}{g_{3}^{(0)}}g_{3}^{(0){{T}_{1}}}\ln (g_{2}^{(0)}){{T}_{1}}g_{2}^{(0)g_{3}^{(0){{T}_{1}}}} & 1 \\ . & . & . & . \\   . & . & . & .  \\   g_{2}^{(0)g_{3}^{(0){{T}_{N}}}} & \tfrac{g_{1}^{(0)}}{g_{2}^{(0)}}g_{3}^{(0){{T}_{N}}}g_{2}^{(0)g_{3}^{(0){{T}_{N}}}} & \tfrac{g_{1}^{(0)}}{g_{3}^{(0)}}g_{3}^{(0){{T}_{N}}}\ln (g_{2}^{(0)}){{T}_{N}}g_{2}^{(0)g_{3}^{(0){{T}_{N}}}} & 1  \\ \end{matrix} \right] \end{align}\,\!$$


 * $${{\nu }^{(0)}}=\left[ \begin{matrix}

g_{1}^{(0)} \\ g_{2}^{(0)} \\ g_{3}^{(0)} \\ g_{4}^{(0)} \\ \end{matrix} \right]\,\!$$

The same reasoning as before is followed here, and the estimate of the parameters $${{\nu }^{(0)}}\,\!$$ is given by:


 * $${{\widehat{\nu }}^{(0)}}={{\left( {{D}^}{{D}^{(0)}} \right)}^{-1}}{{D}^}{{Y}^{(0)}}\,\!$$

The revised estimated regression coefficients in matrix form are:


 * $${{g}^{(1)}}={{g}^{(0)}}+{{\widehat{\nu }}^{(0)}}\,\!$$

To see if the revised regression coefficients will lead to a reasonable result, the least squares criterion measure, $$Q$$, should be checked. According to the Least Squares Principle, the solution to the values of the parameters are those values that minimize $$Q\,\!$$. With the starting coefficients, $${{g}^{(0)}}\,\!$$, $$Q\,\!$$ is:


 * $${{Q}^{(0)}}=\underset{i=1}{\overset{N}{\mathop \sum }}\,{{\left( {{Y}_{i}}-f({{T}_{i}},{{g}^{(0)}}) \right)}^{2}}\,\!$$

With the coefficients at the end of the first iteration, $${{g}^{(1)}}\,\!$$, $$Q\,\!$$ is:


 * $${{Q}^{(1)}}=\underset{i=1}{\overset{N}{\mathop \sum }}\,{{\left( {{Y}_{i}}-f({{T}_{i}},{{g}^{(1)}}) \right)}^{2}}\,\!$$

For the Gauss-Newton method to work properly, and to satisfy the Least Squares Principle, the relationship $${{Q}^{(k+1)}}<{{Q}^{(k)}}\,\!$$ has to hold for all $$k\,\!$$, meaning that $${{g}^{(k+1)}}\,\!$$ gives a better estimate than $${{g}^{(k)}}\,\!$$. The problem is not yet completely solved. Now $${{g}^{(1)}}\,\!$$ are the starting values, producing a new set of values $${{g}^{(2)}}.\,\!$$ The process is continued until the following relationship has been satisfied.


 * $${{Q}^{(s-1)}}-{{Q}^{(s)}}\simeq 0\,\!$$

As mentioned previously, when using the Gauss-Newton method or some other estimation procedure, it is advisable to try several sets of starting values to make sure that the solution gives relatively consistent results. Note that RGA uses a different analysis method called the Levenberg-Marquardt. This method utilizes the best features of the Gauss-Newton method and the method of the steepest descent, and occupies a middle ground between these two methods.

Confidence Bounds
The approximate reliability confidence bounds under the modified Gompertz model can be obtained using non-linear regression. Additionally, the reliability is always between 0 and 1. In order to keep the endpoints of the confidence interval, the logit transformation can be used to obtain the confidence bounds on reliability.


 * $$CB=\frac{{{{\hat{R}}}_{i}}+(1-{{{\hat{R}}}_{i}}){{e}^{\pm {{z}_{\alpha }}{{{\hat{\sigma }}}_{R}}/\left[ {{{\hat{R}}}_{i}}(1-{{{\hat{R}}}_{i}}) \right]}}}\,\!$$


 * $${{\hat{\sigma }}^{2}}=\frac{SSE}{n-p}\,\!$$

where $$p\,\!$$ is the total number of groups (in this case 4) and $$n\,\!$$ is the total number of items in each group.

Example: Modified Gompertz for Reliability Data
=More Examples=