Algorithms for H-bases computations

H-basis algorithms that do not rely on Gröbner basis calculations consist of two fundamental stages: the computation of a basis for a syzygy module and the reduction process. This thesis presents enhanced methods that utilize two distinct linear algebraic techniques, namely row reduction and QR Decomposition, for both stages. The efficacy of these methods is demonstrated through examples.