Package-free solution [PK / PD]

posted by ElMaestro  – Denmark, 2013-07-18 00:27 (4355 d 15:58 ago) – Posting: # 11008
Views: 22,571

Hi yung-jin,

:thumb up: Very smart numerical approach. Works perfectly. Simple and clean. Can this approach be used to solve more one parameters, such as K10 and K01 simultaneously? Hmm...


Yes it can. This time it was a one-domensional problem, but it can be extended to any number of dimensions. It is a typical grid search. The trouble is that for each new dimension the computation time is multiplied by a factor Gridsize. In this case I used 10000 steps as this is just one dimension. But if we try two dimensions and use 10000 steps per dimension, well, it is going to be (10^5)^2 loops then and you might be late for supper. Better to decrease the grid density then iterate more times over the optimiser then. Of course one can work with X steps in one dimension and Y steps in the other dimension if a speed gain is envisaged. Everything is possible.

Pass or fail!
ElMaestro

Complete thread:

UA Flag
Activity
 Admin contact
23,424 posts in 4,927 threads, 1,677 registered users;
33 visitors (0 registered, 33 guests [including 8 identified bots]).
Forum time: 16:26 CEST (Europe/Vienna)

Complex, statistically improbable things are by their nature
more difficult to explain than
simple, statistically probable things.    Richard Dawkins

The Bioequivalence and Bioavailability Forum is hosted by
BEBAC Ing. Helmut Schütz
HTML5