Nonlinear function inversion using k-vector

作者:

Highlights:

摘要

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,⋯) 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.

论文关键词:Root finders,Nonlinear functions,Convergence acceleration,Computational efficiency

论文评审过程:Received 23 April 2017, Revised 11 August 2017, Accepted 8 October 2017, Available online 5 November 2017, Version of Record 5 November 2017.

论文官网地址:https://doi.org/10.1016/j.amc.2017.10.009