Many inverse problems in applied mathematics can be formulated as the approximation of a target element $u$ in a complete metric space $(X,d)$ by the fixed point $\bar x$ of an appropriate contraction mapping $T : X \to X$. The method of {\em collage coding} seeks to solve this problem by finding a contraction mapping $T$ that minimizes the so-called {\em collage distance} $d(x,Tx)$. In this paper, we develop a collage coding framework for inverse problems involving two classes of integral equations -- those with delay and Hammerstein-type equations. We illustrate the method with some practical examples
Solving inverse problems for delay integral equations using the "collage method" for fixed points / H. Kunze, D. La Torre, K. Levere, E.R. Vrscay. - In: INTERNATIONAL JOURNAL OF MATHEMATICS AND STATISTICS. - ISSN 0974-7117. - 11:1(2012), pp. 1-11.
Solving inverse problems for delay integral equations using the "collage method" for fixed points
D. La TorreSecondo
;
2012
Abstract
Many inverse problems in applied mathematics can be formulated as the approximation of a target element $u$ in a complete metric space $(X,d)$ by the fixed point $\bar x$ of an appropriate contraction mapping $T : X \to X$. The method of {\em collage coding} seeks to solve this problem by finding a contraction mapping $T$ that minimizes the so-called {\em collage distance} $d(x,Tx)$. In this paper, we develop a collage coding framework for inverse problems involving two classes of integral equations -- those with delay and Hammerstein-type equations. We illustrate the method with some practical examplesPubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.