Suchergebnisse - F.2.1 [Analysis of algorithms and problem complexity]

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

“… Although the algorithm gives worse complexity bounds than pseudo-division approaches, our experiments show that our approach is superior for input polynomials with moderate degrees if the ground …”
Volltext

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

“… We address various problems in this context, and analyze their computational complexity. We find that different problems are complete for the complexity classes Applying …”
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 …”
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

A study of some addition chain problems von Tsai, Y.H., Chin, Y.H.

“… In this paper, some mathematical properties of the shortest-length addition chain are found for certain integers whose binary patterns meet some special forms; …”
Volltext