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]

Authors

Daniel S. Graça

This author has not been identified. Look up 'Daniel S. Graça' in Google

Ning Zhong

This author has not been identified. Look up 'Ning Zhong' in Google

H. S. Dumas

This author has not been identified. Look up 'H. S. Dumas' in Google