Sciweavers

573 search results - page 25 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
IJCM
2007
53views more  IJCM 2007»
13 years 9 months ago
Splitting methods for non-autonomous linear systems
We present splitting methods for numerically solving a certain class of explicitly time-dependent linear differential equations. Starting from an efficient method for the autonom...
Sergio Blanes, Fernando Casas, Ander Murua
ICA
2007
Springer
14 years 27 days ago
Estimating the Mixing Matrix in Sparse Component Analysis Based on Converting a Multiple Dominant to a Single Dominant Problem
We propose a new method for estimating the mixing matrix, A, in the linear model x(t) = As(t), t = 1, . . . , T, for the problem of underdetermined Sparse Component Analysis (SCA)....
Nima Noorshams, Massoud Babaie-Zadeh, Christian Ju...
SIAMJO
2000
74views more  SIAMJO 2000»
13 years 8 months ago
A Specialized Interior-Point Algorithm for Multicommodity Network Flows
Abstract. Despite the efficiency shown by interior-point methods in large-scale linear programming, they usually perform poorly when applied to multicommodity flow problems. The ne...
Jordi Castro
ICASSP
2008
IEEE
14 years 3 months ago
Compressive sensing and waveform design for the identification of Linear time-varying systems
In this paper, we investigate the application of compressive sensing and waveform design for estimating linear time-varying system characteristics. Based on the fact that the spre...
Jun Jun Zhang, Antonia S. Papandreou
STOC
2007
ACM
128views Algorithms» more  STOC 2007»
14 years 9 months ago
Iteratively constructing preconditioners via the conjugate gradient method
We consider the problem of solving a symmetric, positive definite system of linear equations. The most well-known and widely-used method for solving such systems is the preconditi...
John Dunagan, Nicholas J. A. Harvey