Sciweavers

13603 search results - page 105 / 2721
» On the Complexity of Computing Treelength
Sort
View
NA
2010
144views more  NA 2010»
13 years 7 months ago
A binary powering Schur algorithm for computing primary matrix roots
An algorithm for computing primary roots of a nonsingular matrix A is presented. In particular, it computes the principal root of a real matrix having no nonpositive real eigenvalu...
Federico Greco, Bruno Iannazzo
SIAMNUM
2010
87views more  SIAMNUM 2010»
13 years 4 months ago
A Note on the Computation of All Zeros of Simple Quaternionic Polynomials
Polynomials with quaternionic coefficients located on only one side of the powers (we call them simple polynomials) may have two different types of zeros: isolated and spherical ze...
Drahoslava Janovská, Gerhard Opfer
ICASSP
2011
IEEE
13 years 29 days ago
On spatio-temporal Tomlinson Harashima Precoding in IIR channels: MMSE solution, properties, and fast computation
We consider spatio-temporal Tomlinson Harashima Precoding where the feedforward filter is located at the transmitter and an additional scalar gain is employed as receive filter....
Sander Wahls, Holger Boche