Sciweavers

688 search results - page 66 / 138
» Computing with subspaces
Sort
View
SIAMSC
2010
160views more  SIAMSC 2010»
14 years 8 months ago
Shift-Invert Arnoldi Approximation to the Toeplitz Matrix Exponential
The shift-invert Arnoldi method is employed to generate an orthonormal basis from the Krylov subspace corresponding to a real Toeplitz matrix and an initial vector. The vectors and...
Spike T. Lee, Hong-Kui Pang, Hai-Wei Sun
SIAMSC
2010
95views more  SIAMSC 2010»
14 years 8 months ago
Interpreting IDR as a Petrov--Galerkin Method
The IDR method of Sonneveld and van Gijzen [SIAM J. Sci. Comput., 31:1035–1062, 2008] is shown to be a Petrov-Galerkin (projection) method with a particular choice of left Krylov...
Valeria Simoncini, Daniel B. Szyld
COMPUTING
2006
110views more  COMPUTING 2006»
14 years 9 months ago
An Alternative Algorithm for a Sliding Window ULV Decomposition
The ULV decomposition (ULVD) is an important member of a class of rank-revealing two-sided orthogonal decompositions used to approximate the singular value decomposition (SVD). Th...
H. Erbay, J. Barlow
CORR
2008
Springer
82views Education» more  CORR 2008»
14 years 9 months ago
Kaltofen's division-free determinant algorithm differentiated for matrix adjoint computation
Kaltofen has proposed a new approach in (Kaltofen, 1992) for computing matrix determinants without divisions. The algorithm is based on a baby steps/giant steps construction of Kr...
Gilles Villard
CVPR
2003
IEEE
15 years 11 months ago
Joint Manifold Distance: a new approach to appearance based clustering
We wish to match sets of images to sets of images where both sets are undergoing various distortions such as viewpoint and lighting changes. To this end we have developed a Joint ...
Andrew W. Fitzgibbon, Andrew Zisserman