Banded matrix solvers and polynomial Diophantine equations

0411517 - UTIA-B 20050247 CZ eng K - Conference Paper (Czech conference)
Hromčík, Martin - Hurák, Zdeněk - Frízel, R. - Šebek, M.
Banded matrix solvers and polynomial Diophantine equations.
Praha: ČVUT, 2005. In: Proceedings of the Technical Computing Prague 2005 Conference. - (Procházka, A.), s. 151-159
[International Conference Technical Computing Prague 2005. Praha (CZ), 15.11.2005]
R&D Projects: GA ČR GA102/05/0011; GA MŠMT 1M0567
Institutional research plan: CEZ:AV0Z10750506
Keywords : algebraic approach * polynomial Diophantine equations * polynomial design
Subject RIV: BC - Control Systems Theory

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.
Permanent Link: http://hdl.handle.net/11104/0131597