Sciweavers

149 search results - page 5 / 30
» Solving Very Sparse Rational Systems of Equations
Sort
View
IPPS
2000
IEEE
13 years 12 months ago
Ordering Unstructured Meshes for Sparse Matrix Computations on Leading Parallel Systems
Abstract. Computer simulations of realistic applications usually require solving a set of non-linear partial di erential equations PDEs over a nite region. The process of obtaini...
Leonid Oliker, Xiaoye S. Li, Gerd Heber, Rupak Bis...
ICCS
2007
Springer
14 years 1 months ago
Hierarchical-Matrix Preconditioners for Parabolic Optimal Control Problems
Abstract. Hierarchical (H)-matrices approximate full or sparse matrices using a hierarchical data sparse format. The corresponding H-matrix arithmetic reduces the time complexity o...
Suely Oliveira, Fang Yang
IMA
2007
Springer
137views Cryptology» more  IMA 2007»
14 years 1 months ago
Algebraic Cryptanalysis of the Data Encryption Standard
In spite of growing importance of AES, the Data Encryption Standard is by no means obsolete. DES has never been broken from the practical point of view. The triple DES is believed ...
Nicolas Courtois, Gregory V. Bard
JSC
2011
99views more  JSC 2011»
12 years 10 months ago
Sparse polynomial division using a heap
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
Michael B. Monagan, Roman Pearce
AMC
2010
175views more  AMC 2010»
13 years 7 months ago
An inexact parallel splitting augmented Lagrangian method for large system of linear equations
: Parallel iterative methods are powerful tool for solving large system of linear equations (LEs). The existing parallel computing research results are focussed mainly on sparse sy...
Zheng Peng, DongHua Wu