Sciweavers

40 search results - page 6 / 8
» Preconditioned iterative methods on sparse subspaces
Sort
View
CVPR
2010
IEEE
14 years 1 months ago
Pushing the Envelope of Modern Methods for Bundle Adjustment
In this paper, we present results and experiments with several methods for bundle adjustment, producing the fastest bundle adjuster ever published. The fastest methods work with t...
Yekeun Jeong, David Nister, Drew Steedly, Richard ...
CDC
2009
IEEE
114views Control Systems» more  CDC 2009»
13 years 11 months ago
Parametric model order reduction accelerated by subspace recycling
Abstract-- Many model order reduction methods for parameterized systems need to construct a projection matrix V which requires computing several moment matrices of the parameterize...
Lihong Feng, Peter Benner, Jan G. Korvink
CORR
2010
Springer
275views Education» more  CORR 2010»
13 years 7 months ago
Dictionary Optimization for Block-Sparse Representations
Recent work has demonstrated that using a carefully designed dictionary instead of a predefined one, can improve the sparsity in jointly representing a class of signals. This has m...
Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Elda...
CVPR
2008
IEEE
14 years 9 months ago
Simultaneous image transformation and sparse representation recovery
Sparse representation in compressive sensing is gaining increasing attention due to its success in various applications. As we demonstrate in this paper, however, image sparse rep...
Junzhou Huang, Xiaolei Huang, Dimitris N. Metaxas
IPPS
1995
IEEE
13 years 11 months ago
Performance evaluation of a new parallel preconditioner
The linear systems associated with large, sparse, symmetric, positive definite matrices are often solved iteratively using the preconditioned conjugate gradient method. We have d...
Keith D. Gremban, Gary L. Miller, Marco Zagha