Nonlinear Function Inversion using k-vector
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 reserved pith:HVDNSQARrecord.jsonopen to challenge →
read the original abstract
This work introduces a general numerical technique to invert one dimensional analytic or tabulated nonlinear functions in assigned ranges of interest. The proposed approach is based on an optimal version of the k-vector range searching, an ad-hoc modification devised for function inversion. The optimality consists of retrieving always the same number of data ($1,2,\dots$) for a specified searching range to initiate the root solver. This provides flexibility to adapt the technique to a variety of root solvers (e.g., bisection, Newton, etc.), using a specified number of starting points. The proposed method allows to build an inverse function toolbox for a set of specified nonlinear functions. In particular, the method is suitable when intensive inversions of the same function are required. The inversion is extremely fast (almost instantaneous), but it requires a one-time preprocessing effort.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.