If | Then |
---|---|
a < θ | θ = a + exp( φ ) |
θ < b | θ = b - exp( φ ) |
a < θ < b | θ = a +((b - a) / (1 + exp( -φ ))) |
Term | Description |
---|---|
a and b | numeric constants |
θ's | parameters |
φ | transformed parameters |
Minitab performs these transforms, and displays the results in terms of the original parameters.
Term | Description |
---|---|
n | nth observation |
N | total number of observations |
p | number of free (unlocked) parameters |
R | the (upper triangular) R matrix from the QR decomposition of Vi for the final iteration |
V0 | gradient matrix = ( ∂f(xn, θ) / ∂θp), the P by 1 vector of partial derivatives of f(x0, θ), evaluated at θ* |
S |
Term | Description |
---|---|
R | the (upper triangular) R matrix from the QR decomposition of Vi for the final iteration |
P | number of free (unlocked) parameters |
v0 | gradient matrix = ( ∂f(xn, θ) / ∂θ p), the P by 1 vector of partial derivatives of f( x0, θ), evaluated at θ* |
θ's | parameters |
Let θ = (θ1, . . . . θp) * with θ* being the final iteration for θ.
The likelihood-based 100 (1 - α) % confidence limits satisfy:
where S( θp ) is the SSE obtained when holding θp fixed and minimizing over the other parameters.1 This is equivalent to solving:
S(θp) = S(θ*) + (tα/2)2 MSE
Term | Description |
---|---|
θ's | parameters |
n | nth observation |
N | total number of observations |
P | number of free (unlocked) parameters |
tα/2 | upper α/2 point of the t distribution with N - P degrees of freedom |
S(θ) | Sum of the squared error |
MSE | mean squared error |