Self-verified extension of affine arithmetic to arbitrary order
<p>Affine Arithmetic (AA) is a self-verifying computational approach that keeps track of first-order correlation between uncertainties in the data and intermediate and final results.</p><p>In this paper we propose a higher-order extension satisfying the requirements of genericity, arb...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Università degli Studi di Catania
2008-05-01
|
| Series: | Le Matematiche |
| Subjects: | |
| Online Access: | http://www.dmi.unict.it/ojs/index.php/lematematiche/article/view/47 |
| Summary: | <p>Affine Arithmetic (AA) is a self-verifying computational approach that keeps track of first-order correlation between uncertainties in the data and intermediate and final results.</p><p>In this paper we propose a higher-order extension satisfying the requirements of genericity, arbitrary-order and self-verification, comparing the resulting ethod with other well-known high-order extensions of AA.</p> |
|---|---|
| ISSN: | 0373-3505 2037-5298 |