scholarly journals An Algorithm for Fast Multiplication of Kaluza Numbers

2021 ◽  
Vol 11 (17) ◽  
pp. 8203
Author(s):  
Aleksandr Cariow ◽  
Galina Cariowa ◽  
Janusz P. Paplinski
Keyword(s):  
Computational Complexity ◽  
Effective Algorithm ◽  
Real Numbers ◽  
Fast Multiplication ◽  
Interesting Solution

This paper presents a new algorithm for multiplying two Kaluza numbers. Performing this operation directly requires 1024 real multiplications and 992 real additions. We presented in a previous paper an effective algorithm that can compute the same result with only 512 real multiplications and 576 real additions. More effective solutions have not yet been proposed. Nevertheless, it turned out that an even more interesting solution could be found that would further reduce the computational complexity of this operation. In this article, we propose a new algorithm that allows one to calculate the product of two Kaluza numbers using only 192 multiplications and 384 additions of real numbers.

Inverse Kinematic Solution of Robot Manipulators Using Interval Analysis

1998 ◽  
Vol 120 (1) ◽  
pp. 147-150 ◽  
Author(s):  
R. S. Rao ◽  
A. Asaithambi ◽  
S. K. Agrawal
Keyword(s):  
Computational Complexity ◽  
Numerical Algorithm ◽  
Interval Analysis ◽  
Inverse Kinematics ◽  
Inverse Kinematic ◽  
Real Numbers ◽  
Computational Mathematics ◽  
All Solutions ◽  
Inverse Kinematics Problem ◽  
Kinematic Solution

Interval analysis is a growing branch of computational mathematics where operations are carried out on intervals instead of real numbers. This paper presents the first application of this method to robotic mechanisms for the solution of inverse kinematics. As shown in this paper, it is possible to potentially compute all solutions of the inverse kinematics problem using this method. This paper describes the preliminaries of interval analysis, the numerical algorithm, the computational complexity, and illustrations with examples.

scholarly journals Liveness characteristic analysis of a class of Petri nets

2018 ◽  
Vol 10 (6) ◽  
pp. 168781401878148
Author(s):  
Miao Liu ◽  
Zhou He
Keyword(s):  
Computational Complexity ◽  
Petri Nets ◽  
Flexible Manufacturing ◽  
Flexible Manufacturing Systems ◽  
Manufacturing Systems ◽  
Effective Algorithm ◽  
Finite Capacity ◽  
Characteristic Analysis ◽  
Control Actions ◽  
Sequential Processes

Petri nets are an effective tool for analyzing and modeling the dynamic behavior of flexible manufacturing systems. Finite capacity systems of simple sequential processes with resources are an important subclass of Petri nets, for which this article gives a liveness characteristic analysis. First, an effective algorithm for deciding the liveness of finite capacity systems of simple sequential processes with resources is developed by analyzing the relation between the structural properties of resource subnets and the strict minimal siphons. Then, a liveness condition of finite capacity systems of simple sequential processes with resources is accordingly established. Based on the proposed liveness condition, an algorithm for configuring an initial marking for a finite capacity systems of simple sequential processes with resources is given, and therefore, a live finite capacity systems of simple sequential processes with resources net with a configured initial marking can be obtained, which avoids the siphon enumerations and the addition of any control actions. It is shown that the computational complexity of both the developed liveness deciding and the initial marking configuration algorithms is polynomial. Examples are finally provided to illustrate the mentioned results.

Low-Complexity Multiplication Using Complement and Signed-Digit Recoding Methods

2014 ◽  
Vol 619 ◽  
pp. 342-346
Author(s):  
Te Jen Chang ◽  
Ping Sheng Huang ◽  
Shan Jen Cheng ◽  
Ching Yin Chen ◽  
I Hui Pan
Keyword(s):  
Computational Complexity ◽  
Low Complexity ◽  
Fast Multiplication ◽  
Speed Up ◽  
Overall Performance ◽  
Representation Method ◽  
Computing Method

In this paper, a fast multiplication computing method utilizing the complement representation method and canonical recoding technique is proposed. By performing complements and canonical recoding technique, the number of partial products can be reduced. Based on these techniques, we propose algorithm provides an efficient multiplication method. On average, our proposed algorithm to reduce the number of k-bit additions from (0.25k+logk/k+2.5) to (k/6 +logk/k+2.5), where k is the bit-length of the multiplicand A and multiplier B. We can therefore efficiently speed up the overall performance of the multiplication. Moreover, if we use the new proposes to compute common-multiplicand multiplication, the computational complexity can be reduced from (0.5 k+2 logk/k+5) to (k/3+2 logk/k+5) k-bit additions.

scholarly journals An Effective Algorithm for the Synthesis of Irreducible Polynomials over a Galois Fields of Arbitrary Characteristics

