Sciweavers

243 search results - page 2 / 49
» Linear Network Codes and Systems of Polynomial Equations
Sort
View
EUROPAR
2001
Springer
15 years 2 months ago
Polynomial Preconditioning for Specially Structured Linear Systems of Equations
For the solution of the SID (Symmetric InDefinite) linear systems, the use of the GLS (Generalized Least-Squares) polynomial preconditioner can improve the execution efficiency of...
Y. Liang, Jim Weston, Marek Szularz
APPML
2006
71views more  APPML 2006»
14 years 9 months ago
The polynomial solution to the Sylvester matrix equation
For when the Sylvester matrix equation has a unique solution, this work provides a closed form solution, which is expressed as a polynomial of known matrices. In the case of non-u...
Qingxi Hu, Daizhan Cheng
ACNS
2011
Springer
231views Cryptology» more  ACNS 2011»
14 years 1 months ago
Cold Boot Key Recovery by Solving Polynomial Systems with Noise
A method for extracting cryptographic key material from DRAM used in modern computers has been recently proposed in [9]; the technique was called Cold Boot attacks. When considerin...
Martin Albrecht, Carlos Cid
FOCM
2010
111views more  FOCM 2010»
14 years 6 months ago
A Note on the Finite Variance of the Averaging Function for Polynomial System Solving
In [BP08], the average complexity of linear homotopy methods to solve polynomial equations with random initial input (in a sense to be described below) was proven to be finite, an...
Carlos Beltrán, Michael Shub
STOC
2007
ACM
132views Algorithms» more  STOC 2007»
15 years 9 months ago
On the convergence of Newton's method for monotone systems of polynomial equations
Monotone systems of polynomial equations (MSPEs) are systems of fixed-point equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomial with p...
Stefan Kiefer, Michael Luttenberger, Javier Esparz...