You are missing trading opportunities:
- Free trading apps
- Over 8,000 signals for copying
- Economic news for exploring financial markets
Registration
Log in
You agree to website policy and terms of use
If you do not have an account, please register
5-ю. And why make a smartass out of yourself with all sorts of "open systems", "closed systems", "composite terms", "vectors", "matrices" when everything is explained in 5th grade concepts? In the 5th grade they study systems of linear equations.
Right, right... ;)))))))))))) bragging about your illiteracy -- what else can you do...
Yeah, yeah, yeah... ;)))))))))))) you're bragging about your illiteracy -- what else can you do...
Well, there's always an option - you can get your hands on calculus and pretend to be smart by showing graphs and formulas from it.
Well, there is always an option - you can get hold of calculus and pretend to be smart, demonstrating graphs and formulas from it.
Get a mathcaddy - how much cleverness can you show?
Hi Yusuf and the sittings! 😊
Here's your infamous a0 (aka C0)
White noise is white noise in Africa
I have a feeling that you gave birth to SLAU of 5 equations for years. And you've been dubbing it with a halo of mega-scientific sensation and delusions of grandeur. And that's 7th grade high school maths.
But my tiny SLAU() function easily solves SLAU of 50 equations and I made it and debugged it in less than 1 day. I don't know which way I solved SLAU, because I'm always too lazy to study existing methods, it's easier to invent my own. Most likely my way is not optimal and of course I haven't invented anything new, I'm not strong in theory. But it's the most compact method I've ever seen.
Bravo, you have surpassed Gauss and Kramer:
Consider the linear dependence of the exponent Y on a set of variables x:
To estimate the coefficients of the equation we apply Gauss's method of least squares and obtain the following system of k linear equations with at least n ≥ k+1 groups of actual data Y depending on the values of the variables x:
In general, this system of equations is solved by Gauss (1777- 1855) method of successive elimination of variables or by using the properties of matrices, known as Cramer's method (1704-1752).
Computational complexity
The method of Gauss is a classical method for solvingsystems of linear algebraic equations(SLAE). This is a method of sequential elimination ofvariables, when using the elementary transformation of a system of equations is reduced to an equivalent system of a stepped (or triangular) form, from which consistently, starting with the last (by number) of variables, are all the remaining variables.
The algorithm of solution ofSLAE by Gauss method is divided into two stages.
Cramer's methodrequires computation ofdeterminants of appropriate dimension. When usingthe Gaussian methodto compute the determinants, the method has a time complexity of order4, which is worse than ifthe Gaussian methodwere directly used to solve a system of equations.
he already said above - the system doesn't chop and further arguments are irrelevant...
he already said above - the system doesn't chop and further arguments are irrelevant...
Renat, I never said that. I said that I wouldn't judge until I'd tested everything on a real account. I'm waiting for the advisor to be transferred from MKL5 code to 4.
Too bad...
It's too early to tell.
It's too early to tell.