bibtype K - Conference Paper (Czech conference)
ARLID 0411517
utime 20240103182333.7
mtime 20060210235959.9
title (primary) (eng) Banded matrix solvers and polynomial Diophantine equations
publisher
place Praha
name ČVUT
pub_time 2005
specification
page_count 9 s.
serial
title Proceedings of the Technical Computing Prague 2005 Conference
page_num 151-159
editor
name1 Procházka
name2 A.
keyword algebraic approach
keyword polynomial Diophantine equations
keyword polynomial design
author (primary)
ARLID cav_un_auth*0101110
name1 Hromčík
name2 Martin
institution UTIA-B
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0101111
name1 Hurák
name2 Zdeněk
institution UTIA-B
fullinstit Ústav teorie informace a automatizace AV ČR, v. v. i.
author
ARLID cav_un_auth*0213313
name1 Frízel
name2 R.
country CZ
author
ARLID cav_un_auth*0021057
name1 Šebek
name2 M.
country CZ
COSATI 09H
COSATI 09I
cas_special
project
project_id GA102/05/0011
agency GA ČR
ARLID cav_un_auth*0213187
project
project_id 1M0567
agency GA MŠk
ARLID cav_un_auth*0202350
research CEZ:AV0Z10750506
abstract (eng) 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.
action
ARLID cav_un_auth*0213314
name International Conference Technical Computing Prague 2005
place Praha
country CZ
dates 15.11.2005
RIV BC
reportyear 2006
department
permalink http://hdl.handle.net/11104/0131597
ID_orig UTIA-B 20050247
arlyear 2005
mrcbU10 2005
mrcbU10 Praha ČVUT
mrcbU63 Proceedings of the Technical Computing Prague 2005 Conference 151 159
mrcbU67 Procházka A. 340