Optimization and software-numerical implementation of miller's algorithm on a four-frequency model of solid vibration movement

On the basis of a programmed-numerical approach, new values of the coefficients in the Miller orientation algorithm are obtained. For this, an analytical reference model of the angular motion of a rigid body was applied in the form of a four-frequency representation of the orientation quaternion.The numerical implementation of the reference model for a given set of frequencies is presented in the form of constructed trajectories in the configuration space of orientation parameters. A software-numerical implementation of Miller's algorithm is carried out for different values of the coefficients and the values of the coefficients are obtained, which optimize the error of the accumulated drift. It is shown that for the presented reference model of angular motion, Miller's algorithm with a new set of coefficients provides a lower computational drift error compared to with the classic Miller algorithm and the Ignagni modification, which are optimized for conical motion.

MATLAB GUI for computing Bessel functions using continued fractions algorithm

Higher order Bessel functions are prevalent in physics and engineering and there exist different methods to evaluate them quickly and efficiently. Two of these methods are Miller's algorithm and the continued fractions algorithm. Miller's algorithm uses arbitrary starting values and normalization constants to evaluate Bessel functions. The continued fractions algorithm directly computes each value, keeping the error as small as possible. Both methods respect the stability of the Bessel function recurrence relations. Here we outline both methods and explain why the continued fractions algorithm is more efficient. The goal of this paper is both (1) to introduce the continued fractions algorithm to physics and engineering students and (2) to present a MATLAB GUI (Graphic User Interface) where this method has been used for computing the Semi-integer Bessel Functions and their zeros.

Isotopy of latin squares in cryptography

ABSTRACT We present a new algorithm for a decision problem if two Latin squares are isotopic. Our modification has the same complexity as Miller’s algorithm, but in many practical situations is much faster. Based on our results we study also a zero-knowledge protocol suggested in [3]. From our results it follows that there are some problems in practical application of this protocol.