MEG-Eliminations

  • Authors:

  • D. E. Khmelnov

  • Affiliations:

  • Moscow Institute of Physics and Technology, Institutskii proezd 9, Dolgoprudnyi, Moscow oblast, 141700 Russia dennis_khmelnov@mail.ru

  • Venue:
  • Programming and Computing Software
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

The basic disadvantage of the algorithms of EG-eliminations [1] is that the degrees of elements of the polynomial matrix being used and the coefficients of these elements grow. The progress in overcoming this difficulty is associated with the use of modular approaches. The paper describes modularization of EG-eliminations and a modified elimination scheme based on that modularization (“quasi-modular algorithm”).