How does a numerical method test for linearity (or in general order of
nonlinearity) of an operator? By comparing function value with the
first two Taylor terms, within machine precision?
I suspect only code analysis ("reification", as in analysis of the
expression syntax tree) would be feasible and reliable for general
problems.

Reply via email to