Parabolic Layers, II

Size: px
Start display at page:

Download "Parabolic Layers, II"

Transcription

1 Discrete Approximations for Singularly Perturbed Boundary Value Problems with Parabolic Layers, II Paul A. Farrell, Pieter W. Hemker, and Grigori I. Shishkin Computer Science Program Technical Report Number CS March 10,1995 Department of Mathematics and Computer Science Kent State University Kent, Ohio

2 Discrete Approximations for Singularly Perturbed Boundary Value Problems with Parabolic Layers, II æ P.A. Farrell y P.W. Hemker z G.I. Shishkin x 1 2 Abstract In his series of three papers we study singularly perturbed èspè boundary value problems for equations of elliptic and parabolic type. For small values of the perturbation parameter parabolic boundary and interior layers appear in these problems. If classical discretisation methods are used, the solution of the ænite diæerence scheme and the approximation of the diæusive æux do not converge uniformly with respect to this parameter. Using the method of special, adapted grids, we can construct diæerence schemes that allow approximation of the solution and the normalised diffusive æux uniformly with respect to the small parameter. We also consider singularly perturbed boundary value problems for convection-diæusion equations. Also for these problems we construct special ænite diæerence schemes, the solution of which converges "-uniformly. We study what problems appear, when classical schemes are used for the approximation of the spatial derivatives. We compare the results with those obtained by the adapted approach. Results of numerical experiments are discussed. In the three papers we ærst give anintroduction on the general problem, and then we consider respectively èiè Problems for SP parabolic equations, for which the solution and the normalised diæusive æuxes are required; èiiè Problems for SP elliptic equations with boundary conditions of Dirichlet, Neumann and Robin type; èiiiè Problems for SP parabolic equation with discontinuous boundary conditions. æ Note: This work was supported by NWO through grant IB y Department of Mathematics and Computer Science, Kent State University, Kent, OH 44240, U.S.A. z CWI, Center for Mathematics and Computer Science, Amsterdam, The Netherlands x IMM, Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Science, Ekaterinburg, Russia 1 AMS Classiæcation: Primary: 65L12. Secondary: 65L50, 65N06, 65N50. 2 Keywords: singular perturbation problems, æ-uniform methods, parabolic boundary layers 1

3 Part II Boundary value problem for elliptic equation with mixed boundary condition 1 Introduction In this part we sketch avariety of special methods which are used for constructing "-uniformly convergent schemes. We shall demonstrate a method which achieves improved accuracy for solving singularly perturbed boundary value problem for elliptic equations with parabolic boundary layers. In Section 4 we shall introduce a natural class, B, of ænite diæerence schemes, in which èby the above mentioned approaches èaè and èbèè we can construct èformallyè the special ænite diæerence schemes with approximate solutions which converge parameter-uniformly to the solution of our initial boundary value problem. In this chapter we consider a class of singularly perturbed boundary value problems which arise when diæusion processes in a moving medium are modeled. For such boundary value problems which describe transfer with diæusion, we construct a special scheme that converges parameter-uniformly. We shall show that for the construction of such schemes from class B, the use of a special condensing grid èor an adaptive meshè is necessary. It means that the choice èto construct special parameter-uniformly convergent schemes for our class of convection diæusion problemsè is quite restricted. By condensing èor adaptiveè grids we can construct ænite diæerence schemes which converge parameter-uniformly. We shall present and discuss the results of numerical computations using both the classical and the new special ænite diæerence schemes. 2 The class of boundary value problems 2.1 The physical problem The diæusion of a substance in a convective æow of an incompressible æuid in a two-dimension domain gives rise to an equation of the form, "æuèxè+~vèxèæ ~ ruèxè=fèxè; x2æ; è2:1aè where ~vèxè and F èxè are the velocity and source, respectively; 1=" is the Peclet number èreynolds numberè, if the substance is heat èdiæusive matter or momentumè ë1ë. When the substance is heat èdiæusive matter or momentumè then 2

4 uèxè is the temperature èdensity or velocityè at the point x. On the boundary of domain considered èthat is the wall of the container holding the æuidè we have a boundary condition that describes the exchange of the substance with the surrounding environment, uèxè =0; æ: è2:1bè æ is the boundary of the domain èthe wall of the containerè, the outward normal derivative at the boundary, æ characterises intensity of exchange of the substance between the medium and the wall, where the value is given by Uèxè. When æ tends to inænity the condition è2.1bè becomes the Dirichlet condition uèxè =Uèxè; 0 æ: The inæow boundary, that is the part of the 0 æ where the stream enters the domain, we denote + æ, and the outæow boundary æ ~nèxè æ ~vèxè é 0; + æ; ~nèxè æ ~vèxè é 0; æ: Here ~nèxè is a unit vector in the direction of the external normal. 0 æwehave condition On the ~nèxè æ ~vèxè =0; 0 æ: + æ the value of uèxè is given, and on outæow æwe assume the æux to be known uèxè =U + èxè; + uèxè =æèxè; æ: è2:1dè Problem è2.1è describes a general diæusion process into moving medium. For suæciently large Peclet number èreynolds numberè, " can be very small. As " tends to zero a boundary layer appears in the neighbourhood of the 0 æ. 2.2 The class of boundary value problems Now we describe the class of two-dimensional convection-diæusion problems with mixed boundary conditions, for which we shall study the convergence behaviour. Notice that we consider here mixed boundary conditions, where usually only Dirichlet boundary conditions are studied. On the rectangular domain D = fx : 0 éx i éd i ; i=1;2gwe consider the elliptic boundary value problem L è2:2è uèxè ç è " 2 X s=1;2 a s 2 1 è uèxè =fèxè; x2è2.2aè D; 3

5 uèxè ='èxè; x2, + ; l è2:2è uèxè, è1, æèuèxè =èèxè; uèxè =çèxè; x2,, : è2.2bè è2.2cè è2.2dè Here a s ;b;c;f;';è, and ç are suæciently smooth functions, æ 2 ë0; 1ë, " 2 è0; 1ë, a 0 ç a 1 èxè, a 2 èxè ç a 0 ; bèxè ç b 0 ; cèxè ç 0; x 2 D; a 0 ; b 0 é0, and, + =,ëfxjx 1 =0g;,, =,ëfxjx 1 =d 1 g;, 0 =,ëfxj0éx 1 éd 1 g: This class of problems includes, for example, the following boundary value problem for a regular diæerential equation X L è2:3è Uèyè çf s=1;2 A 2 s y 2 e D, with regular boundary 1 guèyè =Fèyè; è2:3aè Uèyè =æèyè; y2e, + ; l è2:3è Uèyè Uèyè, è1, =æèyè; y2, e 0 ; =0; y2, e, ; on the rectangular domain e D = fy : 0 éyi ée di ; i=1;2g,e di =",1 d i, if the size of domain e D is suæciently large. 2.3 The construction of "-uniformly convergent schemes When " tends to zero in the neighbourhood of, 0, boundary layers appear which are described by parabolic equations. Hence these layers are known as parabolic boundary layers. Although classical diæerence approximations èsee, for example, ë6, 7ë ë è converge for è2.2è to the solution of the boundary value problem for each æxed value of " èsee Theorem 3.1è, the accuracy of the numerical solution depends on the value of " and decreases, sometimes to complete loss of accuracy, when " is less or comparable with the step-size of the uniform grid. This means that classical ænite diæerence schemes do not converge uniformly with respect to the parameter ", èsee theorem 3.2è. Therefore, for the boundary value problem è2.2è it is of interest to construct special schemes the solution of which does converge "-uniformly. For the case of the Dirichlet problem è2.2aè, an "-uniformly convergent ænite diæerence scheme is found in ë9, 10ë. 4

6 3 Classical diæerence scheme To solve the problem è2.2è we ærst use a classical ænite diæerence method. On the set D we introduce the rectangular grid D h =! 1 æ! 2 ; è3:4è where! s is a, in general non-uniform, grid on the interval ë0;d s ë and N s is the number of nodes of the grid! s, s =1;2. Deæne h i s = x i+1 s, x i s, h s = max i h i s, h ç MN,1, where h = max s h s, N = min s N s, s =1;2; D h = D ë D h,, h =,ëd h :For problem è2.2è we use the diæerence scheme where æ è3:5è zèxè ç " 2 æ è3:5è zèxè =fèxè; x2 D h ; zèxè ='èxè; x2, + h ; ç è3:5è zèxè =èèxè; x2, 0 h ; æ x1 zèxè =çèxè; x2,, h ; X s=1;2 a s èxèæ xsbx s zèxè, bèxèæ x1 zèxè, cèxèzèxè; è3:5aè è3:5bè è3:5cè è3:5dè ç è3:5è zèxè ç è "ææx2 zèxè, è1, æèzèxè; x 2 =0;,"ææ x2 zèxè, è1, æèzèxè; x 2 = d 2 ; æ xsbx s zèxè is the second divided diæerence on a non-uniform grid, and æ xs zèxè and æ xs zèxè are the ærst forward and backward divided diæerences. The diæerence scheme è3.5è, è3.4è is monotone èthat is the maximum principle holdsè ë7ë. By means of the maximum principle, and using the estimates of the derivatives èsee ë5ëè, we ænd that the solution of the scheme è3.5è-è3.4è converges èfor a æxed value of the parameter "è as juèxè,zèxèjçm",4 N,1 ; x 2 D h : è3:6è Theorem 3.1 Let u 2 C 4 èdè. Then, for a æxed value of the parameter ", the solution of the scheme è3.5èíè3.4è converges to the solution of the boundary value problem è2.2è with an error bound given by è3.6è. Clearly è3.6è does not imply "-uniform convergence of the diæerence scheme. In fact it can be shown that it is impossible to obtain "-uniform convergence for the diæerence scheme è3.5è-è3.4è on a æxed "-independent mesh. The proof is found in ë8ë. We summarise this result in the following theorem. Theorem 3.2 èsee ë5ëè On an "-independent grid of type è3.4è, the solution of the classical ænite diæerence scheme è3.5è,è4.8è does not converge "-uniformly to the solution of the boundary value problem è2.2è. 5

