385 search results - page 1 / 77 » A Fast Algorithm for Matrix Balancing |
DAGSTUHL
2007
13 years 6 months ago
2007
SIAMSC
2011
12 years 7 months ago
2011
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
STACS
1999
Springer
13 years 9 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
JCB
2002
13 years 4 months ago
2002
This paper investigates the standard ordinary least-squares version 24 and the balanced version 20 of the minimum evolution principle. For the standard version, we provide a greedy...
PARA
1994
Springer
13 years 9 months ago
1994
Springer
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...