Sciweavers

50 search results - page 2 / 10
» Rainbow solutions of linear equations over Zp
Sort
View
ADCM
1998
132views more  ADCM 1998»
13 years 6 months ago
Numerical solution of generalized Lyapunov equations
Two e cient methods for solving generalized Lyapunov equations and their implementations in FORTRAN 77 are presented. The rst one is a generalization of the Bartels{Stewart method...
Thilo Penzl
TIT
2008
75views more  TIT 2008»
13 years 6 months ago
Linear Network Codes and Systems of Polynomial Equations
If and are nonnegative integers and F is a field, then a polynomial collection {p1, . . . , p} Z[1, . . . , ] is said to be solvable over F if there exist 1, . . . , F such t...
Randall Dougherty, Christopher F. Freiling, Kennet...
EPIA
1993
Springer
13 years 10 months ago
Fast Methods for Solving Linear Diophantine Equations
We present some recent results from our research on methods for finding the minimal solutions to linear Diophantine equations over the naturals. We give an overview of a family of...
Miguel Filgueiras, Ana Paula Tomás
FOCS
2009
IEEE
14 years 1 months ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson
TPDS
2008
97views more  TPDS 2008»
13 years 6 months ago
Solving Systems of Linear Equations on the CELL Processor Using Cholesky Factorization
: The STI CELL processor introduces pioneering solutions in processor architecture. At the same time it presents new challenges for the development of numerical algorithms. One is ...
Jakub Kurzak, Alfredo Buttari, Jack Dongarra