Hey Guys and Gals ^^
I'm having trouble with Julia. Maybe one of you can help me out
The program i am writing requires the linear-equation-system-solver(command
"\") in the folder "Julia-0.4.5\share\julia\base\linalg".
Now my problem is that i need the equation solved strictly on integers, an
a
ers of magnitude more computationally intensive than even precise
> approximations. If you need something which is really precise, try
> BigFloats or Decimals.jl.
>
> On Friday, July 15, 2016 at 11:50:01 AM UTC-7, Kurolong wrote:
>>
>> Hey Guys and Gals ^^
>> I'
The thing is, i did not write that i need an exact integer solution because
i don't like approximation, but because i am working in N^n and rounding
can cause catastrophically false results. The matrices i am working on are,
however, not all that big (i would guess absolute max 30x100, usually m
Unfortunately, switching to Rational{BigInt} did not help. same error :(
Turns out that it actually did fix the error, but i was too tired and
confused things.
BUT the components of the fractions were a lot too large.
A Gauß-algorithm should have returned very managable fractions, not
fractions of 300-decimal-place-numbers by 300-decimal-place-numbers.
I suspect this
But Julia cannot calculate the Moore-Penrose-Inverse for the Rational Type
:(
Well, firstly, with matrices, the increase should be distributed among
entries.
secondly, i was talking about running my above example in BigInt.
A 2x3 matrix should most definitely not produce fractions like that.
Thirdly, the system has the solution [0.8,-2.0,0.4].
This is not what the function
Thank you, this was very helpful.
Just a small question: Are the UpperTriangular and LowerTriangular commands
actually necessary in some case?
The other question i have is what A_div_B! actually does in this case, but
i have a feeling that this is hard to explain.
Ah right, so what you are doing is just solving successively for L and U.
Okay, all questions answered.
Thank you^^
