Computer-assisted proofs of localized patterns and branches of periodic solutions in the 2D Gray-Scott system of PDEs.
Table of contents:
- Introduction
- The Gray-Scott system of equations
- Utilisation and References
- License and Citation
- Contact
This Julia code is a complement to the article
[[1]](To appear) : "The 2D Gray-Scott model: constructive proofs of existence of stationary localized patterns", M. Cadiot and D. Blanco, [ArXiv Link](To appear).
It provides the necessary rigorous computations of the bounds presented along the paper. The computations are performed using the package IntervalArithmetic. The mathematical objects (spaces, sequences, operators,...) are built using the package RadiiPolynomial in combination with the add on D4Fourier. Detailed instructions are available in the code to help the user run it.
The Gray-Scott system of equations
In the case
In Section 4.4 in [[1]](To appear), we prove that, under the condition (79) in Theorem 4.11, localized patterns can be proven to be the limit of a branch of (spatially) periodic solutions as the period tends to infinity for the Gray-Scott system of equations. In particular this condition involves the explicit computation of multiple bounds, which is achieved in the present code. Moreover, we verify that condition (79) is verified for three different localized patterns and we obtain a constructive proof of existence of a branch of periodic solutions limiting the localized pattern. By using D4Fourier, we obtain proofs of the
We provide as well candidate solutions for the proofs, which are given in the files U0_spikeaway.jld2, U0_ring.jld2, and U0_leaf.jld2. These correspond to the sequence
Given these approximate solution, LocalizedPatternsGS.jl provides the explicit computation of the bounds in Lemmas 4.3, 4.5, and 4.6. It also provides a value for
Then, the code LocalizedPatternsReducedGS.jl provides the same results for the scalar case. In particular, it computes the bounds in Lemmas 5.3, 5.4, and 5.5. It also provides a value for
The codes in LocalizedPatternsGS.jl and LocalizedPatternsReducedGS.jl can serve to prove other patterns than the one provided as illustration should one have the numerical candidates and they possess
The code is build using the following packages :
This code is available as open source under the terms of the MIT License.
If you wish to use this code in your publication, research, teaching, or other activities, please cite it using the following BibTeX template:
@software{LocalizedPatternSH.jl,
author = {Matthieu Cadiot and Dominic Blanco},
title = {LocalizedPatternsGS.jl},
url = {https://github.com/dominicblanco/LocalizedPatternsGS.jl},
note = {\url{ https://github.com/dominicblanco/LocalizedPatternsGS.jl},
year = {2024},
doi = {10.5281/zenodo.10967034}
}
DOI : 10.5281/zenodo.10967034
You can contact us at :
matthieu.cadiot@mail.mcgill.ca dominic.blanco@mail.mcgill.ca