Identification of Parameters in Neutral Functional Differential Equations with State-Dependent Delays

To appear in the proceedings of 44th IEEE Conference on Decision and Control and European Control Conference ECC 5, Seville, Spain. -5 December 5. Identification of Parameters in Neutral Functional Differential Equations with State-Dependent Delays Ferenc Hartung and Janos Turi Abstract We introduce a parameter identification algorithm and establish its theoretical convergence on initial value problems governed by neutral functional differential equations with state-dependent delays. The discretization of the differential equation is based on an Euler-type approximation method using equations with piecewise constant arguments. Numerical examples are included. I. INTRODUCTION In this paper, making use of a general framework for parameter identification in distributed parameter systems see e.g., [], [], [3], [], and the references therein, we study convergence properties of numerical schemes producing approximate solutions of parameter estimation problems for a class of neutral functional differential equations with statedependent delays SD-NFDEs of the form ẋt = ft, xt, xt σt, xt, ẋt τt, xt. Existence, uniqueness and numerical approximations of solutions for such equations were considered in [4], [7], [8], [] and [9] and the references therein. Parameter estimation problems were studied in [4] for equations of the form xt+qtxt τt, xt =f t, xt, xt σt, xt the so-called implicit neutral case. Note that represents a more general class of SD-NFDEs than. In this paper, extending and refining our earlier results see [7] for retarded equations with state-dependent delays and [] [4] for NFDEs with constant, time- and statedependent delays, we define a parameter estimation method using an approximation scheme based on equations with piecewise-constant arguments EPCAs, show its theoretical convergence, and study its applicability on numerical examples. The remaining part of the paper is organized as follows: In Section we specify the class SD-NFDEs we will study and obtain some basic properties of the solutions. In Section 3 we briefly recall the general identification framework used in the current study. In Section 4 we introduce a simple EPCA-based numerical approximation scheme, and discuss the key step of the general identification procedure, namely, the convergence of the approximate problem under a certain double limiting process. Section 5 contains a few numerical examples. F. Hartung is with the Department of Mathematics and Computing, University of Veszprém, H-8 Veszprém, P.O.Box 58, Hungary hartung@szt.vein.hu J. Turi is with the Programs in Mathematical Sciences, University of Texas at Dallas, Richardson, TX 7583, USA turi@utdallas.edu Note that EPCAs were used first in [9] to obtain numerical approximation schemes and to prove the convergence of the approximation method for linear delay and neutral differential equations with constant delays, and later in [] and [5] for nonlinear delay and neutral equations with statedependent delays. II. A CLASS OF SD-NFDES Consider the nonlinear SD-NFDE ẋt = ft, xt, xt σt, xt, λ, ẋt τt, xt, ξ, θ, 3 for t, and the associated initial condition xt = ϕt, t [ r, ]. 4 We assume throughout the paper that Λ, Ξ and Θ are normed linear spaces, where the norms are denoted by Λ, Ξ and Θ, respectively. A fixed norm on R n is denoted by. The Banachspace of continuous real-valued functions defined on [ r, ] with the norm ψ C = max{ ψs : s [ r, ]} will be denoted by C. The Banach-space of absolutely continuous functions on [ r, ] is denoted by W,, where ψ W, = max{ ψ C, ess sup{ ψs : s [ r, ]}}. We will assume H f C[, T] R n R n R n Θ; R n is locally Lipschitz continuous in its first, second, third and fifth arguments, and globally Lipschitz continuous in its fourth argument, i.e., there exists L and for every M there exists L = L M such that ft, x, y, z, θ f t, x, ȳ, z, θ L t t + x x + y ȳ + θ θ Θ + L z z, for t, t [, T], x, x, y, ȳ, z, z R n, θ, θ Θ such that x, x, y, ȳ, θ Θ, θ Θ M; H τ, σ C[, T] R n ; R are such that i there exist r > and r > such that σt, x, λ r and < r τt, x, ξ r for t [, T], x R n, λ Λ, ξ Ξ; ii σ and τ are locally Lipschitz continuous in their all arguments, i.e., for every M there exists constants L 3 = L 3 M and L 4 = L 4 M such that σt, x, λ σ t, x, λ L 3 t t + x x + λ λ Λ and τt, x, ξ τ t, x, ξ L 4 t t + x x + ξ ξ Ξ, for t, t [, T], x, x R n,

