122 search results - page 4 / 25 » Fast matrix multiplication is stable |
ESA
2004
Springer
14 years 24 days ago
2004
Springer
Let A and B two n × n matrices over a ring R (e.g., the reals or the integers) each containing at most m non-zero elements. We present a new algorithm that multiplies A and B usi...
SODA
1996
ACM
13 years 8 months ago
1996
ACM
TIT
2008
13 years 7 months ago
2008
A certain modular representation of multilinear polynomials is considered. The modulo 6 representation of polynomial f is just any polynomial f + 6g. The 1-a-strong representation ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We show that a fast algorithm for the QR factorization of a Toeplitz or Hankel matrix A is weakly stable in the sense that RT R is close to AT A. Thus, when the algorithm is used ...
ICYCS
2008
IEEE
14 years 1 months ago
2008
IEEE
— Nowadays wireless mesh routers are facilitating with more wireless channels than ever because of the advanced wireless communication technologies such as OFDM, SDR and CR(cogni...