Search Results (13)

Reliable multivariable control is critical for industrial sectors where processes exhibit severe nonlinearities and interactions. A Continuous Stirred Tank Reactor (CSTR) is a rigorous benchmark for testing control strategies addressing these complexities. This work first establishes a linear MIMO mathematical framework to define the specific structure of such interactive systems. Analysis via phase planes and steady-state analysis reveals low controllability, bistability, and strong coupling, leading to the collapse of traditional decoupled control schemes. To address these issues via multivariable control, we propose a centralized MIMO RST control structure synthesized via a Matrix Fraction Description (MFD) and the extended Bézout equation. Simulations for performance evaluation and comparison highlight the following key findings: (1) the centralized RST maintains stability and tracking precision in regions where decentralized RST loops fail; (2) it exhibits performance comparable to the Augmented State Pole Placement with Integral Action (ASPPIA) method and outperforms the standard Model-Based Predictive Control (MPC) baseline, particularly during critical equilibrium point transitions; and (3) it offers a robust yet computationally simple design that provides superior flexibility for pole placement, accommodating future identification-based models and adaptive tuning. These results validate our algebraic synthesis as a robust, computationally efficient solution for managing highly interactive nonlinear dynamics. Full article

In this paper, the robustness of a system with sundry disturbed open loop dynamics is investigated by employing robust right coprime factorization (RRCF). These sundry disturbed open loop dynamics are present not only in the feed forward path, but also within the feedback loop. In such a control framework, the nominal plant is firstly right coprime factorized and a feed forward and a feedback controllers are designed based on Bezout identity to ensure the overall stability. Subsequently, considering the sundry disturbed open loop dynamics, a new condition formulated as a disturbed Bezout identity is put forward to achieve the closed loop stability of the system, even in the presence of disturbances existing in sundry open loops, where in the feedback loop a disturbed identity operator is defined. This approach guarantees the system robustness if a specific inequality condition is satisfied. And, it should be noted that the proposed approach is applicable to both linear and nonlinear systems with sundry disturbed open loop dynamics. Simulations demonstrate the effectiveness of our methodology. Full article

In this paper, we introduce secure groups as a cryptographic scheme representing finite groups together with a range of operations, including the group operation, inversion, random sampling, and encoding/decoding maps. We construct secure groups from oblivious group representations combined with cryptographic protocols, implementing the operations securely. We present both generic and specific constructions, in the latter case specifically for number-theoretic groups commonly used in cryptography. These include Schnorr groups (with quadratic residues as a special case), Weierstrass and Edwards elliptic curve groups, and class groups of imaginary quadratic number fields. For concreteness, we develop our protocols in the setting of secure multiparty computation based on Shamir secret sharing over a finite field, abstracted away by formulating our solutions in terms of an arithmetic black box for secure finite field arithmetic or for secure integer arithmetic. Secure finite field arithmetic suffices for many groups, including Schnorr groups and elliptic curve groups. For class groups, we need secure integer arithmetic to implement Shanks’ classical algorithms for the composition of binary quadratic forms, which we will combine with our adaptation of a particular form reduction algorithm due to Agarwal and Frandsen. As a main result of independent interest, we also present an efficient protocol for the secure computation of the extended greatest common divisor. The protocol is based on Bernstein and Yang’s constant-time 2-adic algorithm, which we adapt to work purely over the integers. This yields a much better approach for multiparty computation but raises a new concern about the growth of the Bézout coefficients. By a careful analysis, we are able to prove that the Bézout coefficients in our protocol will never exceed $3max(a,b)$ in absolute value for inputs a and b. We have integrated secure groups in the Python package MPyC and have implemented threshold ElGamal and threshold DSA in terms of secure groups. We also mention how our results support verifiable multiparty computation, allowing parties to jointly create a publicly verifiable proof of correctness for the results accompanying the results of a secure computation. Full article

The interplays between topology and algebraic geometry present a set of interesting properties. In this paper, we comprehensively revisit the Bézout theorem in terms of topology, and we present a topological proof of the theorem considering n-dimensional space. We show the role of topology in understanding the complete and finite intersections of algebraic curves within a topological space. Moreover, we introduce the concept of symmetrically complex translations of roots in a zero-set of a real algebraic curve, which is called a fundamental polynomial, and we show that the resulting complex algebraic curve is additively decomposable into multiple components with varying degrees in a sequence. Interestingly, the symmetrically complex translations of roots in a zero-set of a fundamental polynomial result in the formation of isomorphic topological manifolds if one of the complex translations is kept fixed, and it induces repeated real roots in the fundamental polynomial as a component. A set of numerically simulated examples is included in the paper to illustrate the resulting manifold structures and the associated properties. Full article

