Results 1 to 10 of about 64 (53)
Relationship Between GF(2^m) Montgomery and Shifted Polynomial Basis Multiplication Algorithms [PDF]
IEEE Transactions on Computers, 2006 Applying the matrix-vector product idea of the Mastrovito multiplier to the GF(2m) Montgomery multiplication algorithm, we present a new parallel multiplier for irreducible trinomials. This multiplier and the corresponding shifted polynomial basis (SPB) multiplier have the same circuit structure for the same set of parameters.
Haining Fan, M A Hasan
exaly +6 more sources
Generalized Shifted Chebyshev Koornwinder’s Type Polynomials: Basis Transformations [PDF]
Symmetry, 2018 Approximating continuous functions by polynomials is vital to scientific computing and numerous numerical techniques. On the other hand, polynomials can be characterized in several ways using different bases, where every form of basis has its advantages and power.
Maalee Almheidat, Mohammad Alqudah
exaly +4 more sources
A shifted fractional-order Hahn functions Tau method for time-fractional PDE with nonsmooth solution [PDF]
Iranian Journal of Numerical Analysis and Optimization, 2023 In this paper, a new orthogonal system of nonpolynomial basis functions is introduced and used to solve a class of time-fractional partial differential equations that have nonsmooth solutions.
N. Mollahasani
doaj +1 more source
Solving recurrences for Legendre–Bernstein basis transformations
Examples and Counterexamples, 2023 The change of basis matrix M from shifted Legendre to Bernstein polynomials and M−1 have applications in computer graphics. Algorithms use their properties to find the matrix elements efficiently.
D.A. Wolfram
doaj +1 more source
Fractal and Fractional, 2021 This paper applies a numerical method of polynomial function approximation to the numerical analysis of variable fractional order viscoelastic rotating beam.
Cundi Han +3 more
doaj +1 more source
Space Efficient
IEEE Access, 2020 Recently, new multiplication schemes over the binary extension field GF(2m) based on an n-term Karatsuba algorithm have been proposed for irreducible trinomials. In this paper, we extend these schemes for trinomials to any irreducible polynomials.
Sun-Mi Park +3 more
doaj +1 more source
SOLVE ABEL’S INTEGRAL EQUATION USING POINT INTERPOLATION MESHLESS METHOD [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2018 In this paper the numerical method for solving Abel,s integral equation are introduced ,this method is based on point interpolation meshless method. Also Radial basis function, zeros of the shifted Legendre polynomial as the collocation points utilized ...
Nahdh. S .m. Al-saif
doaj +1 more source
Results in Physics, 2023 This study aims to develop, analyze and implement an efficient method for approximating two-point boundary value problems of ordinary differential equations.
Muideen O. Ogunniran +4 more
doaj +1 more source
Efficient Bit-Parallel Multiplier for All Trinomials Based on
IEEE Access, 2020 Recently, hybrid multiplication schemes over the binary extension field $GF(2^{m})$ based on $n$ -term Karatsuba algorithm (KA) have been proposed for irreducible trinomials.
Sun-Mi Park +3 more
doaj +1 more source
Low Space Complexity
IEEE Access, 2019 We propose bit-parallel GF(2m) multipliers for irreducible trinomials using an n-term Karatsuba algorithm and Mastrovito approach, which are generalizations of the newly proposed multiplication scheme for a specific trinomial.
Sun-Mi Park +3 more
doaj +1 more source