7 We want to make the following interesting observation. We consider problem è2.2è. If we take inl è2:2è the parameter " = 1 èleaving " unchanged in è2.2aè and æ è3:5è, but adapting it in ç è3:5è è, then no singular part will appear as a ærst term in the expansion w.r.t. ". Hence, the classical scheme will be "-uniform convergent in this case. 4 The ætted diæerence scheme For parabolic problems with parabolic layers, it was shown in ë5ë that there does not exist a diæerence scheme only based on ætting of the coeæcients, for which the solution converges "-uniformly to the solution. Here we show a similar result for the elliptic boundary value problem è2.2è. Let us consider the problem L è4:7è uèxè ç " 1 uèxè =0; x2d; è4:7aè uèxè =0; x2, + ; è4:7bè l è2:2è uèxè =èèxè; x2, 0 ; è4:7cè where uèxè =0; x2,, ; è4:7dè ç è0 èx 1 è; x2, 0 ; x 2 =0; 0; x2, 0 ; x 2 6=0; and the function è 0 èx 1 è; x 1 2 ë0;d 1 ë is suæciently smooth. The solution of problem è4.7è is the singular solution. Let us introduce a class, called class A, of ænite diæerence schemes for problem è4.7è, for the construction of which we use uniform meshes: D u h = fd hè3:4è ; where! s =! u s are uniform grids; s =1;2g: è4:8è and also èfor the approximation of equation è4.7aèè a standard æve-point, ætted ænite diæerence operator X æ è4:9è zèxè çf èa s æ xs x s + B s æ xs, Cgzèxè =E; x 2 D h : è4:9è s=1;2 Here the coeæcients A s ;B s ;C;Eare functionals of the coeæcients of equation è4.7aè and also depend on x; h 1 ; h 2, and ". We suppose that for h 2 ",1! 0 and h 1! 0 these coeæcients A s ; B s ; C; Eapproximate the data of equation è4.7aè, in the uniform norm, in the neighbourhood of at least one point the boundary layer region. 6

8 Theorem 4.1 In the class A of ænite diæerence schemes there does not exist a diæerence scheme of which the solution converges "-uniformly to the solution of the boundary value problem è4.7è. The proof of this theorem is rather complex. An outline of the principle steps is found in ë11, 13ë. Remark 1. A statement similar to Theorem 4.1 is also true in the case when the diæerence schemes are constructed on a more general stencil with a ænite number of nodes. The results of Theorem 4.1 and Remark 1 can be explained as follows. All solutions of problem è4.7è èdeæned by diæerent functions èèxèè are singular solutions. Those solutions can not be represented as linear combinations of a ænite number of æxed functions of boundary layer type èboundary layer functionsè. Let us introduce class B of ænite diæerence schemes for problem è2.2è, for the construction of which we use rectangular grids D h è3:4è, which are generally nonuniform and a æve-point ænite diæerence operator èin general a ætted operatorè of the standard form. The coeæcients of the diæerence operator are, as before, functionals of the coeæcients of the equation è2.2aè and also depend on x; " and on the distance between the nodes of the stencil used. Again, we suppose that for h! 0 the coeæcients of the diæerence operator approximate èin the uniform normè the coeæcients of equation è2.2aè on the set D h è3:4è. We remark that class B is a natural class for constructing ænite diæerence schemes for problem è2.2è as it includes both ætted methods and methods with special condensing grids. This is in contrast to class A, which contains only schemes on uniform meshes. Consequences of Theorem 4.1 include results such as: Corollary 4.2 In the case of boundary value problems of type è2.2è, class B of ænite diæerence schemes does not contain any diæerence scheme which, on grids with arbitrary distribution of nodes, can achieve "-uniform convergence of the solution to solution of boundary value problem è2.2è by the use of a ætted method. Corollary 4.3 In the case of boundary value problems of type è2.2è, the use of special condensing grids èor adaptive meshesè is necessary for the construction of " -uniformly class B ænite diæerence schemes. 5 Diæerence scheme of method of special condensing mesh We now construct an "-uniformly convergent scheme for the boundary value problem è2.2è. We use a special condensing mesh èin the neighbourhood of 7

9 the boundary layersè, where the distribution of the nodes is deæned by a-priori estimates of the solution and its derivatives. This approach is similar to that in ë11, 12, 13ë, where the Dirichlet problem was studied. Consider the special grid D æ h =! 1 æ! æ 2 ; è5:10è where! æ 2 =! æ 2 èçè is a special piecewise uniform mesh,! 1 is a uniform mesh, ç is a parameter which depends on " and N 2. The mesh! æ 2 èçè is constructed as follows. The interval ë 0;d 2 ë is divided into three parts ë 0;çë, ë ç;d 2,çë, ë d 2,ç;d 2 ë, 0 éççd 2 =4. Each subinterval ë 0;çë and ë d 2,ç;d 2 ë is divided into N 2 =4 equal cells and the subinterval ë ç;d 2,çëinto N 2 =2 equal cells. Suppose ç = çè"; N 2 è = minë d 2 =4; m"ln N 2 ë where m is arbitrary number. The diæerence scheme è3.5è, è5.10è belongs to class B. The scheme is constructed using an a priori adapted mesh. Distribution of the nodes on grid D æ h ensures " -uniform approximation of the boundary value problem. This is formalised in the following theorem èsee also ë5ëè. Theorem 5.1 The solution of diæerence scheme è3.5è, è5.10è converges " - uniformly to the solution of boundary value problem è2.2è. The following bound holds for the error juèxè, zèxèj çmn,1=3 ; x2d æ h : è5:11è The proof of this theorem will appear in a future paper. 6 Numerical results Theoretically èsee Theorem 3.2è it has been shown that the classical diæerence scheme è3.5è on the uniform grid è4.8è does not converge "-uniformly in the l 1 -norm to the solution of the boundary value problem è2.2è. But it could be the case that the error max Dh jzèxè, uèxèj is relatively small for the classical scheme, which would reduce the need for a special scheme. On the other hand, Theorem 5.1 shows that the special scheme è3.5è,è5.10è converges "-uniformly, but no indication is given about the value of the order constant M in è5.11è and the order of convergence is rather small. It might be that the error is relatively large for any reasonable values of N 1, N 2. This would reduce the practical value of the special scheme. The following numerical experiments address these issues. 6.1 The model problem To see the eæect of the special scheme in practice, for the approximation of the model problem we study the singularly perturbed elliptic equation with a mixed 8

10 boundary condition L è6:12è uèxè ç " 2 æuèxè, l è6:12è uèxè =èèxè; x2, 1 uèxè =,1; x2d ; è6:12è where uèxè=0; x2, 2 uèxè =0; x2,, ; l è6:12è uèxè ç ç æ"è@=@x2 èuèxè,è1, æèuèxè; x 2 =0;,æ"è@=@x 2 èuèxè,è1, æèuèxè; x 2 =1: We compare the numerical results for the classical scheme è3.5è, è4.8è and the special scheme è3.5è, è5.10è. Here D = fx :0éx 1 ;x 2 é1g, ç x1 ; x2, èèxè= 0 ;x 2 =0; 0; x2, 0 ;x 2 =1: For the solution of problem è6.12è, we have the representation uèxè =Uèxè+Wèxè; x2d; where Uèxè =x 1,x2D, is the outer solution, and W èxè represents the parabolic boundary layer in the neighbourhood of the edges at x 2 = 0 and x 2 =1. We have the following bounds on the solution,1 ç uèxè ç 1; x2d : Due to Theorem 5.1 the solution of the discrete problem with the adapted mesh converges "-uniformly to the solution of our model problem è6.12è. The function u h èxè, which is the solution of the special scheme è3.5è,è5.10è is shown in Figure The behaviour of the numerical solution of the classical scheme To see the diæerence between the use of the uniform and the adapted grid, for the approximation of è6.12è we ærst use the classical scheme è3.5è,è4.8è. We solve the problem for diæerent values of the mesh width h 1 = h 2 = N,1 and for diæerent values of the parameters " and æ. The results for a set of numerical experiments is given in Table 1. From Table 1 we can see that the solution of scheme è3.5è-è4.8è does not converge "-uniformly. The errors, for a æxed value of N, depend on the parameters " and æ. For " ç 0:1 and æ =0:0;0:1;0:5;1:0 the error behaviour is regular: when N increases, the error decreases. For " =10,3 9

