The following lines of code appear in levenberg-marquardt algorithm in the optimization package "Optim": DtD = diagm(Float64[max(x, MIN_DIAGONAL) for x in sum(J.^2,1)]) delta_x = ( J'*J + sqrt(lambda)*DtD ) \ -J'*fcur However, my questions has nothing to do with the algorithm or anything specific to the package. I guess it...

So my professor has us writing a program that fines the prime facotrization of a number given by the user. And provide the answer in exponents. So if your number was 96, I have the program listing out like this 2 x 2 x 2 x 2 x 3. He...

For example, consider the number 96. It can be written in following ways: 1. 96 2. 48 * 2 3. 24 * 2 * 2 4. 12 * 2 * 2 * 2 5. 6 * 2 * 2 * 2 * 2 6. 3 * 2 * 2 *...

I have been trying to solve this problem. http://www.spoj.com/problems/DIV/ for calcuating interger factors, I tried two ways first: normal sqrt(i) iteration. int divCount = 2; for (int j = 2; j * j <= i ; ++j) { if( i % j == 0) { if( i / j ==...

im trying to make LU factorization on n x n(getting n from scanf) matrix HEAP CORRUPTION causes when i try to make n x n matrix and put numbers in :/ i dont know where to fix as i am using malloc for the first time #include <stdio.h> #include <stdlib.h>...