Prev Next Index-> contents reference index search external Up-> CppAD Appendix compare_c repeat_det_by_minor_c CppAD-> Install Introduction AD ADFun preprocessor multi_thread utility ipopt_solve Example speed Appendix Appendix-> Faq directory Theory glossary Bib wish_list whats_new deprecated compare_c numeric_ad addon License compare_c-> det_of_minor_c det_by_minor_c uniform_01_c correct_det_by_minor_c repeat_det_by_minor_c elapsed_seconds_c time_det_by_minor_c main_compare_c repeat_det_by_minor_c Headings-> Syntax repeat size Source Code

$\newcommand{\W}[1]{ \; #1 \; } \newcommand{\R}[1]{ {\rm #1} } \newcommand{\B}[1]{ {\bf #1} } \newcommand{\D}[2]{ \frac{\partial #1}{\partial #2} } \newcommand{\DD}[3]{ \frac{\partial^2 #1}{\partial #2 \partial #3} } \newcommand{\Dpow}[2]{ \frac{\partial^{#1}}{\partial {#2}^{#1}} } \newcommand{\dpow}[2]{ \frac{ {\rm d}^{#1}}{{\rm d}\, {#2}^{#1}} }$
Repeat det_by_minor Routine A Specified Number of Times

Syntax
repeat_det_by_minor(repeat, size)

repeat
The argument has prototype       size_t repeat  It specifies the number of times to repeat the calculation.

size
The argument has prototype       size_t size  It specifies the number of rows (and columns) in the square matrix we are computing the determinant of.

Source Code
void repeat_det_by_minor(size_t repeat, size_t size)
{     double *a;
a = (double*) malloc( (size * size) * sizeof(double) );

while(repeat--)
{     uniform_01(size * size, a);
det_by_minor(a, size);
}

free(a);
return;
}

Input File: test_more/compare_c/det_by_minor.c