11 Figure 1: Solution computed with the adapted mesh, " = 0:01, æ = 0:5, N = 32 and m =1:0. Table 1: Table of errors EèN; "; æè for the classical scheme N " æ è-1è 0.329è-1è 0.158è-1è 0.696è-2è 0.241è-2è 10, è-1è 0.291è-1è 0.122è-1è 0.403è-2è 10, è-1è è-1è 0.246è-1è 10, è-1è 0.283è-1è 0.157è-1è 0.200è-1è è-1è 0.381è-1è 0.170è-1è 0.744è-2è 0.314è-2è 0.104è-2è 10, è-1è 0.310è-1è 0.129è-1è 0.423è-2è 10, è-1è 10, è-1è 0.401è-1è 0.183è-1è 0.842è-2è 0.359è-2è 0.119è-2è 10, è-1è 0.176è-1è 10, , è-1è 0.288è-1è 0.132è-1è 0.562è-2è 0.187è-2è 10, è-1è 0.211è-1è 10, , In this table the error EèN; "; æè is deæned by EèN; "; æè = max x2d h jeèx; N; "; æèj ; è6:13aè eèx; N; "; æè =zèxè,u? èxè; è6:13bè where u? èxè is the piecewise interpolation of z m?256 èxè, m = m è5:10è = 1 èsee Table 2è, and zèxè ç z N èxè is the solution of è3.5è,è4.8è with h 1 = h 2 = N,1. Notice that u? èxè is an accurate approximation of uèxè. 10

12 and æ =0:0;0:1;0:5 and for " =10,2 and æ =0:0, for some values of N the error increases with increasing N. For æ =0:5;1:0 and a æxed N the error increases with decreasing ". In particular, for " = 10,3 and æ = 0:5;1:0 the errors for N ç 128 are of the same order or larger than èin `1-normè the solution of the BVP. Thus, the numerical results illustrate that the lack of"-uniform convergence leads to large errors indeed. 6.3 The behaviour of the numerical solution of the special scheme In Table 2 we show the behaviour of è3.5è,è5.10è, with m = m è5:10è = 1, applied to the model problem è6.12è From Table 2 we can see that the solution of the Table 2: Table of errors EèN; "; æè for the special scheme N " æ è-1è 0.329è-1è 0.158è-1è 0.696è-2è 0.241è-2è 10, è-1è 0.291è-1è 0.122è-1è 0.403è-2è 10, è-1è 0.361è-1è 0.148è-1è 0.497è-2è 10, è-1è 0.361è-1è 0.148è-1è 0.497è-2è è-1è 0.381è-1è 0.170è-1è 0.744è-2è 0.314è-2è 0.104è-2è 10, è-1è 0.310è-1è 0.129è-1è 0.423è-2è 10, è-1è 0.461è-1è 0.240è-1è 0.924è-2è 10, è-1è 0.461è-1è 0.241è-1è 0.925è-2è è-1è 0.401è-1è 0.183è-1è 0.842è-2è 0.359è-2è 0.119è-2è 10, è-1è 0.176è-1è 10, è-1è 10, è-1è è-1è 0.288è-1è 0.132è-1è 0.562è-2è 0.187è-2è 10, è-1è 0.211è-1è 10, è-1è 10, è-1è In this table the function EèN; "; æè is deæned by è6.13è, but now zèxè =z m?n èxè in è6.13è is the solution of è3.5è,è5.10è with m = m è5:10è = 1 and N 1 = N 2 = N scheme è3.5è-è5.10è does converge "-uniformly indeed. The errors for a æxed value of " =1:0;10,1 ; 10,2 ; 10,3 and æ =0:0;0:1;0:5;1:0have all a regular behaviour and decrease for increasing N. For a æxed value of æ and N the error stabilises for decreasing ": the errors for " =10,2 and " =10,3 are practically the same. For " ç 10,2 and a æxed value of N we ænd the largest error for æ =1:0. In particular, for " ç 10,2, æ =1:0 and N = 128 the error is less than 6è. Also here, the numerical results illustrate the practical value of "-convergent methods. 11

13 Conclusion For the elliptic boundary value problem è2.2è, where a small parameter multiplies the highest derivative, we have analysed diæerent approaches for the construction of discrete methods. We present methods for which the accuracy of the discrete solution does not depend on the value of the small parameter, but only on the number ofpoints in the discretisation. We show that in a natural class of ænite diæerence schemes, for the problem considered, no "-uniform methods exist on a uniform grid ètheorem 4.1è. As a consequence, for the construction of "-uniform methods the use of an adapted non-uniform mesh is necessary. With a special, adapted, non-uniform mesh and a simple classical diæerence scheme, we are able to construct an "-uniform approximation To illustrate the practical importance of our study, for a model problem we show byanumerical example that, on a uniform grid, the classical diæerence scheme is not "-uniformly convergent. In our example, the error èwith a Neumann boundary conditionè is not less than 700è of the solution, for N=128 and " =10,3. The same example shows that we might obtain an "-uniformly convergent solution if we use the adapted mesh. Now the error is not larger than 6è of the solution, for any value of the parameter ". Thus, the numerical example illustrates that the theoretical considerations have practical implications indeed. References ë1ë E.V. Ametistov V.A. Grigor'ev B.T. Eæmtsev, editor. Heat and Mass Transfer. HeatíTechnology Experiment. Handbook. Energoizdat, Moscow, èin Russianè. ë2ë P.W. Hemker and G.I. Shishkin. Discrete approximation of singularly perturbed parabolic PDEs with a discontinuous initial condition. In J.J.H. Miller, editor, BAIL VI Proceedings, pages 3í4. Boole Press, ë3ë P.W. Hemker and G.I. Shishkin. Approximation of parabolic PDEs with a discontinuous initial condition. East-West Journal of Numerical mathematics, 1è4è:287í302, ë4ë P.W. Hemker and G.I. Shishkin. Discrete approximation of singularly perturbed parabolic pdes with a discontinuous initial condition. Computational Fluid Dynamics Journal, 2:375í392, ë5ë P.W. Hemker and G.I. Shishkin. On a class of singularly perturbed boundary value problems for which an adaptive mesh technique is necessary. In D. Bainov and V. Covachev, editors, Proceedings of the Second International Colloquium on Numerical Analysis, pages 83í92. VSP, International 12

14 Science Publishers, Proceedings of the ësecond International Colloquium on Numerical Analysis", August 13-17, ë6ë G.I. Marchuk. Methods of Numerical Mathematics. Springer, New York, ë7ë A.A. Samarski. Theory of Diæerence Scheme. Nauka, Moscow, èin Russianè. ë8ë G.I. Shishkin. An increase in accuracy of solutions to diæerence scheme for parabolic equations with small parameters at highest-order derivatives. Zh. Vychisl. Mat. Mat. Fiz., 24:864í875, èin Russianè. ë9ë G.I. Shishkin. Approximation of solutions to singularly perturbed boundary value problems with corner boundary layers. Doklady Akad. Nauk SSSR., 296:39í43, èin Russianè. ë10ë G.I. Shishkin. Approximation of solutions to singularly perturbed boundary value problems with corner boundary layers. Zh. Vychisl. Mat. Mat. Fiz., 27:1360í1374, èin Russianè. ë11ë G.I. Shishkin. Approximation of solutions to singularly perturbed boundary value problems with parabolic boundary layers. Zh. Vychisl. Mat. Mat. Fiz., 29:963í977, èin Russianè. ë12ë G.I. Shishkin. Grid approximation of singularly perturbed elliptic equation in domain with characteristic bounds. Sov. J. Numer. Anal. Math. Modelling., 5:327í343, ë13ë G.I. Shishkin. Grid Approximation of Singularly Perturbed Elliptic and Parabolic Equations. Ur. O. RAN, Ekaterinburg, èin Russianè. 13

Iterative Domain Decomposition Methods for Singularly Perturbed Nonlinear Convection-Diffusion Equations

Iterative Domain Decomposition Methods for Singularly Perturbed Nonlinear Convection-Diffusion Equations Iterative Domain Decomposition Methods for Singularly Perturbed Nonlinear Convection-Diffusion Equations P.A. Farrell 1, P.W. Hemker 2, G.I. Shishkin 3 and L.P. Shishkina 3 1 Department of Computer Science,

More information

Kent State University

Kent State University Solution of Singular Perturbation Problems via the Domain Decomposition Method on Serial and Parallel Computers Paul A. Farrell, Igor P. Boglaev and Vadim V. Sirotkin Computer Science Program Technical

More information

If we remove the cyclotomic factors of fèxè, must the resulting polynomial be 1 or irreducible? This is in fact not the case. A simple example is give

If we remove the cyclotomic factors of fèxè, must the resulting polynomial be 1 or irreducible? This is in fact not the case. A simple example is give AN EXTENSION OF A THEOREM OF LJUNGGREN Michael Filaseta and Junior Solan* 1. Introduction E.S. Selmer ë5ë studied the irreducibility over the rationals of polynomials of the form x n + " 1 x m + " 2 where

More information

