Reducing rational polynomial: a proposition of a strategy to deal with floating point numbers using singular value decomposition

2022 ◽  
Author(s):  
Ahmad Deeb ◽  
Rafik Belarbi
2021 ◽  
Author(s):  
Ahmad DEEB ◽  
Rafik Belarbi

Abstract In this article, we present a new strategy to reduce rational polynomial based on the kernel of a linear map defined by the matrix's Sylvester. The strategy does not hold the computation of the Greatest common divisors (GCD) of two polynomials, as other algorithms do, but produce the reduced fraction directly. This strategy was inspired when we consider elements of Padé approximant as a basis is the Proper Generalised Decomposition for solving Partial Differential equation. The algorithm can use the Singular value decomposition technique when dealing with a polynomial with floating-point arithmetic. We compare it with Brown's algorithm in two wedges: multiplication for finite fields and large integers. Results are shown in term of time computation and robustness. The proposed algorithm shows that the time accuracy of computing the reduced fractional is at the same order as the Brown algorithm for finite field and large integers when the GCD of both polynomials has a small degree and an improving when the GCD's degree increase with the degree of polynomials. Also, robustness is more dynamic when arithmetic with the floating-point operation.


2017 ◽  
Author(s):  
Ammar Ismael Kadhim ◽  
Yu-N Cheah ◽  
Inaam Abbas Hieder ◽  
Rawaa Ahmed Ali

2020 ◽  
Vol 13 (6) ◽  
pp. 1-10
Author(s):  
ZHOU Wen-zhou ◽  
◽  
FAN Chen ◽  
HU Xiao-ping ◽  
HE Xiao-feng ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document