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

Division-free computation of subresultants using Bezout matrices by 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…”
Get full text

Complexity results for some eigenvector problems by 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…”
Get full text

Systolic givens factorization of dense rectangular matrices by 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…”
Get full text

Block LU decompositon of a band matrix on a systolic array by 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…”
Get full text

A study of some addition chain problems by 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;…”
Get full text