where Sènè stands for the set of n æ n real symmetric matrices, and æ is a bounded open set in IR n,typically with a suæciently regular boundary, mean

where Sènè stands for the set of n æ n real symmetric matrices, and æ is a bounded open set in IR n,typically with a suæciently regular boundary, mean GOOD AND VISCOSITY SOLUTIONS OF FULLY NONLINEAR ELLIPTIC EQUATIONS 1 ROBERT JENSEN 2 Department of Mathematical and Computer Sciences Loyola University Chicago, IL 60626, U.S.A. E-mail: rrj@math.luc.edu

More information

LECTURE Review. In this lecture we shall study the errors and stability properties for numerical solutions of initial value.

LECTURE Review. In this lecture we shall study the errors and stability properties for numerical solutions of initial value. LECTURE 24 Error Analysis for Multi-step Methods 1. Review In this lecture we shall study the errors and stability properties for numerical solutions of initial value problems of the form è24.1è dx = fèt;

More information

problem of detection naturally arises in technical diagnostics, where one is interested in detecting cracks, corrosion, or any other defect in a sampl

problem of detection naturally arises in technical diagnostics, where one is interested in detecting cracks, corrosion, or any other defect in a sampl In: Structural and Multidisciplinary Optimization, N. Olhoæ and G. I. N. Rozvany eds, Pergamon, 1995, 543í548. BOUNDS FOR DETECTABILITY OF MATERIAL'S DAMAGE BY NOISY ELECTRICAL MEASUREMENTS Elena CHERKAEVA

More information

Keywords: machine learning, reinforcement learning, dynamic programming, Markov decision processes èmdpsè, linear programming, convex programming, fun

Keywords: machine learning, reinforcement learning, dynamic programming, Markov decision processes èmdpsè, linear programming, convex programming, fun Approximate Solutions to Markov Decision Processes Geoærey J. Gordon June 1999 CMU-CS-99-143 School of Computer Science Carnegie Mellon University Pittsburgh, PA 15213 Submitted in partial fulællment of

More information

J. TSINIAS In the present paper we extend previous results on the same problem for interconnected nonlinear systems èsee ë1-18ë and references therein

J. TSINIAS In the present paper we extend previous results on the same problem for interconnected nonlinear systems èsee ë1-18ë and references therein Journal of Mathematical Systems, Estimation, and Control Vol. 6, No. 1, 1996, pp. 1í17 cæ 1996 Birkhíauser-Boston Versions of Sontag's Input to State Stability Condition and Output Feedback Global Stabilization

More information

On the Solution of the Elliptic Interface Problems by Difference Potentials Method

On the Solution of the Elliptic Interface Problems by Difference Potentials Method On the Solution of the Elliptic Interface Problems by Difference Potentials Method Yekaterina Epshteyn and Michael Medvinsky Abstract Designing numerical methods with high-order accuracy for problems in

More information

2 2. EQUATIONS AND ALGORITHMS 2.1. WAITING ELEMENTS Brittle-elastic bar. Consider a stretched rod from a homogeneous elastic-brittle material. If load

2 2. EQUATIONS AND ALGORITHMS 2.1. WAITING ELEMENTS Brittle-elastic bar. Consider a stretched rod from a homogeneous elastic-brittle material. If load DYNAMICS OF DAMAGE IN TWO-DIMENSIONAL STRUCTURES WITH WAITING LINKS Andrej Cherkaev and Liya Zhornitskaya Keywords: Dynamics of damage, Failure, Structures. Abstract The paper deals with simulation of

More information

322 HENDRA GUNAWAN AND MASHADI èivè kx; y + zk çkx; yk + kx; zk: The pair èx; kæ; ækè is then called a 2-normed space. A standard example of a 2-norme

322 HENDRA GUNAWAN AND MASHADI èivè kx; y + zk çkx; yk + kx; zk: The pair èx; kæ; ækè is then called a 2-normed space. A standard example of a 2-norme SOOCHOW JOURNAL OF MATHEMATICS Volume 27, No. 3, pp. 321-329, July 2001 ON FINITE DIMENSIONAL 2-NORMED SPACES BY HENDRA GUNAWAN AND MASHADI Abstract. In this note, we shall study ænite dimensional 2-normed

More information

Numerical Solutions to Partial Differential Equations

Numerical Solutions to Partial Differential Equations Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Numerical Methods for Partial Differential Equations Finite Difference Methods

More information

A PARAMETER ROBUST NUMERICAL METHOD FOR A TWO DIMENSIONAL REACTION-DIFFUSION PROBLEM

A PARAMETER ROBUST NUMERICAL METHOD FOR A TWO DIMENSIONAL REACTION-DIFFUSION PROBLEM A PARAMETER ROBUST NUMERICAL METHOD FOR A TWO DIMENSIONAL REACTION-DIFFUSION PROBLEM C. CLAVERO, J.L. GRACIA, AND E. O RIORDAN Abstract. In this paper a singularly perturbed reaction diffusion partial

More information

2 I. Pritsker and R. Varga Wesay that the triple èg; W;æè has the rational approximation property if, iè iiè for any f èzè which is analytic in G and

2 I. Pritsker and R. Varga Wesay that the triple èg; W;æè has the rational approximation property if, iè iiè for any f èzè which is analytic in G and Rational approximation with varying weights in the complex plane Igor E. Pritsker and Richard S. Varga Abstract. Given an open bounded set G in the complex plane and a weight function W èzè which is analytic

More information

of the BaBar Silicon Vertex Tracker D. Barni, D. Giugni, F. Lanni, F. Palombo Abstract

of the BaBar Silicon Vertex Tracker D. Barni, D. Giugni, F. Lanni, F. Palombo Abstract BaBar Note è 295 May 16th, 1996 Thermal Finite Elements Analysis of the BaBar Silicon Vertex Tracker D. Barni, D. Giugni, F. Lanni, F. Palombo Dipartimento di Fisica dell'universitça and Sezione INFN,

More information

SPLINE COLLOCATION METHOD FOR SINGULAR PERTURBATION PROBLEM. Mirjana Stojanović University of Novi Sad, Yugoslavia

