Abstract The k-vector search technique is a method designed to perform extremely fast range searching of large databases at computational cost independent of the size of the database. k-vector search algorithms have historically found application in satellite star-tracker navigation systems which index very large star catalogues repeatedly in the process of attitude estimation. Recently, the k-vector search algorithm has been applied to numerous other problem areas including non-uniform random variate sampling, interpolation of 1-D or 2-D tables, nonlinear function inversion, and solution of systems of nonlinear equations. This paper presents algorithms in which the k-vector search technique is used to solve each of these problems in a computationally-efficient manner. In instances where these tasks must be performed repeatedly on a static (or nearly-static) data set, the proposed k-vector-based algorithms offer an extremely fast solution technique that outperforms standard methods.
A k-Vector Approach to Sampling, Interpolation, and Approximation
The Journal of the Astronautical Sciences ; 60 , 3-4
2013
Aufsatz (Zeitschrift)
Englisch
A k-Vector Approach to Sampling, Interpolation, and Approximation
Springer Verlag | 2013
|A K-Vector Approach to Sampling, Interpolation, and Approximation (AAS 12-624)
British Library Conference Proceedings | 2013
|An interpolation formula for approximation spaces
British Library Conference Proceedings | 1992
|The Interpolation Property of Fuzzy Polynomial Approximation
British Library Conference Proceedings | 1994
|Image interpolation using interpolative classified vector quantization
British Library Online Contents | 2008
|