The forward kinematics in parallel manipulators is a mathematically challenging issue, unlike serial manipulators. Kinematic constraint equations are non-linear transcendental equations that can be reduced to algebraic equations with appropriate transformations. For this reason, sophisticated and time-consuming methods such as the Bezout method, the Groebner bases method, and the like, are used. In this paper, we demonstrate that these equations can be solved by non-complicated mathematical methods for some special types of manipulators such as the 3-3 and 6-3 types of Stewart platforms, and the 3-RRR planar parallel manipulator. Our first method is an analytical approach that exploits the special structure of kinematic constraint equations and yields polynomials of 32nd and 16th order, as mentioned in the previous works. In the second method, an error function is defined. This error function is employed to find the most appropriate initial values for the non-linear equation solver which is used for solving kinematic constraint equations. Determining the initial values in this manner saves computation time and guarantees fast convergence to real solutions. Full article

This paper proposes an efficient exact dimensional synthesis method for finding all the link lengths of the Watt II and Stephenson III six-bar slider-crank function generators, satisfying nine prescribed precision points using the homotopy continuation method. The synthesis equations of each mechanism are initially constructed as a system of 56 quadratic polynomials whose Bézout number, which represents the maximum number of solutions, is 2⁵⁶ ≅ 7.21 × 10¹⁶. In order to reduce the size of the system, multi-homogeneous formulation is applied to transform the system into 12 equations in 12 unknowns, and the multi-homogeneous Bézout number of the system is 286,720. The Bertini solver, based on the homotopy continuation method, is used to solve the synthesis equations to obtain the dimensions of the two mechanisms. For the arbitrarily given nine precision points, the proposed method yields 37 and 31 defect-free solutions of Watt II and Stephenson III six-bar slider-crank mechanisms, respectively, and it is confirmed that they pass through the prescribed positions. Full article

In this paper, we characterize residuated lattices for which the topological space of prime ideals is a Noetherian space. The notion of i-Noetherian residuated lattice is introduced and related properties are investigated. We proved that a residuated lattice is i-Noetherian iff every ideal is principal. Moreover, we show that a residuated lattice has the spectrum of a Noetherian space iff it is i-Noetherian. Full article

The number of actuators of an underactuated robot is less than its degree of freedom. In other words, underactuated robots can be designed with fewer actuators than fully actuated ones. Although an underactuated robot is more complex than a fully actuated robot, it has many advantages, such as energy, material, and space saving. Therefore, it has high research value in both control theory and practical applications. Swing-up is a mechanism with two links, which mimics a gymnast performing a horizontal bar movement. Over the past few decades, many sufficiently robust control techniques have been developed for a fully actuated robot but almost none of them can be directly applicable to an underactuated robot system. The reason is that such control techniques require certain assumptions that are valid only for fully actuated robot systems but not for underactuated ones. In this paper, a control system design method for underactuated robots based on operator theory and an isomorphism scheme is first proposed. Bezout identity is designed using isomorphism. The effectiveness of the design method is confirmed by simulation. The simulation results show that the performances, such as robust stability and response time, of an underactuated robot control system are improved. Full article

This article presents the use of data processing to apprehend mathematical questions such as the Riemann Hypothesis (RH) by numerical calculation. Calculations are performed alongside graphs of the argument of the complex numbers $\zeta \left(x+iy\right)=a+ib$ and $\xi \left(x+iy\right)=p+iq$ , in the critical strip. On the one hand, the two-dimensional surface angle ${\tan }^{-1}\left(b/a\right)$ of the Riemann Zeta function $\zeta$ is related to the semi-angle of the fractional part of $\frac{y}{2\pi }\ln \left(\frac{y}{2\pi e}\right)$ and, on the other hand, the Ksi function $\xi$ of the Riemann functional equation is analyzed with respect to the coordinates $\left(x,1-x;y\right)$ . The computation of the power series expansion of the $\xi$ function with its symmetry analysis highlights the RH by the underlying ratio of Gamma functions inside the $\xi$ formula. The $\xi$ power series beside the angle of both surfaces of the $\zeta$ function enables to exhibit a Bézout identity $au+bv\equiv c$ between the components $\left(a,b\right)$ of the $\zeta$ function, which illustrates the RH. The geometric transformations in complex space of the Zeta and Ksi functions, illustrated graphically, as well as series expansions, calculated by computer, make it possible to elucidate this mathematical problem numerically. A final theoretical outlook gives deeper insights on the functional equation’s mechanisms, by adopting a computer–scientific perspective. Full article

