Sciweavers

84 search results - page 5 / 17
» Fast algorithms for polynomial solutions of linear different...
Sort
View
ASIACRYPT
2008
Springer
13 years 9 months ago
Solving Linear Equations Modulo Divisors: On Factoring Given Any Bits
We study the problem of finding solutions to linear equations modulo an unknown divisor p of a known composite integer N. An important application of this problem is factorization ...
Mathias Herrmann, Alexander May
JSCIC
2008
62views more  JSCIC 2008»
13 years 7 months ago
Robustness of a Spline Element Method with Constraints
The spline element method with constraints is a discretization method where the unknowns are expanded as polynomials on each element and Lagrange multipliers are used to enforce th...
Gerard Awanou
TPDS
2008
97views more  TPDS 2008»
13 years 7 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
JCPHY
2011
87views more  JCPHY 2011»
12 years 10 months ago
A fast directional algorithm for high-frequency electromagnetic scattering
This paper is concerned with the fast solution of high frequency electromagnetic scattering problems using the boundary integral formulation. We extend the O(N log N) directional ...
Paul Tsuji, Lexing Ying
FCCM
2006
IEEE
111views VLSI» more  FCCM 2006»
14 years 1 months ago
Pipelined Mixed Precision Algorithms on FPGAs for Fast and Accurate PDE Solvers from Low Precision Components
FPGAs are becoming more and more attractive for high precision scientific computations. One of the main problems in efficient resource utilization is the quadratically growing r...
Robert Strzodka, Dominik Göddeke