𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A recursive algorithm for finding HDMR terms for sensitivity analysis

✍ Scribed by H. Kaya; M. Kaplan; H. Saygın

Publisher
Elsevier Science
Year
2004
Tongue
English
Weight
178 KB
Volume
158
Category
Article
ISSN
0010-4655

No coin nor oath required. For personal study only.

✦ Synopsis

High Dimensional Model Representation (HDMR) is an efficient technique which decomposes a multivariate function into a constant, univariate, bivariate functions and so on. These functions are forced to be mutually orthogonal by means of an orthogonality condition. The technique which is generally used for high-dimensional input-output systems can be applied to various disciplines including sensitivity analysis, differential equations, inversion of data and so on. In this article we present a computer program that computes individual components of HDMR resolution of a given multivariate function. The program also calculates the global sensitivity indices. Lastly the results of the numerical experiments for different set of functions are introduced.

📜 SIMILAR VOLUMES

A simple greedy algorithm for finding fu
A simple greedy algorithm for finding functional relations: efficient implementation and average case analysis
✍ Tatsuya Akutsu; Satoru Miyano; Satoru Kuhara 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 186 KB

Inferring functional relations from relational databases is important for the discovery of scientiÿc knowledge because many experimental data are represented in the form of tables and many rules are represented in the form of functions. A simple greedy algorithm has been known as an approximation al

Analysis of parallel algorithms for find
Analysis of parallel algorithms for finding a maximal independent set in a random hypergraph
✍ H. Chen; A. M. Frieze 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 726 KB

It is well known [9] that finding a maximal independent set in a graph is in class J%, and [lo] that finding a maximal independent set in a hypergraph with fixed dimension is in %JV"%' . It is not known whether this latter problem remains in A% when the dimension is part of the input. We will study

Perturbed Algorithms and Sensitivity Ana
Perturbed Algorithms and Sensitivity Analysis for a General Class of Variational Inclusions
✍ Samir Adly 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 229 KB

In the present paper, we study a perturbed iterative method for solving a general class of variational inclusions. An existence result which generalizes some known results in this field, a convergence result, and a new iterative method are given. We also prove the continuity of the perturbed solutio

A computational algorithm for the Green'
A computational algorithm for the Green's function method of sensitivity analysis in chemical kinetics
✍ Eugene P. Dougherty; Herschel Rabitz 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 665 KB

## Abstract The recent interest in numerical modeling of chemical kinetics has generated the need for proper analysis of the system sensitivities in such models. This paper describes the logic for a program developed by the authors to implement the Green's function method of sensitivity analysis in