Bioequivalence and Bioavailability Forum • Benchmark code

Benchmark code [Two-Stage / GS Designs]

posted by Helmut – Vienna, Austria, 2017-08-23 03:48 (2860 d 20:11 ago) – Posting: # 17741
Views: 29,846

Hi ElMaestro,

I changed this part (the number of repetitions should be left to microbench).

 vecCritCVs<<-rep(0,500)

 for (Nps in 6:length(vecCritCVs))

  {

   if (Nps==6) iniCV=min(0.709*GMR-0.552, 0.709/GMR -0.552)

               else iniCV=vecCritCVs[Nps-1]


    vecCritCVs[Nps]<<-FindCritCV.Sec(0.8, GMR, Nps, 1, 1e-9, iniCV)

  }

  n2=GetNps(0.5)

 return(n2)

}



Bench.H1()

I ran just 10,000 cause yours was so slow. Improved over previous versions but still 260times slower than mine. BTW, Zhang’s approximation was spot on. No iterations performed at all (to be expected with a high sample size).

Unit: microseconds

            expr   min    lq  mean  median    uq    max neval

      Bench.H1() 27847 28381 29364 28943.8 29707 139057 10000

 sampleN2.TOST()    65    75   111   111.1   143   1614 10000

❝ Late edit: I believe we can even do something like:

❝ Nps= 2* length(vecCritCVs[vecCritCVs<=CV])

❝ - which is faster still and does not explicitly involve a loop.

Given the results from above I didn’t try that.

—
Dif-tor heh smusma 🖖🏼 Довге життя Україна!
Helmut Schütz

The quality of responses received is directly proportional to the quality of the question asked. 🚮
Science Quotes

Complete thread:

Initial sample size guess for the Potvin methods ElMaestro 2017-08-19 15:04
- Initial sample size guess for the Potvin methods Helmut 2017-08-19 16:06
  - Initial sample size guess for the Potvin methods ElMaestro 2017-08-19 16:14
    - Initial sample size guess for the Potvin methods Helmut 2017-08-19 17:12
      - Initial sample size guess for the Potvin methods ElMaestro 2017-08-19 17:17
        
        Confuse-a-Cat Helmut 2017-08-19 17:33
        
        Confuse-a-Cat ElMaestro 2017-08-19 17:56
    - loop ↔ vectorized ↔ direct Helmut 2017-08-20 14:40
      - loop ↔ vectorized ↔ direct ElMaestro 2017-08-20 15:22
        
        loop ↔ vectorized ↔ direct Helmut 2017-08-20 16:23
        
        loop ↔ vectorized ↔ direct ElMaestro 2017-08-20 17:22
- The n ext crackpot iteration ElMaestro 2017-08-19 20:04
  - The n ext crackpot iteration Helmut 2017-08-20 02:20
- The ultimate crackpot iteration! ElMaestro 2017-08-20 14:35
  - The ultimate crackpot iteration! Helmut 2017-08-20 15:11
    - The ultimate crackpot iteration! ElMaestro 2017-08-20 15:28
      - The ultimate crackpot iteration! Helmut 2017-08-20 16:06
        
        The ultimate crackpot iteration! ElMaestro 2017-08-20 16:15
        
        The ultimate crackpot iteration! Helmut 2017-08-20 18:58
        
        The ultimate crackpot iteration! ElMaestro 2017-08-20 19:32
        
        Suggested code ElMaestro 2017-08-21 18:13
        
        Nitpicker! Helmut 2017-08-22 13:33
        
        Nitpicker! ElMaestro 2017-08-22 17:27
        
        Nitpicker! Helmut 2017-08-22 17:49
        
        Nitpicker! ElMaestro 2017-08-22 17:59
        
        Nitpicker! Helmut 2017-08-22 19:15
        
        Benchmark code ElMaestro 2017-08-22 22:29
        
        Benchmark codeHelmut 2017-08-23 01:48