Logo by AGUS - Contribute your own Logo!

END OF AN ERA, FRACTALFORUMS.COM IS CONTINUED ON FRACTALFORUMS.ORG

it was a great time but no longer maintainable by c.Kleinhuis contact him for any data retrieval,
thanks and see you perhaps in 10 years again

this forum will stay online for reference
News: Visit us on facebook
 
*
Welcome, Guest. Please login or register. August 16, 2018, 02:40:32 AM


Login with username, password and session length


The All New FractalForums is now in Public Beta Testing! Visit FractalForums.org and check it out!


Pages: 1 ... 22 23 [24]   Go Down
  Print  
Share this topic on DiggShare this topic on FacebookShare this topic on GoogleShare this topic on RedditShare this topic on StumbleUponShare this topic on Twitter
Author Topic: *Continued* SuperFractalThing: Arbitrary precision mandelbrot set rendering in Java.  (Read 16738 times)
0 Members and 1 Guest are viewing this topic.
therror
Explorer
****
Posts: 42


« Reply #345 on: September 23, 2017, 09:10:09 AM »

Hi! How to find coefficients A[k] for Multibrot arbitrary integer power? Does exist generalization of formula in http://mathr.co.uk/blog/2016-03-06_simpler_series_approximation.html ? Thanks )
Logged
claude
Fractal Bachius
*
Posts: 563



WWW
« Reply #346 on: September 24, 2017, 07:29:36 PM »

Hi! How to find coefficients A[k] for Multibrot arbitrary integer power? Does exist generalization of formula in http://mathr.co.uk/blog/2016-03-06_simpler_series_approximation.html ? Thanks )

I asked on M.SE, which shows how to get the equations for the A[k], just not in an explicit recursion (you have to expand the power series and collect terms):
https://math.stackexchange.com/questions/2443377/closed-form-for-these-power-series-coefficients
The equations for the A[k] coefficients are defined implicitly, don't know an explicit closed form solution.  The implicit form may be enough, depending what you need to do.
Logged
claude
Fractal Bachius
*
Posts: 563



WWW
« Reply #347 on: September 28, 2017, 10:20:19 PM »

I answered my own M.SE question, with Maxima source code that can be used (with only a little extra manual work) to get the explicit recursion formula for a specific P.

The problem for arbitrary P is that (in code terms) you'd need nested loops to a depth of P-1, and most programming languages don't let you do that easily.
Logged
Pages: 1 ... 22 23 [24]   Go Down
  Print  
 
Jump to:  

Related Topics
Subject Started by Replies Views Last post
Java applet for exploring the Mandelbrot set Announcements & News Paton 5 3032 Last post March 26, 2007, 06:03:34 PM
by Paton
What range/precision for fractional escape counts for Mandelbrot/Julia sets? Programming Duncan C 7 3567 Last post May 01, 2007, 08:23:13 PM
by Duncan C
Java Mandelbrot segment Help & Support fractalwizz 10 1264 Last post December 29, 2008, 08:01:24 PM
by cKleinhuis
[Java] Double-double library for 128-bit precision. Programming Zom-B 10 10959 Last post December 20, 2010, 04:03:48 AM
by David Makin
SuperFractalThing: Arbitrary precision mandelbrot set rendering in Java. Announcements & News « 1 2 ... 16 17 » mrflay 252 59146 Last post August 17, 2016, 11:59:31 PM
by cKleinhuis

Powered by MySQL Powered by PHP Powered by SMF 1.1.21 | SMF © 2015, Simple Machines

Valid XHTML 1.0! Valid CSS! Dilber MC Theme by HarzeM
Page created in 0.139 seconds with 28 queries. (Pretty URLs adds 0.012s, 2q)