2021 ◽  
Vol 20 ◽  
pp. 508-519
Author(s):  
Anatoly Beletsky
Keyword(s):  
Computational Complexity ◽  
High Performance ◽  
Large Degree ◽  
Search Method ◽  
Effective Algorithm ◽  
Irreducible Polynomials ◽  
Computing Systems ◽  
Galois Fields ◽  
Average Performance ◽  
Very High

The known algorithms for synthesizing irreducible polynomials have a significant drawback: their computational complexity, as a rule, exceeds the quadratic one. Moreover, consequently, as a consequence, the construction of large-degree polynomials can be implemented only on computing systems with very high performance. The proposed algorithm is base on the use of so-called fiducial grids (ladders). At each rung of the ladder, simple recurrent modular computations are performers. The purpose of the calculations is to test the irreducibility of polynomials over Galois fields of arbitrary characteristics. The number of testing steps coincides with the degree of the synthesized polynomials. Upon completion of testing, the polynomial is classifieds as either irreducible or composite. If the degree of the synthesized polynomials is small (no more than two dozen), the formation of a set of tested polynomials is carried out using the exhaustive search method. For large values of the degree, the test polynomials are generating by statistical modeling. The developed algorithm allows one to synthesize binary irreducible polynomials up to 2Kbit on personal computers of average performance

scholarly journals Minimum Rank of Matrices Described by a Graph or Pattern over the Rational, Real and Complex Numbers

10.37236/749 ◽  
2008 ◽  
Vol 15 (1) ◽  
Author(s):  
Avi Berman ◽  
Shmuel Friedland ◽  
Leslie Hogben ◽  
Uriel G. Rothblum ◽  
Bryan Shader
Keyword(s):  
Computational Complexity ◽  
Rational Numbers ◽  
Complex Numbers ◽  
Real Numbers ◽  
Minimum Rank ◽  
The Real ◽  
Sign Patterns ◽  
Symmetric Patterns

We use a technique based on matroids to construct two nonzero patterns $Z_1$ and $Z_2$ such that the minimum rank of matrices described by $Z_1$ is less over the complex numbers than over the real numbers, and the minimum rank of matrices described by $Z_2$ is less over the real numbers than over the rational numbers. The latter example provides a counterexample to a conjecture by Arav, Hall, Koyucu, Li and Rao about rational realization of minimum rank of sign patterns. Using $Z_1$ and $Z_2$, we construct symmetric patterns, equivalent to graphs $G_1$ and $G_2$, with the analogous minimum rank properties. We also discuss issues of computational complexity related to minimum rank.

scholarly journals Computational Analysis of Quantitative Characteristics of some Residual Properties of Solvable Baumslag-Solitar Groups

2021 ◽  
Vol 28 (2) ◽  
pp. 136-145
Author(s):  
Elena Alexandrovna Tumanova
Keyword(s):  
Computational Complexity ◽  
Computational Analysis ◽  
Multiplicative Group ◽  
Prime Numbers ◽  
Effective Algorithm ◽  
Residual Properties ◽  
Quantitative Characteristics ◽  
Algebraic Cryptography ◽  
Almost All ◽  
Element Set

Let $G_{k}$ be defined as $G_{k} = \langle a, b;\ a^{-1}ba = b^{k} \rangle$, where $k \ne 0$. It is known that, if $p$ is some prime number, then $G_{k}$ is residually a finite $p$-group if and only if $p \mid k - 1$. It is also known that, if $p$ and $q$ are primes not dividing $k - 1$, $p < q$, and $\pi = \{p,\,q\}$, then $G_{k}$ is residually a finite $\pi$-group if and only if $(k, q) = 1$, $p \mid q - 1$, and the order of $k$ in the multiplicative group of the field $\mathbb{Z}_{q}$ is a $p$\-number. This paper examines the question of the number of two-element sets of prime numbers that satisfy the conditions of the last criterion. More precisely, let $f_{k}(x)$ be the number of sets $\{p,\,q\}$ such that $p < q$, $p \nmid k - 1$, $q \nmid k - 1$, $(k, q) = 1$, $p \mid q - 1$, the order of $k$ modulo $q$ is a $p$\-number, and $p$, $q$ are chosen among the first $x$ primes. We state that, if $2 \leq |k| \leq 10000$ and $1 \leq x \leq 50000$, then, for almost all considered $k$, the function $f_{k}(x)$ can be approximated quite accurately by the function $\alpha_{k}x^{0.85}$, where the coefficient $\alpha_{k}$ is different for each $k$ and $\{\alpha_{k} \mid 2 \leq |k| \leq 10000\} \subseteq (0.28;\,0.31]$. We also investigate the dependence of the value $f_{k}(50000)$ on $k$ and propose an effective algorithm for checking a two-element set of prime numbers for compliance with the conditions of the last criterion. The results obtained may have applications in the theory of computational complexity and algebraic cryptography.

Sign in / Sign up

Export Citation Format

Share Document