SIAMMAX
2010
13 years 6 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
SIAMMAX
2010
13 years 6 months ago
2010
For a given symmetric positive definite matrix A RN
ADCM
2004
13 years 11 months ago
2004
If f(t) = k=0 aktk converges for all t IR with all coefficients ak 0, then the function f(< x, y >) is positive definite on H
MP
2008
13 years 11 months ago
2008
Abstract In this note we discuss the convergence of Newton's method for minimization. We present examples in which the Newton iterates satisfy the Wolfe conditions and the Hes...
FOCS
2008
IEEE
13 years 11 months ago
2008
IEEE
The nested dissection method developed by Lipton, Rose, and Tarjan is a seminal method for quickly performing Gaussian elimination of symmetric real positive definite matrices who...
ECCV
2010
Springer
13 years 11 months ago
2010
Springer
Sparse representation of signals has been the focus of much research in the recent years. A vast majority of existing algorithms deal with vectors, and higher
NIPS
2004
14 years 26 days ago
2004
Complex objects can often be conveniently represented by finite sets of simpler components, such as images by sets of patches or texts by bags of words. We study the class of posi...