Talk:Continued fraction/Arithmetic/G(matrix ng, continued fraction n): Difference between revisions
Talk:Continued fraction/Arithmetic/G(matrix ng, continued fraction n) (view source)
Revision as of 14:00, 7 November 2020
, 3 years agoThundergnat moved page Talk:Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N) to Talk:Continued fraction/Arithmetic/G(matrix ng, continued fraction n): Follow normal task title capitalization policy
(c++ version calculates cf for <math>\frac{1 + \frac{1}{\sqrt{2}}}{2}</math>) |
Thundergnat (talk | contribs) m (Thundergnat moved page Talk:Continued fraction/Arithmetic/G(matrix NG, Contined Fraction N) to Talk:Continued fraction/Arithmetic/G(matrix ng, continued fraction n): Follow normal task title capitalization policy) |
||
| (2 intermediate revisions by one other user not shown) | |||
Line 25:
* The task description uses the notation "+ 1/2" which apparently corresponds to an "NG matrix" with a1=2, a=1, b1=0, b=2 and the notation "divided by 4" which apparently corresponds to an "NG matrix" with a1=1, a=0, b1=0, b=4. There is probably a good reason for this, but that should also be documented. Some implementations also use other "NG Matrices" but why?
* It's not at all clear how we would compute an arithmetic geometric mean in this task. We would need to be able to compute the square root of an arbitrary value, but most square root algorithms (including continued fraction expansion) would require we be able to multiply two continued fractions if we are to compute the square root of a number represented as a continued fraction. The best we can do here is find a fixed precision rational value for use in an NG4 matrix and combine that with a continued fraction. But if we are going to do that, we might as well stick with rational approximations for the entire algorithm.
Anyways... this draft has potential, but it also needs some work. --[[User:Rdm|Rdm]] ([[User talk:Rdm|talk]]) 10:25, 9 July 2015 (UTC)
| |||