The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited

Daniel S. Graça, Ning Zhong, H. S. Dumas. The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited. Theoretical Computer Science, 457:101-110, 2012. [doi]

@article{GracaZD12,
  title = {The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited},
  author = {Daniel S. Graça and Ning Zhong and H. S. Dumas},
  year = {2012},
  doi = {10.1016/j.tcs.2012.07.013},
  url = {http://dx.doi.org/10.1016/j.tcs.2012.07.013},
  researchr = {https://researchr.org/publication/GracaZD12},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {457},
  pages = {101-110},
}