Iterations of the Quadratic Map

This website (link to bookmark: contains software and data relatd to two papers:

Files for download related to the paper [1]:

Files for download related to the paper [2] (see note below on the data contained in the archive files):

In most cases, instead of providing the complete ".log" files produced by the program, ".csv" files containing only the data used for the graphs are provided, extracted from the ".log" files, and the original ".log" files without the raw data are provided as ".txt" files. Additionally, ".res" files are available that contain the information on the resources used in each case, measured by David MacKenzie's time program (a timing program available in most Linux systems) on a Debian Linux 10.8 system with the Intel® Core™2 Duo Processor E8400 running at 3 GHz.

Description of the CSV files. Each CSV file name contains a capital letter indicating the type of data:

Each line of each CSV file contains numbers regarding specific computed intervals:


An interface is provided to running the program introduced in the paper [1]. Since some computations can be very lengthy and memory-consuming, there are some limits set up on what one can do using this interface. Please, download and compile the program to run it at your computer in order to use full capabilities of the software.

Please, fill out the form with desired values of parameters, and click the RUN button to see the result under the form. Then you are welcome to adjust some parameters, and run the computation again.
Please, note that in the short version of the form, there are only a few selected parameters shown below (thus the numbering is not contiguous). Click the button below to toggle between the short list and the long one.

1. The left endpoint of the parameter interval (obligatory argument)  ‑l (min 1) (max 2)
2. The right endpoint of the parameter interval (obligatory argument)  ‑r (min 1) (max 2)
4. The radius of the critical neighborhood, a.k.a. delta (0.001)  ‑d
14. The maximal running time after which the program is stopped, in seconds  ‑t (min 1) (max 20)
16. The required minimal number of iterates to count as an 'escape'  ‑rN
17. The required minimal image width to count as an 'escape'  ‑rW

[After you hit the RUN button to run the program, the results of the computation will be displayed here after the computation has been completed.]