Development of symbolic algorithms for certain algebraic processes
This study investigates the problem of computing the exact greatest common divisor of two polynomials relative to an orthogonal basis, defined over the rational number field. The main objective of the study is to design and implement an effective and efficient symbolic algorithm for the general clas...
Saved in:
Main Authors: | Abd. Rahman, Ali, Aris, Nor'aini |
---|---|
Format: | Monograph |
Language: | English |
Published: |
Research Management Center
2007
|
Subjects: | |
Online Access: | http://eprints.utm.my/id/eprint/2417/1/NorainiAris2007_DevelopmentAlgorithmsforAlgebraicProcesses.pdf http://eprints.utm.my/id/eprint/2417/ http://rmc.utm.my/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Development of symbolic algorithms for certain algebraic processes
by: Abd. Rahman, Ali, et al.
Published: (2007) -
Analysis and comparison of numerical algorithms for finding the GCD of certain types of polynomials in the Chebyshev basis
by: Isa, S. N. A., et al.
Published: (2017) -
Year Five Pupils’ Number Sense and Algebraic Thinking: the Mediating Role of Symbol and Pattern Sense
by: Piriya, Somasundram, et al.
Published: (2019) -
Coefficient estimates for certain subclasses of bi-univalent functions
by: Nurdiana Nurali, et al.
Published: (2019) -
Solving certain trinomial equation by means of generalized hypergeometric functions
by: Syed Abd. Rahman, Sharifah Alwiah
Published: (2002)