Algorithmic Computation of de Rham Cohom
โ
Uli Walther
๐
Article
๐
2000
๐
Elsevier Science
๐
English
โ 493 KB
Let X = C n . In this paper we present an algorithm that computes the de Rham cohomology groups H i dR (U, C) where U is the complement of an arbitrary Zariski-closed set Y in X. Our algorithm is a merger of the algorithm given in Oaku and Takayama (1999), who considered the case where Y is a hyper