Sciweavers

598 search results - page 11 / 120
» The Structure of Sparse Resultant Matrices
Sort
View
CSDA
2002
77views more  CSDA 2002»
13 years 8 months ago
Numerically stable cointegration analysis
Cointegration analysis involves the solution of a generalized eigenproblem involving moment matrices and inverted moment matrices. These formulae are unsuitable for actual computa...
Jurgen A. Doornik, R. J. O'Brien
CORR
2007
Springer
75views Education» more  CORR 2007»
13 years 8 months ago
On Undetected Error Probability of Binary Matrix Ensembles
Abstract— In this paper, analysis on undetected error probability of ensembles of m × n binary matricies is presented. Two ensembles are considered: One is an ensemble of dense ...
Tadashi Wadayama
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 8 months ago
Solving Sparse Integer Linear Systems
We propose a new algorithm to solve sparse linear systems of equations over the integers. This algorithm is based on a p-adic lifting technique combined with the use of block matr...
Wayne Eberly, Mark Giesbrecht, Pascal Giorgi, Arne...
CORR
2010
Springer
188views Education» more  CORR 2010»
13 years 8 months ago
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers
High-dimensional statistical inference deals with models in which the the number of parameters p is comparable to or larger than the sample size n. Since it is usually impossible ...
Sahand Negahban, Pradeep Ravikumar, Martin J. Wain...
SC
2009
ACM
14 years 3 months ago
Implementing sparse matrix-vector multiplication on throughput-oriented processors
Sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear algebra. In contrast to the uniform regularity of dense linear algebra, sparse operations enc...
Nathan Bell, Michael Garland