In parametric equations—stochastic equations are a special case—one may want to approximate the solution such that it is easy to evaluate its dependence of the parameters. Interpolation in the parameters is an obvious possibility, in this context often labeled as a collocation method. In the frequent situation where one has a “solver” for the equation for a given parameter value—this may be a s...

For real time applications, simple linear or cubic interpolation and FCBI (Fast Curvature Based Interpolation) algorithms are applied for the task of enlargement of images without changing super resolution (low resolution and high resolution), but the results obtained are not really satisfactory, being affected by relevant artifacts like blurring and jaggies. In this paper we describe a new met...

Algorithms based on Pythagorean hodographs (PH) both in Euclidean plane and Minkowski space share common goals, the main one being rationality of offsets of planar domains. However, only separate interpolation techniques based on these curves can be found in the literature. It was recently revealed that rational PH curves in Euclidean plane and Minkowski space are very closely related. In this ...

In sharp contrast to classical proof complexity we are currently short of lower bound techniques for QBF proof systems. In this paper we establish the feasible interpolation technique for all resolution-based QBF systems, whether modelling CDCL or expansion-based solving. This both provides the first general lower bound method for QBF proof systems as well as largely extends the scope of classi...