Skip to main content
SpringerLink
Log in

MEG-Eliminations

  • Published:
Programming and Computer Software Aims and scope Submit manuscript

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”).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. Abramov, S.A., EG-Eliminations, J. Difference Equations Appl., 1999, vol. 5, pp. 393-433.

    Google Scholar 

  2. Abramov, S.A., Glotov, P.E., and Khmelnov, D.E., A Scheme of Eliminations in Linear Recurrent Systems and Its Applications, Proc. of French-Russian Lyapunov Institute (in press).

  3. McClellan, M.T., The Exact Solutions of Systems of Linear Equations with Polynomial Coefficients, J. ACM, 1973, vol. 20, no. 4.M.

Download references

Author information

Authors and Affiliations

  1. Moscow Institute of Physics and Technology, Institutskii proezd 9, Dolgoprudnyi, Moscow oblast, 141700, Russia

    D. E. Khmelnov

Authors
  1. D. E. Khmelnov
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khmelnov, D.E. MEG-Eliminations. Programming and Computer Software 27, 12–17 (2001). https://doi.org/10.1023/A:1007126517467

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1007126517467

Keywords

Search

Navigation