In recent years, many applications, as well as theoretical properties of interval analysis have been investigated. Without any claim for completeness, such applications and methodologies range from enclosing the effect of round-off errors in highly accurate numerical computations over simulating guaranteed enclosures of all reachable states of a dynamic system model with bounded uncertainty in parameters and initial conditions, to the solution of global optimization tasks. By exploiting the fundamental enclosure properties of interval analysis, this paper aims at computing invariant sets of nonlinear closed-loop control systems. For that purpose, Lyapunov-like functions and interval analysis are combined in a novel manner. To demonstrate the proposed techniques for enclosing invariant sets, the systems examined in this paper are controlled via sliding mode techniques with subsequently enclosing the invariant sets by an interval based set inversion technique. The applied methods for the control synthesis make use of a suitably chosen Gröbner basis, which is employed to solve Bézout’s identity. Illustrating simulation results conclude this paper to visualize the novel combination of sliding mode control with an interval based computation of invariant sets. Full article

By reversing paradigms that normally utilize mathematical models as the basis for nonlinear adaptive controllers, this article describes using the controller to serve as a novel computational approach for mathematical system identification. System identification usually begins with the dynamics, and then seeks to parameterize the mathematical model in an optimization relationship that produces estimates of the parameters that minimize a designated cost function. The proposed methodology uses a DC motor with a minimum-phase mathematical model controlled by a self-tuning regulator without model pole cancelation. The normal system identification process is briefly articulated by parameterizing the system for least squares estimation that includes an allowance for exponential forgetting to deal with time-varying plants. Next, towards the proposed approach, the Diophantine equation is derived for an indirect self-tuner where feedforward and feedback controls are both parameterized in terms of the motor’s math model. As the controller seeks to nullify tracking errors, the assumed plant parameters are adapted and quickly converge on the correct parameters of the motor’s math model. Next, a more challenging non-minimum phase system is investigated, and the earlier implemented technique is modified utilizing a direct self-tuner with an increased pole excess. The nominal method experiences control chattering (an undesirable characteristic that could potentially damage the motor during testing), while the increased pole excess eliminates the control chattering, yet maintains effective mathematical system identification. This novel approach permits algorithms normally used for control to instead be used effectively for mathematical system identification. Full article

In this survey paper, a summary of results which are to be found in a series of papers, is presented. The subject of interest is focused on matrix algebraic properties of the Fisher information matrix (FIM) of stationary processes. The FIM is an ingredient of the Cram´er-Rao inequality, and belongs to the basics of asymptotic estimation theory in mathematical statistics. The FIM is interconnected with the Sylvester, Bezout and tensor Sylvester matrices. Through these interconnections it is shown that the FIM of scalar and multiple stationary processes fulfill the resultant matrix property. A statistical distance measure involving entries of the FIM is presented. In quantum information, a different statistical distance measure is set forth. It is related to the Fisher information but where the information about one parameter in a particular measurement procedure is considered. The FIM of scalar stationary processes is also interconnected to the solutions of appropriate Stein equations, conditions for the FIM to verify certain Stein equations are formulated. The presence of Vandermonde matrices is also emphasized. Full article

In this paper, we address the implementation of physical layer network coding (PNC) based on compute and forward (CF) in relay networks. It is known that the maximum achievable rates in CF-based transmission is limited due to the channel approximations at the relay. In this work, we propose the integer forcing precoder (IFP), which bypasses this maximum rate achievability limitation. Our precoder requires channel state information (CSI) at the transmitter, but only that of the channel between the transmitter and the relay, which is a feasible assumption. The overall contributions of this paper are three-fold. Firstly, we propose an implementation of CF using IFP and prove that this implementation achieves higher rates as compared to traditional relaying schemes. Further, the probability of error from the proposed scheme is shown to have up to 2 dB of gain over the existent lattice network coding-based implementation of CF. Secondly, we analyze the two phases of transmission in the CF scheme, thereby characterizing the end-to-end behavior of the CF and not only one-phase behavior, as in previous proposals. Finally, we develop decoders for both the relay and the destination. We use a generalization of Bezout’s theorem to justify the construction of these decoders. Further, we make an analytical derivation of the end-to-end probability of error for cubic lattices using the proposed scheme. Full article