Sciweavers

719 search results - page 40 / 144
» Solving Sparse Linear Constraints
Sort
View
109
Voted
JVCA
2007
128views more  JVCA 2007»
15 years 11 days ago
Impulse-based dynamic simulation in linear time
This paper describes an impulse-based dynamic simulation method for articulated bodies which has a linear time complexity. Existing linear-time methods are either based on a reduc...
Jan Bender
95
Voted
ICDCN
2010
Springer
15 years 7 months ago
Parallelization of the Lanczos Algorithm on Multi-core Platforms
In this paper, we report our parallel implementations of the Lanczos sparse linear system solving algorithm over large prime fields, on a multi-core platform. We employ several lo...
Souvik Bhattacherjee, Abhijit Das
NAA
2004
Springer
117views Mathematics» more  NAA 2004»
15 years 5 months ago
Parallel Performance of a 3D Elliptic Solver
It was recently shown that block-circulant preconditioners applied to a conjugate gradient method used to solve structured sparse linear systems arising from 2D or 3D elliptic prob...
Ivan Lirkov
151
Voted
CORR
2012
Springer
225views Education» more  CORR 2012»
13 years 8 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
103
Voted
ICC
2008
IEEE
142views Communications» more  ICC 2008»
15 years 7 months ago
End-to-End Outage Probability Minimization in OFDM Based Linear Multi-Hop Networks
Abstract— This paper is concerned with the end-to-end transmission outage in an OFDM based wireless multi-hop network. The network consists of a source node, a destination node, ...
Xiaolu Zhang, Meixia Tao, Wenhua Jiao, Chun Sum Ng