SPLINE COLLOCATION METHOD FOR SINGULAR PERTURBATION PROBLEM. Mirjana Stojanović University of Novi Sad, Yugoslavia GLASNIK MATEMATIČKI Vol. 37(57(2002, 393 403 SPLINE COLLOCATION METHOD FOR SINGULAR PERTURBATION PROBLEM Mirjana Stojanović University of Novi Sad, Yugoslavia Abstract. We introduce piecewise interpolating

More information

ACCURATE NUMERICAL METHOD FOR BLASIUS PROBLEM FOR FLOW PAST A FLAT PLATE WITH MASS TRANSFER

ACCURATE NUMERICAL METHOD FOR BLASIUS PROBLEM FOR FLOW PAST A FLAT PLATE WITH MASS TRANSFER FDS-2000 Conference, pp. 1 10 M. Sapagovas et al. (Eds) c 2000 MII ACCURATE UMERICAL METHOD FOR BLASIUS PROBLEM FOR FLOW PAST A FLAT PLATE WITH MASS TRASFER B. GAHA 1, J. J. H. MILLER 2, and G. I. SHISHKI

More information

StrucOpt manuscript No. èwill be inserted by the editorè Detecting the stress æelds in an optimal structure II: Three-dimensional case A. Cherkaev and

StrucOpt manuscript No. èwill be inserted by the editorè Detecting the stress æelds in an optimal structure II: Three-dimensional case A. Cherkaev and StrucOpt manuscript No. èwill be inserted by the editorè Detecting the stress æelds in an optimal structure II: Three-dimensional case A. Cherkaev and _I. Kíucíuk Abstract This paper is the second part

More information

Interior Layers in Singularly Perturbed Problems

Interior Layers in Singularly Perturbed Problems Interior Layers in Singularly Perturbed Problems Eugene O Riordan Abstract To construct layer adapted meshes for a class of singularly perturbed problems, whose solutions contain boundary layers, it is

More information

November 9, Abstract. properties change in response to the application of a magnetic æeld. These æuids typically

November 9, Abstract. properties change in response to the application of a magnetic æeld. These æuids typically On the Eæective Magnetic Properties of Magnetorheological Fluids æ November 9, 998 Tammy M. Simon, F. Reitich, M.R. Jolly, K. Ito, H.T. Banks Abstract Magnetorheological èmrè æuids represent a class of

More information

A.V. SAVKIN AND I.R. PETERSEN uncertain systems in which the uncertainty satisæes a certain integral quadratic constraint; e.g., see ë5, 6, 7ë. The ad

A.V. SAVKIN AND I.R. PETERSEN uncertain systems in which the uncertainty satisæes a certain integral quadratic constraint; e.g., see ë5, 6, 7ë. The ad Journal of Mathematical Systems, Estimation, and Control Vol. 6, No. 3, 1996, pp. 1í14 cæ 1996 Birkhíauser-Boston Robust H 1 Control of Uncertain Systems with Structured Uncertainty æ Andrey V. Savkin

More information

P.B. Stark. January 29, 1998

P.B. Stark. January 29, 1998 Statistics 210B, Spring 1998 Class Notes P.B. Stark stark@stat.berkeley.edu www.stat.berkeley.eduèçstarkèindex.html January 29, 1998 Second Set of Notes 1 More on Testing and Conædence Sets See Lehmann,

More information

that in Conecture 1 we havefèxè=èx n+1, 1è=èx, 1è so that f 0 èxè = nxn+1, èn +1èx n +1 èx,1è 2 : Higher derivatives of fèxè as in Conecture 2 take a

that in Conecture 1 we havefèxè=èx n+1, 1è=èx, 1è so that f 0 èxè = nxn+1, èn +1èx n +1 èx,1è 2 : Higher derivatives of fèxè as in Conecture 2 take a CLASSES OF POLNOMIALS HAVING ONL ONE NONíCCLOTOMIC IRREDUCIBLE FACTOR A. Borisov, M. Filaseta*, T.. Lam**, and O. Trifonov 1. Introduction In 1986, during the problem session at the West Coast Number Theory

More information

SPRING Final Exam. May 5, 1999

SPRING Final Exam. May 5, 1999 IE 230: PROBABILITY AND STATISTICS IN ENGINEERING SPRING 1999 Final Exam May 5, 1999 NAME: Show all your work. Make sure that any notation you use is clear and well deæned. For example, if you use a new

More information

CS 294-2, Visual Grouping and Recognition èprof. Jitendra Malikè Sept. 8, 1999

CS 294-2, Visual Grouping and Recognition èprof. Jitendra Malikè Sept. 8, 1999 CS 294-2, Visual Grouping and Recognition èprof. Jitendra Malikè Sept. 8, 999 Lecture è6 èbayesian estimation and MRFè DRAFT Note by Xunlei Wu æ Bayesian Philosophy æ Markov Random Fields Introduction

More information

initial work on entropy coding èe.g. Huæman codingè relied on knowing, or measuring,

initial work on entropy coding èe.g. Huæman codingè relied on knowing, or measuring, 161 Chapter 6 Adaptive Quantization Without Side Information 1 Contents 6.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 161 6.2 Adaptation algorithm : : : : : : : : : :

More information

FORM 1 Physics 240 í Fall Exam 1 CONTI COULTER GRAFE SKALSEY ZORN. Please æll in the information requested on the scantron answer sheet

FORM 1 Physics 240 í Fall Exam 1 CONTI COULTER GRAFE SKALSEY ZORN. Please æll in the information requested on the scantron answer sheet FORM 1 Physics 240 í Fall 1999 Exam 1 Name: Discussion section instructor and time: ècircle ONE TIMEè CONTI COULTER GRAFE SKALSEY ZORN MW 10-11 èè23è MW 8-9 èè4è MW 2-3 èè7è MW 11-12 èè6è MW 9-10 èè12è

More information

Economics Midterm Answer Key. Q1 èiè In this question we have a Marshallian demand function with arguments Cèp;mè =

Economics Midterm Answer Key. Q1 èiè In this question we have a Marshallian demand function with arguments Cèp;mè = Economics 7 997 Midterm Answer Key PART A Q èiè In this question we have a Marshallian demand function with arguments Cè;mè = Cè; w; w Lè. We can determine this function from the solution to max fc;lg

More information

where A and B are constants of integration, v t = p g=k is the terminal velocity, g is the acceleration of gravity, and m is the mass of the projectil

where A and B are constants of integration, v t = p g=k is the terminal velocity, g is the acceleration of gravity, and m is the mass of the projectil Homework 5 Physics 14 Methods in Theoretical Physics Due: Wednesday February 16, 4 Reading Assignment: Thornton and Marion, Ch..4. 1. è1d motion, Newtonian resistance.è In class, we considered the motion

More information

582 A. Fedeli there exist U 2B x, V 2B y such that U ë V = ;, and let f : X!Pèçè bethe map dened by fèxè =B x for every x 2 X. Let A = ç ëfs; X; ç; ç;

582 A. Fedeli there exist U 2B x, V 2B y such that U ë V = ;, and let f : X!Pèçè bethe map dened by fèxè =B x for every x 2 X. Let A = ç ëfs; X; ç; ç; Comment.Math.Univ.Carolinae 39,3 è1998è581í585 581 On the cardinality of Hausdor spaces Alessandro Fedeli Abstract. The aim of this paper is to show, using the reection principle, three new cardinal inequalities.

More information

Parameter-Uniform Numerical Methods for a Class of Singularly Perturbed Problems with a Neumann Boundary Condition

Parameter-Uniform Numerical Methods for a Class of Singularly Perturbed Problems with a Neumann Boundary Condition Parameter-Uniform Numerical Methods for a Class of Singularly Perturbed Problems with a Neumann Boundary Condition P. A. Farrell 1,A.F.Hegarty 2, J. J. H. Miller 3, E. O Riordan 4,andG.I. Shishkin 5 1

More information

Centrum voor Wiskunde en Informatica

Centrum voor Wiskunde en Informatica Centrum voor Wiskunde en Informatica Modelling, Analysis and Simulation Modelling, Analysis and Simulation High-order time-accurate schemes for singularly perturbed parabolic convection-diffusion problems

More information

APPENDIX E., where the boundary values on the sector are given by = 0. n=1. a 00 n + 1 r a0 n, n2

APPENDIX E., where the boundary values on the sector are given by = 0. n=1. a 00 n + 1 r a0 n, n2 APPENDIX E Solutions to Problem Set 5. èproblem 4.5.4 in textè èaè Use a series expansion to nd èèr;è satisfying èe.è è rr + r è r + r 2 è =, r 2 cosèè in the sector éré3, 0 éé 2, where the boundary values

More information

RIGIDITY IN THE HARMONIC MAP HEAT FLOW. We establish various uniformity properties of the harmonic map heat æow,

RIGIDITY IN THE HARMONIC MAP HEAT FLOW. We establish various uniformity properties of the harmonic map heat æow, j. differential geometry 45 è1997è 593-610 RIGIDITY IN THE HARMONIC MAP HEAT FLOW PETER MILES TOPPING Abstract We establish various uniformity properties of the harmonic map heat æow, including uniform

More information

ON SINGULAR PERTURBATION OF THE STOKES PROBLEM

ON SINGULAR PERTURBATION OF THE STOKES PROBLEM NUMERICAL ANALYSIS AND MATHEMATICAL MODELLING BANACH CENTER PUBLICATIONS, VOLUME 9 INSTITUTE OF MATHEMATICS POLISH ACADEMY OF SCIENCES WARSZAWA 994 ON SINGULAR PERTURBATION OF THE STOKES PROBLEM G. M.

More information

L. FAYBUSOVICH in detail in ë6ë. The set of points xèæè;æ ç 0; is usually called the central trajectory for the problem For the construction

L. FAYBUSOVICH in detail in ë6ë. The set of points xèæè;æ ç 0; is usually called the central trajectory for the problem For the construction Journal of Mathematical Systems, Estimation, and Control Vol. 5, No. 3, 1995, pp. 1í13 cæ 1995 Birkhíauser-Boston A Hamiltonian Formalism for Optimization Problems æ Leonid Faybusovich Abstract We consider

More information

StrucOpt manuscript No. èwill be inserted by the editorè Detecting stress æelds in an optimal structure I Two-dimensional case and analyzer A. Cherkae

StrucOpt manuscript No. èwill be inserted by the editorè Detecting stress æelds in an optimal structure I Two-dimensional case and analyzer A. Cherkae StrucOpt manuscript No. èwill be inserted by the editorè Detecting stress æelds in an optimal structure I Two-dimensional case and analyzer A. Cherkaev and _I. Kíucíuk Abstract In this paper, weinvestigate

More information

Figure 1: Startup screen for Interactive Physics Getting Started The ærst simulation will be very simple. With the mouse, select the circle picture on

Figure 1: Startup screen for Interactive Physics Getting Started The ærst simulation will be very simple. With the mouse, select the circle picture on Experiment Simulations í Kinematics, Collisions and Simple Harmonic Motion Introduction Each of the other experiments you perform in this laboratory involve a physical apparatus which you use to make measurements

More information

SUMMARY The maximum likelihood estimator for the drift of a Brownian æow on IR d, d ç 2, is found with the assumption that the covariance is known. By

SUMMARY The maximum likelihood estimator for the drift of a Brownian æow on IR d, d ç 2, is found with the assumption that the covariance is known. By MAXIMUM LIKELIHOOD ESTIMATOR FOR THE DRIFT OF A BROWNIAN FLOW Mine CçA~GLAR Princeton University, Princeton, NJ, USA 1 1 Current address: Guttenberg, NJ USA 1 SUMMARY The maximum likelihood estimator for

More information

Journal of Universal Computer Science, vol. 3, no. 11 (1997), submitted: 8/8/97, accepted: 16/10/97, appeared: 28/11/97 Springer Pub. Co.

Journal of Universal Computer Science, vol. 3, no. 11 (1997), submitted: 8/8/97, accepted: 16/10/97, appeared: 28/11/97 Springer Pub. Co. Journal of Universal Computer Science, vol. 3, no. 11 (1997), 1250-1254 submitted: 8/8/97, accepted: 16/10/97, appeared: 28/11/97 Springer Pub. Co. Sequential Continuity of Linear Mappings in Constructive

More information

-2q. +3q. +6q. +2q. -3q. -2q. -3q. +2q. +3q. +6q

-2q. +3q. +6q. +2q. -3q. -2q. -3q. +2q. +3q. +6q Name: Sectè èor TA nameè: Student Id è Please æll in your name, student id number, section number and FORM on your test scan forms. PHYSICS 22 FALL 1997 FIRST MIDTERM EXAM, FORM A 1. You are given two

More information

5. FVM discretization and Solution Procedure

5. FVM discretization and Solution Procedure 5. FVM discretization and Solution Procedure 1. The fluid domain is divided into a finite number of control volumes (cells of a computational grid). 2. Integral form of the conservation equations are discretized

More information

Lecture 1. Introduction. The importance, ubiquity, and complexity of embedded systems are growing

Lecture 1. Introduction. The importance, ubiquity, and complexity of embedded systems are growing Lecture 1 Introduction Karl Henrik Johansson The importance, ubiquity, and complexity of embedded systems are growing tremendously thanks to the revolution in digital technology. This has created a need

More information

Preliminary Examination, Numerical Analysis, August 2016

Preliminary Examination, Numerical Analysis, August 2016 Preliminary Examination, Numerical Analysis, August 2016 Instructions: This exam is closed books and notes. The time allowed is three hours and you need to work on any three out of questions 1-4 and any

More information

Remarks on the analysis of finite element methods on a Shishkin mesh: are Scott-Zhang interpolants applicable?

Remarks on the analysis of finite element methods on a Shishkin mesh: are Scott-Zhang interpolants applicable? Remarks on the analysis of finite element methods on a Shishkin mesh: are Scott-Zhang interpolants applicable? Thomas Apel, Hans-G. Roos 22.7.2008 Abstract In the first part of the paper we discuss minimal

More information

x

x Macmí36 è98-è Solutions Homework è èdue January 6, 998è Exercise Set.. èaè witèplotsè: f:=è-expèxè+*xèè3; f := 3, 3 ex + 3 x?abs plotèabsèfè,x=0..è; 0.6 0. 0. 0. 0.38 0.36 0.3 0 0. 0. 0.6 0.8 x By moving

More information

the x's and the y's unlike the standard k-means clustering on the x's ë8ë. We then present results comparing EMRBF with standard RBF estimation method

the x's and the y's unlike the standard k-means clustering on the x's ë8ë. We then present results comparing EMRBF with standard RBF estimation method EMRBF: A Statistical Basis for Using Radial Basis Functions for Process Control Lyle H. Ungar Department of Chemical Engineering University ofpennsylvania ungar@cis.upenn.edu Richard D. De Veaux Mathematics

More information

+ - cos ( ω t) V I R 1. V Cos( ω t + φ)

+ - cos ( ω t) V I R 1. V Cos( ω t + φ) Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.002 í Electronic Circuits Homework è10 Handout F98052 Issued 11è10è98 í Due 11è18è98 Exercise 101: Determine

More information

Radial Basis Functions for Process Control Lyle H. Ungar Tom Johnson Richard D. De Veaux University ofpennsylvania Voice Processing Corp. Princeton Un

Radial Basis Functions for Process Control Lyle H. Ungar Tom Johnson Richard D. De Veaux University ofpennsylvania Voice Processing Corp. Princeton Un Radial Basis Functions for Process Control Lyle H. Ungar Tom Johnson Richard D. De Veaux University ofpennsylvania Voice Processing Corp. Princeton University Abstract Radial basis function èrbfsè neural

More information

Parameter robust methods for second-order complex-valued reaction-diffusion equations

Parameter robust methods for second-order complex-valued reaction-diffusion equations Postgraduate Modelling Research Group, 10 November 2017 Parameter robust methods for second-order complex-valued reaction-diffusion equations Faiza Alssaedi Supervisor: Niall Madden School of Mathematics,

More information

A. Arenz, E. Schnieder: Modelling and control of a æexible 'goliath' robot - a case study using ADAMSèControls 1. a case study using ADAMSèControls

A. Arenz, E. Schnieder: Modelling and control of a æexible 'goliath' robot - a case study using ADAMSèControls 1. a case study using ADAMSèControls A. Arenz, E. Schnieder: Modelling and control of a æexible 'goliath' robot - a case study using ADAMSèControls 1 Modelling and control of a æexible 'goliath' robot - a case study using ADAMSèControls Dipl.-Ing.

More information

LECTURE 17. Algorithms for Polynomial Interpolation

LECTURE 17. Algorithms for Polynomial Interpolation LECTURE 7 Algorithms for Polynomial Interpolation We have thus far three algorithms for determining the polynomial interpolation of a given set of data.. Brute Force Method. Set and solve the following

More information

BUDKER INSTITUTE OF NUCLEAR PHYSICS. B.V. Chirikov and V.V. Vecheslavov MULTIPLE SEPARATRIX CROSSING: CHAOS STRUCTURE. Budker INP NOVOSIBIRSK

BUDKER INSTITUTE OF NUCLEAR PHYSICS. B.V. Chirikov and V.V. Vecheslavov MULTIPLE SEPARATRIX CROSSING: CHAOS STRUCTURE. Budker INP NOVOSIBIRSK BUDKER INSTITUTE OF NUCLEAR PHYSICS B.V. Chirikov and V.V. Vecheslavov MULTIPLE SEPARATRIX CROSSING: CHAOS STRUCTURE Budker INP 2000-1 NOVOSIBIRSK 2000 chaos structure B.V. Chirikov and V.V. Vecheslavov

More information

I R TECHNICAL RESEARCH REPORT. A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm. by C. Lawrence, A. Tits T.R.

I R TECHNICAL RESEARCH REPORT. A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm. by C. Lawrence, A. Tits T.R. TECHNICAL RESEARCH REPORT A Computationally Efficient Feasible Sequential Quadratic Programming Algorithm by C. Lawrence, A. Tits T.R. 98-46 I R INSTITUTE FOR SYSTEMS RESEARCH ISR develops, applies and

More information

and it has also been combined with adaptive grid generation ë20ë and domain decomposition ë21ë. The functions a i : æærær 2!R, in è1.1è are assumed to

and it has also been combined with adaptive grid generation ë20ë and domain decomposition ë21ë. The functions a i : æærær 2!R, in è1.1è are assumed to Mixed Finite Element Method for onlinear Elliptic Problems: the h-p -Version Miyoung Lee and Fabio A. Milner Department of Mathematics, Purdue University West Lafayette, I 47907-1395, U.S.A. Abstract.

More information

successfully to the at most t moves èincluding the initial move mè made in these intervals. Thus Spoiler may aswell play the remaining t, 1moves

successfully to the at most t moves èincluding the initial move mè made in these intervals. Thus Spoiler may aswell play the remaining t, 1moves The class of æ 1 ææææ r is z and z 2 R x. The class z of æ 1 ææææ r is in L z and R x. As z 2 L z ë R x, z = z. Thus ë1;i r è under M and ë1;i r è under M have the same Ehrenfeucht value. Thus Duplicator

More information

Economics 472. Lecture 16. Binary Dependent Variable Models

Economics 472. Lecture 16. Binary Dependent Variable Models University of Illinois Fall 998 Department of Economics Roger Koenker Economics 472 Lecture 6 Binary Dependent Variable Models Let's begin with a model for an observed proportion, or frequency. We would

More information

W 1 æw 2 G + 0 e? u K y Figure 5.1: Control of uncertain system. For MIMO systems, the normbounded uncertainty description is generalized by assuming

W 1 æw 2 G + 0 e? u K y Figure 5.1: Control of uncertain system. For MIMO systems, the normbounded uncertainty description is generalized by assuming Chapter 5 Robust stability and the H1 norm An important application of the H1 control problem arises when studying robustness against model uncertainties. It turns out that the condition that a control

More information

The Optimal Set and Optimal Partition Approach to Linear. Arjan B. Berkelaar, Kees Roos and Tamças Terlaky. October 16, 1996

The Optimal Set and Optimal Partition Approach to Linear. Arjan B. Berkelaar, Kees Roos and Tamças Terlaky. October 16, 1996 The Optimal Set and Optimal Partition Approach to Linear and Quadratic Programming æ Arjan B. Berkelaar, Kees Roos and Tamças Terlaky October 16, 1996 Department of Econometrics and Operations Research

More information

Cholesky factorisations of linear systems coming from a finite difference method applied to singularly perturbed problems

Cholesky factorisations of linear systems coming from a finite difference method applied to singularly perturbed problems Cholesky factorisations of linear systems coming from a finite difference method applied to singularly perturbed problems Thái Anh Nhan and Niall Madden The Boundary and Interior Layers - Computational

More information

Historically, all oæ-mass-shell eæects in the DIS on the nucleons are divided into two. x Nm. 2pq = p 0 + p z

Historically, all oæ-mass-shell eæects in the DIS on the nucleons are divided into two. x Nm. 2pq = p 0 + p z Preprint Alberta-Thy-38-94. On the Oæ-Mass-Shell Deformation of the Nucleon Structure Function. A.Yu. Umnikov and F.C. Khanna Theoretical Physics Institute, Physics Department, University of Alberta, Edmonton,

More information

Finite difference method for elliptic problems: I

Finite difference method for elliptic problems: I Finite difference method for elliptic problems: I Praveen. C praveen@math.tifrbng.res.in Tata Institute of Fundamental Research Center for Applicable Mathematics Bangalore 560065 http://math.tifrbng.res.in/~praveen

More information

532 A. Bella, I.V. Yaschenko General remarks on AP spaces In ëptë, it was observed that!1 + 1 is not AP. The rst author showed in ëb1ë that every scat

532 A. Bella, I.V. Yaschenko General remarks on AP spaces In ëptë, it was observed that!1 + 1 is not AP. The rst author showed in ëb1ë that every scat Comment.Math.Univ.Carolinae 40,3 è1999è531í536 531 On AP and WAP spaces A. Bella, I.V. Yaschenko Abstract. Several remarks on the properties of approximation by points èapè and weak approximation by points

More information

Contents 1. Introduction 2. Mass balance and diæusion 3. Momentum balance and Korteweg Stresses 4. One dimensional mixing layer problems 5. Dynamic an

Contents 1. Introduction 2. Mass balance and diæusion 3. Momentum balance and Korteweg Stresses 4. One dimensional mixing layer problems 5. Dynamic an Non-solenoidal Velocity Eæects and Korteweg Stresses in Simple Mixtures of Incompressible Liquids Daniel D. Joseph z, Adam Huang, and Howard Hu Department of Aerospace Engineering and Mechanics University

More information

Klaus Korossy: Linear-Recursive Number Sequence Tasks 44 to be a prime example of inductive reasoning. Inductive reasoning has been an integral part o

Klaus Korossy: Linear-Recursive Number Sequence Tasks 44 to be a prime example of inductive reasoning. Inductive reasoning has been an integral part o Methods of Psychological Research Online 1998, Vol.3, No.1 Internet: http:èèwww.pabst-publishers.deèmprè Solvability and Uniqueness of Linear-Recursive Number Sequence Tasks æ Klaus Korossy Psychologisches

More information

leading to a ænal state with missing energy. The rate for such processes is strongly dependent on the number of extra dimensions as well as the exact

leading to a ænal state with missing energy. The rate for such processes is strongly dependent on the number of extra dimensions as well as the exact SLAC-PUB-8204 July 1999 TESTS OF LOW SCALE QUANTUM GRAVITY IN e, e, AND ææ COLLISIONS a T.G. RIZZO b Stanford Linear Accelerator Center, Stanford University, Stanford, CA 94309, USA Arkani-Hamed, Dimopoulos

More information

586 D.E. Norton A dynamical system consists of three ingredients: a setting in which the dynamical behavior takes place, such as the real line, a toru

586 D.E. Norton A dynamical system consists of three ingredients: a setting in which the dynamical behavior takes place, such as the real line, a toru Comment.Math.Univ.Carolinae 36,3 è1995è585í597 585 The fundamental theorem of dynamical systems Douglas E. Norton Abstract. We propose the title of The Fundamental Theorem of Dynamical Systems for a theorem

More information

R TH + V TH. Vport. + Rport V TH

R TH + V TH. Vport. + Rport V TH Massachusetts Institute of Technology Department of Electrical Engineering and omputer Science 6.002 í Electronic ircuits Homework è3 Solution Handout F9827 Exercise 31: When a particular network having

More information

the ratio of the hazards converges to unity as time increases. This is in contrast to the proportional hazards model which constrains the ratio of the

the ratio of the hazards converges to unity as time increases. This is in contrast to the proportional hazards model which constrains the ratio of the MLE IN THE PROPORTIONAL ODDS MODEL BY S.A. MURPHY, A.J. ROSSINI AND A.W. VAN DER VAART Pennsylvania State University, University of South Carolina and Free University Amsterdam We consider maximum likelihood

More information

V. RAMAKRISHNA èf; gè-invarianceèor local controlled invarianceè condition, ëf; æë ç æ + G hold. Here F is in any of the one of the vector æelds f; g

V. RAMAKRISHNA èf; gè-invarianceèor local controlled invarianceè condition, ëf; æë ç æ + G hold. Here F is in any of the one of the vector æelds f; g Journal of Mathematical Systems, Estimation, and Control Vol. 6, No. 3, 1996, pp. 1í29 cæ 1996 Birkhíauser-Boston Disturbance Decoupling Via Diæerential Forms æ Viswanath Ramakrishna y Abstract We formulate

More information

Abstract To characterize color values measured by color devices èe.g. scanners, color copiers and color camerasè in a deviceíindependent fashion these

Abstract To characterize color values measured by color devices èe.g. scanners, color copiers and color camerasè in a deviceíindependent fashion these White-point preserving color correction Graham D. Finlayson Department of Computer Science, University of York, York, United Kingdom YO1 5DD Mark S. Drew School of Computing Science, Simon Fraser University,

More information

of Hydrodynamic Stability Problems* Department of Computer Science, University oftennessee, Knoxville, Tennessee

of Hydrodynamic Stability Problems* Department of Computer Science, University oftennessee, Knoxville, Tennessee Chebyshev tau - QZ lgorithm Methods for Calculating Spectra of Hydrodynamic Stability Problems* J.J. Dongarra è1è, B. Straughan è2è ** & D.W. Walker è2è è1è Department of Computer Science, University oftennessee,

More information

1 Introduction The nonhomogeneous Poisson process arises naturally in reliability theory as the process that records the epochs and the number of repa

1 Introduction The nonhomogeneous Poisson process arises naturally in reliability theory as the process that records the epochs and the number of repa Nonhomogeneous Poisson Processes and Logconcavity Franco Pellerey Dipartimento di Matematica Politecnico di Torino Corso Duca degli Abruzzi, 24 1129 Torino, ITALY Moshe Shaked Department of Mathematics

More information

A proof of Calibration via Blackwell's. Dean P. Foster æ. Abstract. Over the past few years many proofs of calibration have been presented

A proof of Calibration via Blackwell's. Dean P. Foster æ. Abstract. Over the past few years many proofs of calibration have been presented A proof of Calibration via Blackwell's Approachability heore Dean P. Foster æ February 27, 1997 Abstract Over the past few years any proofs of calibration have been presented èfoster and Vohra è1991, 1997è,

More information

SUPERCONVERGENCE OF DG METHOD FOR ONE-DIMENSIONAL SINGULARLY PERTURBED PROBLEMS *1)

SUPERCONVERGENCE OF DG METHOD FOR ONE-DIMENSIONAL SINGULARLY PERTURBED PROBLEMS *1) Journal of Computational Mathematics, Vol.5, No., 007, 185 00. SUPERCONVERGENCE OF DG METHOD FOR ONE-DIMENSIONAL SINGULARLY PERTURBED PROBLEMS *1) Ziqing Xie (College of Mathematics and Computer Science,

More information

SUMMARY OF CONVECTION CORRELATION EQUATIONS. ME 353 Heat Transfer 1. University ofwaterloo

SUMMARY OF CONVECTION CORRELATION EQUATIONS. ME 353 Heat Transfer 1. University ofwaterloo SUMMARY.TEX SUMMARY OF CONVECTION CORREATION EQUATIONS ME 353 Heat Transfer 1 Department of Mecanical Engineering University ofwaterloo M.M. Yovanovic November 10, 1997 Te attaced material is a summary

More information

Numerical Analysis of Differential Equations Numerical Solution of Elliptic Boundary Value

Numerical Analysis of Differential Equations Numerical Solution of Elliptic Boundary Value Numerical Analysis of Differential Equations 188 5 Numerical Solution of Elliptic Boundary Value Problems 5 Numerical Solution of Elliptic Boundary Value Problems TU Bergakademie Freiberg, SS 2012 Numerical

More information

A Singularly Perturbed Convection Diffusion Turning Point Problem with an Interior Layer

A Singularly Perturbed Convection Diffusion Turning Point Problem with an Interior Layer A Singularly Perturbed Convection Diffusion Turning Point Problem with an Interior Layer E. O Riordan, J. Quinn School of Mathematical Sciences, Dublin City University, Glasnevin, Dublin 9, Ireland. Abstract

More information

NUMERICAL STUDY OF CONVECTION DIFFUSION PROBLEM IN TWO- DIMENSIONAL SPACE

NUMERICAL STUDY OF CONVECTION DIFFUSION PROBLEM IN TWO- DIMENSIONAL SPACE IJRRAS 5 () November NUMERICAL STUDY OF CONVECTION DIFFUSION PROBLEM IN TWO- DIMENSIONAL SPACE. K. Sharath Babu,* & N. Srinivasacharyulu Research Scholar, Department of Mathematics, National Institute

More information

systems March 3, 1999 Abstract polynomial equations. The algorithms which fall in this category make up the engines in symbolic algebra

systems March 3, 1999 Abstract polynomial equations. The algorithms which fall in this category make up the engines in symbolic algebra CDC99 - REG0098 Computer algebra in the control of singularly perturbed dynamical systems J.W. Helton æ F. Dell Kronewitter y March 3, 1999 Abstract Commutative Groebner basis methods have proven to be

More information

Finite Difference Methods for Boundary Value Problems

Finite Difference Methods for Boundary Value Problems Finite Difference Methods for Boundary Value Problems October 2, 2013 () Finite Differences October 2, 2013 1 / 52 Goals Learn steps to approximate BVPs using the Finite Difference Method Start with two-point

More information

Iterative Improvement plus Random Restart Stochastic Search by X. Hu, R. Shonkwiler, and M. C. Spruill School of Mathematics Georgia Institute of Tech

Iterative Improvement plus Random Restart Stochastic Search by X. Hu, R. Shonkwiler, and M. C. Spruill School of Mathematics Georgia Institute of Tech Iterative Improvement plus Random Restart Stochastic Search by X. Hu, R. Shonkwiler, and M. C. Spruill School of Mathematics Georgia Institute of Technology Atlanta, GA 0 email: shonkwiler@math.gatech.edu,

More information

K.L. BLACKMORE, R.C. WILLIAMSON, I.M.Y. MAREELS at inænity. As the error surface is deæned by an average over all of the training examples, it is diæc

K.L. BLACKMORE, R.C. WILLIAMSON, I.M.Y. MAREELS at inænity. As the error surface is deæned by an average over all of the training examples, it is diæc Journal of Mathematical Systems, Estimation, and Control Vol. 6, No. 2, 1996, pp. 1í18 cæ 1996 Birkhíauser-Boston Local Minima and Attractors at Inænity for Gradient Descent Learning Algorithms æ Kim L.

More information

Algorithm Composition Scheme for Problems in Composite Domains Based on the Difference Potential Method

Algorithm Composition Scheme for Problems in Composite Domains Based on the Difference Potential Method ISSN 0965-545, Computational Mathematics and Mathematical Physics, 006, Vol 46, No 10, pp 17681784 MAIK Nauka /Interperiodica (Russia), 006 Original Russian Text VS Ryaben kii, VI Turchaninov, YeYu Epshteyn,

More information

October 13, Many biological organisms learn new control skills, improving with

October 13, Many biological organisms learn new control skills, improving with A Qualitative Approach to Control Learning Benjamin Kuipers October 13, 1995 1 Summary Control in biological systems is robust, adaptive, heterogeneous, and nonlinear. Many biological organisms learn new

More information

Department of Technical Physics, Helsinki University of Technology, FIN Espoo, Finland

Department of Technical Physics, Helsinki University of Technology, FIN Espoo, Finland Local Density of States in a Dirty Normal Metal Connected to a Superconductor W. Belzig, C. Bruder, and Gerd Schíon ; Institut fíur Theoretische Festkíorperphysik, Universitíat Karlsruhe, D-768 Karlsruhe,

More information

256 Facta Universitatis ser.: Elect. and Energ. vol. 11, No.2 è1998è primarily concerned with narrow range of frequencies near ærst resonance èwhere s

256 Facta Universitatis ser.: Elect. and Energ. vol. 11, No.2 è1998è primarily concerned with narrow range of frequencies near ærst resonance èwhere s FACTA UNIVERSITATIS èni ç Sè Series: Electronics and Energetics vol. 11, No.2 è1998è, 255-261 EFFICIENT CALCULATION OF RADAR CROSS SECTION FOR FINITE STRIP ARRAY ON DIELECTRIC SLAB Borislav Popovski and

More information

> 12 GeV. (a) Value 43% 7-12 GeV 11% 13% 11% 9% 8% 5-7 GeV GeV GeV. (b) Uncertainty. narrow resonan ces 1 14% 31% 11% ρ 25%

> 12 GeV. (a) Value 43% 7-12 GeV 11% 13% 11% 9% 8% 5-7 GeV GeV GeV. (b) Uncertainty. narrow resonan ces 1 14% 31% 11% ρ 25% Measurement of R Between 2-5 GeV Derrick Kong University of Hawaii We have obtained measurements of the total cross section for e + e, annihilation into hadronic ænal states for 6 energy points è2.6, 3.2,

More information

Deænition 1 A set S is ænite if there exists a number N such that the number of elements in S èdenoted jsjè is less than N. If no such N exists, then

Deænition 1 A set S is ænite if there exists a number N such that the number of elements in S èdenoted jsjè is less than N. If no such N exists, then Morphology of Proof An introduction to rigorous proof techniques Craig Silverstein September 26, 1998 1 Methodology of Proof an example Deep down, all theorems are of the form if A then B. They may be

More information

A New Invariance Property of Lyapunov Characteristic Directions S. Bharadwaj and K.D. Mease Mechanical and Aerospace Engineering University of Califor

A New Invariance Property of Lyapunov Characteristic Directions S. Bharadwaj and K.D. Mease Mechanical and Aerospace Engineering University of Califor A New Invariance Property of Lyapunov Characteristic Directions S. Bharadwaj and K.D. Mease Mechanical and Aerospace Engineering University of California, Irvine, California, 92697-3975 Email: sanjay@eng.uci.edu,

More information

9 Facta Universitatis ser.: Elect. and Energ. vol. 11, No.3 è1998è this paper we have considered shaping gain for two interesting quantization procedu

9 Facta Universitatis ser.: Elect. and Energ. vol. 11, No.3 è1998è this paper we have considered shaping gain for two interesting quantization procedu FACTA UNIVERSITATIS èniçsè Series: Electronics and Energetics vol. 11, No.3 è1998è, 91-99 NONLINEAR TRANSFORMATION OF ONEíDIMENSIONAL CONSTELLATION POINTS IN ORDER TO ERROR PROBABILITY DECREASING Zoran

More information

XMM and MCVs Cynthia H. James, Graziella Branduardi-Raymont, Mark Cropper and Gavin Ramsay Mullard Space Science Laboratory, University College London

XMM and MCVs Cynthia H. James, Graziella Branduardi-Raymont, Mark Cropper and Gavin Ramsay Mullard Space Science Laboratory, University College London XMM and MCVs Cynthia H. James, Graziella Branduardi-Raymont, Mark Cropper and Gavin Ramsay Mullard Space Science Laboratory, University College London, Holmbury St Mary, Dorking, Surrey, RH5 6NT, UK ABSTRACT

More information

Lecture 4.2 Finite Difference Approximation

Lecture 4.2 Finite Difference Approximation Lecture 4. Finite Difference Approimation 1 Discretization As stated in Lecture 1.0, there are three steps in numerically solving the differential equations. They are: 1. Discretization of the domain by

More information

A UNIFORMLY ACCURATE FINITE ELEMENTS METHOD FOR SINGULAR PERTURBATION PROBLEMS. Mirjana Stojanović University of Novi Sad, Serbia and Montenegro

A UNIFORMLY ACCURATE FINITE ELEMENTS METHOD FOR SINGULAR PERTURBATION PROBLEMS. Mirjana Stojanović University of Novi Sad, Serbia and Montenegro GLASNIK MATEMATIČKI Vol. 38(58(2003, 185 197 A UNIFORMLY ACCURATE FINITE ELEMENTS METHOD FOR SINGULAR PERTURBATION PROBLEMS Mirjana Stojanović University of Novi Sad, Serbia and Montenegro Abstract. We

More information

INTRODUCTION TO PDEs

INTRODUCTION TO PDEs INTRODUCTION TO PDEs In this course we are interested in the numerical approximation of PDEs using finite difference methods (FDM). We will use some simple prototype boundary value problems (BVP) and initial

More information

1 Introduction The Super-Kamiokande detector is a 5,-ton water Cherenkov detector located at a depth of 2,7 meters water equivalent in the Kamioka min

1 Introduction The Super-Kamiokande detector is a 5,-ton water Cherenkov detector located at a depth of 2,7 meters water equivalent in the Kamioka min RESULTS ON NEUTRINO OSCILLATIONS FROM 4 DAYS OF SUPER-KAMIOKANDE DATA Yoshitaka Itow Kamioka Observatory Institute for Cosmic Ray Research, University of Tokyo, Higashi-Mozumi Kamioka, Gifu, 56-12, Japan

More information

Benjamin Shults. Department of Mathematics Computer Science Department

Benjamin Shults. Department of Mathematics Computer Science Department Proving properties of continuous systems: qualitative simulation and temporal logic æ Benjamin Shults Department of Mathematics èbshults@math.utexas.eduè University of Texas at Austin, Austin, TX 78712

More information

In the previous chapters we have presented synthesis methods for optimal H 2 and

In the previous chapters we have presented synthesis methods for optimal H 2 and Chapter 8 Robust performance problems In the previous chapters we have presented synthesis methods for optimal H 2 and H1 control problems, and studied the robust stabilization problem with respect to

More information

t x

t x Stability in Discrete Population Models P. Cull æ and J. Chaæee y 1 æ Computer Science Dept., Oregon State University, Corvallis, OR 97331 USA, pc@cs.orst.edu y Mathematics Dept., Western Washington University,

More information

SOLVING ELLIPTIC PDES

SOLVING ELLIPTIC PDES university-logo SOLVING ELLIPTIC PDES School of Mathematics Semester 1 2008 OUTLINE 1 REVIEW 2 POISSON S EQUATION Equation and Boundary Conditions Solving the Model Problem 3 THE LINEAR ALGEBRA PROBLEM

More information