4966 search results - page 326 / 994 » its 2010 |
188
click to vote
SIAMCOMP
2010
15 years 1 months ago
2010
In the first part of the paper, we reexamine the all-pairs shortest paths (APSP) problem and present a new algorithm with running time O(n3 log3 log n/ log2 n), which improves all...
207
click to vote
SIAMIS
2010
15 years 1 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
150
click to vote
SIAMMAX
2010
15 years 1 months ago
2010
Ruhe's rational Krylov method is a popular tool for approximating eigenvalues of a given matrix, though its convergence behavior is far from being fully understood. Under fair...
164
click to vote
SIAMNUM
2010
15 years 1 months ago
2010
Two algorithms based upon a tree-cotree decomposition, called in this paper spanning tree technique (STT) and generalized spanning tree technique (GSTT), have been shown to be usef...
168
click to vote
SIAMREV
2010
15 years 1 months ago
2010
We present some observations on the block triangular form (btf) of structurally symmetric, square, sparse matrices. If the matrix is structurally rank deficient, its canonical btf ...