Sciweavers

385 search results - page 6 / 77
» A Fast Algorithm for Matrix Balancing
Sort
View
JCPHY
2011
109views more  JCPHY 2011»
14 years 14 days ago
Fast construction of hierarchical matrix representation from matrix-vector multiplication
We develop a hierarchical matrix construction algorithm using matrixvector multiplications, based on the randomized singular value decomposition of low-rank matrices. The algorith...
Lin Lin, Jianfeng Lu, Lexing Ying
SYRCODIS
2008
136views Database» more  SYRCODIS 2008»
14 years 11 months ago
Stochastic Approach to Binary Matrix Partitioning for Phylogenetic Networks
In this research we introduce the problem of the binary matrix partitioning in a biological context. Our idea is to use SNP matrix to construct a set of phylogenetic networks to r...
Victoria Kusherbaeva, Nikolay Vyahhi
ESA
2004
Springer
98views Algorithms» more  ESA 2004»
15 years 3 months ago
Fast Sparse Matrix Multiplication
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...
Raphael Yuster, Uri Zwick
ESA
2006
Springer
105views Algorithms» more  ESA 2006»
15 years 1 months ago
Dynamic Programming and Fast Matrix Multiplication
Abstract. We give a novel general approach for solving NP-hard optimization problems that combines dynamic programming and fast matrix multiplication. The technique is based on red...
Frederic Dorn
73
Voted
DAGSTUHL
2007
14 years 11 months ago
The Sinkhorn-Knopp Algorithm: Convergence and Applications
As long as a square nonnegative matrix A contains sufficient nonzero elements, then the Sinkhorn-Knopp algorithm can be used to balance the matrix, that is, to find a diagonal sc...
Philip A. Knight