Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9657226 | The Journal of Logic and Algebraic Programming | 2005 | 14 Pages |
Abstract
Given computable scalar fields, the operations on tensor fields will also be computable. As a consequence we get computable solvers for PDEs. The traditional numerical methods for achieving computability by various approximation techniques (e.g., finite difference, finite element or finite volume methods), all have artifacts in the form of numerical inaccuracies and various forms of noise in the solutions. We hope these observations will inspire the development of a theory for computable scalar fields, which either lets us understand why these artefacts are inherent, or provides us with better tools for constructing these basic building blocks.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Magne Haveraaen, Helmer André Friis, Hans Munthe-Kaas,