Abstract
Several results on instability in nonhomogeneous architectures able to generate Turing patterns are presented. The approach makes use of the continuity theorem regarding the dependence of polynomial roots on coefficients and of the root-locus techniques for small, and large parameter deviations from their homogeneous values, respectively. The results are valid for any linearized nonhomogeneous discrete model capable of generating Turing patterns.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have