Blow-up collocation solutions of nonlinear homogeneous Volterra integral equations

Size: px
Start display at page:

Download "Blow-up collocation solutions of nonlinear homogeneous Volterra integral equations"

Transcription

1 Blow-up collocation solutions of nonlinear homogeneous Volterra integral equations R. Benítez 1,, V. J. Bolós 2, 1 Dpto. Matemáticas, Centro Universitario de Plasencia, Universidad de Extremadura. Avda. Virgen del Puerto 2, 16 Plasencia (Cáceres), Spain. rbenitez@unex.es 2 Dpto. Matemáticas para la Economía la Empresa, Facultad de Economía, Universidad de Valencia. Avda. Tarongers s/n, 4622 Valencia, Spain. vicente.bolos@uv.es Ma 211 (Revised: December 214) Abstract In this paper, collocation methods are used for detecting blow-up solutions of nonlinear homogeneous Volterra-Hammerstein integral equations. To do this, we introduce the concept of blow-up collocation solution and analze numericall some blow-up time estimates using collocation methods in particular examples where previous results about existence and uniqueness can be applied. Finall, we discuss the relationships between necessar conditions for blow-up of collocation solutions and exact solutions. 1 Introduction Some engineering and industrial problems are described b explosive phenomena which are modeled b nonlinear integral equations whose solutions exhibit blow-up at finite time (see [1, 2] and references therein). Man authors have studied necessar and sufficient conditions for the existence of a such blow-up time. Particularl, in [3 9], equation (t) = t K (t, s) G ( (s)) ds, t I = [, ˆt [ (1) was considered. In these works, conditions for the existence of a finite blow-up time, as well as upper and lower estimates of it, were given, although the were not ver accurate in some cases. A wa for improving these estimations is to stud numerical approximations of the solution; in this aspect, collocation methods have proven to be a ver suitable technique for approximating nonlinear integral equations, because of its stabilit and accurac (see [1]). Hence, the aim of this paper is to test the usefulness of collocation methods for detecting blow-up solutions of the nonlinear homogeneous Volterra-Hammerstein integral equation (HVHIE) given b equation (1). Work supported b project MTM28-546, Spain. 1

2 Ver recentl, Yang and Brunner [11] analzed the blow-up behavior of collocation solutions for a similar Hammerstein-Volterra integral equation with a convolution kernel (t) = φ(t) + t K(t s)g(s, (s))ds, t I. (2) Equation (1) should not be regarded as a particular case of (2) (for a convolution kernel), because in [11] a positive non-homogeneit φ and a Lipschitz-continuous nonlinearit G were considered. Indeed, under the hpotheses on the kernel and the nonlinearit considered in [11], it is well-known that equation (1) has onl the trivial solution ( ) and moreover, under the conditions we shall state in Section 3, the collocation equations given in [11] lead to the trivial sequence ( n = for all n N). Thus, equation (1) considered here is beond the scope of the standard techniques, which usuall impose conditions that guarantee the uniqueness of the solutions. An approach for solving this problem, which we shall follow in this paper, is writing equation (1) as an implicitl linear homogeneous Volterra integral equation (HVIE), i.e. setting z = G and plugging it into the nonlinear integral equation (1) to obtain ( t ) z(t) = G ((Vz) (t)) = G K (t, s) z(s) ds, t I, (3) being V the linear Volterra operator. There is a one-to-one correspondence between solutions of (1) and (3) (see [1, 12]), in particular, if z is a solution of (3), then := Vz is a solution of (1). This paper is structured as follows: in Section 2 we introduce briefl the basic definitions and state the notation. Next, we devote Section 3 to generalize the results about existence and uniqueness of nontrivial collocation solutions obtained in [13] in order to appl the results to blow-up problems. In Section 4, we introduce the concept of blow-up collocation solution and analze numericall some blow-up time estimates using collocation methods in particular examples where the previous results about existence and uniqueness can be applied. Finall, in Section 5, we discuss the relationships between necessar conditions for blow-up of collocation solutions and exact solutions. 2 Collocation problems for implicitl linear HVIEs Following the notation of [1], a collocation problem for equation (3) in I = [, T ] is given b a mesh I h := {t n : = t < t 1 <... < t N = T } and a set of m collocation parameters c 1 <... < c m 1. We denote h n := t n+1 t n, n =,..., N 1, and the quantit h := max {h n : n =,... N 1} is the diameter of I h. Moreover, the collocation points are given b t n,i := t n + c i h n, i = 1,..., m, and the set of collocation points is denoted b X h (see [1, 15]). A collocation solution z h is then given b the collocation equation ( t ) z h (t) = G K (t, s) z h (s) ds, t X h, where z h is in the space of piecewise polnomials of degree less than m. From now on, a collocation problem or a collocation solution will be alwas referred to the implicitl linear HVIE (3). So, if we want to obtain an estimation of a solution of the nonlinear HVHIE (1), then we have to consider h := Vz h. At the beginning of Section 4, we define the concepts of blow-up collocation problems and blow-up collocation solutions. To do this, we extend the definition of collocation In [1, 13], the diameter h is also called stepsize. Here, in order to emphasize the variabilit of the stepsizes, we shall not follow this notation for preventing misunderstandings. Moreover, in the algorithms presented in Section 4.1, the initial stepsize h is set equal to h, but in successive iterations the stepsizes ma decrease. 2

3 solution to meshes I h with infinite points. Taking this into account, it is noteworth that if z h is a blow-up collocation solution, then h also blows up at the same blow-up time. As it is stated in [1], a collocation solution z h is completel determined b the coefficients Z n,i := z h (t n,i ), for n =,..., N 1 and i = 1,..., m, since z h (t n + vh n ) = m j=1 L j (v) Z n,j for all v ], 1], where L 1 (v) := 1, L j (v) := m v c k k j c j c k, for j = 2,..., m, are the Lagrange fundamental polnomials with respect to the collocation parameters. The values of Z n,i are given b the sstem where and Z n,i = G F n (t n,i ) + h n B n (i, j) := ci F n (t) := The term F n (t n,i ) is called the lag term. m j=1 B n (i, j) Z n,j, (4) K (t n,i, t n + sh n ) L j (s) ds tn K (t, s) z h (s) ds. (5) 3 Existence and uniqueness of nontrivial collocation solutions In [13], we used collocation methods for approximating the nontrivial solutions of (1). In particular, we studied the collocation solutions of the implicitl linear HVIE (3), under the assumption that some general conditions were held. Specificall, it was required that the kernel K was a locall bounded function; nevertheless, non locall bounded kernels, e.g. weakl singular kernels, appear in man cases of blow-up solutions (see [7, 14]) and so, in the present work, we shall first replace this condition with another not excluding this kind of kernels. Hence, the general conditions that we are going to impose (even if the are not explicitl mentioned) are: Over K. The kernel K : R 2 [, + [ has its support in { (t, s) R 2 : s t }. For ever t >, the map s K (t, s) is locall integrable, and K(t) := t K (t, s) ds t is a strictl increasing function. Moreover, lim t a + a K (t, s) ds = for all a. Note that for convolution kernels (i.e. K(t, s) = k(t s)) this last condition is alwas held, because k is locall integrable and then lim t a + t a k(t s) ds = lim t a + t a k(s) ds = lim t + t k(s) ds =. Over G. The nonlinearit G : [, + [ [, + [ is a continuous, strictl increasing function, and G() =. Note that, since G is injective, the solution of equation (1) is also given b = G 1 z, where z is a solution of (3). Also, since G() =, the zero function is alwas a solution of both equations (1) and (3), called trivial solution. Moreover, for convolution kernels, given a solution z(t) of (3), an horizontal translation of z, z c (t) defined b {, if t < c z c (t) = z(t c) if t c, This last condition is new with respect to those given in [13], and replaces the locall boundedness condition. 3

4 is also a solution of (3) (see [13,16,17]). Motivated b this fact we give the next definitions, that are also valid for nonconvolution kernels: Definition 3.1. We sa that a propert P holds near zero if there exists ɛ > such that P holds on ], δ[ for all < δ < ɛ. On the other hand, we sa that P holds awa from zero if there exists τ > such that P holds on ]t, + [ for all t > τ. The concept awa from zero was originall defined in a more restrictive wa in [13]; nevertheless both definitions are appropriate for our purposes. Definition 3.2. We sa that a solution of (3) is nontrivial if it is not identicall zero near zero. Moreover, given a collocation problem, we sa that a collocation solution is nontrivial if it is not identicall zero in ]t, t 1 ]. Given a kernel K, a nonlinearit G and some collocation parameters {c 1,..., c m }, in [13] there were defined three kinds of existence of nontrivial collocation solutions (of the corresponding collocation problem) in an interval I = [, T ] using a mesh I h : existence near zero, existence for fine meshes, and unconditional existence. For these two last kinds of existence, it is ensured the existence of nontrivial collocation solutions in an interval, and hence, there is no blow-up. On the other hand, existence near zero is equivalent to the existence of a nontrivial collocation solution with adaptive stepsize, as it is defined in [11]. In this case, collocation solutions can alwas be extended a little more, but it is not ensured the existence of nontrivial collocation solutions for arbitrar large T and, thus, it can blow up in finite time. For the sake of clarit and readabilit, let us recall the definition of existence near zero given in [13]: Definition 3.3. We sa that there is existence near zero if there exists H > such that if < h H then there are nontrivial collocation solutions in [, t 1 ]; moreover, there exists H n > such that if < h n H n then there are nontrivial collocation solutions in [, t n+1 ] (for n = 1,..., N 1 and given h,..., h n 1 > such that there are nontrivial collocation solutions in [, t n ]). Note that, in general, H n depends on h,..., h n 1. As in [13], we shall restrict our analsis to two particular cases of collocation problems, namel: Case 1: m = 1 with c 1 >. Case 2: m = 2 with c 1 =. In these cases, sstem (4) is reduced to a single nonlinear equation, whose solution is given b the fixed points of G (α + β) for some α, β. Determining conditions for the existence of collocation solutions in the general case is a problem of an overwhelming difficult. In fact, in [13] examples of equations for which, in cases 1 and 2, there existed nontrivial collocation solutions, et in some other cases, for the same equation, there were no nontrivial collocation solutions, were given. The proofs of the results obtained in [13] rel on the locall boundedness of the kernel K. Therefore, we will revise such proofs, imposing the new general conditions given at the beginning of this section, and avoiding other hpotheses that turn out to be unnecessar. For example, we extend these results to decreasing convolution kernels, among others. From the previous work [13], we quote a lemma on nonlinearities G satisfing the general conditions: Lemma 3.1. The following statements are equivalent to the statement that G() (in ], + [): is unbounded (i) There exists β > such that G (β) has nonzero fixed points for all < β β. (ii) Given A, there exists β A > such that G (α + β) has nonzero fixed points for all α A and for all < β β A. 4

5 3.1 Case 1: m = 1 with c 1 > First, we shall consider m = 1 with c 1 >. Equations (4) are then reduced to where Z n,1 = G (F n (t n,1 ) + h n B n Z n,1 ), n =,..., N 1, (6) B n := B n (1, 1) = c1 K (t n,1, t n + sh n ) ds (7) and the lag terms F n (t n,1 ) are given b (5) with i = 1. Note that B n > because the integrand in (7) is strictl positive almost everwhere in ], c 1 [. Remark 3.1. In [13], it is ensured that lim hn + h nb n = taking into account (7) and the old general conditions imposed over K. Thus, we must ensure that the limit also vanishes considering the new general conditions. In fact, with a change of variable, we can express (7) as B n = 1 tn,1 K (t n,1, s) ds. (8) h n t n Hence, b (8) and the new condition, we have since t n,1 = t n + c 1 h n. t lim h nb n = lim K (t, s) ds =, h n + t t + n t n Now, we are in position to give a characterization of the existence near zero of nontrivial collocation solutions: Proposition 3.1. There is existence near zero if and onl if G() is unbounded. Proof. ( ) Let us prove that if G() is unbounded, then there is existence near zero. So, we are going to prove b induction over n that there exist H n >, for n =,..., N 1, such that if < h n H n then there exist solutions of the sstem (6) with Z n,1 > : For n =, taking into account Remark 3.1 and Lemma 3.1-(i), we choose a small enough H > such that < h B β for all < h H. So, since the lag term is, we can appl Lemma 3.1-(i) to the equation (6), concluding that there exist strictl positive solutions for Z,1. Let us suppose that, choosing one of those Z,1 and given n >, there exist H 1,..., H n 1 > such that if < h i H i with i = 1,..., n 1, then there exist coefficients Z 1,1,..., Z n 1,1 fulfilling the equation (6). Note that these coefficients are strictl positive, and hence, it is guaranteed that the corresponding collocation solution z h is (strictl) positive in ], t n ]. Finall, we are going to prove that there exists H n > such that if < h n H n then there exists Z n,1 > fulfilling the equation (6) with the previous coefficients Z,1,... Z n 1,1 : Let us define A := max {F n (t n + c 1 ɛ) : ɛ 1}. Note that A exists because s K (t, s) is locall integrable for all t >, and z h is bounded in [, t n ]; hence, F n, given b (5), is bounded in [t n, t n + c 1 ]. Moreover, A because K and z h are positive functions. So, appling Lemma 3.1-(ii), there exists β A > such that G (α + β) has positive fixed points for all α A and for all < β β A. On one hand, taking into 5

6 account Remark 3.1, we choose a small enough < H n 1 such that < h n B n β A for all < h n H n ; on the other hand, choosing one of those h n, we have F n (t n,1 ) A. Hence, we obtain the existence of Z n,1 as the strictl positive fixed point of G (F n (t n,1 ) + h n B n ). ( ) For proving the other condition, we use Lemma 3.1-(i), taking into account Remark 3.1. A similar result was proved in [13] with the additional hpothesis K (t, s) K (t, s) for all s t < t (or k is increasing for the particular case of convolution kernels K(t, s) = k(t s)). We have shown that this hpothesis is not needed and the difference between the proofs is the choice of A. Taking into account Remark 3.1, we can adapt the results given in [13] about sufficient conditions on existence for fine meshes and unconditional existence to our new general conditions. This will help us to identif collocation problems without blow-up (see Proposition 3.2 below). In the following results recall the Definition 3.1 of the concepts near zero and awa from zero. Proposition 3.2. Let G() be unbounded near zero. If K is a convolution kernel and G() is bounded awa from zero, then there is existence for fine meshes. If G() is unbounded awa from zero, then there is unconditional existence. If, in addition, G() is a strictl decreasing function, then there is at most one nontrivial collocation solution. The proof is analogous to the one given in [13]. Note that the propert G() is unbounded awa from zero appears there as there exists a sequence { n } + n=1 of positive real numbers G( and divergent to + such that lim n) n + n =, but both are equivalent. 3.2 Case 2: m = 2 with c 1 = Considering m = 2 with c 1 =, we have to solve the following equations: for n =,..., N 1, where Z n,1 = G (F n (t n,1 )) (9) Z n,2 = G (F n (t n,2 ) + h n B n (2, 1) Z n,1 + h n B n (2, 2) Z n,2 ), (1) B n (2, j) = c2 K (t n,2, t n + sh n ) L j (s) ds, j = 1, 2 (11) and F n (t n,i ), for i = 1, 2, are given b (5). Note that B n (2, j) > for j = 1, 2, because the integrand in (11) is strictl positive almost everwhere in ], c 2 [. Remark 3.2. As in the first case, we have to ensure that lim hn + h nb n (2, j) = for j = 1, 2, taking into account the new general conditions (see Remark 3.1). Actuall, since < L j (s) < 1 for s ], c 2 [, we have c2 h n B n (2, j) h n K (t n,2, t n + sh n ) ds = tn,2 t n K (t n,2, s) ds. (12) Hence, b (12) and the general conditions, the following inequalities are fulfilled: lim h n + h n B n (2, j) lim t t + n t t n K (t, s) ds =. 6

7 Analogousl to the previous case, we present a characterization of the existence near zero of nontrivial collocation solutions: Proposition 3.3. Let the map t K (t, s) be continuous in ]s, ɛ[ for some ɛ > and for all s < ɛ (this hpothesis can be removed if c 2 = 1). Then there is existence near zero if and onl if G() is unbounded. Proof. ( ) Let us prove that if G() is unbounded, then there is existence near zero. So, we are going to prove b induction over n that there exist H n >, for n =,..., N 1, such that if < h n H n then there exist solutions of the sstem (1) with Z n,2 > : For n =, taking into account Remark 3.2 and Lemma 3.1-(i), we choose a small enough H > such that < h B (2, 2) β for all < h H. So, since the lag terms are and Z,1 = G () =, we can appl Lemma 3.1-(i) to the equation (1), concluding that there exist strictl positive solutions for Z,2. Let us suppose that, choosing one of those Z,2 and given n >, there exist constants H 1,..., H n 1 > such that if < h i H i, for i = 1,..., n 1, then there exist coefficients Z 1,2,..., Z n 1,2 fulfilling the equation (1). Moreover, let us suppose that z h is positive in [, t n ], i.e. these coefficients satisf Z l,2 (1 c 2 ) Z l,1 for l = 1,..., n 1, where Z l,1 is given b (9). Finall, we are going to prove that there exists H n > such that if < h n H n then there exists Z n,2 > fulfilling the equation (1) with the previous coefficients, and z h is positive in [, t n+1 ], i.e. Z n,2 (1 c 2 ) Z n,1 : Let us define A := max {F n (t n + c 2 ɛ) + (13) c2 } ɛg (F n (t n + c 1 ɛ)) K (t n,2, t n + sh n ) L 1 (s) ds : ɛ 1. Note that A exists and A because s K (t, s) is locall integrable for all t >, z h is bounded and positive in [, t n ], the nonlinearit G is bounded and positive, and the polnomial L 1 is bounded and positive in [, c 2 ]. So, appling Lemma 3.1-(ii), there exists β A > such that G (α + β) has positive fixed points for all α A and for all < β β A. On one hand, taking into account Remark 3.2, we choose a small enough < H n 1 such that < h n B n (2, 2) β A for all < h n H n ; on the other hand, taking into account (5), the lag terms F n (t n,i ) are positive for i = 1, 2, because K and z h are positive. Therefore, b (9), Z n,1 = G (F n (t n,1 )) is positive, because G is positive. Moreover, h n B n (2, 1) is positive. So, F n (t n,2 ) + h n B n (2, 1) Z n,1 A. Hence, we obtain the existence of Z n,2 as the strictl positive fixed point of the function G (α + β) where α := F n (t n,2 ) + h n B n (2, 1) Z n,1 and β := h n B n (2, 2). Concluding, we have to check that Z n,2 (1 c 2 ) Z n,1. On one hand, 2 Z n,2 = G F n (t n,2 ) + h n B n (2, j) Z n,j G (F n (t n,2 )) j=1 because B n (2, j) Z n,j for j = 1, 2. On the other hand, since t K (t, s) is continuous in ]s, ɛ[ for some ɛ > and for all s < ɛ, we can suppose that the stepsize is small enough for t n,1 < ɛ, and then F n (t) is continuous in t n,1. Hence, 7

8 since G is continuous, G (F n (t)) is also continuous in t n,1, i.e. lim hn + G (F n (t n,2 )) = G (F n (t n,1 )). Therefore, choosing a small enough h n, we have G (F n (t n,2 )) (1 c 2 ) G (F n (t n,1 )) = (1 c 2 ) Z n,1. ( ) For proving the other condition, we use Lemma 3.1-(i), taking into account Remark 3.2. It is noteworth that a similar result was proved in [13], but the hpothesis on the kernel was K (t, s) K (t, s) for all s t < t, and so, unlike Proposition 3.3, it could not be applied to decreasing convolution kernels (for example). Again, the main difference between both proofs lies in the choice of A. Note that for convolution kernels K(t, s) = k(t s), the hpothesis on K is equivalent to sa that k is continuous near zero, which is a fairl weak hpothesis. On the other hand, for general kernels, this hpothesis is onl needed to ensure that t K (t, s) is continuous in t n,1. Therefore, if it is not continuous, it is important to choose h i such that the mapping t K (t, s) is continuous at the collocation points t i,1, i =,... N 1. More specificall, the hpothesis on K is onl needed to check that Z n,2 (1 c 2 ) Z n,1, and hence, to ensure that z h is positive in [, t n ]. Nevertheless, this hpothesis is not needed to verif that Z,2 > Z,1 =, and so, it is alwas ensured the existence of Z 1,2 (and obviousl Z 1,1 ), even if the hpothesis does not hold. Hence, if we use another method to check that Z 1,2 (1 c 2 ) Z 1,1 (e.g., numericall), then it is ensured the existence of Z 2,2. Repeating this reasoning we can guarantee the existence of Z n,2, removing the hpothesis on K. Thus, we can state a result analogous to Proposition 3.3 without hpothesis on the kernel: G() Proposition 3.4. is unbounded if and onl if there exists H > such that there are nontrivial collocation solutions in [, t 1 ] for < h H. In this case, there alwas exists H 1 > such that there are nontrivial collocation solutions in [, t 2 ] for < h 1 H 1. Moreover, if G() is unbounded and there is a positive nontrivial collocation solution in [, t n ], then there exists H n > such that there are nontrivial collocation solutions in [, t n+1 ] for < h n H n. Considering Remark 3.2 and taking the coefficient A given in (13), we can adapt some results of [13] about sufficient conditions on existence for fine meshes and unconditional existence to our new general conditions. These results are useful for identifing collocation problems without blow-up. Proposition 3.5. Let G() be unbounded near zero, and let the map t K (t, s) be continuous in ]s, ɛ[ for some ɛ > and for all s < ɛ (this hpothesis can be removed if c 2 = 1). If K is a convolution kernel and G() is bounded awa from zero, then there is existence for fine meshes. If G() is unbounded awa from zero, then there is unconditional existence. If, in addition, G() is a strictl decreasing function, then there is at most one nontrivial collocation solution. Moreover, as in Proposition 3.4, we can state a result about unconditional existence without hpothesis on the kernel: Proposition 3.6. Let G() be unbounded near zero. If G() is unbounded awa from zero and there is a positive nontrivial collocation solution in [, t n ], then there is a nontrivial collocation solution in [, t n+1 ] for an h n >. If, in addition, G() is a strictl decreasing function, then there is at most one nontrivial collocation solution. 8

9 3.3 Nondivergent existence and uniqueness Our interest is the stud of existence of nontrivial collocation solutions using meshes I h with arbitrar small h >. So, we are not interested in collocation problems whose collocation solutions escape to + when a certain h n +, since this is a divergence smptom. Following this criterion, we define the concept of nondivergent existence : Let = t <... < t n be a mesh such that there exist nontrivial collocation solutions, and let S hn be the index set of the nontrivial collocation solutions of the corresponding collocation problem with mesh t <... < t n < t n + h n. Given s S hn, we denote b Z s;n,i the coefficients of the corresponding nontrivial collocation solution satisfing equations (4). Then, we sa that there is nondivergent existence in t + n if { } inf s S hn max i=1,...,m {Z s;n,i} exists for small enough h n > and it does not diverge to + when h n +. Given a mesh I h = { = t <... < t N } such that there exist nontrivial collocation solutions, we sa that there is nondivergent existence if there is nondivergent existence in t + n for n =,..., N. See [13] for a more detailed analsis, where we also define the concept of nondivergent uniqueness. In [13] it is proved the next result: Proposition 3.7. In cases 1 and 2 with existence of nontrivial collocation solutions, there is nondivergent existence if and onl if G() is unbounded near zero. Moreover, if, in addition, G is well-behaved, in the sense stated below, then there is nondivergent uniqueness. We sa that G is well-behaved if G(α+) is strictl decreasing near zero for all α >. Note that this condition is ver weak (see [13]). So, taking into account Propositions 3.1, 3.3 and 3.7, the main result of this paper is: Theorem 3.1. (Hpothesis onl for case 2 with c 2 1: the map t K (t, s) is continuous in ]s, ɛ[ for some ɛ > and for all s < ɛ.) There is nondivergent existence near zero if and onl if G() is unbounded near zero. Moreover, if in addition, G is well-behaved then, there is nondivergent uniqueness near zero. In the same wa, we can combine Propositions 3.4 and 3.7 obtaining a result about nondivergent existence and uniqueness without hpothesis on the kernel, and, as Theorem 3.1, it can be useful to stud numericall problems with decreasing convolution kernels in case 2 with c 2 1. We can also combine Propositions 3.2, 3.5 and 3.6 with Proposition 3.7, obtaining results about nondivergent existence and uniqueness (for fine meshes and unconditional) that are useful for identifing collocation problems without blow-up. Some of these results can be reformulated as necessar conditions for the existence of blow-up (see Section 5). 4 Blow-up collocation solutions In this section we will extend the concept of collocation problem and collocation solution in order to consider the case of blow-up collocation solutions. Definition 4.1. We sa that a collocation problem is a blow-up collocation problem (or has a blow-up) if the following conditions are held: 1. There exists T > such that there is no collocation solution in I = [, T ] for an mesh I h. 2. Given M > there exists < τ < T, and a collocation solution z h defined on [, τ] such that z h (t) > M for some t [, τ]. 9

10 We can not speak about blow-up collocation solutions in the classic sense, since collocation solutions are defined in compact intervals and obviousl the are bounded; so, we have to extend first the concept of collocation solution to half-closed intervals I = [, T [ before we are in position to define the notion of blow-up collocation solution. Definition 4.2. Let I := [, T [ and I h be an infinite mesh given b a strictl increasing sequence {t n } + n= with t = and convergent to T. A collocation solution on I using the mesh I h is a function defined on I such that it is a collocation solution (in the classic sense) for an finite submesh {t n } N n= with N N. A collocation solution on I is a blow-up collocation solution (or has a blow-up) with blow-up time T if it is unbounded. Remark 4.1. In [11] it is defined the concept of collocation solution with adaptive stepsize that uses an infinite mesh I h. It is stated that this kind of collocation solutions blows up in finite time if T b (I h ) := lim t n = lim n n n h i <, without imposing an condition about unboundedness on the collocation solution. In this case, T b (I h ) is called the numerical blow-up time. According to this definition, we could remove the second point in Definition 4.1. However, this definition of numerical blow-up time in [11] is made in the framework of a Lipschitz nonlinearit G in the non-homogeneous case, and it is proved (in case 1) that the corresponding collocation solution is effectivel unbounded if we choose a given adaptive stepsize that depends on the Lipschitz constant of G. Nevertheless, we can not use this framework in our case (homogeneous case), because supposing a Lipschitz-continuous nonlinearit G would impl that the unique solution of (1) or (3) is the trivial one. On the other hand, if we consider a non-lipschitz nonlinearit, then we can not assure that the collocation solution is unbounded since the adaptive stepsize given in [11] becomes zero in the homogeneous case. Therefore, in Definition 4.1 it is necessar the condition about unboundedness, and in Definition 4.2 we impose explicitl that the collocation solution has to be unbounded. Given a collocation problem with nondivergent uniqueness near zero, a necessar condition for the nondivergent collocation solution to blow-up is that there is neither existence for fine meshes nor unconditional existence. So, for example, given a convolution kernel K(t, s) = k(t s), in cases 1 and 2 we must require that G() is unbounded awa from zero (moreover, in case 2 with c 2 1, we must demand that there exists ɛ > such that k is continuous in ], ɛ[). For instance, in [5] it is studied equation (1) with convolution kernel k(t s) = (t s) β, β, and nonlinearit G() = t α, < α < 1, concluding that the nontrivial (exact) solution does not have blow-up. If we consider a collocation problem with the above kernel and nonlinearit in cases 1 and 2, then we can ensure unconditional nondivergent uniqueness (b Propositions 3.2, 3.5 and 3.7); thus, we can also conclude that the nondivergent collocation solution has no blow-up. Actuall, we reach the same conclusion considering an kernel satisfing the general conditions (in case 1 and case 2 with c 2 = 1) and such that t K (t, s) is continuous in ]s, ɛ[ for some ɛ > and for all s < ɛ (in case 2 with c 2 1). In Section 5 we discuss in more detail the relationships between necessar conditions for blow-up of collocation solutions and exact solutions. 4.1 Numerical algorithms Given a blow-up collocation problem with nondivergent uniqueness near zero (alwas in cases 1 and 2), we are going to describe a general algorithm to compute the nontrivial collocation i= 1

11 solution and estimate the blow-up time. Given stepsizes h,..., h n, the collocation solution at t n+1 is obtained from the attracting fixed point of a certain function G(α+β), given b equation (6) in case 1, or (1) in case 2. Therefore, the ke point in the algorithm is to decide whether there is a fixed point or not and, if so, estimate it. In order to check that there is no fixed point, the most straightforward technique consists on iterating the function and, if a certain bound (which ma depend on the fixed points found in the previous steps) is overcomed, then it is assumed that there is no fixed point. So, if for a certain n there is no fixed point, then a smaller h n should be taken (e.g. h n /2 is used in the examples below), and this procedure is repeated with the new α and β corresponding to this new value of h n. If h n becomes smaller than a given tolerance (e.g in our examples), the algorithm stops and t n = h h n 1 is the estimation of the blow-up time. Finall, we need to determine whether the obtained collocation solution is unbounded or not, but it is not strictl possible since we have computed the collocation solution onl for a finite mesh. Therefore, we will check if the collocation solution overcomes a previousl fixed threshold bound M >. To sum up, the algorithm consists mainl on: 1. Set n = and an initial stepsize h (= h). 2. Check if there is a fixed point in (6) (case 1) or (1) (case 2), taking into account Section If there is fixed point, then compute it, set n = n + 1, h n = h n 1, and repeat If there is not fixed point, then repeat 2 with a smaller stepsize h n. If h n becomes smaller than a given tolerance, the algorithm ends and the blow-up time estimation is given b t n = h h n 1. Note that the initial stepsize h is also denoted b h because it coincides with the diameter of the mesh. 4.2 Examples We will consider the following examples: if [, 1] 1. K (t, s) = 1 and G () = 2 if ]1, + [ if [, 1] 2. K (t, s) = 1 and G () = e 1 if ]1, + [ 3. K (t, s) = k(t s) = t s and G () of Example K (t, s) = k(t s) = and G () of Example 1. π(t s) In Example 1, the fixed points of G(α + β) can be found analticall: If α < 1 and 1 α < β 1 4α, then the fixed point is 1 2αβ 1 4αβ ( If α < 1 and β 1 α, then the fixed point is 1 2 β + ) β 2 + 4α. If α 1 and β 1 4α, then the fixed point is 1 2αβ 1 4αβ 2β 2. 2β 2. 11

12 Figure 1: Extrapolation technique given b (14). M 1, M 2 and m 1, m 2 are the maximum and minimum times respectivel, using initial stepsizes h 1 and h 2, with h 1 > h 2. If β > 1 4α then there is no solution for the corresponding h n. Hence a smaller h n is taken as described in the general case. However, both the computational cost and accurac of the general and specific algorithms are similar. In the first two examples, the blow-up time of the corresponding (exact) solution is ˆt = 3, while in the other two the blow-up time is unknown. In [7] it was studied a famil of equations to which Example 4 belongs. In all examples, both K and G fulfill the general conditions and the hpotheses of Theorem 3.1, and thus it is ensured the nondivergent existence and uniqueness near zero. Note that since the kernel in Example 4 is decreasing and unbounded near zero this case is out of the scope of the stud of [13]. On the other hand, in all examples, G() is unbounded awa from zero and G() is bounded awa from zero, and hence there can exist a blow-up (see Propositions 3.2 and 3.5). We have found the numerical nondivergent collocation solutions for a given diameter h (it is in fact the initial stepsize h ), using the algorithms described in Section 4.1 (the specific for the Example 1 and the general for the rest). In Figures 2, 3, 4 and 5 the estimations of the blow-up time of the collocation solutions for a given initial stepsize h are depicted, varing c 1 in case 1 or c 2 in case 2. Note that the different graphs for different h intersect each other in a fairl good approximation of the blow-up time, as it is shown in Tables 1, 2, 4 and 5. Moreover, we can use a more general technique consisting on extrapolating the minimum (m 1, m 2 ) and maximum (M 1, M 2 ) times of two results with different initial stepsizes h 1, h 2 respectivel, with h 1 > h 2 (see Figure 1); in this wa the blow-up time estimation is given b ˆt M 1 (M 1 M 2 )(M 1 m 1 ) (M 1 M 2 ) + (m 2 m 1 ). (14) In Examples 3 and 4 we do not know the exact value of the blow-up time. However, in order to make a stud of the relative error analogous to the previous examples, we have taken as blow-up time for Example 3 the approximation for h =.1 in case 2 with c 2 =.5: t = ; in Example 4 the blow-up time value has been taken as the approximation for h =.1 in case 2 with c 2 = 2/3 (Radau I collocation points): t = Results are shown in Tables 7, 8, 1 and 11. The relative error of varing c 1 (case 1) or c 2 (case 2) is the relative vertical size of the graph, and it decreases at the same rate as h. On the other hand, the relative error of the intersection decreases faster, in some cases at the same rate as h 2. Moreover, in case 1, the best approximations are obtained with c 1.5, and in case 2 with c 2 2/3 (approximatel Radau I ) for Examples 1, 2 and 4 (see Tables 3, 6 and 12), while for Example 3 the best approximations are obtained with c 2.5; however, in Table 9 are also shown the approximations and their corresponding errors for the Radau I collocation 12

13 Figure 2: Example 1. Numerical estimation of the blow-up time of collocation solutions varing c 1 (case 1) or c 2 (case 2), for different initial stepsizes h. The blow-up time of the corresponding (exact) solution is ˆt = 3. The intersection of both curves gives a good approximation of the blow-up time. 13

14 Figure 3: Example 2. Numerical estimation of the blow-up time of collocation solutions varing c 1 (case 1) or c 2 (case 2), for different initial stepsizes h. The blow-up time of the corresponding (exact) solution is ˆt = 3. The intersection of both curves gives a good approximation of the blow-up time. points. On the other hand, the intersections technique offers better results, but at a greater computational cost. 5 Discussion and comments The main necessar conditions for a collocation problem to have a blow-up are obtained from Propositions 3.2 (case 1) and 3.5 (case 2), and are mostl related to the nonlinearit, since the assumption on the kernel the map t K (t, s) is continuous in ]s, ɛ[ for some ɛ > and for all s < ɛ is onl required in case 2 with c 2 1 and it is a ver weak hpothesis. Hence, assuming that the kernel satisfies this hpothesis, the main necessar condition for the existence of a blow-up is: 1. G() is bounded awa from zero. In addition, for convolution kernels, there is another necessar condition: 2. G() is unbounded awa from zero, i.e. there exists a sequence { n } + n=1 numbers and divergent to + such that lim n n + G( =. n) of positive real In [4] it is given a necessar and sufficient condition for the existence of blow-up (exact) solutions for equation (1) with a kernel of the form K(t, s) = (t s) α 1 r(s) with α >, r 14

15 Figure 4: Example 3. Numerical estimation of the blow-up time of collocation solutions varing c 1 (case 1) or c 2 (case 2), for different initial stepsizes h. The intersection of both curves gives a good approximation of the blow-up time. 15

16 Figure 5: Example 4. Numerical estimation of the blow-up time of collocation solutions varing c 1 (case 1) or c 2 (case 2), for different initial stepsizes h. The intersection of both curves gives a good approximation of the blow-up time. 16

17 nondecreasing and continuous for t, r(t) = for t, and r(t) > for t > : + ( ) 1/α s ds < +. (15) G(s) s This also holds for convolution kernels of Abel tpe K(t, s) = (t s) α 1 with α >, generalizing some results given in [3]. Next we will show that necessar conditions 1 and 2 above mentioned are also necessar conditions for the integral given in (15) to be convergent, and thus for the existence of a blow-up (exact) solution. Proposition 5.1. If (15) holds, then G() is unbounded awa from zero. Proof. Let us suppose that G() that G() < M for all > δ, for a large enough δ. Hence + ( s ) 1/α ds G(s) s > is bounded awa from zero. So, there exists M > such + δ ( ) 1/α ( ) 1/α s ds 1 + G(s) s > ds M δ s = +. Proposition 5.2. If (15) holds, then Proof. B Proposition 5.1, G() increasing sequence { n } + all n. Let us suppose that G() is bounded awa from zero. is unbounded awa from zero and hence, there exists a strictl n=1 with 1 > and divergent to + such that n G( n) < 1 2 α < 1 for G() is unbounded awa from zero; so, we can construct a subsequence of { n } + n=1, that we are going to call {z n} + n=1, such that there exist z n ]z n, z n+1 [ with z n G(z n ) = 1 for each n. This is possible because G() is unbounded awa from zero and then, z given z n there exists z > z n such that G(z) > 1. Then, we choose z n+1 to be an element of { n } + n=1 greater than z. Since z n G(z < 1 and G is continuous, the existence of n) z n is proved. Moreover, since G is positive and strictl increasing, we have that z n G(z > n) and then z n > G (z n ). Hence, taking also into account that z n = G (z n) and have z n G(z n ) = 1, zn G(z < 1 n) 2, we α zn+1 z n ( s ) 1/α ds G(s) s z ( ) n 1/α s ds z ( ) > z n G(s) s > n 1/α s ds z n G (z n) s ( ( ) ) ( 1/α ( ) ) 1/α zn zn = α 1 > α 1 > α G (z n ) 2. z n Therefore, (15) does not hold. The results presented here provide a guide for future research. An interesting problem which is not full resolved is to determine the relationship between the existence of blow-up in exact solutions and in collocation solutions. Another open problem is to assure the unboundedness of a collocation solution with adaptive stepsize (in the sense of [11]) using an infinite mesh I h with lim n t n < in the general case of a non-lipschitz nonlinearit G (see Remark 4.1). In other words, if we can not arrive at a given time T with an collocation solution (i.e. using an mesh), then, is there a collocation blow-up? If so, and in terms of Definition 4.1, it would be sufficient to hold onl the first condition for a collocation problem to have a blow-up. 17

18 Acknowlegdments The authors would like to thank the anonmous reviewer of the journal Applied Mathematics and Computation for his/her valuable comments that contributed greatl to the improvement of the paper. References [1] C. M. Kirk. Numerical and asmptotic analsis of a localized heat source undergoing periodic motion. Nonlinear Anal. 71 (29), e2168 e2172. [2] F. Calabrò, G. Capobianco. Blowing up behavior for a class of nonlinear VIEs connected with parabolic PDEs. J. Comput. Appl. Math. 228 (29), [3] W. Mdlarczk. A condition for finite blow-up time for a Volterra integral equation. J. Math. Anal. Appl. 181 (1994), [4] W. Mdlarczk. The blow-up solutions of integral equations. Colloq. Math. 79 (1999), [5] T. Ma lolepsz, W. Okrasiński. Conditions for blow-up of solutions of some nonlinear Volterra integral equations. J. Comput. Appl. Math. 25 (27), [6] T. Ma lolepsz, W. Okrasiński. Blow-up conditions for nonlinear Volterra integral equations with power nonlinearit. Appl. Math. Letters. 21 (28), [7] T. Ma lolepsz, W. Okrasiński. Blow-up time for solutions for some nonlinear Volterra integral equations. J. Math. Anal. Appl. 366 (21), [8] H. Brunner, Z. W. Yang. Blow-up behavior of Hammerstein-tpe Volterra Integral Equations. J. Integral Equations Appl. 24 (4) (212), [9] T. Ma lolepsz. Nonlinear Volterra integral equations and the Schröder functional equation. Nonlinear Anal. T. M. A. 74 (211), [1] H. Brunner. Collocation Methods for Volterra Integral and Related Functional Differential Equations. Cambridge Universit Press, Cambridge (24). [11] Z. W. Yang, H. Brunner. Blow-up behavior of collocation solutions to Hammerstein-tpe Volterra integral equations. SIAM J. Numer. Anal. 51 (213), [12] M. A. Krasnosel skii, P. P. Zabreiko. Geometric Methods of Nonlinear Analsis. Springer Verlag, New York, [13] R. Benítez, V. J. Bolós. Existence and uniqueness of nontrivial collocation solutions of implicitl linear homogeneous Volterra integral equations. J. Comput. Appl. Math. 235 (211), [14] T. Ma lolepsz. Blow-up solutions in one-dimensional diffusion models. Nonlinear Anal. T. M. A. 95 (214), [15] H. Brunner. Implicitl linear collocation methods for nonlinear Volterra integral equations. Appl. Numer. Math. 9 (1992), [16] M.R. Arias, R. Benítez, Aspects of the behaviour of solutions of nonlinear Abel equations. Nonlinear Anal. T.M.A. 54 (23), pp [17] M.R. Arias, R. Benítez, A note of the uniqueness and the attractive behaviour of solutions for nonlinear Volterra equations, J. Integral Equations Appl. 13 (4) (21),

19 Tables Case 1 Varing c 1 Extrapolation Intersection h min. t max. t Rel. error t Rel. error t Rel. error (c 1 = 1) (c 1 =.1) (c 1 =.39) (c 1 = 1) (c 1 =.1) (c 1 = 1) (c 1 =.1) (c 1 =.44) (c 1 = 1) (c 1 =.1) Table 1: Example 1. Numerical data of Figure 2 (case 1: m = 1, c 1 > ). Case 2 Varing c 2 Extrapolation Intersection h min. t max. t Rel. error t Rel. error t Rel. error (c 2 = 1) (c 2 =.1) (c 2 =.618) (c 2 = 1) (c 2 =.1) (c 2 = 1) (c 2 =.1) (c 2 =.623) (c 2 = 1) (c 2 =.1) 1 6 Table 2: Example 1. Numerical data of Figure 2 (case 2: m = 2, c 1 = ). h Case 1 - c 1 =.5 Case 2 - Radau I Blow-up Rel. error Blow-up Rel. error q Table 3: Example 1. Numerical estimations and relative errors of the blow-up time of collocation solutions in case 1 with c 1 =.5, and case 2 with Radau I collocation points, c 1 =, c 2 = 2/3, for different initial stepsizes h. 19

20 Case 1 Varing c 1 Extrapolation Intersection h min. t max. t Rel. error t Rel. error t Rel. error (c 1 = 1) (c 1 =.1) (c 1 =.399) (c 1 = 1) (c 1 =.1) (c 1 = 1) (c 1 =.1) (c 1 =.444) (c 1 = 1) (c 1 =.1) Table 4: Example 2. Numerical data of Figure 3 (case 1: m = 1, c 1 > ). Case 2 Varing c 2 Extrapolation Intersection h min. t max. t Rel. error t Rel. error t Rel. error (c 2 = 1) (c 2 =.1) (c 2 =.6466) (c 2 = 1) (c 2 =.1) (c 2 = 1) (c 2 =.1) (c 2 =.65114) (c 2 = 1) (c 2 =.1) Table 5: Example 2. Numerical data of Figure 3 (case 2: m = 2, c 1 = ). h Case 1 - c 1 =.5 Case 2 - Radau I Blow-up Rel. error Blow-up Rel. error Table 6: Example 2. Numerical estimations and relative errors of the blow-up time of collocation solutions in case 1 with c 1 =.5, and case 2 with Radau I collocation points, c 1 =, c 2 = 2/3, for different initial stepsizes h. Case 1 Varing c 1 Extrapolation Intersection h min. t max. t Rel. error t Rel. error t Rel. error (c 1 = 1) (c 1 =.1) (c 1 =.3961) (c 1 = 1) (c 1 =.1) (c 1 = 1) (c 1 =.1) (c 1 =.441) (c 1 = 1) (c 1 =.1) Table 7: Example 3. Numerical data of Figure 4 (case 1: m = 1, c 1 > ). The blow-up time of the corresponding (exact) solution is assumed to be ˆt

21 Case 2 Varing c 2 Extrapolation Intersection h min. t max. t Rel. error t Rel. error t Rel. error (c 2 = 1) (c 2 =.1) (c 2 =.5286) (c 2 = 1) (c 2 =.1) (c 2 = 1) (c 2 =.1) (c 2 =.514) (c 2 = 1) (c 2 =.1) Table 8: Example 3. Numerical data of Figure 4 (case 2: m = 2, c 1 = ). The blow-up time of the corresponding (exact) solution is assumed to be ˆt h Case 1 - c 1 =.5 Case 2 - Radau I Case 2 - c 2 =.5 Blow-up Rel. error Blow-up Rel. error Blow-up Rel. error Table 9: Example 3. Numerical estimations and relative errors of the blow-up time of collocation solutions in case 1 with c 1 =.5, and case 2 with Radau I collocation points, c 1 =, c 2 = 2/3, and c 1 =, c 2 =.5, for different initial stepsizes h. The blow-up time of the corresponding (exact) solution is assumed to be ˆt Case 1 Varing c 1 Extrapolation Intersection h min. t max. t Rel. error t Rel. error t Rel. error (c 1 = 1) (c 1 =.5) (c 1 =.444) (c 1 = 1) (c 1 =.5) (c 1 = 1) (c 1 =.5) (c 1 =.461) (c 1 = 1) (c 1 =.5) Table 1: Example 4. Numerical data of Figure 5 (case 1: m = 1, c 1 > ). The blow-up time of the corresponding (exact) solution is assumed to be ˆt

22 Case 2 Varing c 2 Extrapolation h min. t max. t Rel. error t Rel. error (c 2 =.95) (c 2 =.33) (c 2 =.9) (c 2 =.3) (c 2 =.9) (c 2 =.3) (c 2 =.85) (c 2 =.28) Table 11: Example 4. Numerical data of Figure 5 (case 1: m = 2, c 1 = ). The intersection method can not be applied because there are more than one intersection. The blow-up time of the corresponding (exact) solution is assumed to be ˆt h Case 1 - c 1 =.5 Case 2 - Radau I Blow-up Rel. error Blow-up Rel. error Table 12: Example 4. Numerical estimations and relative errors of the blow-up time of collocation solutions in case 1 with c 1 =.5, and case 2 with Radau I collocation points, c 1 =, c 2 = 2/3, for different initial stepsizes h. The blow-up time of the corresponding (exact) solution is assumed to be ˆt

Invariant manifolds of the Bonhoeffer-van der Pol oscillator

Invariant manifolds of the Bonhoeffer-van der Pol oscillator Invariant manifolds of the Bonhoeffer-van der Pol oscillator R. Benítez 1, V. J. Bolós 2 1 Dpto. Matemáticas, Centro Universitario de Plasencia, Universidad de Extremadura. Avda. Virgen del Puerto 2. 10600,

More information

Section 3.1. ; X = (0, 1]. (i) f : R R R, f (x, y) = x y

Section 3.1. ; X = (0, 1]. (i) f : R R R, f (x, y) = x y Paul J. Bruillard MATH 0.970 Problem Set 6 An Introduction to Abstract Mathematics R. Bond and W. Keane Section 3.1: 3b,c,e,i, 4bd, 6, 9, 15, 16, 18c,e, 19a, 0, 1b Section 3.: 1f,i, e, 6, 1e,f,h, 13e,

More information

arxiv: v1 [nlin.cd] 20 Jul 2010

arxiv: v1 [nlin.cd] 20 Jul 2010 Invariant manifolds of the Bonhoeffer-van der Pol oscillator arxiv:1007.3375v1 [nlin.cd] 20 Jul 2010 R. Benítez 1, V. J. Bolós 2 1 Departamento de Matemáticas, Centro Universitario de Plasencia, Universidad

More information

FIRST- AND SECOND-ORDER IVPS The problem given in (1) is also called an nth-order initial-value problem. For example, Solve: Solve:

FIRST- AND SECOND-ORDER IVPS The problem given in (1) is also called an nth-order initial-value problem. For example, Solve: Solve: .2 INITIAL-VALUE PROBLEMS 3.2 INITIAL-VALUE PROBLEMS REVIEW MATERIAL Normal form of a DE Solution of a DE Famil of solutions INTRODUCTION We are often interested in problems in which we seek a solution

More information

ENGI 9420 Engineering Analysis Solutions to Additional Exercises

ENGI 9420 Engineering Analysis Solutions to Additional Exercises ENGI 940 Engineering Analsis Solutions to Additional Exercises 0 Fall [Partial differential equations; Chapter 8] The function ux (, ) satisfies u u u + = 0, subject to the x x u x,0 = u x, =. Classif

More information

Bifurcations of the Controlled Escape Equation

Bifurcations of the Controlled Escape Equation Bifurcations of the Controlled Escape Equation Tobias Gaer Institut für Mathematik, Universität Augsburg 86135 Augsburg, German gaer@math.uni-augsburg.de Abstract In this paper we present numerical methods

More information

Fuzzy Topology On Fuzzy Sets: Regularity and Separation Axioms

Fuzzy Topology On Fuzzy Sets: Regularity and Separation Axioms wwwaasrcorg/aasrj American Academic & Scholarl Research Journal Vol 4, No 2, March 212 Fuzz Topolog n Fuzz Sets: Regularit and Separation Aioms AKandil 1, S Saleh 2 and MM Yakout 3 1 Mathematics Department,

More information

Examples and counterexamples for Markus-Yamabe and LaSalle global asymptotic stability problems Anna Cima, Armengol Gasull and Francesc Mañosas

Examples and counterexamples for Markus-Yamabe and LaSalle global asymptotic stability problems Anna Cima, Armengol Gasull and Francesc Mañosas Proceedings of the International Workshop Future Directions in Difference Equations. June 13-17, 2011, Vigo, Spain. PAGES 89 96 Examples and counterexamples for Markus-Yamabe and LaSalle global asmptotic

More information

Introduction to Differential Equations

Introduction to Differential Equations Introduction to Differential Equations. Definitions and Terminolog.2 Initial-Value Problems.3 Differential Equations as Mathematical Models Chapter in Review The words differential and equations certainl

More information

Introduction to Differential Equations. National Chiao Tung University Chun-Jen Tsai 9/14/2011

Introduction to Differential Equations. National Chiao Tung University Chun-Jen Tsai 9/14/2011 Introduction to Differential Equations National Chiao Tung Universit Chun-Jen Tsai 9/14/011 Differential Equations Definition: An equation containing the derivatives of one or more dependent variables,

More information

Heat-diffusion maximal operators for Laguerre semigroups with negative parameters

Heat-diffusion maximal operators for Laguerre semigroups with negative parameters Journal of Functional Analsis 9 5 3 36 www.elsevier.com/locate/jfa Heat-diffusion maximal operators for Laguerre semigroups with negative parameters R. Macías a,,c.segovia b,, J.L. Torrea c, a IMAL-FIQ,

More information

A Beckman-Quarles type theorem for linear fractional transformations of the extended double plane

A Beckman-Quarles type theorem for linear fractional transformations of the extended double plane Rose- Hulman Undergraduate Mathematics Journal A Beckman-Quarles tpe theorem for linear fractional transformations of the extended double plane Andrew Jullian Mis a Josh Keilman b Volume 12, No. 2, Fall

More information

Section 1.2: A Catalog of Functions

Section 1.2: A Catalog of Functions Section 1.: A Catalog of Functions As we discussed in the last section, in the sciences, we often tr to find an equation which models some given phenomenon in the real world - for eample, temperature as

More information

Identification of Nonlinear Dynamic Systems with Multiple Inputs and Single Output using discrete-time Volterra Type Equations

Identification of Nonlinear Dynamic Systems with Multiple Inputs and Single Output using discrete-time Volterra Type Equations Identification of Nonlinear Dnamic Sstems with Multiple Inputs and Single Output using discrete-time Volterra Tpe Equations Thomas Treichl, Stefan Hofmann, Dierk Schröder Institute for Electrical Drive

More information

Orientations of digraphs almost preserving diameter

Orientations of digraphs almost preserving diameter Orientations of digraphs almost preserving diameter Gregor Gutin Department of Computer Science Roal Hollowa, Universit of London Egham, Surre TW20 0EX, UK, gutin@dcs.rhbnc.ac.uk Anders Yeo BRICS, Department

More information

Stability Analysis for Linear Systems under State Constraints

Stability Analysis for Linear Systems under State Constraints Stabilit Analsis for Linear Sstems under State Constraints Haijun Fang Abstract This paper revisits the problem of stabilit analsis for linear sstems under state constraints New and less conservative sufficient

More information

10 Back to planar nonlinear systems

10 Back to planar nonlinear systems 10 Back to planar nonlinear sstems 10.1 Near the equilibria Recall that I started talking about the Lotka Volterra model as a motivation to stud sstems of two first order autonomous equations of the form

More information

Autonomous Equations / Stability of Equilibrium Solutions. y = f (y).

Autonomous Equations / Stability of Equilibrium Solutions. y = f (y). Autonomous Equations / Stabilit of Equilibrium Solutions First order autonomous equations, Equilibrium solutions, Stabilit, Longterm behavior of solutions, direction fields, Population dnamics and logistic

More information

Spotlight on the Extended Method of Frobenius

Spotlight on the Extended Method of Frobenius 113 Spotlight on the Extended Method of Frobenius See Sections 11.1 and 11.2 for the model of an aging spring. Reference: Section 11.4 and SPOTLIGHT ON BESSEL FUNCTIONS. Bessel functions of the first kind

More information

Engineering Mathematics I

Engineering Mathematics I Engineering Mathematics I_ 017 Engineering Mathematics I 1. Introduction to Differential Equations Dr. Rami Zakaria Terminolog Differential Equation Ordinar Differential Equations Partial Differential

More information

4.3 Mean-Value Theorem and Monotonicity

4.3 Mean-Value Theorem and Monotonicity .3 Mean-Value Theorem and Monotonicit 1. Mean Value Theorem Theorem: Suppose that f is continuous on the interval a, b and differentiable on the interval a, b. Then there eists a number c in a, b such

More information

y R T However, the calculations are easier, when carried out using the polar set of co-ordinates ϕ,r. The relations between the co-ordinates are:

y R T However, the calculations are easier, when carried out using the polar set of co-ordinates ϕ,r. The relations between the co-ordinates are: Curved beams. Introduction Curved beams also called arches were invented about ears ago. he purpose was to form such a structure that would transfer loads, mainl the dead weight, to the ground b the elements

More information

QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS

QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS Journal of the Operations Research Societ of Japan 008, Vol. 51, No., 191-01 QUADRATIC AND CONVEX MINIMAX CLASSIFICATION PROBLEMS Tomonari Kitahara Shinji Mizuno Kazuhide Nakata Toko Institute of Technolog

More information

SMOOTHNESS PROPERTIES OF SOLUTIONS OF CAPUTO- TYPE FRACTIONAL DIFFERENTIAL EQUATIONS. Kai Diethelm. Abstract

SMOOTHNESS PROPERTIES OF SOLUTIONS OF CAPUTO- TYPE FRACTIONAL DIFFERENTIAL EQUATIONS. Kai Diethelm. Abstract SMOOTHNESS PROPERTIES OF SOLUTIONS OF CAPUTO- TYPE FRACTIONAL DIFFERENTIAL EQUATIONS Kai Diethelm Abstract Dedicated to Prof. Michele Caputo on the occasion of his 8th birthday We consider ordinary fractional

More information

A New Closed-loop Identification Method of a Hammerstein-type System with a Pure Time Delay

A New Closed-loop Identification Method of a Hammerstein-type System with a Pure Time Delay A New Closed-loop Identification Method of a Hammerstein-tpe Sstem with a Pure Time Dela Edin Drljević a, Branislava Peruničić b, Željko Jurić c, Member of IEEE Abstract A procedure for the closed-loop

More information

Krylov Integration Factor Method on Sparse Grids for High Spatial Dimension Convection Diffusion Equations

Krylov Integration Factor Method on Sparse Grids for High Spatial Dimension Convection Diffusion Equations DOI.7/s95-6-6-7 Krlov Integration Factor Method on Sparse Grids for High Spatial Dimension Convection Diffusion Equations Dong Lu Yong-Tao Zhang Received: September 5 / Revised: 9 March 6 / Accepted: 8

More information

Exponential time differencing methods for nonlinear PDEs

Exponential time differencing methods for nonlinear PDEs XXI Congreso de Ecuaciones Diferenciales Aplicaciones XI Congreso de Matemática Aplicada Ciudad Real, 1- septiembre 9 (pp. 1 8) Exponential time differencing methods for nonlinear PDEs F. de la Hoz 1,

More information

Mathematics 309 Conic sections and their applicationsn. Chapter 2. Quadric figures. ai,j x i x j + b i x i + c =0. 1. Coordinate changes

Mathematics 309 Conic sections and their applicationsn. Chapter 2. Quadric figures. ai,j x i x j + b i x i + c =0. 1. Coordinate changes Mathematics 309 Conic sections and their applicationsn Chapter 2. Quadric figures In this chapter want to outline quickl how to decide what figure associated in 2D and 3D to quadratic equations look like.

More information

Superconvergence analysis of multistep collocation method for delay Volterra integral equations

Superconvergence analysis of multistep collocation method for delay Volterra integral equations Computational Methods for Differential Equations http://cmde.tabrizu.ac.ir Vol. 4, No. 3, 216, pp. 25-216 Superconvergence analysis of multistep collocation method for delay Volterra integral equations

More information

8.1 Exponents and Roots

8.1 Exponents and Roots Section 8. Eponents and Roots 75 8. Eponents and Roots Before defining the net famil of functions, the eponential functions, we will need to discuss eponent notation in detail. As we shall see, eponents

More information

MAT 127: Calculus C, Fall 2010 Solutions to Midterm I

MAT 127: Calculus C, Fall 2010 Solutions to Midterm I MAT 7: Calculus C, Fall 00 Solutions to Midterm I Problem (0pts) Consider the four differential equations for = (): (a) = ( + ) (b) = ( + ) (c) = e + (d) = e. Each of the four diagrams below shows a solution

More information

PICONE S IDENTITY FOR A SYSTEM OF FIRST-ORDER NONLINEAR PARTIAL DIFFERENTIAL EQUATIONS

PICONE S IDENTITY FOR A SYSTEM OF FIRST-ORDER NONLINEAR PARTIAL DIFFERENTIAL EQUATIONS Electronic Journal of Differential Equations, Vol. 2013 (2013), No. 143, pp. 1 7. ISSN: 1072-6691. URL: http://ejde.math.txstate.edu or http://ejde.math.unt.edu ftp ejde.math.txstate.edu PICONE S IDENTITY

More information

Relativistic simultaneity and causality

Relativistic simultaneity and causality Relativistic simultaneity and causality V. J. Bolós 1,, V. Liern 2, J. Olivert 3 1 Dpto. Matemática Aplicada, Facultad de Matemáticas, Universidad de Valencia. C/ Dr. Moliner 50. 46100, Burjassot Valencia),

More information

Differentiation and applications

Differentiation and applications FS O PA G E PR O U N C O R R EC TE D Differentiation and applications. Kick off with CAS. Limits, continuit and differentiabilit. Derivatives of power functions.4 C oordinate geometr applications of differentiation.5

More information

1.3. Absolute Value and Piecewise-Defined Functions Absolutely Piece-ful. My Notes ACTIVITY

1.3. Absolute Value and Piecewise-Defined Functions Absolutely Piece-ful. My Notes ACTIVITY Absolute Value and Piecewise-Defined Functions Absolutel Piece-ful SUGGESTED LEARNING STRATEGIES: Activating Prior Knowledge, Create Representations, Quickwrite. Graph both = - for < 3 and = - + 7 for

More information

1.2 Functions and Their Properties PreCalculus

1.2 Functions and Their Properties PreCalculus 1. Functions and Their Properties PreCalculus 1. FUNCTIONS AND THEIR PROPERTIES Learning Targets for 1. 1. Determine whether a set of numbers or a graph is a function. Find the domain of a function given

More information

Discontinuous Galerkin method for a class of elliptic multi-scale problems

Discontinuous Galerkin method for a class of elliptic multi-scale problems INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN FLUIDS Int. J. Numer. Meth. Fluids 000; 00: 6 [Version: 00/09/8 v.0] Discontinuous Galerkin method for a class of elliptic multi-scale problems Ling Yuan

More information

arxiv: v1 [nlin.cd] 20 Jul 2010

arxiv: v1 [nlin.cd] 20 Jul 2010 A wavelet-based tool for studying non-periodicity R. Benítez 1, V. J. Bolós 2, M. E. Ramírez 3 arxiv:1007.3373v1 [nlin.cd] 20 Jul 2010 1 Departamento de Matemáticas, Centro Universitario de Plasencia,

More information

2.5. Infinite Limits and Vertical Asymptotes. Infinite Limits

2.5. Infinite Limits and Vertical Asymptotes. Infinite Limits . Infinite Limits and Vertical Asmptotes. Infinite Limits and Vertical Asmptotes In this section we etend the concept of it to infinite its, which are not its as before, but rather an entirel new use of

More information

MATH 117 LECTURE NOTES

MATH 117 LECTURE NOTES MATH 117 LECTURE NOTES XIN ZHOU Abstract. This is the set of lecture notes for Math 117 during Fall quarter of 2017 at UC Santa Barbara. The lectures follow closely the textbook [1]. Contents 1. The set

More information

2 Ordinary Differential Equations: Initial Value Problems

2 Ordinary Differential Equations: Initial Value Problems Ordinar Differential Equations: Initial Value Problems Read sections 9., (9. for information), 9.3, 9.3., 9.3. (up to p. 396), 9.3.6. Review questions 9.3, 9.4, 9.8, 9.9, 9.4 9.6.. Two Examples.. Foxes

More information

CHAPTER 2: Partial Derivatives. 2.2 Increments and Differential

CHAPTER 2: Partial Derivatives. 2.2 Increments and Differential CHAPTER : Partial Derivatives.1 Definition of a Partial Derivative. Increments and Differential.3 Chain Rules.4 Local Etrema.5 Absolute Etrema 1 Chapter : Partial Derivatives.1 Definition of a Partial

More information

Local Maximums and Local Minimums of Functions. f(x, y) has a local minimum at the point (x 0, y 0 ) if f(x 0, y 0 ) f(x, y) for

Local Maximums and Local Minimums of Functions. f(x, y) has a local minimum at the point (x 0, y 0 ) if f(x 0, y 0 ) f(x, y) for Local Extrema Previousl we have taken the partial derivative of a function f(x, ). But those partial derivatives were themselves functions and so we can take their partial derivatives. Local Maximums and

More information

CONTINUOUS SPATIAL DATA ANALYSIS

CONTINUOUS SPATIAL DATA ANALYSIS CONTINUOUS SPATIAL DATA ANALSIS 1. Overview of Spatial Stochastic Processes The ke difference between continuous spatial data and point patterns is that there is now assumed to be a meaningful value, s

More information

Ordinary Differential Equations

Ordinary Differential Equations 58229_CH0_00_03.indd Page 6/6/6 2:48 PM F-007 /202/JB0027/work/indd & Bartlett Learning LLC, an Ascend Learning Compan.. PART Ordinar Differential Equations. Introduction to Differential Equations 2. First-Order

More information

Additional Material On Recursive Sequences

Additional Material On Recursive Sequences Penn State Altoona MATH 141 Additional Material On Recursive Sequences 1. Graphical Analsis Cobweb Diagrams Consider a generic recursive sequence { an+1 = f(a n ), n = 1,, 3,..., = Given initial value.

More information

INTRODUCTION TO DIFFERENTIAL EQUATIONS

INTRODUCTION TO DIFFERENTIAL EQUATIONS INTRODUCTION TO DIFFERENTIAL EQUATIONS. Definitions and Terminolog. Initial-Value Problems.3 Differential Equations as Mathematical Models CHAPTER IN REVIEW The words differential and equations certainl

More information

4.7. Newton s Method. Procedure for Newton s Method HISTORICAL BIOGRAPHY

4.7. Newton s Method. Procedure for Newton s Method HISTORICAL BIOGRAPHY 4. Newton s Method 99 4. Newton s Method HISTORICAL BIOGRAPHY Niels Henrik Abel (18 189) One of the basic problems of mathematics is solving equations. Using the quadratic root formula, we know how to

More information

One-Dimensional Dynamics

One-Dimensional Dynamics One-Dimensional Dnamics We aim to characterize the dnamics completel describe the phase portrait) of the one-dimensional autonomous differential equation Before proceeding we worr about 1.1) having a solution.

More information

On Range and Reflecting Functions About the Line y = mx

On Range and Reflecting Functions About the Line y = mx On Range and Reflecting Functions About the Line = m Scott J. Beslin Brian K. Heck Jerem J. Becnel Dept.of Mathematics and Dept. of Mathematics and Dept. of Mathematics and Computer Science Computer Science

More information

Cubic and quartic functions

Cubic and quartic functions 3 Cubic and quartic functions 3A Epanding 3B Long division of polnomials 3C Polnomial values 3D The remainder and factor theorems 3E Factorising polnomials 3F Sum and difference of two cubes 3G Solving

More information

RELATIONS AND FUNCTIONS through

RELATIONS AND FUNCTIONS through RELATIONS AND FUNCTIONS 11.1.2 through 11.1. Relations and Functions establish a correspondence between the input values (usuall ) and the output values (usuall ) according to the particular relation or

More information

Appendix 2 Complex Analysis

Appendix 2 Complex Analysis Appendix Complex Analsis This section is intended to review several important theorems and definitions from complex analsis. Analtic function Let f be a complex variable function of a complex value, i.e.

More information

Geometric Stiffness Effects in 2D and 3D Frames

Geometric Stiffness Effects in 2D and 3D Frames Geometric Stiffness Effects in D and 3D Frames CEE 41. Matrix Structural Analsis Department of Civil and Environmental Engineering Duke Universit Henri Gavin Fall, 1 In situations in which deformations

More information

MAT 1275: Introduction to Mathematical Analysis. Graphs and Simplest Equations for Basic Trigonometric Functions. y=sin( x) Function

MAT 1275: Introduction to Mathematical Analysis. Graphs and Simplest Equations for Basic Trigonometric Functions. y=sin( x) Function MAT 275: Introduction to Mathematical Analsis Dr. A. Rozenblum Graphs and Simplest Equations for Basic Trigonometric Functions We consider here three basic functions: sine, cosine and tangent. For them,

More information

1.2 Functions and Their Properties PreCalculus

1.2 Functions and Their Properties PreCalculus 1. Functions and Their Properties PreCalculus 1. FUNCTIONS AND THEIR PROPERTIES Learning Targets for 1. 1. Determine whether a set of numbers or a graph is a function. Find the domain of a function given

More information

OPTIMAL CONTROL FOR A PARABOLIC SYSTEM MODELLING CHEMOTAXIS

OPTIMAL CONTROL FOR A PARABOLIC SYSTEM MODELLING CHEMOTAXIS Trends in Mathematics Information Center for Mathematical Sciences Volume 6, Number 1, June, 23, Pages 45 49 OPTIMAL CONTROL FOR A PARABOLIC SYSTEM MODELLING CHEMOTAXIS SANG UK RYU Abstract. We stud the

More information

Subband Coding and Wavelets. National Chiao Tung University Chun-Jen Tsai 12/04/2014

Subband Coding and Wavelets. National Chiao Tung University Chun-Jen Tsai 12/04/2014 Subband Coding and Wavelets National Chiao Tung Universit Chun-Jen Tsai /4/4 Concept of Subband Coding In transform coding, we use N (or N N) samples as the data transform unit Transform coefficients are

More information

3.0 PROBABILITY, RANDOM VARIABLES AND RANDOM PROCESSES

3.0 PROBABILITY, RANDOM VARIABLES AND RANDOM PROCESSES 3.0 PROBABILITY, RANDOM VARIABLES AND RANDOM PROCESSES 3.1 Introduction In this chapter we will review the concepts of probabilit, rom variables rom processes. We begin b reviewing some of the definitions

More information

5A Exponential functions

5A Exponential functions Chapter 5 5 Eponential and logarithmic functions bjectives To graph eponential and logarithmic functions and transformations of these functions. To introduce Euler s number e. To revise the inde and logarithm

More information

Constant 2-labelling of a graph

Constant 2-labelling of a graph Constant 2-labelling of a graph S. Gravier, and E. Vandomme June 18, 2012 Abstract We introduce the concept of constant 2-labelling of a graph and show how it can be used to obtain periodic sphere packing.

More information

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics Journal of Inequalities in Pure and Applied Mathematics http://jipam.vu.edu.au/ Volume 2, Issue 2, Article 15, 21 ON SOME FUNDAMENTAL INTEGRAL INEQUALITIES AND THEIR DISCRETE ANALOGUES B.G. PACHPATTE DEPARTMENT

More information

Dynamics of multiple pendula without gravity

Dynamics of multiple pendula without gravity Chaotic Modeling and Simulation (CMSIM) 1: 57 67, 014 Dnamics of multiple pendula without gravit Wojciech Szumiński Institute of Phsics, Universit of Zielona Góra, Poland (E-mail: uz88szuminski@gmail.com)

More information

A convergence result for an Outer Approximation Scheme

A convergence result for an Outer Approximation Scheme A convergence result for an Outer Approximation Scheme R. S. Burachik Engenharia de Sistemas e Computação, COPPE-UFRJ, CP 68511, Rio de Janeiro, RJ, CEP 21941-972, Brazil regi@cos.ufrj.br J. O. Lopes Departamento

More information

Coordinate geometry. + bx + c. Vertical asymptote. Sketch graphs of hyperbolas (including asymptotic behaviour) from the general

Coordinate geometry. + bx + c. Vertical asymptote. Sketch graphs of hyperbolas (including asymptotic behaviour) from the general A Sketch graphs of = a m b n c where m = or and n = or B Reciprocal graphs C Graphs of circles and ellipses D Graphs of hperbolas E Partial fractions F Sketch graphs using partial fractions Coordinate

More information

Dynamics of the parabolic restricted three-body problem

Dynamics of the parabolic restricted three-body problem Dnamics of the parabolic restricted three-bod problem Esther Barrabés a, Josep M. Cors b,, Mercè Ollé c a Universitat de Girona, Escola Politècnica Superior, 1771 Girona, Spain b Universitat Politècnica

More information

SEPARABLE EQUATIONS 2.2

SEPARABLE EQUATIONS 2.2 46 CHAPTER FIRST-ORDER DIFFERENTIAL EQUATIONS 4. Chemical Reactions When certain kinds of chemicals are combined, the rate at which the new compound is formed is modeled b the autonomous differential equation

More information

Notes on Convexity. Roy Radner Stern School, NYU. September 11, 2006

Notes on Convexity. Roy Radner Stern School, NYU. September 11, 2006 Notes on Convexit Ro Radner Stern School, NYU September, 2006 Abstract These notes are intended to complement the material in an intermediate microeconomic theor course. In particular, the provide a rigorous

More information

For each problem, place the letter choice of your answer in the spaces provided on this page.

For each problem, place the letter choice of your answer in the spaces provided on this page. Math 6 Final Exam Spring 6 Your name Directions: For each problem, place the letter choice of our answer in the spaces provided on this page...... 6. 7. 8. 9....... 6. 7. 8. 9....... B signing here, I

More information

Numerical Simulation of Stochastic Differential Equations: Lecture 2, Part 1. Recap: SDE. Euler Maruyama. Lecture 2, Part 1: Euler Maruyama

Numerical Simulation of Stochastic Differential Equations: Lecture 2, Part 1. Recap: SDE. Euler Maruyama. Lecture 2, Part 1: Euler Maruyama Numerical Simulation of Stochastic Differential Equations: Lecture, Part 1 Des Higham Department of Mathematics Universit of Strathclde Lecture, Part 1: Euler Maruama Definition of Euler Maruama Method

More information

Published by European Centre for Research Training and Development UK ( GRONWALL BELLMAN OU-IANG TYPE INEQUALITIES

Published by European Centre for Research Training and Development UK (  GRONWALL BELLMAN OU-IANG TYPE INEQUALITIES GRONWALL BELLMAN OU-IANG TYPE INEQUALITIES Jaashree V. Patil Department of Mathematics Vasantrao Naik Mahavidalaa,Aurangabad - 43 3 (M.S.) INDIA ABSTRACT: In this paper we prove some retarded nonlinear

More information

A sharp Blaschke Santaló inequality for α-concave functions

A sharp Blaschke Santaló inequality for α-concave functions Noname manuscript No will be inserted b the editor) A sharp Blaschke Santaló inequalit for α-concave functions Liran Rotem the date of receipt and acceptance should be inserted later Abstract We define

More information

Identification of a memory kernel in a nonlinear parabolic integro-differential problem

Identification of a memory kernel in a nonlinear parabolic integro-differential problem FACULTY OF ENGINEERING AND ARCHITECTURE Identification of a memory kernel in a nonlinear parabolic integro-differential problem K. Van Bockstal, M. Slodička and F. Gistelinck Ghent University Department

More information

A derivative-free nonmonotone line search and its application to the spectral residual method

A derivative-free nonmonotone line search and its application to the spectral residual method IMA Journal of Numerical Analysis (2009) 29, 814 825 doi:10.1093/imanum/drn019 Advance Access publication on November 14, 2008 A derivative-free nonmonotone line search and its application to the spectral

More information

Null-controllability of the heat equation in unbounded domains

Null-controllability of the heat equation in unbounded domains Chapter 1 Null-controllability of the heat equation in unbounded domains Sorin Micu Facultatea de Matematică-Informatică, Universitatea din Craiova Al. I. Cuza 13, Craiova, 1100 Romania sd micu@yahoo.com

More information

1. Introduction. An optimization problem with value function objective is a problem of the form. F (x, y) subject to y K(x) (1.2)

1. Introduction. An optimization problem with value function objective is a problem of the form. F (x, y) subject to y K(x) (1.2) OPTIMIZATION PROBLEMS WITH VALUE FUNCTION OBJECTIVES ALAIN B. ZEMKOHO Abstract. The famil of optimization problems with value function objectives includes the minmax programming problem and the bilevel

More information

UC San Francisco UC San Francisco Previously Published Works

UC San Francisco UC San Francisco Previously Published Works UC San Francisco UC San Francisco Previousl Published Works Title Radiative Corrections and Quantum Chaos. Permalink https://escholarship.org/uc/item/4jk9mg Journal PHYSICAL REVIEW LETTERS, 77(3) ISSN

More information

14.1 Systems of Linear Equations in Two Variables

14.1 Systems of Linear Equations in Two Variables 86 Chapter 1 Sstems of Equations and Matrices 1.1 Sstems of Linear Equations in Two Variables Use the method of substitution to solve sstems of equations in two variables. Use the method of elimination

More information

MAT389 Fall 2016, Problem Set 2

MAT389 Fall 2016, Problem Set 2 MAT389 Fall 2016, Problem Set 2 Circles in the Riemann sphere Recall that the Riemann sphere is defined as the set Let P be the plane defined b Σ = { (a, b, c) R 3 a 2 + b 2 + c 2 = 1 } P = { (a, b, c)

More information

From bell-shaped solitary wave to W/M-shaped solitary wave solutions in an integrable nonlinear wave equation

From bell-shaped solitary wave to W/M-shaped solitary wave solutions in an integrable nonlinear wave equation PRAMANA c Indian Academ of Sciences Vol. 74, No. journal of Januar 00 phsics pp. 9 6 From bell-shaped solitar wave to W/M-shaped solitar wave solutions in an integrable nonlinear wave equation AIYONG CHEN,,,

More information

A Method for Geometry Optimization in a Simple Model of Two-Dimensional Heat Transfer

A Method for Geometry Optimization in a Simple Model of Two-Dimensional Heat Transfer A Method for Geometr Optimization in a Simple Model of Two-Dimensional Heat Transfer X. Peng, K. Niakhai B. Protas Jul, 3 arxiv:37.48v [math.na] 4 Jul 3 Abstract This investigation is motivated b the problem

More information

Hamiltonicity and Fault Tolerance

Hamiltonicity and Fault Tolerance Hamiltonicit and Fault Tolerance in the k-ar n-cube B Clifford R. Haithcock Portland State Universit Department of Mathematics and Statistics 006 In partial fulfillment of the requirements of the degree

More information

Associativity of triangular norms in light of web geometry

Associativity of triangular norms in light of web geometry Associativit of triangular norms in light of web geometr Milan Petrík 1,2 Peter Sarkoci 3 1. Institute of Computer Science, Academ of Sciences of the Czech Republic, Prague, Czech Republic 2. Center for

More information

* τσ σκ. Supporting Text. A. Stability Analysis of System 2

* τσ σκ. Supporting Text. A. Stability Analysis of System 2 Supporting Tet A. Stabilit Analsis of Sstem In this Appendi, we stud the stabilit of the equilibria of sstem. If we redefine the sstem as, T when -, then there are at most three equilibria: E,, E κ -,,

More information

UNIVERSIDAD CARLOS III DE MADRID MATHEMATICS II EXERCISES (SOLUTIONS )

UNIVERSIDAD CARLOS III DE MADRID MATHEMATICS II EXERCISES (SOLUTIONS ) UNIVERSIDAD CARLOS III DE MADRID MATHEMATICS II EXERCISES (SOLUTIONS ) CHAPTER : Limits and continuit of functions in R n. -. Sketch the following subsets of R. Sketch their boundar and the interior. Stud

More information

The generalized Euler-Maclaurin formula for the numerical solution of Abel-type integral equations.

The generalized Euler-Maclaurin formula for the numerical solution of Abel-type integral equations. The generalized Euler-Maclaurin formula for the numerical solution of Abel-type integral equations. Johannes Tausch Abstract An extension of the Euler-Maclaurin formula to singular integrals was introduced

More information

Chapter 8 More About the Trigonometric Functions

Chapter 8 More About the Trigonometric Functions Relationships Among Trigonometric Functions Section 8. 8 Chapter 8 More About the Trigonometric Functions Section 8. Relationships Among Trigonometric Functions. The amplitude of the graph of cos is while

More information

ON THE BEHAVIOR OF SOLUTIONS OF LINEAR NEUTRAL INTEGRODIFFERENTIAL EQUATIONS WITH UNBOUNDED DELAY

ON THE BEHAVIOR OF SOLUTIONS OF LINEAR NEUTRAL INTEGRODIFFERENTIAL EQUATIONS WITH UNBOUNDED DELAY Georgian Mathematical Journal Volume 11 (24), Number 2, 337 348 ON THE BEHAVIOR OF SOLUTIONS OF LINEAR NEUTRAL INTEGRODIFFERENTIAL EQUATIONS WITH UNBOUNDED DELAY I.-G. E. KORDONIS, CH. G. PHILOS, I. K.

More information

4 Inverse function theorem

4 Inverse function theorem Tel Aviv Universit, 2013/14 Analsis-III,IV 53 4 Inverse function theorem 4a What is the problem................ 53 4b Simple observations before the theorem..... 54 4c The theorem.....................

More information

6.4 graphs OF logarithmic FUnCTIOnS

6.4 graphs OF logarithmic FUnCTIOnS SECTION 6. graphs of logarithmic functions 9 9 learning ObjeCTIveS In this section, ou will: Identif the domain of a logarithmic function. Graph logarithmic functions. 6. graphs OF logarithmic FUnCTIOnS

More information

arxiv: v1 [math.na] 9 Feb 2013

arxiv: v1 [math.na] 9 Feb 2013 STRENGTHENED CAUCHY-SCHWARZ AND HÖLDER INEQUALITIES arxiv:1302.2254v1 [math.na] 9 Feb 2013 J. M. ALDAZ Abstract. We present some identities related to the Cauchy-Schwarz inequality in complex inner product

More information

Ch 3 Alg 2 Note Sheet.doc 3.1 Graphing Systems of Equations

Ch 3 Alg 2 Note Sheet.doc 3.1 Graphing Systems of Equations Ch 3 Alg Note Sheet.doc 3.1 Graphing Sstems of Equations Sstems of Linear Equations A sstem of equations is a set of two or more equations that use the same variables. If the graph of each equation =.4

More information

An analytic proof of the theorems of Pappus and Desargues

An analytic proof of the theorems of Pappus and Desargues Note di Matematica 22, n. 1, 2003, 99 106. An analtic proof of the theorems of Pappus and Desargues Erwin Kleinfeld and Tuong Ton-That Department of Mathematics, The Universit of Iowa, Iowa Cit, IA 52242,

More information

FIXED POINT ITERATION

FIXED POINT ITERATION FIXED POINT ITERATION The idea of the fixed point iteration methods is to first reformulate a equation to an equivalent fixed point problem: f (x) = 0 x = g(x) and then to use the iteration: with an initial

More information

COMPUTATIONAL METHODS AND ALGORITHMS Vol. I - Numerical Methods for Ordinary Differential Equations and Dynamic Systems - E.A.

COMPUTATIONAL METHODS AND ALGORITHMS Vol. I - Numerical Methods for Ordinary Differential Equations and Dynamic Systems - E.A. COMPUTATIOAL METHODS AD ALGORITHMS Vol. I umerical Methods for Ordinar Differential Equations and Dnamic Sstems E.A. oviov UMERICAL METHODS FOR ORDIARY DIFFERETIAL EQUATIOS AD DYAMIC SYSTEMS E.A. oviov

More information

Two-sided Mullins-Sekerka flow does not preserve convexity

Two-sided Mullins-Sekerka flow does not preserve convexity Differential Equations and Computational Simulations III J. Graef, R. Shivaji, B. Soni, & J. Zhu (Editors) Electronic Journal of Differential Equations, Conference 01, 1997, pp. 171 179. ISSN: 1072-6691.

More information

2-6. _ k x and y = _ k. The Graph of. Vocabulary. Lesson

2-6. _ k x and y = _ k. The Graph of. Vocabulary. Lesson Chapter 2 Lesson 2-6 BIG IDEA The Graph of = _ k and = _ k 2 The graph of the set of points (, ) satisfing = k_, with k constant, is a hperbola with the - and -aes as asmptotes; the graph of the set of

More information

Applications of Gauss-Radau and Gauss-Lobatto Numerical Integrations Over a Four Node Quadrilateral Finite Element

Applications of Gauss-Radau and Gauss-Lobatto Numerical Integrations Over a Four Node Quadrilateral Finite Element Avaiable online at www.banglaol.info angladesh J. Sci. Ind. Res. (), 77-86, 008 ANGLADESH JOURNAL OF SCIENTIFIC AND INDUSTRIAL RESEARCH CSIR E-mail: bsir07gmail.com Abstract Applications of Gauss-Radau

More information

2.2 SEPARABLE VARIABLES

2.2 SEPARABLE VARIABLES 44 CHAPTER FIRST-ORDER DIFFERENTIAL EQUATIONS 6 Consider the autonomous DE 6 Use our ideas from Problem 5 to find intervals on the -ais for which solution curves are concave up and intervals for which

More information

STUDY KNOWHOW PROGRAM STUDY AND LEARNING CENTRE. Functions & Graphs

STUDY KNOWHOW PROGRAM STUDY AND LEARNING CENTRE. Functions & Graphs STUDY KNOWHOW PROGRAM STUDY AND LEARNING CENTRE Functions & Graphs Contents Functions and Relations... 1 Interval Notation... 3 Graphs: Linear Functions... 5 Lines and Gradients... 7 Graphs: Quadratic

More information