National Repository of Grey Literature 5 records found  Search took 0.00 seconds. 
Banded matrix solvers and polynomial Diophantine equations
Hromčík, Martin ; Hurák, Zdeněk ; Frízel, R. ; Šebek, M.
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.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.