Banded Matrix Solvers and Polynomial Diophantine Equations

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F06%3A03121758" target="_blank" >RIV/68407700:21230/06:03121758 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Banded Matrix Solvers and Polynomial Diophantine Equations

Original language description

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 theobservation 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. Reliable numerical algorithms and programs for banded matrices are readily available at present, for instance in the well known LAPACK package.

Czech name

Není k dispozici

Czech description

Není k dispozici

Type

A - Audiovisual production

CEP classification

BC - Theory and management systems

OECD FORD branch

—

Project

<a href="/en/project/1M0567" target="_blank" >1M0567: Centre for Applied Cybernetics</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2006

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

ISBN

—

Place of publication

Toulouse

Publisher/client name

—

Version

—

Carrier ID

neuvedeno