Není k dispozici

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F05%3A03111506" target="_blank" >RIV/68407700:21230/05:03111506 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Banded Matrix Solvers and Polynomial Diophantine Equations

Popis výsledku v původním jazyce

Numerical procedures and programs 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 Sylvester 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. Software routines based on dedicated LAPACK band matrix solvers were programmed in the C language and linked to MATLAB, mainly for two reasons: to provide prospective users with an environment most of them are familiar with, and to gain the possibility of direct comparison with related functions of the Polynomial Toolbox for MATLAB.

Název v anglickém jazyce

Banded Matrix Solvers and Polynomial Diophantine Equations

Popis výsledku anglicky

Numerical procedures and programs 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 Sylvester 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. Software routines based on dedicated LAPACK band matrix solvers were programmed in the C language and linked to MATLAB, mainly for two reasons: to provide prospective users with an environment most of them are familiar with, and to gain the possibility of direct comparison with related functions of the Polynomial Toolbox for MATLAB.

Druh

A - Audiovizuální tvorba

CEP obor

BC - Teorie a systémy řízení

OECD FORD obor

—

Projekt

<a href="/cs/project/GA102%2F05%2F2075" target="_blank" >GA102/05/2075: Teoretické základy pro integrované řízení a optimalizaci technologických procesů</a><br>

Návaznosti

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

Rok uplatnění

2005

Kód důvěrnosti údajů

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

ISBN

80-7080-577-3

Místo vydání

Praha

Název nakladatele resp. objednatele

—

Verze

—

Identifikační číslo nosiče

neuvedeno