Suchergebnisse - "F.2.1[Analysis of Algorithms and Problem Complexity"

Division-free computation of subresultants using Bezout matrices von Kerber, Michael

“… We present an algorithm to compute the subresultant sequence of two polynomials that completely avoids division in the ground domain, generalizing an algorithm …”
Volltext

Complexity results for some eigenvector problems von Eiter, Thomas, Gottlob, Georg

“… We consider the computation of eigenvectors over the integers, where each component x i satisfies for an integer b. We address various problems in this …”
Volltext

Systolic givens factorization of dense rectangular matrices von Cosnard, Michel, Robert, Yves

“… Given an m by n dense matrix A(m≧n) we consider parallel algorithms to compute its orthogonal factorization via Givens rotations. First we describe an …”
Volltext

Block LU decompositon of a band matrix on a systolic array von Robert, Yves

“… After a brief discussion on systolic arrays for band matrix LU or QR decomposition, we introduce a new systolic array for the block 2x2 LU decompositon of a …”
Volltext