Validating an A Priori Enclosure Using. High-Order Taylor Series. George F. Corliss and Robert Rihm. Abstract
|
|
- Noah Ball
- 6 years ago
- Views:
Transcription
1 Validating an A Priori Enclosure Using High-Order Taylor Series George F. Corliss and Robert Rihm Abstract We use Taylor series plus an enclosure of the remainder term to validate the existence of a unique solution for initial value problems in ordinary dierential equations and to compute a coarse enclosure of that solution. The signicance of this result is its application to Lohner's AWA algorithm for validated solutions, not to the theory of ordinary dierential equations. By using high-order Taylor series in Lohner's Algorithm I, we are able to validate the solution over much longer time steps than is done in the current AWA code. For Lohner's enclosure by polynomials, the enclosures are expensive to compute, but it is easy to check for enclosure. For our enclosure by Taylor series, the enclosures are free because they are already being computed, but checking for enclosure requires 2 n polynomial rootndings. Work is continuing on an implementation that will allow direct computational comparisons of the eectiveness of the two methods. Keywords: ordinary dierential equations, Lohner's algorithm, validated computation, Taylor series, enclosure methods. Introduction The AWA (Anfangswertaufgabe) program by Rudolf Lohner [4, 5, 6, 7, 8] computes an enclosure of the solution of an initial value problem (IVP) in ordinary dierential equations (ODE) u = f(u); u(t) = u; (1) where we only know an interval enclosure [u] of the vector u in general. Without loss of generality, Lohner assumes the system is autonomous only to simplify the proofs. We assume that f is at least p? 1 times continuously dierentiable in a domain D with [u] D IR n, p 2. Then there is a unique at least p times continuously dierentiable solution u(t) in a neighborhood of t. AWA is a single-step method. At each integration time step, AWA applies two algorithms: Algorithm I: (Existence and enclosure) Find a step size h and a coarse enclosure interval [u ] D such that for t 2 [t] := [t; t + h], the solution u(t) exists and satises u(t) 2 [u ].
2 2 George F. Corliss and Robert Rihm Algorithm II: (Tightening) Compute a tight enclosure for u(t) at t = t1 := t + h. Throughout this paper, we use the term \validation" to mean \prove existence of u(t) for some t and nd a coarse enclosure [u ]". The eciency of AWA has been limited by the Euler step size enforced by Algorithm I as used in the current program. We show that Taylor series plus an enclosure of the remainder term can be used not only in Algorithm II to tighten the enclosure, but also in Algorithm I for the validation step. The consequence of this result for AWA is that Algorithm I can validate the existence of the unique solution over time steps appropriate for high-order methods employed for tightening during Algorithm II. The basic idea of AWA is to enclose the Taylor coecients and the remainder term of the solution. It goes back to Moore who presented his method in 1965 (see [1, 11]). The Taylor coecients are computed using recurrence relations derived from the ODE: f () (u) := f(u); (u) := u; f (i?1) (u) f (u) ; i = 1; 2; : : :; p? 1 ; (u) i := 1 i f(i?1) (u); i = 1; 2; : : :; p : (2) The recurrences given by Equation (2) are not as intimidating as they might appear; this is just an expression of the computation of the Taylor coecients for the solution. They can be evaluated by using automatic dierentiation (see e.g. [12]). If we begin the recurrences given by Equation (2) with the initial value u and compute in exact arithmetic, we get the Taylor coecients (u) i for the solution expanded at t = t. If we begin the recurrences given by Equation (2) with an interval vector [u] and compute in rounded interval arithmetic, then we get enclosures ([u]) i of the Taylor coecients for all solutions starting from u 2 [u]. We can also begin with a coarse interval [u ] and compute the interval vectors ([u ]) i. Then (b t? t ) p ([u ]) p contains the remainder of the p? 1st degree Taylor polynomial of u(b t), if u(t) 2 [u ](t) for all t 2 [t ;b t]. We emphasize that the computation of these values does not pre-suppose the existence of a solution. We are just computing sequences of numbers. If we cannot compute any of these values, then we are not able to proceed with validation. However, if we know an a priori enclosure [u ] of the solution on [t], then p?1 u(t) 2 (t? t) i (u) i + (t? t) p ([u ]) p =: T p (t; u; [u ]) or p?1 u(t) 2 (t? t) i ([u]) i + (t? t) p ([u ]) p = T p (t; [u]; [u ]), resp. (3)
3 Validating an A Priori Enclosure 3 for t 2 [t], if only the interval polynomial T p stays in [u ]. Moore as well as Lohner use (modications of) this formula to tighten an a priori enclosure [u ] (see e.g. [13]). 1 Current AWA Approach Validation and the computation of a tight enclosure are separate, though related, issues. This paper addresses only the issue of validation, the role of Lohner's Algorithm I. The techniques of his Algorithm II for tightening the enclosure are discussed in [4, 5, 6, 7, 8]. Algorithm I uses the following theorem for validation. Theorem 1 ([6]) Let [u ] D be an interval vector satisfying [u 1 ] := u + [; h] f? [u ] [u ] : Then u(t) 2 [u 1 ] (and hence u(t) 2 [u ]) for t 2 [t] = [t; t + h]. It follows directly from Theorem 2 Let [u](t) and [v](t) D be interval vector valued functions, and let each p times continuously dierentiable function v(t) 2 [v](t) satisfy Z t (v(t)) := u + for t 2 [t]. Then the solution u of Equation (1) satises for t 2 [t]. t f(v()) d 2 [u](t) [v](t) (4) u(t) 2 [u](t) Proof: If (4) holds and we start a Picard-Lindelof iteration Z t u (k) (t) = (u (k?1) (t)) = u + t f(u (k?1) ()) d ; k = 1; 2; : : : with a p times dierentiable function u () (t) 2 [v](t), then every successor is again p times dierentiable and lies in [u](t). However, the sequence of Picard iterates should leave this interval function if the solution did so.
4 4 George F. Corliss and Robert Rihm It seems strange to let v(t) be p times dierentiable. However, this assumption is used in the following section. AWA nds a step size h and an interval [u ] such that [u ] [u 1 ] := [u] + [; h]f? [u ]? [u ] ; (5) for all t 2 [t] := [t; t+h], and hence validates that the solution of Equation (1) exists on [t] and is contained in [u ]. Figure 1 shows the a priori bound [u ] = [:2; :5] and ([u ]) for the logistic equation u = u(1? u), u() = :3, on the interval t 2 [; :6]. In this gure, ([u ]) [u ] in the interval t 2 [; :5]. If we tighten [u ] = [:29; :5], then ([u ]) [u ] in the larger interval t 2 [; :563] u t Figure 1. A priori bounds with [u ] = [:2; :5]. 2 Lohner's Enclosure of u (p) The allowable step size h for which validation can be done using Theorem 1 as described in Section 1 is limited to a step appropriate for Euler's method, no matter how high the order of the method used during Algorithm II to tighten the enclosure. Stetter showed in [14] that for the problem u = Au, A 2 IR nn, the step size h obtained by applying Theorem 1 may be multiplied by the degree p of the Taylor
5 Validating an A Priori Enclosure 5 polynomial used in Algorithm II. Algorithm II yields a validated tight enclosure for t = t + ph because p!([u ]) p = A p [u ] contains the p-th derivative u (p) (t) for all t 2 [t; t + ph], even though [u ] does not enclose the solution on this enlarged interval, in general. Lohner [9] suggests using coarse enclosures for higher derivatives also in the general case. Actually, he uses Theorem 2 instead of Theorem 1 and a special kind of interval polynomials for [v](t) instead of a constant coarse enclosure as in the current AWA program. Lohner guesses an enclosure [v ] of u (p) (t)=p! satisfying p?1 [v](t) := (t? t) i (u) i + (t? t) p [v ] D: The Picard-Lindelof operator reproduces the Taylor coecients of the exact solution. There is an interval vector [v 1 ] such that each p times dierentiable function v(t) 2 [v](t) satises p?1 (v(t)) 2 [u](t) := (t? t) i (u) i + (t? t) p [v 1 ]: If [v 1 ] [v ] holds, then we also have [u](t) 2 [v](t), and according to Theorem 2, u(t) 2 [u](t). To obtain [v 1 ], one has to compute an enclosure of the remainder coecient of the p? 2nd degree Taylor polynomial of f(v(t)) for all p times dierentiable functions v(t) 2 [v](t). It also contains the remainder coecient of the p? 1st degree Taylor polynomial of (v(t)). For computing or enclosing these coecients on a computer, one has to apply polynomial interval machine arithmetic given by Eiermann [3], which provides the enclosure of a xed number of Taylor coecients of standard operations and standard functions on interval polynomials as well as the enclosure of the respective remainders. The advantage of this idea of Lohner over the validation strategy discussed in Section 1 is that validation is possible for step sizes appropriate for a method of local order p. Example 1 The solution of the initial value problem u =?u; u() = 1 satises u(t) = e?t 2 [; 1] for t. However, the application of Theorem 1 for [u ] = [; 1] requires a step size 1 since u + [; h]f([u ]) [u ], 1 + [; h](?[; 1]) [; 1], h 1:
6 6 George F. Corliss and Robert Rihm However, Lohner's approach yields validation for much longer steps. p = 6 and [v ] = [; 1], we get If we choose [v](t) = 1? t + t2 2? t3 6 + t4 24? t t6 [; 1]; 72 f([v](t)) =?[v](t)?1 + t? t2 2 + t3 6? t t5 12 [1? h ; 1]; and 6 [u](t) = ([v](t)) = 1? t + t2 2? t3 6 + t4 24? t t6 72 [1? h 6 ; 1] for t 2 [t; t + h]. We have [1? h 6 ; 1] [v ] = [; 1], h 6 : Of course, we could enclose the sixth Taylor coecient of f instead of the fth one to obtain h = 7. However, in general we only assume f to be p? 1 times dierentiable. In this example, the coecients of f(v(t)) can easily be calculated. However, there is no implementation of the method for the general case yet, although Lohner has described [9] such an implementation using the Eiermann operators for interval polynomial arithmetic. 3 Validated Enclosure Using Taylor Series The use of Taylor series for validation, as well as for tight enclosure, is suggested by pictures such as those in Figure 2, which shows Taylor series enclosures for the solution of the Lorenz system t
7 Validating an A Priori Enclosure t t Figure 2. Taylor Series Enclosures for the Solution of the Lorenz System. As already mentioned, AWA uses the recurrence relations (2) and the formula (3) for computing a tight enclosure in Algorithm II after having validated a coarse enclosure [u ] for a step size h in Algorithm I. It would cause no additional costs if the Taylor expansion (3) could also be used in Algorithm I. The following theorem shows that this can actually be done. Theorem 3 Let u 2 int([u ]) D. Let for t 2 [t]. Then p?1 [u](t) := (t? t) i (u) i + (t? t) p ([u ]) p [u ] ; (6) u(t) 2 [u](t) for t 2 [t] : Proof: It follows from our assumptions that Equation (1) has a solution u in some neighborhood of the point (t; u), for every u 2 [u]. We must prove that that neighborhood includes all of [t]. If (6) holds, then u(t) 2 [u](t) as long as u(t) 2 [u ].
8 8 George F. Corliss and Robert Rihm Assume that u(t) leaves [u](t) =: [u(t); u(t)], and hence [u ] at b t 2 int([t ]). Without loss of generality, we assume u j (b t) = uj (b t) = sup[u ]j, for some j 2 f1; : : :; ng. From u (p) (t) 2 p!([u ]) p, it follows that p?2 u (t) 2 (t? t) i (u) i + (t? t) p?1 p([u ]) p ; and hence u (t) u (t) on [t;b t]. Therefore, uj (b t) = uj (b t) implies uj (t) = u j (t) for all t 2 [t;b t]. If uj is constant, then we have u = u j (b t) = sup[u ]j, which contradicts the assumption u 2 int([u ]). Otherwise, u j (b t) is an isolated maximum of the p-th degree polynomial u j. The same holds for u j (t), since this function is at least p times continuously dierentiable in [t]. Hence, u(t) cannot leave [u](t) at b t. This approach avoids complicated calculations and nevertheless takes the order p into account. With p = 6, we can validate the coarse enclosure [; 1] in Example 1 for h = 2:1, compared with h = 1 for a constant bound enclosure and h = 6 using Lohner's polynomial enclosure. Example 2 We want to validate the solution u(t) = 1=t of the initial value problem u =?u 2 ; u(1) = 1 in the interval [u ] = [; 2]. For the constant bound enclosure, we have [u 1 ] := 1 + [; h](?[; 2] 2 ) = [1? 4h; 1] [u ], h 1=4 as the maximal step size we can reach by applying Theorem 1. However, the approach of this section for p = 2 yields a longer step: [u](t) = 1? (t? 1) + [; 8](t? 1) 2 [; 2], h 1 + p Implications for AWA Using the results of the previous section, AWA Algorithm I is :42 : Task 1: Approximate solution. Compute Taylor coecients of an approximate solution p?1 bu(t) := (t? t) i (u) i from recurrence relation (2). In practice, we must compute (u) i using rounded interval arithmetic to capture any round-o errors. The work of Task 1 is already being done in AWA Algorithm II.
9 Validating an A Priori Enclosure 9 Task 2: Guess a step h. Use heuristics based on the radius of convergence [1] of the truncated series for bu or on previous steps sizes. Task 3: Guess a constant enclosure [u ]. Bound the range of bu([t; t+h]), and inate it a little. Task 4: Compute the remainder terms ([u ]) i, for i = ; : : : ; p from the recurrence relation (2). The work of Task 4 is already being done in AWA Algorithm II. Task 5: Compute stepsize for validation. The stepsize is the point nearest to t (and in [t]) at which p?1 [u](t) := (t? t) i (u) i + (t? t) p ([u ]) p leaves [u ]. This requires 2 n polynomial rootndings. For each polynomial rootnding problem, it is sucient to compute only relatively coarse lower bounds for the smallest real root in the interval (t; t + h], so a few iterations of a simplied interval Newton method should suce. Remark. Variable order. We must compute ([u ]), : : :, ([u ]) p?1 in order to compute ([u ]) p. Hence, it is relatively inexpensive to compute the step size in Task 5 for each order p. The order used for validation in Algorithm I can be dierent from the order used for tightening in Algorithm II. The information is readily available to make both Algorithms I and II fully variable order. Remark. Iteration. If Task 5 nds that [u](t) [u ] on [t], then we can repeat Tasks 4 and 5 with a larger h or else with [u ] = [u]([t]). Remark. Optimization. Given guesses for h from Task 2 and for [u ] from Task 3, we compute in Task 5 the largest step for which we can validate existence and containment. Numerical experiments have shown [2] that a carefully chosen [u ] allows step sizes 1 times as long as step sizes corresponding to [u ] given by reasonable heuristics. That suggests viewing Algorithm I as an optimization problem: Maximize step size h by varying guessed h and [u ] p?1 subject to [u](t) := (t? t) i (u) i + (t? t) p ([u ]) p [u ] Remark. Eectiveness. Either Lohner's enclosure by polynomials or our enclosure by Taylor series is signicantly more expensive than Picard-Lindelof iteration of constant bounds currently used by AWA. However, AWA Algorithm II involves the solution of an ODE system of dimension n n, so almost any eort we expend in Algorithm I that allows AWA to take longer steps improves the overall eciency of AWA.
10 1 George F. Corliss and Robert Rihm Remark. Which is better? For Lohner's enclosure by polynomials, the enclosures are expensive to compute, but it is easy to check for enclosure. For our enclosure by Taylor series, the enclosures are free because they are already being computed, but checking for enclosure requires 2n polynomial rootndings. Work is continuing on an implementation that will allow direct computational comparisons of the eectiveness of the two methods. Acknowledgments We thank the anonymous referee for helpful suggestions. The work of Corliss was supported in part by National Science Foundation Grant No. DMS{ and in part by SUN Academic Equipment Grant No. EDUD{US{9428. References [1] Y. F. Chang and G. Corliss, Solving Ordinary Dierential Equations Using Taylor Series, ACM Trans. Math. Software, 8(1982), 114{144. [2] G. Corliss, Validating an A Priori Enclosure Using High-Order Taylor Series, presented at SCAN '95, Wuppertal, [3] M. Ch. Eiermann, Adaptive Berechnung von Integraltransformationen mit Fehlerschranken, PhD thesis, Universitat Freiburg, [4] R. J. Lohner, Anfangswertaufgaben im IR n mit kompakten Mengen fur Anfangswerte und Parameter, Diplomarbeit, Inst. f. Angew. Math., Universitat Karlsruhe, [5] R. J. Lohner, Enclosing the Solutions of Ordinary Initial and Boundary Value Problems, in Computer Arithmetic: Scientic Computation and Programming Languages, E. W. Kaucher, U. Kulisch, and C. Ullrich, eds., Wiley-Teubner Series in Computer Science, Stuttgart, 1987, pp. 255{286. [6] R. J. Lohner, Einschlieung der Losung gewohnlicher Anfangs{ und Randwertaufgaben und Anwendungen, PhD thesis, Universitat Karlsruhe, [7] R. J. Lohner, Interval Arithmetic in Staggered Correction Format, in Scientic Computing with Automatic Result Verication, E. Adams and U. Kulisch, eds., Academic Press, San Diego, [8] R. J. Lohner, On Step Size and Order Control in the Veried Solution of Ordinary Initial Value Problems, presented at SCAN '93, September 1993, Vienna.
11 Validating an A Priori Enclosure 11 [9] R. J. Lohner, Step Size and Order Control in the Veried Solution of IVP with ODE's, presented at the SciCADE '95 International Conference on Scientic Computation and Dierential Equations, Stanford, Calif., March 28 { April 1, [1] R. E. Moore, The Automatic Analysis and Control of Error in Digital Computation Based on the Use of Interval Numbers, in Error in Digital Computation, Vol. I, L. B. Rall, ed., John Wiley and Sons, New York, 1965, pp. 61{13. [11] R. E. Moore, Interval Analysis, Prentice-Hall, Englewood Clis, N.J., [12] L. B. Rall, Automatic Dierentiation: Techniques and Applications, vol. 12 of Lecture Notes in Computer Science, Springer Verlag, Berlin, [13] R. Rihm, Interval Methods for Initial Value Problems in ODEs, in Topics in Validated Computations, J. Herzberger, ed., Elsevier Science B.V., Amsterdam, 1994, pp. 173{27. [14] H. J. Stetter, Validated Solution of Initial Value Problems for ODE, in Computer Arithmetic and Self-Validating Numerical Methods Ch. Ullrich, ed., Academic Press, San Diego, 199, pp. 171{186. Addresses: G.F. Corliss, Marquette University, Department of Mathematics, Statistics, and Computer Science, P.O. Box 1881 Milwaukee, Wisconsin , USA. georgec@mscs.mu.edu R. Rihm, Universitat Karlsruhe, Institut fur Angewandte Mathematik, Karlsruhe, Germany. robert.rihm@math.uni-karlsruhe.de
Geometric Series Bounds for the Local Errors of Taylor Methods for Linear n-th Order ODEs
Appeared in: Alefeld, G., Rohn, J., Rump, S., Yamamoto, T. (eds): Symbolic Algebraic Methods and Verification Methods, pp. 183 193. Springer, Wien, 2001. Geometric Series Bounds for the Local Errors of
More informationOn the existence of an eigenvalue below the essential spectrum
On the existence of an eigenvalue below the essential spectrum B.M.Brown, D.K.R.M c Cormack Department of Computer Science, Cardiff University of Wales, Cardiff, PO Box 916, Cardiff CF2 3XF, U.K. A. Zettl
More informationIntegrating ODE's in the Complex Plane-Pole Vaulting
MATHEMATICS OF COMPUTATION, VOLUME 35, NUMBER 152 OCTOBER 1980, PAGES 1181-1189 Integrating ODE's in the Complex Plane-Pole Vaulting By George F. Corliss Abstract. Most existing algorithms for solving
More informationInterval Methods and Taylor Model Methods for ODEs
Interval Methods and Taylor Model Methods for ODEs Markus Neher, Dept. of Mathematics KARLSRUHE INSTITUTE OF TECHNOLOGY (KIT) 0 TM VII, Key West KIT University of the State of Baden-Wuerttemberg and Interval
More informationPropagation of Uncertainties in Nonlinear Dynamic Models
Propagation of Uncertainties in Nonlinear Dynamic Models Youdong Lin 1, Scott Ferson 2, George F. Corliss 3 and Mark A. Stadtherr 1 1 Department of Chemical and Biomolecular Engineering, University of
More informationVerified Calculation of the Nodes and Weights for Gaussian Quadrature Formulas
Interval Computations No 4, 1993 Verified Calculation of the Nodes and Weights for Gaussian Quadrature Formulas Ulrike Storck Using Gaussian Quadrature for the verified calculation of an integral assumes
More informationOn a Unied Representation of Some Interval Analytic. Dedicated to the professors of mathematics. L. Berg, W. Engel, G. Pazderski, and H.- W. Stolle.
Rostock. Math. Kolloq. 49, 75{88 (995) Subject lassication (AMS) 65F5, 65G, 65H Gunter Mayer On a Unied Representation of Some Interval Analytic Algorithms Dedicated to the professors of mathematics L.
More informationOptimization of Rational Approximations by Continued Fractions
Bergische Universität Wuppertal Optimization of Rational Approximations by Continued Fractions Frithjof Blomquist Preprint BUW-WRSWT 2006/3 Wissenschaftliches Rechnen/ Softwaretechnologie Impressum Herausgeber:
More informationINTERVAL MATHEMATICS TECHNIQUES FOR CONTROL THEORY COMPUTATIONS
INTERVAL MATHEMATICS TECHNIQUES FOR CONTROL THEORY COMPUTATIONS R. Baker Kearfott Department of Mathematics University of Southwestern Louisiana Lafayette, Louisiana 70504-1010 1 Introduction and motivation
More informationValue Problem for an Ordinary Differential Equation. Nedialko Stoyanov Nedialkov. A thesis submitted in conformity with the requirements
Computing Rigorous Bounds on the Solution of an Initial Value Problem for an Ordinary Differential Equation by Nedialko Stoyanov Nedialkov A thesis submitted in conformity with the requirements for the
More informationD0 D1 s(t0,d0,t1) D2 s(t1,d1,t2)
Consistency Techniques in Ordinary Dierential Equations? Yves Deville 1,Micha Janssen 1,Pascal Van Hentenryck 2 1 Universite catholique de Louvain, Pl. Ste Barbe 2, B-1348 Louvain-la-Neuve, Belgium 2 Brown
More informationON EXPLICIT INTERVAL METHODS OF ADAMS-BASHFORTH TYPE
COMPUTATIONAL METHODS IN SCIENCE AND TECHNOLOGY 8 (2), 46-57 (2002) ON EXPLICIT INTERVAL METHODS OF ADAMS-BASHFORTH TYPE MAŁGORZATA JANKOWSKA 1, ANDRZEJ MARCINIAK 1, 2 1 Poznań University of Technology,
More informationValidated Solutions of Initial Value Problems for Parametric ODEs
Validated Solutions of Initial Value Problems for Parametric ODEs Youdong Lin and Mark A. Stadtherr Department of Chemical and Biomolecular Engineering University of Notre Dame, Notre Dame, IN 46556, USA
More informationEXISTENCE VERIFICATION FOR SINGULAR ZEROS OF REAL NONLINEAR SYSTEMS
EXISTENCE VERIFICATION FOR SINGULAR ZEROS OF REAL NONLINEAR SYSTEMS JIANWEI DIAN AND R BAKER KEARFOTT Abstract Traditional computational fixed point theorems, such as the Kantorovich theorem (made rigorous
More informationOur goal is to solve a general constant coecient linear second order. this way but that will not always happen). Once we have y 1, it will always
October 5 Relevant reading: Section 2.1, 2.2, 2.3 and 2.4 Our goal is to solve a general constant coecient linear second order ODE a d2 y dt + bdy + cy = g (t) 2 dt where a, b, c are constants and a 0.
More informationW. Kramer, U. Kulisch, R. Lohner. Numerical Toolbox. for Veried Computing II. Advanced Numerical Problems
W. Kramer, U. Kulisch, R. Lohner Numerical Toolbox for Veried Computing II Advanced Numerical Problems This is a draftversion which still contains errors. i Preface To L. Kronecker we owe the remark, \God
More information9 Linear Interpolation and Estimation using Interval Analysis
9 Linear Interpolation and Estimation using Interval Analysis S. M. Markov and E. D. Popova 1 ABSTRACT This chapter considers interpolation and curve tting using generalized polynomials under bounded measurement
More informationA Finite Element Method for an Ill-Posed Problem. Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D Halle, Abstract
A Finite Element Method for an Ill-Posed Problem W. Lucht Martin-Luther-Universitat, Fachbereich Mathematik/Informatik,Postfach 8, D-699 Halle, Germany Abstract For an ill-posed problem which has its origin
More informationTaylor series based nite dierence approximations of higher-degree derivatives
Journal of Computational and Applied Mathematics 54 (3) 5 4 www.elsevier.com/locate/cam Taylor series based nite dierence approximations of higher-degree derivatives Ishtiaq Rasool Khan a;b;, Ryoji Ohba
More informationThe Algebraic Multigrid Projection for Eigenvalue Problems; Backrotations and Multigrid Fixed Points. Sorin Costiner and Shlomo Ta'asan
The Algebraic Multigrid Projection for Eigenvalue Problems; Backrotations and Multigrid Fixed Points Sorin Costiner and Shlomo Ta'asan Department of Applied Mathematics and Computer Science The Weizmann
More informationON TAYLOR MODEL BASED INTEGRATION OF ODES
ON TAYLOR MODEL BASED INTEGRATION OF ODES M. NEHER, K. R. JACKSON, AND N. S. NEDIALKOV Abstract. Interval methods for verified integration of initial value problems (IVPs for ODEs have been used for more
More informationRatio-Like and Recurrence Relation Tests for Convergence of Series
J. Inst. Maths Applies (1980) 25,349-359 Ratio-Like and Recurrence Relation Tests for Convergence of Series Y. F. CHANG AND G. CORLISS Department of Computer Science, University of Nebraska, Lincoln, Nebraska
More informationODEs and Redefining the Concept of Elementary Functions
ODEs and Redefining the Concept of Elementary Functions Alexander Gofen The Smith-Kettlewell Eye Research Institute, 2318 Fillmore St., San Francisco, CA 94102, USA galex@ski.org, www.ski.org/gofen Abstract.
More informationSpurious Chaotic Solutions of Dierential. Equations. Sigitas Keras. September Department of Applied Mathematics and Theoretical Physics
UNIVERSITY OF CAMBRIDGE Numerical Analysis Reports Spurious Chaotic Solutions of Dierential Equations Sigitas Keras DAMTP 994/NA6 September 994 Department of Applied Mathematics and Theoretical Physics
More information16.7 Multistep, Multivalue, and Predictor-Corrector Methods
740 Chapter 16. Integration of Ordinary Differential Equations 16.7 Multistep, Multivalue, and Predictor-Corrector Methods The terms multistepand multivaluedescribe two different ways of implementing essentially
More informationIMPLICIT INTERVAL MULTISTEP METHODS FOR SOLVING THE INITIAL VALUE PROBLEM
COMPUTATIONAL METHODS IN SCIENCE AND TECHNOLOGY 8 (1), 17-30 (2002) IMPLICIT INTERVAL MULTISTEP METHODS FOR SOLVING THE INITIAL VALUE PROBLEM MAŁGORZATA JANKOWSKA 1, ANDRZEJ MARCINIAK 1,2 1 Poznań University
More informationAutomatica, 33(9): , September 1997.
A Parallel Algorithm for Principal nth Roots of Matrices C. K. Koc and M. _ Inceoglu Abstract An iterative algorithm for computing the principal nth root of a positive denite matrix is presented. The algorithm
More informationDistributed computation of the number. of points on an elliptic curve
Distributed computation of the number of points on an elliptic curve over a nite prime eld Johannes Buchmann, Volker Muller, Victor Shoup SFB 124{TP D5 Report 03/95 27th April 1995 Johannes Buchmann, Volker
More informationOctober 7, :8 WSPC/WS-IJWMIP paper. Polynomial functions are renable
International Journal of Wavelets, Multiresolution and Information Processing c World Scientic Publishing Company Polynomial functions are renable Henning Thielemann Institut für Informatik Martin-Luther-Universität
More informationApplied Mathematics &Optimization
Appl Math Optim 29: 211-222 (1994) Applied Mathematics &Optimization c 1994 Springer-Verlag New Yor Inc. An Algorithm for Finding the Chebyshev Center of a Convex Polyhedron 1 N.D.Botin and V.L.Turova-Botina
More informationVerified Global Optimization with Taylor Model based Range Bounders
Verified Global Optimization with Taylor Model based Range Bounders KYOKO MAKINO and MARTIN BERZ Department of Physics and Astronomy Michigan State University East Lansing, MI 88 USA makino@msu.edu, berz@msu.edu
More informationOptimal Preconditioners for Interval Gauss Seidel Methods
Optimal Preconditioners for Interval Gauss Seidel Methods R B Kearfott and Xiaofa Shi Introduction Consider the following nonlinear system f 1 x 1, x 2,, x n ) F X) f n x 1, x 2,, x n ) where bounds x
More informationUNIVERSITÄT KARLSRUHE
UNIVERSITÄT KARLSRUHE Computing Slope Enclosures by Exploiting a Unique Point of Inflection Marco Schnurr Preprint Nr. 07/08 Institut für Wissenschaftliches Rechnen und Mathematische Modellbildung z W
More informationRigorous numerical computation of polynomial differential equations over unbounded domains
Rigorous numerical computation of polynomial differential equations over unbounded domains Olivier Bournez 1, Daniel S. Graça 2,3, Amaury Pouly 1,2 1 Ecole Polytechnique, LIX, 91128 Palaiseau Cedex, France
More informationCONSTRUCTIVE APPROXIMATION 2001 Springer-Verlag New York Inc.
Constr. Approx. (2001) 17: 267 274 DOI: 10.1007/s003650010021 CONSTRUCTIVE APPROXIMATION 2001 Springer-Verlag New York Inc. Faber Polynomials Corresponding to Rational Exterior Mapping Functions J. Liesen
More informationCentro de Processamento de Dados, Universidade Federal do Rio Grande do Sul,
A COMPARISON OF ACCELERATION TECHNIQUES APPLIED TO THE METHOD RUDNEI DIAS DA CUNHA Computing Laboratory, University of Kent at Canterbury, U.K. Centro de Processamento de Dados, Universidade Federal do
More information16.7 Multistep, Multivalue, and Predictor-Corrector Methods
16.7 Multistep, Multivalue, and Predictor-Corrector Methods 747 } free_vector(ysav,1,nv); free_vector(yerr,1,nv); free_vector(x,1,kmaxx); free_vector(err,1,kmaxx); free_matrix(dfdy,1,nv,1,nv); free_vector(dfdx,1,nv);
More informationNumerical Results on the Transcendence of Constants. David H. Bailey 275{281
Numerical Results on the Transcendence of Constants Involving e, and Euler's Constant David H. Bailey February 27, 1987 Ref: Mathematics of Computation, vol. 50, no. 181 (Jan. 1988), pg. 275{281 Abstract
More informationSecond Order ODEs. CSCC51H- Numerical Approx, Int and ODEs p.130/177
Second Order ODEs Often physical or biological systems are best described by second or higher-order ODEs. That is, second or higher order derivatives appear in the mathematical model of the system. For
More informationNumerical Integration exact integration is not needed to achieve the optimal convergence rate of nite element solutions ([, 9, 11], and Chapter 7). In
Chapter 6 Numerical Integration 6.1 Introduction After transformation to a canonical element,typical integrals in the element stiness or mass matrices (cf. (5.5.8)) have the forms Q = T ( )N s Nt det(j
More informationEnclosure Methods. G. Alefeld Institut für Angewandte Mathematik Universität Karlsruhe Federal Republic of Germany
Enclosure Methods G. Alefeld Institut für Angewandte Mathematik Universität Karlsruhe Federal Republic of Germany Abstract: We present an overview on existing methods for inc1uding the range of functions
More informationINRIA Rocquencourt, Le Chesnay Cedex (France) y Dept. of Mathematics, North Carolina State University, Raleigh NC USA
Nonlinear Observer Design using Implicit System Descriptions D. von Wissel, R. Nikoukhah, S. L. Campbell y and F. Delebecque INRIA Rocquencourt, 78 Le Chesnay Cedex (France) y Dept. of Mathematics, North
More informationArbitrary Accuracy with Variable Precision Arithmetic
Arbitrary Accuracy with Variable Precision Arithmetic Fritz Kruckeberg Gesellschaft fur Mathematik und Datenverarbeitung mbh (GMD) Summary For the calculation of interval-solutions Y including the true
More informationButterworth Filter Properties
OpenStax-CNX module: m693 Butterworth Filter Properties C. Sidney Burrus This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 3. This section develops the properties
More informationInvestigation of a Subdivision Based Algorithm. for Solving Systems of Polynomial Equations. University of Applied Sciences / FH Konstanz
to appear in the Proceedings of the 3rd World Congress of Nonlinear Analysts (WCNA 000), Catania, Sicily, Italy, July 9{6, 000, as a series of the Journal of Nonlinear Analysis Investigation of a Subdivision
More informationFROM EQUILIBRIUM TO CHAOS
FROM EQUILIBRIUM TO CHAOS Practica! Bifurcation and Stability Analysis RÜDIGER SEYDEL Institut für Angewandte Mathematik und Statistik University of Würzburg Würzburg, Federal Republic of Germany ELSEVIER
More informationComputation of the Bernstein Coecients on Subdivided. are computed directly from the coecients on the subdivided triangle from the
Computation of the Bernstein Coecients on Subdivided riangles Ralf Hungerbuhler Fakultat fur Mathematik und Informatik, Universitat Konstanz, Postfach 5560 D 97, D{78434 Konstanz, Germany Jurgen Garlo
More informationUsing an Extension of Z. Viktor Friesen. Technische Universitat Berlin
An Exercise in Hybrid System Specication Using an Extension of Z Extended Abstract Viktor Friesen Technische Universitat Berlin Abstract. The main concepts of ZimOO are illustrated by a small case study,
More informationParallel Iterations for Cholesky and Rohn s Methods for Solving over Determined Linear Interval Systems
Research Journal of Mathematics and Statistics 2(3): 86-90, 2010 ISSN: 2040-7505 Maxwell Scientific Organization, 2010 Submitted Date: January 23, 2010 Accepted Date: February 11, 2010 Published Date:
More information15 Nonlinear Equations and Zero-Finders
15 Nonlinear Equations and Zero-Finders This lecture describes several methods for the solution of nonlinear equations. In particular, we will discuss the computation of zeros of nonlinear functions f(x).
More informationNumerical analysis meets number theory: using rootfinding methods to calculate inverses mod p n
Numerical analysis meets number theory: using rootfinding methods to calculate inverses mod p n This article is dedicated to the memory of George Mackiw June 7, 2004 Introduction In this article we explore
More informationAIMS Exercise Set # 1
AIMS Exercise Set #. Determine the form of the single precision floating point arithmetic used in the computers at AIMS. What is the largest number that can be accurately represented? What is the smallest
More informationModule 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction
Module 6 : Solving Ordinary Differential Equations - Initial Value Problems (ODE-IVPs) Section 1 : Introduction 1 Introduction In this module, we develop solution techniques for numerically solving ordinary
More informationSeries Solutions Near an Ordinary Point
Series Solutions Near an Ordinary Point MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Spring 2018 Ordinary Points (1 of 2) Consider the second order linear homogeneous
More informationNUMERICAL SOLUTION OF ODE IVPs. Overview
NUMERICAL SOLUTION OF ODE IVPs 1 Quick review of direction fields Overview 2 A reminder about and 3 Important test: Is the ODE initial value problem? 4 Fundamental concepts: Euler s Method 5 Fundamental
More informationFinite Differences: Consistency, Stability and Convergence
Finite Differences: Consistency, Stability and Convergence Varun Shankar March, 06 Introduction Now that we have tackled our first space-time PDE, we will take a quick detour from presenting new FD methods,
More informationStructural Grobner Basis. Bernd Sturmfels and Markus Wiegelmann TR May Department of Mathematics, UC Berkeley.
I 1947 Center St. Suite 600 Berkeley, California 94704-1198 (510) 643-9153 FAX (510) 643-7684 INTERNATIONAL COMPUTER SCIENCE INSTITUTE Structural Grobner Basis Detection Bernd Sturmfels and Markus Wiegelmann
More informationCounterexamples to witness conjectures. Notations Let E be the set of admissible constant expressions built up from Z; + ;?;;/; exp and log. Here a co
Counterexamples to witness conjectures Joris van der Hoeven D pt. de Math matiques (b t. 45) Universit Paris-Sud 91405 Orsay CEDEX France August 15, 003 Consider the class of exp-log constants, which is
More informationOn the Computational Procedure of Solving Boundary Value Problems of Class M Using the Power Series Method
Australian Journal of Basic and Applied Sciences, 4(6): 1007-1014, 2010 ISSN 1991-8178 On the Computational Procedure of Solving Boundary Value Problems of Class M Using the Power Series Method 1 2 E.A.
More informationCONSISTENCY TECHNIQUES FOR SIMULATION OF WASTEWATER TREATMENT PROCESSES WITH UNCERTAINTIES
CONSISTENCY TECHNIQUES FOR SIMULATION OF WASTEWATER TREATMENT PROCESSES WITH UNCERTAINTIES Marco Kletting Andreas Rauh Harald Aschemann Eberhard P. Hofer University of Ulm Department of Measurement, Control,
More informationt x 0.25
Journal of ELECTRICAL ENGINEERING, VOL. 52, NO. /s, 2, 48{52 COMPARISON OF BROYDEN AND NEWTON METHODS FOR SOLVING NONLINEAR PARABOLIC EQUATIONS Ivan Cimrak If the time discretization of a nonlinear parabolic
More informationNovel Approach to Analysis of Nonlinear Recursions. 1 Department of Physics, Bar-Ilan University, Ramat-Gan, ISRAEL
Novel Approach to Analysis of Nonlinear Recursions G.Berkolaiko 1 2, S. Rabinovich 1,S.Havlin 1 1 Department of Physics, Bar-Ilan University, 529 Ramat-Gan, ISRAEL 2 Department of Mathematics, Voronezh
More informationFachrichtung 6.1 Mathematik
Universität des Saarlandes U N I V E R S I T A S S A R A V I E N I S S Fachrichtung 6.1 Mathematik Preprint Nr. A note on splitting-type variational problems with subquadratic growth Dominic reit Saarbrücken
More informationreality is complex process
ISS0080 Automation and Process Control Lecture 5 1 Process models the desire to describe reality Model of the process, model simplication, identication. model reality is complex process Replaces the original;
More informationDeterministic Global Optimization for Dynamic Systems Using Interval Analysis
Deterministic Global Optimization for Dynamic Systems Using Interval Analysis Youdong Lin and Mark A. Stadtherr Department of Chemical and Biomolecular Engineering University of Notre Dame, Notre Dame,
More informationNumerical Methods. King Saud University
Numerical Methods King Saud University Aims In this lecture, we will... find the approximate solutions of derivative (first- and second-order) and antiderivative (definite integral only). Numerical Differentiation
More informationAN INTERVAL METHOD FOR INITIAL VALUE PROBLEMS IN LINEAR ORDINARY DIFFERENTIAL EQUATIONS
AN INTERVAL METHOD FOR INITIAL VALUE PROBLEMS IN LINEAR ORDINARY DIFFERENTIAL EQUATIONS NEDIALKO S. NEDIALKOV Abstract. Interval numerical methods for initial value problems (IVPs) for ordinary differential
More informationFor δa E, this motivates the definition of the Bauer-Skeel condition number ([2], [3], [14], [15])
LAA 278, pp.2-32, 998 STRUCTURED PERTURBATIONS AND SYMMETRIC MATRICES SIEGFRIED M. RUMP Abstract. For a given n by n matrix the ratio between the componentwise distance to the nearest singular matrix and
More informationAn average case analysis of a dierential attack. on a class of SP-networks. Distributed Systems Technology Centre, and
An average case analysis of a dierential attack on a class of SP-networks Luke O'Connor Distributed Systems Technology Centre, and Information Security Research Center, QUT Brisbane, Australia Abstract
More informationCalculation of maximum entropy densities with application to income distribution
Journal of Econometrics 115 (2003) 347 354 www.elsevier.com/locate/econbase Calculation of maximum entropy densities with application to income distribution Ximing Wu Department of Agricultural and Resource
More informationIntegration of Ordinary Differential Equations
Integration of Ordinary Differential Equations Com S 477/577 Nov 7, 00 1 Introduction The solution of differential equations is an important problem that arises in a host of areas. Many differential equations
More informationMathematical Constraint on Functions with Continuous Second Partial Derivatives
1 Mathematical Constraint on Functions with Continuous Second Partial Derivatives J.D. Franson Physics Department, University of Maryland, Baltimore County, Baltimore, MD 15 Abstract A new integral identity
More informationBounds for nonlinear eigenvalue problems
USA-Chile Workshop on Nonlinear Analysis, Electron. J. Diff. Eqns., Conf. 6, 21, pp. 23 27 http://ejde.math.swt.edu or http://ejde.math.unt.edu ftp ejde.math.swt.edu or ejde.math.unt.edu (login: ftp) Bounds
More informationEuler s Method applied to the control of switched systems
Euler s Method applied to the control of switched systems FORMATS 2017 - Berlin Laurent Fribourg 1 September 6, 2017 1 LSV - CNRS & ENS Cachan L. Fribourg Euler s method and switched systems September
More informationON THE DIAMETER OF THE ATTRACTOR OF AN IFS Serge Dubuc Raouf Hamzaoui Abstract We investigate methods for the evaluation of the diameter of the attrac
ON THE DIAMETER OF THE ATTRACTOR OF AN IFS Serge Dubuc Raouf Hamzaoui Abstract We investigate methods for the evaluation of the diameter of the attractor of an IFS. We propose an upper bound for the diameter
More informationAN EFFECTIVE COMPLEX PERMITTIVITY FOR WAVES IN RANDOM MEDIA WITH FINITE WAVELENGTH LYUBIMA B. SIMEONOVA, DAVID C. DOBSON, OLAKUNLE ESO, AND KENNETH M. GOLDEN y Abstract. When we consider wave propagation
More informationTetrational as special function
Tetrational as special function Dmitrii Kouznetsov, Inst.for Laser Science, Univ.of Electro Communications, Japan 8 íîÿáðÿ 9 ã. Àííîòàöèÿ Holomorphic tetrational (superexponential) to base e and its inverse
More informationOUTLINE 1. Introduction 1.1 Notation 1.2 Special matrices 2. Gaussian Elimination 2.1 Vector and matrix norms 2.2 Finite precision arithmetic 2.3 Fact
Computational Linear Algebra Course: (MATH: 6800, CSCI: 6800) Semester: Fall 1998 Instructors: { Joseph E. Flaherty, aherje@cs.rpi.edu { Franklin T. Luk, luk@cs.rpi.edu { Wesley Turner, turnerw@cs.rpi.edu
More information460 HOLGER DETTE AND WILLIAM J STUDDEN order to examine how a given design behaves in the model g` with respect to the D-optimality criterion one uses
Statistica Sinica 5(1995), 459-473 OPTIMAL DESIGNS FOR POLYNOMIAL REGRESSION WHEN THE DEGREE IS NOT KNOWN Holger Dette and William J Studden Technische Universitat Dresden and Purdue University Abstract:
More informationReview of Power Series
Review of Power Series MATH 365 Ordinary Differential Equations J. Robert Buchanan Department of Mathematics Fall 2018 Introduction In addition to the techniques we have studied so far, we may use power
More informationDiscrete Projection Methods for Incompressible Fluid Flow Problems and Application to a Fluid-Structure Interaction
Discrete Projection Methods for Incompressible Fluid Flow Problems and Application to a Fluid-Structure Interaction Problem Jörg-M. Sautter Mathematisches Institut, Universität Düsseldorf, Germany, sautter@am.uni-duesseldorf.de
More informationbelow, kernel PCA Eigenvectors, and linear combinations thereof. For the cases where the pre-image does exist, we can provide a means of constructing
Kernel PCA Pattern Reconstruction via Approximate Pre-Images Bernhard Scholkopf, Sebastian Mika, Alex Smola, Gunnar Ratsch, & Klaus-Robert Muller GMD FIRST, Rudower Chaussee 5, 12489 Berlin, Germany fbs,
More informationValidated Explicit and Implicit Runge-Kutta Methods
Validated Explicit and Implicit Runge-Kutta Methods Alexandre Chapoutot joint work with Julien Alexandre dit Sandretto and Olivier Mullier U2IS, ENSTA ParisTech 8th Small Workshop on Interval Methods,
More informationUniquely 2-list colorable graphs
Discrete Applied Mathematics 119 (2002) 217 225 Uniquely 2-list colorable graphs Y.G. Ganjali a;b, M. Ghebleh a;b, H. Hajiabolhassan a;b;, M. Mirzazadeh a;b, B.S. Sadjad a;b a Institute for Studies in
More informationFilter Banks with Variable System Delay. Georgia Institute of Technology. Atlanta, GA Abstract
A General Formulation for Modulated Perfect Reconstruction Filter Banks with Variable System Delay Gerald Schuller and Mark J T Smith Digital Signal Processing Laboratory School of Electrical Engineering
More information1. Introduction Bottom-Up-Heapsort is a variant of the classical Heapsort algorithm due to Williams ([Wi64]) and Floyd ([F64]) and was rst presented i
A Tight Lower Bound for the Worst Case of Bottom-Up-Heapsort 1 by Rudolf Fleischer 2 Keywords : heapsort, bottom-up-heapsort, tight lower bound ABSTRACT Bottom-Up-Heapsort is a variant of Heapsort. Its
More informationInstitute for Advanced Computer Studies. Department of Computer Science. On the Convergence of. Multipoint Iterations. G. W. Stewart y.
University of Maryland Institute for Advanced Computer Studies Department of Computer Science College Park TR{93{10 TR{3030 On the Convergence of Multipoint Iterations G. W. Stewart y February, 1993 Reviseed,
More informationMath 1270 Honors ODE I Fall, 2008 Class notes # 14. x 0 = F (x; y) y 0 = G (x; y) u 0 = au + bv = cu + dv
Math 1270 Honors ODE I Fall, 2008 Class notes # 1 We have learned how to study nonlinear systems x 0 = F (x; y) y 0 = G (x; y) (1) by linearizing around equilibrium points. If (x 0 ; y 0 ) is an equilibrium
More informationChapter 5 Exercises. (a) Determine the best possible Lipschitz constant for this function over 2 u <. u (t) = log(u(t)), u(0) = 2.
Chapter 5 Exercises From: Finite Difference Methods for Ordinary and Partial Differential Equations by R. J. LeVeque, SIAM, 2007. http://www.amath.washington.edu/ rjl/fdmbook Exercise 5. (Uniqueness for
More informationTOWARDS AUTOMATED CHAOS VERIFICATION
TOWARDS AUTOMATED CHAOS VERIFICATION SARAH DAY CDSNS, Georgia Institute of Technology, Atlanta, GA 30332 OLIVER JUNGE Institute for Mathematics, University of Paderborn, 33100 Paderborn, Germany KONSTANTIN
More informationSupport Vector Regression with Automatic Accuracy Control B. Scholkopf y, P. Bartlett, A. Smola y,r.williamson FEIT/RSISE, Australian National University, Canberra, Australia y GMD FIRST, Rudower Chaussee
More informationExtended Runge Kutta-like formulae
Applied Numerical Mathematics 56 006 584 605 www.elsevier.com/locate/apnum Extended Runge Kutta-like formulae Xinyuan Wu a Jianlin Xia b a State Key Laboratory for Novel Software Technology Department
More information(1.) For any subset P S we denote by L(P ) the abelian group of integral relations between elements of P, i.e. L(P ) := ker Z P! span Z P S S : For ea
Torsion of dierentials on toric varieties Klaus Altmann Institut fur reine Mathematik, Humboldt-Universitat zu Berlin Ziegelstr. 13a, D-10099 Berlin, Germany. E-mail: altmann@mathematik.hu-berlin.de Abstract
More informationOrdinary Differential Equations
CHAPTER 8 Ordinary Differential Equations 8.1. Introduction My section 8.1 will cover the material in sections 8.1 and 8.2 in the book. Read the book sections on your own. I don t like the order of things
More informationJournal of Computational and Applied Mathematics
Journal of Computational Applied Mathematics 236 (212) 3174 3185 Contents lists available at SciVerse ScienceDirect Journal of Computational Applied Mathematics journal homepage: wwwelseviercom/locate/cam
More informationDevelopment of a New One-Step Scheme for the Solution of Initial Value Problem (IVP) in Ordinary Differential Equations
International Journal of Theoretical and Applied Mathematics 2017; 3(2): 58-63 http://www.sciencepublishinggroup.com/j/ijtam doi: 10.11648/j.ijtam.20170302.12 Development of a New One-Step Scheme for the
More informationIn Advances in Neural Information Processing Systems 6. J. D. Cowan, G. Tesauro and. Convergence of Indirect Adaptive. Andrew G.
In Advances in Neural Information Processing Systems 6. J. D. Cowan, G. Tesauro and J. Alspector, (Eds.). Morgan Kaufmann Publishers, San Fancisco, CA. 1994. Convergence of Indirect Adaptive Asynchronous
More informationKrylov Subspace Methods for the Evaluation of Matrix Functions. Applications and Algorithms
Krylov Subspace Methods for the Evaluation of Matrix Functions. Applications and Algorithms 2. First Results and Algorithms Michael Eiermann Institut für Numerische Mathematik und Optimierung Technische
More informationcells [20]. CAs exhibit three notable features, namely massive parallelism, locality of cellular interactions, and simplicity of basic components (cel
I. Rechenberg, and H.-P. Schwefel (eds.), pages 950-959, 1996. Copyright Springer-Verlag 1996. Co-evolving Parallel Random Number Generators Moshe Sipper 1 and Marco Tomassini 2 1 Logic Systems Laboratory,
More informationThe Hopf bifurcation with bounded noise
The Hopf bifurcation with bounded noise Ryan T. Botts 1, Ale Jan Homburg 2,3, and Todd R. Young 4 1 Department of Mathematical, Information & Computer Sciences, Point Loma Nazarene University, 3900 Lomaland
More information