Sciweavers

598 search results - page 2 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
SIAMJO
2011
13 years 7 days ago
Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
Many applications arising in a variety of fields can be well illustrated by the task of recovering the low-rank and sparse components of a given matrix. Recently, it is discovered...
Min Tao, Xiaoming Yuan
SIAMNUM
2011
139views more  SIAMNUM 2011»
13 years 7 days ago
Adaptive Wavelet Schemes for Parabolic Problems: Sparse Matrices and Numerical Results
A simultaneous space-time variational formulation of a parabolic evolution problem is solved with an adaptive wavelet method. This method is shown to converge with the best possibl...
Nabi Chegini, Rob Stevenson
JPDC
2008
135views more  JPDC 2008»
13 years 5 months ago
Parallel block tridiagonalization of real symmetric matrices
Two parallel block tridiagonalization algorithms and implementations for dense real symmetric matrices are presented. Block tridiagonalization is a critical pre-processing step for...
Yihua Bai, Robert C. Ward
DATESO
2004
165views Database» more  DATESO 2004»
13 years 6 months ago
Multi-dimensional Sparse Matrix Storage
Large sparse matrices play important role in many modern information retrieval methods. These methods, such as clustering, latent semantic indexing, performs huge number of computa...
Jiri Dvorský, Michal Krátký
SIAMSC
2011
140views more  SIAMSC 2011»
12 years 8 months ago
A Fast Parallel Algorithm for Selected Inversion of Structured Sparse Matrices with Application to 2D Electronic Structure Calcu
Abstract. An efficient parallel algorithm is presented and tested for computing selected components of H−1 where H has the structure of a Hamiltonian matrix of two-dimensional la...
Lin Lin, Chao Yang, Jianfeng Lu, Lexing Ying, Wein...