385 search results - page 13 / 77 » A Fast Algorithm for Matrix Balancing |
TSP
2008
13 years 9 months ago
2008
This paper presents a new implementation of the YAST algorithm for principal and minor subspace tracking. YAST was initially derived from the Subspace Projection (SP) algorithm by ...
ROBOCUP
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. In the Humanoid Leagues balancing during walking and running is still the biggest challenge for most of the teams. We present here some work in which a dynamic walker is ...
EOR
2006
13 years 9 months ago
2006
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
DATE
2008
IEEE
14 years 3 months ago
2008
IEEE
We present an efficient analog synthesis algorithm employing regression models of circuit matrices. Circuit matrix models achieve accurate and speedy synthesis of analog circuits...
IPPS
1999
IEEE
14 years 1 months ago
1999
IEEE
The known fast sequential algorithms for multiplying two N N matrices (over an arbitrary ring) have time complexity ON , where 2 3. The current best value of is less than 2.3755....