tag:blogger.com,1999:blog-4757118446768919900.post6518841944649554341..comments2018-05-19T02:58:13.795-07:00Comments on Retro Programming: Plotting the Mandelbrot Set on the ZX SpectrumJohn Metcalfhttp://www.blogger.com/profile/09108374348083307900noreply@blogger.comBlogger2125tag:blogger.com,1999:blog-4757118446768919900.post-71803571879105268192018-02-27T03:41:04.552-08:002018-02-27T03:41:04.552-08:00You can speed it up considerably by not using mult...You can speed it up considerably by not using multiplications at all, since you're just suqaring anyway. Squares can be determined from a lookup table, which, in case of the kind of 16-bit arithmetics that you use takes up 32 kilobytes and can be generated in a blink of an eye.<br /><br />Thus:<br />rₙ₊₁ = x + (rₙ)² - (iₙ)²<br />iₙ₊₁ = y + (rₙ + iₙ)² - [(rₙ)² + (iₙ)²]<br /><br />That makes a total of 3 lookups. Moreover, if you calculate the Euclidean norm [(rₙ)² + (iₙ)²] first, it can be used to abort the iteration if it grows beyond 4.Daniel Nagyhttps://www.blogger.com/profile/00975555602783595811noreply@blogger.comtag:blogger.com,1999:blog-4757118446768919900.post-43692962672442951742014-03-23T00:19:48.326-07:002014-03-23T00:19:48.326-07:00It looks as though you've adapted Gauss's ...It looks as though you've adapted Gauss's complex multiplication algorithm (see https://en.wikipedia.org/wiki/Multiplication_algorithm#Gauss.27s_complex_multiplication_algorithm) to your need for squaring followed by adding, then streamlined it. But that wikipedia article states "This algorithm uses only three multiplications, rather than four, and five additions or subtractions rather than two. If a multiply is more expensive than three adds or subtracts, as when calculating by hand, then there is a gain in speed. On modern computers a multiply and an add can take about the same time so there may be no speed gain." If there is a gain, you could gain even more by replacing that multiplication by 2 with a doubling by addition (I haven't looked at your code, maybe you already did).<br /><br />It also looks as though your test for unbounded divergence is based on the result that "... if the absolute value of P_c^n(0) ever becomes larger than 2, the sequence will escape to infinity" (see https://en.wikipedia.org/wiki/Mandelbrot_set#Basic_properties), with you simply testing for your simpler norm at a value that always lies outside the cartesian norm of 2 (since anything passing your test has met the requirements of the result, and anything that diverges unboundedly must necessarily get past your norm's boundary at some point). You could possibly simplify your test further by substituting a slightly larger but rational (better still, dyadic rational, i.e. with finitely many non-zero binary places) test criterion not involving the square root of 2 (again, maybe you already did).P.M.Lawrencehttp://users.beagle.com.au/peterlnoreply@blogger.com