Timeline for Efficient computation of arctan with square roots?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 18 at 16:57 | comment | added | Logan R. Kearsley | @hardmath The summation is indeed amenable to updating; there's only one square and one addition per coordinate. | |
| Aug 18 at 15:01 | comment | added | hardmath♦ | Indeed the summing of the $n$ components to get $x$ for $\arctan(\sqrt x)$ could be a dominating aspect for large enough $n$. The summation might be susceptible to optimization by "updating". There's not enough detail in the Question's body to discuss that idea. More notation would be welcome (use $\LaTeX$ for typeset mathematics). | |
| Aug 16 at 4:12 | comment | added | njuffa |
I am not convinced the arctangent computation has a material impact on overall performance. To get an idea of how much this computation would benefit from use of a fast atan2() implementation, you could try the fast, low-precision, algorithm from a previous answer of mine.
|
|
| Aug 16 at 3:48 | comment | added | njuffa |
Does this require atan() or atan2()? I suspect it is the latter, but it would be beneficial to clarify this in the question.
|
|
| Aug 16 at 2:04 | answer | added | Oscar Smith | timeline score: 2 | |
| S Aug 15 at 20:27 | review | First questions | |||
| Aug 18 at 14:57 | |||||
| S Aug 15 at 20:27 | history | asked | Logan R. Kearsley | CC BY-SA 4.0 |