Sciweavers

573 search results - page 71 / 115
» On Wiedemann's Method of Solving Sparse Linear Systems
Sort
View
CORR
2010
Springer
127views Education» more  CORR 2010»
13 years 9 months ago
Analysis of Basis Pursuit Via Capacity Sets
Finding the sparsest solution for an under-determined linear system of equations D = s is of interest in many applications. This problem is known to be NP-hard. Recent work studie...
Joseph Shtok, Michael Elad
SCL
2008
105views more  SCL 2008»
13 years 9 months ago
Computation of nonlinear balanced realization and model reduction based on Taylor series expansion
In this paper a computational algorithm for nonlinear balanced realization and model reduction based on Taylor series expansion is proposed. This algorithm requires recursive comp...
Kenji Fujimoto, Daisuke Tsubakino
IACR
2011
124views more  IACR 2011»
12 years 8 months ago
Group Law Computations on Jacobians of Hyperelliptic Curves
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...
Craig Costello, Kristin Lauter
IPPS
2002
IEEE
14 years 2 months ago
Fast Inductance Extraction of Large VLSI Circuits
Accurate estimation of signal delay is critical to the design and verification of VLSI circuits. At very high frequencies, signal delay in circuits with small feature sizes is do...
Hemant Mahawar, Vivek Sarin, Weiping Shi
MP
2002
101views more  MP 2002»
13 years 8 months ago
Componentwise fast convergence in the solution of full-rank systems of nonlinear equations
The asymptotic convergence of parameterized variants of Newton's method for the solution of nonlinear systems of equations is considered. The original system is perturbed by a...
Nicholas I. M. Gould, Dominique Orban, Annick Sart...