λ, λ Λ, ξ, ξ Ξ such that x, x M, λ Λ, λ Λ M, ξ Ξ, ξ Ξ M; H3 ϕ W,, i.e., ϕ is Lipschitz continuous, and its derivative ϕ is Lipschitz continuous on [ r, ], i.e., there exists L 5 such that ϕt ϕ t L 5 t t for a.e. t [ r, ]. By a solution of IVP 3-4 on [ r, α] we mean a continuous function x, which is almost everywhere a.e. differentiable and satisfies 3 for a.e. t [, α], and 4 for all t [ r, ]. In 3-4 we consider γ = ϕ, λ, ξ, θ as parameters of the IVP, and define Γ = W, Λ Ξ Θ as the space of the parameters with the norm γ Γ = ϕ W, + λ Λ + ξ Ξ + θ Θ. We assume that these parameters or some of them are unknown, but values X, X,...,X l of the solution, xt, are available via measurements at discrete time values t, t,..., t l. The goal is to find the parameter value, which minimizes the least squares fit-to-data criterion l Jγ = xt i ; γ X i, i= where γ belongs to an admissible set contained in the parameter space Γ. Denote this problem by P. Since by H i t τt, xt, λ for t [, r ], it follows that on this interval 3 is equivalent to the statedependent delay differential equation ẋt = ft, xt, xt σt, xt, λ, ϕt τt, xt, ξ, θ. A result in [8] implies the existence of a unique solution of 3 on [, r ] or on a shorter interval. Repeating the argument successively on intervals [kr, k + r ] k N we get that there exists α > such that IVP 3-4 has a unique solution x on [, α]. Of course, if all Lipschitz constants in H H are global, then it is easy to argue that the unique solution exists on the whole interval [, T]. Lemma shows that both x and ẋ are Lipschitz continuous on [, α]. Lemma : Assume H H3, and let γ = ϕ, λ, ξ, θ Γ be fixed, and x be a solution of 3 corresponding to γ defined on a finite interval [, α]. Then there exist constants M = M α > and M 3 = M 3 α > such that and xt x t M t t, t, t [ r, α], ẋt ẋ t M 3 t t, a.e. t, t [ r, α]. Proof: Let M = max{ xt : t [, α]}, L i = L i M i =, 3, 4 be the Lipschitz constants from H and H, respectively. Assumption H implies ẋt ft, xt, xt σt, xt, λ, ẋt τt, xt, ξ, θ f,,,, θ + f,,,, θ L t + xt + xt σt, xt, λ + θ Θ +L ẋt τt, xt, ξ + f,,,, θ for a.e. t [, α]. Therefore there exists K > such that ẋt K + L ess sup{ ẋs : s [ r, t r ]}, which, using H3 and the method of steps, yields that there exists M > such that ẋt M for a.e. t [, α], hence x is Lipschitz continuous. This proves the first part of this lemma. To prove the second inequality, consider ẋt ẋ t = ft, xt, xt σt, xt, λ, ẋt τt, xt, ξ, θ f t, x t, x t σ t, x t, λ, ẋ t τ t, x t, ξ, θ L t t + xt x t + xt σt, xt, λ x t σ t, x t, λ +L ẋt τt, xt, ξ ẋ t τ t, x t, ξ L t t + M t t +M t t + M σt, xt, λ σ t, x t, λ +L ẋt τt, xt, ξ ẋ t τ t, x t, ξ. For t [, r ] it follows t τt, xt, ξ and t τ t, x t, ξ belong to [ r, ], therefore, using H3, we get ẋt ẋ t K t t + L L 5 t t +L L 5 τt, xt, ξ τ t, x t, ξ K + L 5 K t t, a.e. t, t [, r ], where K = L + M + M L 3 + M L 3 and K = L + L 4 + L 4 M. Similarly, for a.e. t, t [r, r ] we get ẋt ẋ t K + K K + L 5 K t t. Therefore, repeating these steps finitely many times, we get that there exists M 3 > satisfying the second part of the statement. We will use the following elementary estimate in the sequel. In the proof of the lemma and throughout this paper [ ] denotes the greatest integer function. Lemma : Let a, b, and g : [, α] [, and u : [ r, α] [, be monotone increasing functions satisfying ut a + gt + but r, t [, α] and u a. Then ut a+gt+b+b + +b m +b m a, where m = [α/r ]. Proof: The assumptions imply t [, α], ut a + gt + bu a + gt + ba, t [, r ]. Therefore, using the monotonicity of g and u, we get ut a + gt + bur a + gt + ba + gr + ba a + gt + b + b a, t [r, r ]. Then the lemma follows by induction.

III. A GENERAL PARAMETER ESTIMATION METHOD In this section we briefly recall a general method frequently used to identify parameters in various classes of differential equations see, e.g., [], [3], [], and also [] [7]. We will apply this framework for our IVP 3-4 in the next sections. The general method consists of the following steps: Step First take finite dimensional approximations of the parameters, γ N, i.e., γ N N Γ N Γ, dimγ N <, γ N γ as N. Consider a sequence of approximate IVPs corresponding to a discretization of IVP 3-4 for some fixed parameter γ N Γ N with solutions y M,N ; γ N satisfying y M,N t, γ N xt, γ as M, N, uniformly on compact time intervals, and γ N N. Step 3 Define the least square minimization problems P M,N : for each N, M =,,..., i.e., find γ M,N N Γ N, which minimizes the least squares fit-to-data criterion J M,N γ N = l y M,N t i ; γ N X i, γ N N. i= Often N is the projection of to Γ N, and we restrict our discussion to this case. Step 4 Assuming that is a compact subset of Γ, and the approximate solution, y M,N t; γ N, depends continuously on the parameter, γ N, we get, that J M,N is continuous for each M, N. Hence the finite dimensional minimization problems, P M,N, have a solution, γ M,N. Since γ M,N, the sequence γ M,N M, N =,,... has a convergent subsequence, say γ Mj,N j, with limit γ Γ. Step 5 It follows from that J Mj,N j γ Mj,N j J γ as j. Let γ be fixed, and let γ N γ satisfying Step. Then, in particular, γ Nj γ as j. Using that γ Mj,N j is a solution of P Mj,N j, implies J γ = lim j J M j,n j γ Mj,N j lim j J M j,n j γ Nj = Jγ, therefore γ is the solution of the minimization problem P. In practice we take large enough N and M, and use the solution of P M,N as an approximate solution of P. Note that Step 4 and 5 yield that the limit of any convergent subsequence of γ M,N is a solution of P with the same cost. It is possible that the minimizer of Jγ is not unique see, e.g., Example 5.4 in [6]. For results on identifiability of parameters, i.e., the uniqueness of the parameter minimizing the cost function Jγ for simpler classes of delay equations is discussed e.g., in [] and []. In our examples, we will use linear spline approximation to discretize the parameters ϕ, ξ and θ, in the case of nonconstant functions, in Step. In the next section we introduce a set of approximate IVPs corresponding to IVP 3-4 we use in, and show uniform convergence of the scheme, as required in and Step 4, respectively. IV. A PARAMETER ESTIMATION METHOD AND ITS THEORETICAL CONVERGENCE Throughout this section we will use the notation [t] h = [t/h]h, where [ ] is the greatest integer part function. The graph of the function [t] h can be seen in Figure. 6h 5h 4h 3h h h h h h h h h 3h 4h 5h 6h Fig.. It is easy to check that Graph of [t] h t h < [t] h t, t R, h >, 5 therefore [t] h t as h +, uniformly in t. A fractional part of a real number x is denoted by {x} = x [x]. Motivated by our earlier works [] [7], we now consider the approximating equation ẏ h,n t = f [t] h, y h,n [t] h, y h,n [t] h σ[t] h, y h,n [t] h, λ N, ẏ h,n [t] h τ[t] h, y h,n [t] h, ξ N, θ N 6 for t [, T], with the initial condition y h,n t = ϕ N t, t [ r, ]. 7 A solution of IVP 6-7 is a continuous function, satistying 6 for all t except at t = kh, k =,,.... It is easy to see that ẏ h,n is constant on the intervals [kh, k + h, therefore y h,n is a piecewise-linear continuous function for t. Integrating 6 from kh to t, where t [kh, k+h, and then taking a limit as t k + h it is easy to obtain the following recursive formula for the computation of the solution of IVP 6-7: Let ak = y h,n kh and bk = ẏ h,n kh. Then σ k = σkh, ak, λ N τ k = τkh, ak, ξ N [ σk ] { σk } u k = a k h [ h σk ] { σk } +a k [ h h τk ] { τk } v k = b k h [ h τk ] { τk } +b k h h bk + = fkh, ak, u k, v k, θ N ak + = ak + hbk + for k =,,...,[T/h] will define the sequence ak explicitly. Next we prove our main result about the convergence of this approximation method.

Theorem : Assume H H3, and that IVP 3-4 has a unique Lipschitz continuous solution, xt, on [ r, T]. Let γ N = ϕ N, λ N, ξ N, θ N Γ be such that γ γ N Γ as N. Then the solution, y h,n, of IVP 6-7 converges uniformly on [, T] to the solution, x, of IVP 3-4 as h + and N, i.e., lim h + N max xt y h,nt =. 8 tt Proof: Define M max{ λ Λ, ξ Ξ, θ Θ, max{ xt : t [ r, T]}} + ε for some ε >. We assume, without loss of generality, that N is large enough that ϕ N ϕ C < ε, λ N λ Λ < ε, ξ N ξ Ξ < ε, and θ N θ Θ < ε. Let < α h,n T be the largest number such that y h,n t < M for t [, α h,n. α h,n is well-defined since ϕ N < M by our assumptions. Substracting 6 from 3 and applying H with L = L M we get ẋt ẏ h,n t = f t, xt, xt σt, xt, λ, ẋt τt, xt, ξ, θ f [t] h, y h,n [t] h, y h,n [t] h σ[t] h, y h,n [t] h, λ N, ẏ h,n [t] h τ[t] h, y h,n [t] h, ξ N, θ N L h + xt y h,n [t] h + xt σt, xt, λ y h,n [t] h σ[t] h, y h,n [t] h, λ N + θ θ N θ + L ẋt τt, xt, ξ ẏ h,n [t] h τ[t] h, y h,n [t] h, ξ N. 9 Next we will estimate the terms on the right-hand side of 9 separately. Introduce the notation w h,n t := max{ xs y h,n s : r s t}. Then 5 and Lemma yield xt y h,n [t] h xt x[t] h + x[t] h y h,n [t] h M h + w h,n t. We have assumed that λ λ N Λ < ε and ξ ξ N Ξ < ε, therefore λ N Λ M and ξ N Ξ M. Let L 3 = L 3 M and L 4 = L 4 M the Lipschitz constants from H. Hence H ii, 5, Lemma and the monotonicity of w h,n yield xt σt, xt, λ y h,n [t] h σ[t] h, y h,n [t], λ N xt σt, xt, λ x[t] h σ[t] h, y h,n [t], λ N + x[t] h σ[t] h, y h,n [t], λ N y h,n [t] h σ[t] h, y h,n [t], λ N M h + σt, xt, λ σ[t] h, y h,n [t] h, λ N +w h,n [t] h σ[t] h, y h,n [t], λ N M h + L 3 h + L 3 xt y h,n [t] h +L 3 λ λ N Λ + w h,n t M + L 3 + L 3 M h + L 3 w h,n t +L 3 λ λ N Λ + w h,n t for t [, α h,n ]. Introduce z h,n t = ess sup{ ẋs ẏ h,n s : s [ r, t]}. Then, similarly to, it is easy to obtain ẋt τt, xt, ξ ẏ h,n [t] h τ[t] h, y h,n [t], ξ N M 3 h + L 4 h + L 4 M h + L 4 w h,n t + L 4 ξ ξ N Ξ +z h,n t r for a.e. t [, α h,n ]. Here we also used that r τ[t] h, y h,n [t] h, ξ N for t [, α h,n ] by H, and z h,n is monotone increasing. Combining 9,, and we get ẋt ẏ h,n [t] g h,n + K w h,n t + L z h,n t r 3 for a.e. t [, α], where g h,n = L + M + M L 3 + M L 3h + L M 3 + L 4 + L 4 M 4 h + L θ θ N Θ + L M L 3 λ λ N Λ + L M 3 L 4 ξ ξ N Ξ and K = L + M L 3 + L M 3 L 4. Since w h,n and z h,n are monotone increasing, 3 implies ẋs ẏ h,n [s] g h,n + K w h,n t +L z h,n t r for a.e. s t α h,n. On the other hand ẋs ẏ h,n [s] ϕ ϕ N W, for a.e. s [ r, ]. Therefore z h,n t g h,n + ϕ ϕ N W, +K w h,n t+l z h,n t r holds for all t [, α h,n ]. Then Lemma implies z h,n t K g h,n + ϕ ϕ N W, + K 3 w h,n t, 4 for t [, α h,n ], where K = + L + + L m, K 3 = K + L + + L m + L m and m = [α/r ]. Integrating 3 and 6 from to t and substracting the two equations, and using estimates 9,,, and 4 we get for t [, α h,n ] xt y h,n t ϕ ϕ N + f s, xs, xs σs, xs, λ, ẋs τs, xs, ξ, θ f [s] h, y h,n [s] h, y h,n [s] h σ[s] h, y h,n [s] h, λ N, ẏ h,n [s] h τ[s] h, y h,n [s] h, ξ N, θ N ds ϕ ϕ N W, + αg h,n + K w h,n sds +L z h,n s r ds G h,n + K 4 w h,n sds, 5 where G h,n = ϕ ϕ N W, +αg h,n +L K g h,n + ϕ ϕ N W, α and K 4 = K +L K 3. Since xt y h,n t G h,n for t [ r, ], 5 implies w h,n t G h,n + K 4 w h,n sds, t [, α h,n ].

Hence Gronwall s inequality yields w h,n t G h,n e K4α, t [, α h,n ]. Clearly, G h,n as h +, N, hence max{ xs y h,n s : r s α h,n } as h +, N. Consequently α h,n = T for small enough h and large enough N, and the statement of the theorem follows..8.6.4. Step Step xt.8.6.8.4..4.6.8..4.6.8 θt Fig.. Estimation of θt: N = 6, h =.5 Step Step V. NUMERICAL EXAMPLES In this section we present some numerical examples to illustrate our identification method. The general method is the following: consider an IVP with unknown parameters. If the parameters are infinite dimensional, use linear spline approximation of the parameters. Then, for a fixed small h >, consider IVP 6-7, and solve the corresponding finite dimensional least-square minimization problem, P h,n see Step 3 in Section. If h is small and N is large, use the solution of P h,n as an approximate solution of the identification method. To solve P h,n, we used a nonlinear least square minimization code, based on a secant method with Dennis-Gay- Welsch update, combined with a trust region technique. See Section.3 in [6] for detailed description of this method. Example : Consider the SD-NFDE ẋt = ẋ t t t + 4 xt + θt, t [, ], 6 and the associated initial condition xt = 4 t +, t. 7 In this example the unknown parameter is the function θt in the right-hand-side of 6. It is easy to check that the solution of IVP 6-7, corresponding to θt = 8 t + is xt = 4 t +. We used this solution to generate measurements X i = xt i at t i =.i, i =,...,, and considered a 6-dimensional linear spline approximation of θ on [, ]. Figure displays the first 3 steps of the numerical solution of the corresponding finite dimensional minimization problem P.5,6 the discretization step h =.5 starting from the constant initial parameter value θ t =. On the right hand side of Figure the first three iterates of the finite dimensional minimization method and the true parameter value solid line can be seen. The figure shows that the iterates converge to the true parameter value θt. On the left the measurements circles and the numerical solutions of IVP 6-7 corresponding to these parameter values are plotted. Example : Consider again the SD-NFDE investigated in Example, where the time dependent coefficient ξ of the state-dependent delay function is a parameter to be identified: ẋt = ẋ t ξt xt + 8 t +, t [, ]. 8 We associate initial condition 7 to the equation. The solution of IVP 8-7 corresponding to ξt = t t +4 equals to that of the previous example, so we use the same measurements here. In this numerical run we employ an -dimensional spline approximation of ξ with h =.5. Figure 3 shows the first four iterates of the solution of the corresponding finite dimensional minimization problem. We can see that the fourth iterate of ξt is close to the true parameter ξt..3...9 Step Step Step 3 xt.8..4.6.8.8.6.4. ξt Step Step Step 3..4.6.8 Fig. 3. Estimation of ξt: N =, h =.5 Example 3: Consider again the SD-NFDE investigated in Example, where this time an other part of the delay, a constant ξ R in 9 is the unknown parameter: ẋt = ẋ t t t + 4 xt ξ + 8 t +, t [, ]. 9 The associated initial condition is again 7. The solution of 9 corresponding to ξ = is again to that of Example, so we use the same measurements. The parameter is onedimensional, so now we discretize only the equation. The first 5 steps of the iterates of ξ starting from ξ = 5 initial guess and the corresponding least-square cost are listed in Table I for step-sizes h =.,.5 and., respectively. In Figure 4 the measurements and the solutions corresponding to the first 4 parameter values are plotted. We can see good recovery of the parameter. Example 4: Consider again the SD-NFDE investigated in the previous examples: ẋt = ẋ t t t + 4 xt + 8 t +, t [, ], with unknown initial condition of the form { ϕt, t [ r, ] xt = ϕ r, t < r.

TABLE I h =. h =.5 h =. i J h ξ i J h ξ i J h ξ i 7.737 5. 7.6358 5. 6.77848 5..34889.86.34365.8344.38.8443.683.95.595.6.47.54 3.475.9837.43.63.347.4 4..956..9765..9958 5..958..9759..995.5.5 xt Step Step.5 Step 3..4.6.8 Fig. 4. Estimation of ξ: h =.5 As we have seen before, the solution corresponding to initial function ϕt = 4 t + with r = equals to xt = 4 t +. We use again the measurements of Example. The main difficulty in this example is that the exact initial interval, i.e., r = min{t t t +4 xt : t [, ]} depends on the solution. Our numerical results show that if r is selected large enough, then at the first few node points the initial guess of the spline approximation of the initial function is not updated during the iteration. Therefore we pick large enough r, execute the minimization routine, and locate the last node point where the initial guess for the spline is not modified. Then changing r to this value and repeating the run we can find a good approximation of r and the initial function. For similar examples and more detailed discussions we refer the reader to [4] and [7]. In Figure 4 we plotted the first 3 steps of the numerical solution of the finite dimensional minimization problem corresponding to an N = 5 dimensional approximation of the initial function on the initial interval [.5, ] and the discretization step h =.5. The second iteration already shows a really good recovery of the initial function. This run suggests that r <.5..5.5 Step Step xt..4.6.8.5.5 φt Step Step.5.5 Fig. 5. Estimation of ϕt: N = 5, h =.5 VI. ACKNOWLEDGMENTS This research was supported in part by Hungarian National Science Foundation under grants no. OTKA T4699 F.H.. REFERENCES [] H. T. Banks, J. A. Burns and E. M. Cliff, Parameter estimation and identification for systems with delays, SIAM J. Control and Optimization, vol. 9 no. 6, 98, pp 79 88. [] H. T. Banks and K. Kunisch, Estimation Techniques for Distributed Parameter Systems, Birkhäuser, 989. [3] H. T. Banks and P. K. Daniel Lamm, Estimation of delays and other parameters in nonlinear functional differential equations, SIAM J. Control and Optimization, vol. no. 6, 983, pp 895 95. [4] A. Bellen and M. Zennaro, Numerical methods for delay differential equations, Numerical Mathematics and Scientific Computation, Clarendon Press, Oxford University Press, New York, 3. [5] J. A. Burns and P. D. Hirsch, A difference equation approach to parameter estimation for differential-delay equations, Applied Mathematics and Computation, vol. 7, 98, pp 8 3. [6] J. E. Dennis and R. B. Schnabel, Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Prentice-Hall, 983. [7] R. D. Driver, A neutral system with state-dependent delay, J. Diff. Eqns., vol. 54, 984, pp 73 86. [8] L. J. Grimm, Existence and continuous dependence for a class of nonlinear neutral-differential equations, Proc. Amer. Math. Soc., vol. 9 no. 3, 97, pp 467 473. [9] I. Győri, On approximation of the solutions of delay differential equations by using piecewise constant arguments, Internat. J. of Math. & Math. Sci., vol. 4 no., 99, pp 6. [] I. Győri, F. Hartung and J. Turi, On numerical approximations for a class of differential equations with time- and state-dependent delays, Applied Math. Letters, vol. 8 no. 6, 995, pp 9 4. [] J. K. Hale and M. A. Cruz, Existence, uniqueness and continuous dependence for hereditary systems, Ann. Mat. Pura Appl., vol. 85, 97, pp 63 8. [] F. Hartung, T. L. Herdman and J. Turi, Identifications of parameters in hereditary systems, Proceedings of ASME Fifteenth Biennial Conference on Mechanical Vibration and Noise, Boston, Massachusetts, September 995, DE-Vol 84-3, Vol.3, Part C, 6 66. [3] F. Hartung, T. L. Herdman and J. Turi, Identifications of parameters in hereditary systems: a numerical study, Proceedings of the 3rd IEEE Mediterranean Symposium on New Directions in Control and Automation, Cyprus, July 995, 9 98. [4] F. Hartung, T. L. Herdman, and J. Turi, Parameter identification in classes of hereditary systems of neutral type, Appl. Math. and Comp., vol. 4, 997, pp 393 49. [5] F. Hartung, T. L. Herdman, and J. Turi, On existence, uniqueness and numerical approximation for neutral equations with state-dependent delays, Appl. Numer. Math. vol. 4, 997, pp 393 49. [6] F. Hartung, T. L. Herdman, and J. Turi, Parameter identification in classes of neutral differential equations with state-dependent delays, J. Nonlinear Analysis: Theory, Methods and Applications vol. 39,, pp 35 35. [7] F. Hartung and J. Turi, Identification of Parameters in Delay Equations with State-Dependent Delays, J. Nonlinear Analysis: Theory, Methods and Applications, vol 9 no., 997, pp 33 38. [8] K. Ito and F. Kappel, Approximation of semilinear Cauchy problems, Nonlin. Anal. TMA, vol. 4, 995, pp 5 8. [9] Z. Jackiewicz, Existence and uniqueness of neutral delay-differential equations with state dependent delays, Funkcialaj Ekvacioj, vol. 3, 987, pp 9 7. [] K. A. Murphy, Estimation of time- and state-dependent delays and other parameters in functional differential equations, SIAM J. Appl. Math., vol. 5 no. 4, 99, pp 97. [] S. Nakagiri and M. Yamamoto, Identifiability of linear retarded systems in Banach spaces, Funkcialaj Ekvacioj, vol. 3, 988, pp 35 39.