Original title: Banded matrix solvers and polynomial Diophantine equations
Authors: Hromčík, Martin ; Hurák, Zdeněk ; Frízel, R. ; Šebek, M.
Document type: Papers
Conference/Event: International Conference Technical Computing Prague 2005, Praha (CZ), 2005-11-15
Year: 2005
Language: eng
Abstract: 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.
Keywords: algebraic approach; polynomial design; polynomial Diophantine equations
Project no.: CEZ:AV0Z10750506 (CEP), GA102/05/0011 (CEP), 1M0567 (CEP)
Funding provider: GA ČR, GA MŠk
Host item entry: Proceedings of the Technical Computing Prague 2005 Conference

Institution: Institute of Information Theory and Automation AS ČR (web)
Document availability information: Fulltext is available at the institute of the Academy of Sciences.
Original record: http://hdl.handle.net/11104/0131597

Permalink: http://www.nusl.cz/ntk/nusl-35121


The record appears in these collections:
Research > Institutes ASCR > Institute of Information Theory and Automation
Conference materials > Papers