21 search results - page 2 / 5 » Automating the generation of composed linear algebra kernels |
ADG
2000
Springer
13 years 11 months ago
2000
Springer
In this paper we propose a bracket algebra based elimination method for automated generation of readable proofs for theorems in incidence geometry. This method is based on two tech...
EUROPAR
2000
Springer
13 years 11 months ago
2000
Springer
Abstract. Block-recursive codes for dense numerical linear algebra computations appear to be well-suited for execution on machines with deep memory hierarchies because they are e e...
WCC
2005
Springer
14 years 25 days ago
2005
Springer
In this paper, we discuss some methods of constructing frequency/time hopping (FH/TH) sequences over GF(pk ) by taking successive k-tuples of given sequences over GF(p). We are abl...
AMAST
2008
Springer
13 years 9 months ago
2008
Springer
We demonstrate Spiral, a domain-specific library generation system. Spiral generates high performance source code for linear transforms (such as the discrete Fourier transform and ...
ICFEM
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. Refinement plays a crucial role in "top-down" styles of verification, such as the refinement calculus, but for probabilistic systems proof of refinement is a pa...