5 search results - page 1 / 1 » Component-level parallelization of triangular decompositions |
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
We discuss the parallelization of algorithms for solving polynomial systems symbolically by way of triangular decompositions. We introduce a component-level parallelism for which ...
EUROPAR
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. We present parallel algorithms for triangular periodic Sylvester-type matrix equations, conceptually being the third step of a periodic Bartels
HPCN
1998
Springer
13 years 9 months ago
1998
Springer
Unstructured grids can represent the complex geometry of the ocean basin with high delity. The lack of development tools supporting irregular grid problems discourages the use of ...
ASPLOS
2009
ACM
14 years 5 months ago
2009
ACM
QR decomposition is a computationally intensive linear algebra operation that factors a matrix A into the product of a unitary matrix Q and upper triangular matrix R. Adaptive sys...
PDPTA
2008
13 years 6 months ago
2008
Solving linear systems with a large number of variables is at the core of many scienti c problems. Parallel processing techniques for solving such systems have received much attent...