GA102/05/0011 GA ČR - Czech Science Foundation (CSF)
1M0567 GA MŠMT - Ministry of Education, Youth and Sports (MEYS)
CEZ
AV0Z10750506 - UTIA-B (2005-2011)
Annotation
Numerical procedures and codes for linear Diophantine polynomial equations are proposed in this paper based on the banded matrix algorithms and solvers. Both the scalar and matrix cases are covered. The algorithms and programs developed are based on the observation that a set of constant linear equations resulting from the polynomial problem features a special structure. This structure, known as Sylvester, or block Syelvester in the matrix case, can in turn be accommodated in the banded matrix framework.
