Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power (Q1085949): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(85)90037-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2074917087 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Solution of Certain Toeplitz Linear Systems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3311653 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5674406 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q5601777 / rank | |||
Normal rank | |||
Latest revision as of 18:07, 17 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power |
scientific article |
Statements
Fast parallel polynomial division via reduction to triangular Toeplitz matrix inversion and to polynomial inversion modulo a power (English)
0 references
1985
0 references
La division avec reste de deux polynômes peut se réduire à l'inversion d'une matrice triangulaire de Toeplitz; divers algorithmes ont traité ce problème. Ici, les AA. présentent un algorithme utilisant l'inversion d'un polynôme associé.
0 references
matrix inversion
0 references
polynomial inversion
0 references
polynomial division
0 references
parallel algorithms
0 references
triangular Toeplitz matrices
0 references
