On computer algebra-aided stability analysis of dierence schemes generated by means of Gr obner bases
|
|
- Dorthy Pearson
- 8 years ago
- Views:
Transcription
1 On computer algebra-aided stability analysis of dierence schemes generated by means of Gr obner bases Vladimir Gerdt 1 Yuri Blinkov 2 1 Laboratory of Information Technologies Joint Institute for Nuclear Research 2 Department of Mathematics and Mechanics Saratov State University 23 Feb 2007
2 Outline Introduction Finite Dierence Approach Stability of Dierence Schemes Dierence schemes for hyperbolic equations Dierence Cauchy problem Notion of approximation for the initial problem First dierential approximation of dierence scheme Example: Lax Scheme Algorithmic Approach to Generation of Dierence Schemes Algorithm for Construction of Dierential Approximation Algorithm for Hyperbolic Form Algorithm for Hyperbolic Form Implementation in Maple Two-Step Lax-Wendro Schemes Conclusions Bibliography
3 Outline Introduction Finite Dierence Approach Stability of Dierence Schemes Dierence schemes for hyperbolic equations Dierence Cauchy problem Notion of approximation for the initial problem First dierential approximation of dierence scheme Example: Lax Scheme Algorithmic Approach to Generation of Dierence Schemes Algorithm for Construction of Dierential Approximation Algorithm for Hyperbolic Form Algorithm for Hyperbolic Form Implementation in Maple Two-Step Lax-Wendro Schemes Conclusions Bibliography
4 Outline Introduction Finite Dierence Approach Stability of Dierence Schemes Dierence schemes for hyperbolic equations Dierence Cauchy problem Notion of approximation for the initial problem First dierential approximation of dierence scheme Example: Lax Scheme Algorithmic Approach to Generation of Dierence Schemes Algorithm for Construction of Dierential Approximation Algorithm for Hyperbolic Form Algorithm for Hyperbolic Form Implementation in Maple Two-Step Lax-Wendro Schemes Conclusions Bibliography
5 Outline Introduction Finite Dierence Approach Stability of Dierence Schemes Dierence schemes for hyperbolic equations Dierence Cauchy problem Notion of approximation for the initial problem First dierential approximation of dierence scheme Example: Lax Scheme Algorithmic Approach to Generation of Dierence Schemes Algorithm for Construction of Dierential Approximation Algorithm for Hyperbolic Form Algorithm for Hyperbolic Form Implementation in Maple Two-Step Lax-Wendro Schemes Conclusions Bibliography
6 Outline Introduction Finite Dierence Approach Stability of Dierence Schemes Dierence schemes for hyperbolic equations Dierence Cauchy problem Notion of approximation for the initial problem First dierential approximation of dierence scheme Example: Lax Scheme Algorithmic Approach to Generation of Dierence Schemes Algorithm for Construction of Dierential Approximation Algorithm for Hyperbolic Form Algorithm for Hyperbolic Form Implementation in Maple Two-Step Lax-Wendro Schemes Conclusions Bibliography
7 Outline Introduction Finite Dierence Approach Stability of Dierence Schemes Dierence schemes for hyperbolic equations Dierence Cauchy problem Notion of approximation for the initial problem First dierential approximation of dierence scheme Example: Lax Scheme Algorithmic Approach to Generation of Dierence Schemes Algorithm for Construction of Dierential Approximation Algorithm for Hyperbolic Form Algorithm for Hyperbolic Form Implementation in Maple Two-Step Lax-Wendro Schemes Conclusions Bibliography
8 Outline Introduction Finite Dierence Approach Stability of Dierence Schemes Dierence schemes for hyperbolic equations Dierence Cauchy problem Notion of approximation for the initial problem First dierential approximation of dierence scheme Example: Lax Scheme Algorithmic Approach to Generation of Dierence Schemes Algorithm for Construction of Dierential Approximation Algorithm for Hyperbolic Form Algorithm for Hyperbolic Form Implementation in Maple Two-Step Lax-Wendro Schemes Conclusions Bibliography
9 Finite Dierence Approach The nite dierence approach is the most popular discretization technique for numerical solving of ordinary or PDEs. In this approach derivatives are approximated by nite dierences and the resulting algebraic system dierence scheme is solved numerically. Recently (G.,B.,Mozzhilkin'06) we developed an algorithmic method to generation of nite dierence schemes for linear PDEs with two independent variables. The method is based on dierence elimination provided by construction of Gr obner bases for an appropriate elimination ranking. Sometimes Gr obner bases can be computed even for nonlinear dierence systems obtained by discretization of PDEs and related integral equations. In this case nonlinear dierence schemes can also be generated by our method.
10 Finite Dierence Approach The nite dierence approach is the most popular discretization technique for numerical solving of ordinary or PDEs. In this approach derivatives are approximated by nite dierences and the resulting algebraic system dierence scheme is solved numerically. Recently (G.,B.,Mozzhilkin'06) we developed an algorithmic method to generation of nite dierence schemes for linear PDEs with two independent variables. The method is based on dierence elimination provided by construction of Gr obner bases for an appropriate elimination ranking. Sometimes Gr obner bases can be computed even for nonlinear dierence systems obtained by discretization of PDEs and related integral equations. In this case nonlinear dierence schemes can also be generated by our method.
11 Finite Dierence Approach The nite dierence approach is the most popular discretization technique for numerical solving of ordinary or PDEs. In this approach derivatives are approximated by nite dierences and the resulting algebraic system dierence scheme is solved numerically. Recently (G.,B.,Mozzhilkin'06) we developed an algorithmic method to generation of nite dierence schemes for linear PDEs with two independent variables. The method is based on dierence elimination provided by construction of Gr obner bases for an appropriate elimination ranking. Sometimes Gr obner bases can be computed even for nonlinear dierence systems obtained by discretization of PDEs and related integral equations. In this case nonlinear dierence schemes can also be generated by our method.
12 Stability of Dierence Schemes A dierence scheme, to be of practical interest, must be stable. The stability study of dierence schemes exploits symbolic mathematical operations. Thus it can be analyzed with help of computer algebra methods and software (Ganzha,Vorozhtsov'96). To analyze stability one can use dierential approximation that is often called the modied equation(s) of the dierence scheme. There are whole classes of dierent schemes for which their stability properties can be obtained with the aid of the dierential approximation (Strikwerda'04). For all that, in many cases, the computation can be done by means of modern computer algebra software. In this talk we shall demonstrate how Maple can be used for this purpose and present a Maple program for computation of dierential approximations for dierence schemes. In the aggregate with the Maple package for construction of Gr obner bases for linear dierence systems (G.,Robertz'06) the program allows one to generate schemes possessing stability properties.
13 Stability of Dierence Schemes A dierence scheme, to be of practical interest, must be stable. The stability study of dierence schemes exploits symbolic mathematical operations. Thus it can be analyzed with help of computer algebra methods and software (Ganzha,Vorozhtsov'96). To analyze stability one can use dierential approximation that is often called the modied equation(s) of the dierence scheme. There are whole classes of dierent schemes for which their stability properties can be obtained with the aid of the dierential approximation (Strikwerda'04). For all that, in many cases, the computation can be done by means of modern computer algebra software. In this talk we shall demonstrate how Maple can be used for this purpose and present a Maple program for computation of dierential approximations for dierence schemes. In the aggregate with the Maple package for construction of Gr obner bases for linear dierence systems (G.,Robertz'06) the program allows one to generate schemes possessing stability properties.
14 Stability of Dierence Schemes A dierence scheme, to be of practical interest, must be stable. The stability study of dierence schemes exploits symbolic mathematical operations. Thus it can be analyzed with help of computer algebra methods and software (Ganzha,Vorozhtsov'96). To analyze stability one can use dierential approximation that is often called the modied equation(s) of the dierence scheme. There are whole classes of dierent schemes for which their stability properties can be obtained with the aid of the dierential approximation (Strikwerda'04). For all that, in many cases, the computation can be done by means of modern computer algebra software. In this talk we shall demonstrate how Maple can be used for this purpose and present a Maple program for computation of dierential approximations for dierence schemes. In the aggregate with the Maple package for construction of Gr obner bases for linear dierence systems (G.,Robertz'06) the program allows one to generate schemes possessing stability properties.
15 Stability of Dierence Schemes A dierence scheme, to be of practical interest, must be stable. The stability study of dierence schemes exploits symbolic mathematical operations. Thus it can be analyzed with help of computer algebra methods and software (Ganzha,Vorozhtsov'96). To analyze stability one can use dierential approximation that is often called the modied equation(s) of the dierence scheme. There are whole classes of dierent schemes for which their stability properties can be obtained with the aid of the dierential approximation (Strikwerda'04). For all that, in many cases, the computation can be done by means of modern computer algebra software. In this talk we shall demonstrate how Maple can be used for this purpose and present a Maple program for computation of dierential approximations for dierence schemes. In the aggregate with the Maple package for construction of Gr obner bases for linear dierence systems (G.,Robertz'06) the program allows one to generate schemes possessing stability properties.
16 Dierence Cauchy problem Consider the following Cauchy problem u = Au, < 0 <, t > 0 (1) t u(x, 0) = u 0 (x), < 0 <, (2) where x is the spatial variable, t is the temporal variable, A is a linear dierential operator, u 0 (x) is a given function. We approximate the Cauchy problem (1), (2) by the following dierence Cauchy problem: u n+1 j u n j = Λ 1 u n+1 j + Λ 2 u n j, j = 0, ±1, ±2,... ; n = 0, 1, 2,... (3) u 0 j = u 0 (x j ) (4)
17 Dierence Cauchy problem Consider the following Cauchy problem u = Au, < 0 <, t > 0 (1) t u(x, 0) = u 0 (x), < 0 <, (2) where x is the spatial variable, t is the temporal variable, A is a linear dierential operator, u 0 (x) is a given function. We approximate the Cauchy problem (1), (2) by the following dierence Cauchy problem: u n+1 j u n j = Λ 1 u n+1 j + Λ 2 u n j, j = 0, ±1, ±2,... ; n = 0, 1, 2,... (3) u 0 j = u 0 (x j ) (4)
18 Notion of approximation Let L be the operator of the initial equation (1), i.e. Lu = u Au, (5) t and let L h be a dierence operator dened in accordance to (5) as L h u = u(x, t + ) u(x, t) Λ 1 u(x, t + ) Λ 2 u(x, t), (6) Let u(x, t) be a solution of the Cauchy problem (1), (2) smooth enough. If Lu L h u C 1 h k 1 + C 2 k 2, (7) where k 1 > 0, k 2 > 0 and constants C 1 è C 2 do not depend on and h, then (by denition) dierence scheme (3) approximates equation (1) and has order of approximation k 1 w.r.t. h and order k 2 w.r.t..
19 Notion of approximation Let L be the operator of the initial equation (1), i.e. Lu = u Au, (5) t and let L h be a dierence operator dened in accordance to (5) as L h u = u(x, t + ) u(x, t) Λ 1 u(x, t + ) Λ 2 u(x, t), (6) Let u(x, t) be a solution of the Cauchy problem (1), (2) smooth enough. If Lu L h u C 1 h k 1 + C 2 k 2, (7) where k 1 > 0, k 2 > 0 and constants C 1 è C 2 do not depend on and h, then (by denition) dierence scheme (3) approximates equation (1) and has order of approximation k 1 w.r.t. h and order k 2 w.r.t..
20 First dierential approximation of dierence scheme The rst dierential approximation (FDA) of dierence schemes (3) is the partial dierential equation which is obtained from (3) by substitution for the grid function their Taylor expansions and by keeping the main term (Shokin,Yanenko'85) One distinguishes hyperbolic and parabolic forms of FDA (Ganzha, Vorozhtsov'96). To obtain parabolic form of FDA one uses dierential consequences of the initial PDE(s) u t = Au. as a result of dierentiation of the both sides of PDE(s) w.r.t. the independent variables.
21 First dierential approximation of dierence scheme The rst dierential approximation (FDA) of dierence schemes (3) is the partial dierential equation which is obtained from (3) by substitution for the grid function their Taylor expansions and by keeping the main term (Shokin,Yanenko'85) One distinguishes hyperbolic and parabolic forms of FDA (Ganzha, Vorozhtsov'96). To obtain parabolic form of FDA one uses dierential consequences of the initial PDE(s) u t = Au. as a result of dierentiation of the both sides of PDE(s) w.r.t. the independent variables.
22 Error of Dierence Scheme Discretization of a PDE implies that a dierence solution does not satisfy PDE. The deviation of dierence solution from the exact one is called an error of dierence scheme Study and classication of errors is based on representation of the solution by a trigonometric Fourier series and detectiing the variation in amplitude and phase of each harmonic in one step in time and, respectively, the variation of the exact solution (of PDE) on the same time interval. If the harmonic amplitude decreases faster then that for the exact solution, then this eect is called the amplitude error of the scheme caused by an extra diusion inherent to the scheme numerical viscosity. The phase variation of the dierence solution distinct from that for the exact solution is called the phase error caused by distinction in the phase velocities of the harmonic propagation numerical dispersion.
23 Error of Dierence Scheme Discretization of a PDE implies that a dierence solution does not satisfy PDE. The deviation of dierence solution from the exact one is called an error of dierence scheme Study and classication of errors is based on representation of the solution by a trigonometric Fourier series and detectiing the variation in amplitude and phase of each harmonic in one step in time and, respectively, the variation of the exact solution (of PDE) on the same time interval. If the harmonic amplitude decreases faster then that for the exact solution, then this eect is called the amplitude error of the scheme caused by an extra diusion inherent to the scheme numerical viscosity. The phase variation of the dierence solution distinct from that for the exact solution is called the phase error caused by distinction in the phase velocities of the harmonic propagation numerical dispersion.
24 Lax-type Scheme for Burgers' equation u t + f x = ν u xx, ν = const (8) 2u n+1 j+2 (un j+3 + un j+1 ) + fn j+3 fn j+1 = ν un j+4 2un j+2 + un j 2 2h 4h 2 (9) Dierential approximation in point (n, j + 2) { }} { u t + f x νu xx 1 2 u xx h u tt + ( 1 6 f xxx 1 3 νu xxxx)h u xxxx h u ttt 2 + ( f xxxxx 2 45 νu xxxxxx)h = u xxxxxx h6 + (10) From (10) it follows that scheme (9) does not approximate equation óðàâíåíèå (8) at O(h 2 /) 1. It is an example of conditionally convergent scheme.
25 Lax-type Scheme for Burgers' equation u t + f x = ν u xx, ν = const (8) 2u n+1 j+2 (un j+3 + un j+1 ) + fn j+3 fn j+1 = ν un j+4 2un j+2 + un j 2 2h 4h 2 (9) Dierential approximation in point (n, j + 2) { }} { u t + f x νu xx 1 2 u xx h u tt + ( 1 6 f xxx 1 3 νu xxxx)h u xxxx h u ttt 2 + ( f xxxxx 2 45 νu xxxxxx)h = u xxxxxx h6 + (10) From (10) it follows that scheme (9) does not approximate equation óðàâíåíèå (8) at O(h 2 /) 1. It is an example of conditionally convergent scheme.
26 Lax-type Scheme for Burgers' equation u t + f x = ν u xx, ν = const (8) 2u n+1 j+2 (un j+3 + un j+1 ) + fn j+3 fn j+1 = ν un j+4 2un j+2 + un j 2 2h 4h 2 (9) Dierential approximation in point (n, j + 2) { }} { u t + f x νu xx 1 2 u xx h u tt + ( 1 6 f xxx 1 3 νu xxxx)h u xxxx h u ttt 2 + ( f xxxxx 2 45 νu xxxxxx)h = u xxxxxx h6 + (10) From (10) it follows that scheme (9) does not approximate equation óðàâíåíèå (8) at O(h 2 /) 1. It is an example of conditionally convergent scheme.
27 Parabolic Form for FDA For more detailed analysis of scheme (9) one can construct a parabolic form of FDA for f = u 2 /2: { }} { u t + uu x (ν + h2 h2 + (2ν )u x ) 2 u2 u xx + +(u)u x (νu + h2 3 u)u xxx + ( ν2 2 + νh2 6 + h4 12 )u xxxx = 0. To be an approximation of the initial PDE it is necessary that expression marked by {}}{... to be ν whereas the remaining terms which do not occur in PDE to be vanish. For equation (8) and zero viscosity (ν = 0) the expression marked by {}}{... must be > 0. Otherwise the diusion coecient becomes negative. Thereby the boundary-value problem becomes incorrect. For some classes of PDE one can relate (equivalence theorem) the scheme stability with its dierential approximation. (11)
28 Parabolic Form for FDA For more detailed analysis of scheme (9) one can construct a parabolic form of FDA for f = u 2 /2: { }} { u t + uu x (ν + h2 h2 + (2ν )u x ) 2 u2 u xx + +(u)u x (νu + h2 3 u)u xxx + ( ν2 2 + νh2 6 + h4 12 )u xxxx = 0. To be an approximation of the initial PDE it is necessary that expression marked by {}}{... to be ν whereas the remaining terms which do not occur in PDE to be vanish. For equation (8) and zero viscosity (ν = 0) the expression marked by {}}{... must be > 0. Otherwise the diusion coecient becomes negative. Thereby the boundary-value problem becomes incorrect. For some classes of PDE one can relate (equivalence theorem) the scheme stability with its dierential approximation. (11)
29 Parabolic Form for FDA For more detailed analysis of scheme (9) one can construct a parabolic form of FDA for f = u 2 /2: { }} { u t + uu x (ν + h2 h2 + (2ν )u x ) 2 u2 u xx + +(u)u x (νu + h2 3 u)u xxx + ( ν2 2 + νh2 6 + h4 12 )u xxxx = 0. To be an approximation of the initial PDE it is necessary that expression marked by {}}{... to be ν whereas the remaining terms which do not occur in PDE to be vanish. For equation (8) and zero viscosity (ν = 0) the expression marked by {}}{... must be > 0. Otherwise the diusion coecient becomes negative. Thereby the boundary-value problem becomes incorrect. For some classes of PDE one can relate (equivalence theorem) the scheme stability with its dierential approximation. (11)
30 Parabolic Form for FDA For more detailed analysis of scheme (9) one can construct a parabolic form of FDA for f = u 2 /2: { }} { u t + uu x (ν + h2 h2 + (2ν )u x ) 2 u2 u xx + +(u)u x (νu + h2 3 u)u xxx + ( ν2 2 + νh2 6 + h4 12 )u xxxx = 0. To be an approximation of the initial PDE it is necessary that expression marked by {}}{... to be ν whereas the remaining terms which do not occur in PDE to be vanish. For equation (8) and zero viscosity (ν = 0) the expression marked by {}}{... must be > 0. Otherwise the diusion coecient becomes negative. Thereby the boundary-value problem becomes incorrect. For some classes of PDE one can relate (equivalence theorem) the scheme stability with its dierential approximation. (11)
31 Algorithmic Generation of Dierence Schemes In (G.,B.,Mozzhilkin'06) we suggested an algorithmic approach to generation of dierence schemes. By example consider equation (8). u t dt = u, u t = u n+1 j un j+2 + un j, 2 f x dx = f, = 2 h(f x ) n j+1 = fj+2 n fj n, (12) u x dx = u, 2 h(u x ) n j+1 = u n j+2 u n j, u xx dx = u x, 2 h(u xx ) n j+1 = (u x ) n j+2 (u x ) n j. Gr obner basis for u xx u t u x f x u f = scheme (9). If call such method of integration in time as Lax-type scheme, then one can use dierent numerical quadrature formulae for integration over x. For the midpoint or the trapezoidal rule for these integrals 8 dierent schemes are generated. Question: how close are properties of these 8 schemes? A partial answer can be obtained by using the dierential approximation technique.
32 Algorithmic Generation of Dierence Schemes In (G.,B.,Mozzhilkin'06) we suggested an algorithmic approach to generation of dierence schemes. By example consider equation (8). u t dt = u, u t = u n+1 j un j+2 + un j, 2 f x dx = f, = 2 h(f x ) n j+1 = fj+2 n fj n, (12) u x dx = u, 2 h(u x ) n j+1 = u n j+2 u n j, u xx dx = u x, 2 h(u xx ) n j+1 = (u x ) n j+2 (u x ) n j. Gr obner basis for u xx u t u x f x u f = scheme (9). If call such method of integration in time as Lax-type scheme, then one can use dierent numerical quadrature formulae for integration over x. For the midpoint or the trapezoidal rule for these integrals 8 dierent schemes are generated. Question: how close are properties of these 8 schemes? A partial answer can be obtained by using the dierential approximation technique.
33 Algorithmic Generation of Dierence Schemes In (G.,B.,Mozzhilkin'06) we suggested an algorithmic approach to generation of dierence schemes. By example consider equation (8). u t dt = u, u t = u n+1 j un j+2 + un j, 2 f x dx = f, = 2 h(f x ) n j+1 = fj+2 n fj n, (12) u x dx = u, 2 h(u x ) n j+1 = u n j+2 u n j, u xx dx = u x, 2 h(u xx ) n j+1 = (u x ) n j+2 (u x ) n j. Gr obner basis for u xx u t u x f x u f = scheme (9). If call such method of integration in time as Lax-type scheme, then one can use dierent numerical quadrature formulae for integration over x. For the midpoint or the trapezoidal rule for these integrals 8 dierent schemes are generated. Question: how close are properties of these 8 schemes? A partial answer can be obtained by using the dierential approximation technique.
34 Algorithm for Hyperbolic Form Since in advance the order of ratio h is not known, one cannot specify a linear oder for PDE in construction of the dierential approximation. Equation (10) multiplied by it can be partition in three groups: [ (ut + f x νu xx ) 1 2 u xxh 2, 1 2 u tt 2 + ( 1 6 f xxx 1 3 νu xxxx)h u xxxxh 4, 1 6 u ttt 3 + ( f xxxxx 2 45 νu xxxxxx)h u xxxxxxh 6] The rst group does not divisors. The second group has divisors in the rst group. The third group has divisors from the rst and the second groups. The truncation order for the Taylor expansion is specied in such a way in order to provide a correct partition into groups.
35 Algorithm for Hyperbolic Form Since in advance the order of ratio h is not known, one cannot specify a linear oder for PDE in construction of the dierential approximation. Equation (10) multiplied by it can be partition in three groups: [ (ut + f x νu xx ) 1 2 u xxh 2, 1 2 u tt 2 + ( 1 6 f xxx 1 3 νu xxxx)h u xxxxh 4, 1 6 u ttt 3 + ( f xxxxx 2 45 νu xxxxxx)h u xxxxxxh 6] The rst group does not divisors. The second group has divisors in the rst group. The third group has divisors from the rst and the second groups. The truncation order for the Taylor expansion is specied in such a way in order to provide a correct partition into groups.
36 Algorithm for Hyperbolic Form Since in advance the order of ratio h is not known, one cannot specify a linear oder for PDE in construction of the dierential approximation. Equation (10) multiplied by it can be partition in three groups: [ (ut + f x νu xx ) 1 2 u xxh 2, 1 2 u tt 2 + ( 1 6 f xxx 1 3 νu xxxx)h u xxxxh 4, 1 6 u ttt 3 + ( f xxxxx 2 45 νu xxxxxx)h u xxxxxxh 6] The rst group does not divisors. The second group has divisors in the rst group. The third group has divisors from the rst and the second groups. The truncation order for the Taylor expansion is specied in such a way in order to provide a correct partition into groups.
37 Algorithm for Hyperbolic Form To construct FDA for the parabolic form (it is sucient to compare scheme properties), the derivatives in t in the second group are replaced by their values from the rst group. It can be achieved by the sequential substitution derivatives u tt u tx u t in accordance with the lexicographic order: [ (u t + uu x νu xx ) u xx h 2 2, +( νuu xxx 2νu x u xx ν2 u xxxx u2 u xx + uu 2 x) 2 +( 1 6 u xxxxν 1 3 u xxxu 1 2 u xxu x )h u xxxxh 4]
38 Algorithm for Hyperbolic Form To construct FDA for the parabolic form (it is sucient to compare scheme properties), the derivatives in t in the second group are replaced by their values from the rst group. It can be achieved by the sequential substitution derivatives u tt u tx u t in accordance with the lexicographic order: [ (u t + uu x νu xx ) u xx h 2 2, +( νuu xxx 2νu x u xx ν2 u xxxx u2 u xx + uu 2 x) 2 +( 1 6 u xxxxν 1 3 u xxxu 1 2 u xxu x )h u xxxxh 4]
39 Implementation in Maple We implemented the above described method in Maple as a package FDA. >restart; >libname:=libname, /usr/local/lib/lfdm, /usr/local/lib/janet, /usr/local/lib/fda; /opt/maple10/lib, /usr/local/lib/lfdm, /usr/local/lib/janet, /usr/local/lib/fda >with(lfdm); [AEqn, AppShiftOp, AssertJanetBasis, CartanCharacter, CompCond, CompCondBasis, Di2Shift, FactorModuleBasis, HF, HP, HilbertFunction, HilbertPolynomial, HilbertSeries, IndexRegularity, InvReduce, JanetBasis, LFDMOptions, LeadingOp, Pol2Shift, Shift2Di, Shift2Op, Shift2Pol, ShiftGroebnerBasis, ShiftTabVar, WeightedHilbertSeries, ZeroSets] >with(fda); [DForm, PForm]
40 Implementation in Maple We implemented the above described method in Maple as a package FDA. >restart; >libname:=libname, /usr/local/lib/lfdm, /usr/local/lib/janet, /usr/local/lib/fda; /opt/maple10/lib, /usr/local/lib/lfdm, /usr/local/lib/janet, /usr/local/lib/fda >with(lfdm); [AEqn, AppShiftOp, AssertJanetBasis, CartanCharacter, CompCond, CompCondBasis, Di2Shift, FactorModuleBasis, HF, HP, HilbertFunction, HilbertPolynomial, HilbertSeries, IndexRegularity, InvReduce, JanetBasis, LFDMOptions, LeadingOp, Pol2Shift, Shift2Di, Shift2Op, Shift2Pol, ShiftGroebnerBasis, ShiftTabVar, WeightedHilbertSeries, ZeroSets] >with(fda); [DForm, PForm]
41 Implementation in Maple We implemented the above described method in Maple as a package FDA. >restart; >libname:=libname, /usr/local/lib/lfdm, /usr/local/lib/janet, /usr/local/lib/fda; /opt/maple10/lib, /usr/local/lib/lfdm, /usr/local/lib/janet, /usr/local/lib/fda >with(lfdm); [AEqn, AppShiftOp, AssertJanetBasis, CartanCharacter, CompCond, CompCondBasis, Di2Shift, FactorModuleBasis, HF, HP, HilbertFunction, HilbertPolynomial, HilbertSeries, IndexRegularity, InvReduce, JanetBasis, LFDMOptions, LeadingOp, Pol2Shift, Shift2Di, Shift2Op, Shift2Pol, ShiftGroebnerBasis, ShiftTabVar, WeightedHilbertSeries, ZeroSets] >with(fda); [DForm, PForm]
42 Implementation in Maple We implemented the above described method in Maple as a package FDA. >restart; >libname:=libname, /usr/local/lib/lfdm, /usr/local/lib/janet, /usr/local/lib/fda; /opt/maple10/lib, /usr/local/lib/lfdm, /usr/local/lib/janet, /usr/local/lib/fda >with(lfdm); [AEqn, AppShiftOp, AssertJanetBasis, CartanCharacter, CompCond, CompCondBasis, Di2Shift, FactorModuleBasis, HF, HP, HilbertFunction, HilbertPolynomial, HilbertSeries, IndexRegularity, InvReduce, JanetBasis, LFDMOptions, LeadingOp, Pol2Shift, Shift2Di, Shift2Op, Shift2Pol, ShiftGroebnerBasis, ShiftTabVar, WeightedHilbertSeries, ZeroSets] >with(fda); [DForm, PForm]
43 Implementation in Maple We implemented the above described method in Maple as a package FDA. >restart; >libname:=libname, /usr/local/lib/lfdm, /usr/local/lib/janet, /usr/local/lib/fda; /opt/maple10/lib, /usr/local/lib/lfdm, /usr/local/lib/janet, /usr/local/lib/fda >with(lfdm); [AEqn, AppShiftOp, AssertJanetBasis, CartanCharacter, CompCond, CompCondBasis, Di2Shift, FactorModuleBasis, HF, HP, HilbertFunction, HilbertPolynomial, HilbertSeries, IndexRegularity, InvReduce, JanetBasis, LFDMOptions, LeadingOp, Pol2Shift, Shift2Di, Shift2Op, Shift2Pol, ShiftGroebnerBasis, ShiftTabVar, WeightedHilbertSeries, ZeroSets] >with(fda); [DForm, PForm]
44 Implementation in Maple We implemented the above described method in Maple as a package FDA. >restart; >libname:=libname, /usr/local/lib/lfdm, /usr/local/lib/janet, /usr/local/lib/fda; /opt/maple10/lib, /usr/local/lib/lfdm, /usr/local/lib/janet, /usr/local/lib/fda >with(lfdm); [AEqn, AppShiftOp, AssertJanetBasis, CartanCharacter, CompCond, CompCondBasis, Di2Shift, FactorModuleBasis, HF, HP, HilbertFunction, HilbertPolynomial, HilbertSeries, IndexRegularity, InvReduce, JanetBasis, LFDMOptions, LeadingOp, Pol2Shift, Shift2Di, Shift2Op, Shift2Pol, ShiftGroebnerBasis, ShiftTabVar, WeightedHilbertSeries, ZeroSets] >with(fda); [DForm, PForm]
45 Example: Burgers' Equation >L:=[ut(n,j)+Fx(n,j)-nu*uxx(n,j), > ut(n,j+1)*tau-(u(n+1,j+1)-(u(n,j+2)+u(n,j))/2), > 2*Fx(n,j+1)*h-(F(n,j+2)-F(n,j)), > 2*ux(n,j+1)*h-(u(n,j+2)-u(n,j)), > 2*uxx(n,j+1)*h-(ux(n,j+2)-ux(n,j))]; [ut (n, j) + Fx (n, j) ν uxx (n, j), ut (n, j + 1) u (n + 1, j + 1) + 1 u (n, j + 2) + 1 u (n, j), Fx (n, j + 1) h F (n, j + 2) + F (n, j), 2 ux (n, j + 1) h u (n, j + 2) + u (n, j), 2 uxx (n, j + 1) h ux (n, j + 2) + ux (n, j)] >JanetBasis(L, [n,j], [uxx,ux,ut,fx,u,f],2); [[ 2 ν u (n, j + 2) + ν u (n, j) + ν u (n, j + 4) 4 h 2 u (n + 1, j + 2) + 2 h 2 u (n, j + 3) + 2 h 2 u (n, j + 1) 2 hf (n, j + 3) + 2 hf (n, j + 1), 2 Fx (n, j + 1) h F (n, j + 2) + F (n, j), 2 ut (n, j + 1) 2 u (n + 1, j + 1) + u (n, j + 2) + u (n, j), 2 hν ux (n, j) ν u (n, j + 3) + ν u (n, j + 1) + 4 h 2 u (n + 1, j + 1) 2 h 2 u (n, j + 2) 2 h 2 u (n, j) + 2 hf (n, j + 2) 2 hf (n, j), ut (n, j) + Fx (n, j) ν uxx (n, j)], [n, j], [uxx, ux, ut, Fx, u, F]]
46 Example: Burgers' Equation >L:=[ut(n,j)+Fx(n,j)-nu*uxx(n,j), > ut(n,j+1)*tau-(u(n+1,j+1)-(u(n,j+2)+u(n,j))/2), > 2*Fx(n,j+1)*h-(F(n,j+2)-F(n,j)), > 2*ux(n,j+1)*h-(u(n,j+2)-u(n,j)), > 2*uxx(n,j+1)*h-(ux(n,j+2)-ux(n,j))]; [ut (n, j) + Fx (n, j) ν uxx (n, j), ut (n, j + 1) u (n + 1, j + 1) + 1 u (n, j + 2) + 1 u (n, j), Fx (n, j + 1) h F (n, j + 2) + F (n, j), 2 ux (n, j + 1) h u (n, j + 2) + u (n, j), 2 uxx (n, j + 1) h ux (n, j + 2) + ux (n, j)] >JanetBasis(L, [n,j], [uxx,ux,ut,fx,u,f],2); [[ 2 ν u (n, j + 2) + ν u (n, j) + ν u (n, j + 4) 4 h 2 u (n + 1, j + 2) + 2 h 2 u (n, j + 3) + 2 h 2 u (n, j + 1) 2 hf (n, j + 3) + 2 hf (n, j + 1), 2 Fx (n, j + 1) h F (n, j + 2) + F (n, j), 2 ut (n, j + 1) 2 u (n + 1, j + 1) + u (n, j + 2) + u (n, j), 2 hν ux (n, j) ν u (n, j + 3) + ν u (n, j + 1) + 4 h 2 u (n + 1, j + 1) 2 h 2 u (n, j + 2) 2 h 2 u (n, j) + 2 hf (n, j + 2) 2 hf (n, j), ut (n, j) + Fx (n, j) ν uxx (n, j)], [n, j], [uxx, ux, ut, Fx, u, F]]
47 Example: Burgers' Equation >L:=[ut(n,j)+Fx(n,j)-nu*uxx(n,j), > ut(n,j+1)*tau-(u(n+1,j+1)-(u(n,j+2)+u(n,j))/2), > 2*Fx(n,j+1)*h-(F(n,j+2)-F(n,j)), > 2*ux(n,j+1)*h-(u(n,j+2)-u(n,j)), > 2*uxx(n,j+1)*h-(ux(n,j+2)-ux(n,j))]; [ut (n, j) + Fx (n, j) ν uxx (n, j), ut (n, j + 1) u (n + 1, j + 1) + 1 u (n, j + 2) + 1 u (n, j), Fx (n, j + 1) h F (n, j + 2) + F (n, j), 2 ux (n, j + 1) h u (n, j + 2) + u (n, j), 2 uxx (n, j + 1) h ux (n, j + 2) + ux (n, j)] >JanetBasis(L, [n,j], [uxx,ux,ut,fx,u,f],2); [[ 2 ν u (n, j + 2) + ν u (n, j) + ν u (n, j + 4) 4 h 2 u (n + 1, j + 2) + 2 h 2 u (n, j + 3) + 2 h 2 u (n, j + 1) 2 hf (n, j + 3) + 2 hf (n, j + 1), 2 Fx (n, j + 1) h F (n, j + 2) + F (n, j), 2 ut (n, j + 1) 2 u (n + 1, j + 1) + u (n, j + 2) + u (n, j), 2 hν ux (n, j) ν u (n, j + 3) + ν u (n, j + 1) + 4 h 2 u (n + 1, j + 1) 2 h 2 u (n, j + 2) 2 h 2 u (n, j) + 2 hf (n, j + 2) 2 hf (n, j), ut (n, j) + Fx (n, j) ν uxx (n, j)], [n, j], [uxx, ux, ut, Fx, u, F]]
48 Example: Burgers' Equation >L:=[ut(n,j)+Fx(n,j)-nu*uxx(n,j), > ut(n,j+1)*tau-(u(n+1,j+1)-(u(n,j+2)+u(n,j))/2), > 2*Fx(n,j+1)*h-(F(n,j+2)-F(n,j)), > 2*ux(n,j+1)*h-(u(n,j+2)-u(n,j)), > 2*uxx(n,j+1)*h-(ux(n,j+2)-ux(n,j))]; [ut (n, j) + Fx (n, j) ν uxx (n, j), ut (n, j + 1) u (n + 1, j + 1) + 1 u (n, j + 2) + 1 u (n, j), Fx (n, j + 1) h F (n, j + 2) + F (n, j), 2 ux (n, j + 1) h u (n, j + 2) + u (n, j), 2 uxx (n, j + 1) h ux (n, j + 2) + ux (n, j)] >JanetBasis(L, [n,j], [uxx,ux,ut,fx,u,f],2); [[ 2 ν u (n, j + 2) + ν u (n, j) + ν u (n, j + 4) 4 h 2 u (n + 1, j + 2) + 2 h 2 u (n, j + 3) + 2 h 2 u (n, j + 1) 2 hf (n, j + 3) + 2 hf (n, j + 1), 2 Fx (n, j + 1) h F (n, j + 2) + F (n, j), 2 ut (n, j + 1) 2 u (n + 1, j + 1) + u (n, j + 2) + u (n, j), 2 hν ux (n, j) ν u (n, j + 3) + ν u (n, j + 1) + 4 h 2 u (n + 1, j + 1) 2 h 2 u (n, j + 2) 2 h 2 u (n, j) + 2 hf (n, j + 2) 2 hf (n, j), ut (n, j) + Fx (n, j) ν uxx (n, j)], [n, j], [uxx, ux, ut, Fx, u, F]]
49 >collect(%[1,1]/(4*tau*h^2),[tau,h,nu]); 1/2 F (n, j + 3) + 1/2 F (n, j + 1) (1/4 u (n, j + 4) 1/2 u (n, j + 2) + 1/4 u (n, j)) ν + h h 2 1/2 u (n, j + 3) + 1/2 u (n, j + 1) u (n + 1, j + 2) + >a:=-dform(%,[u,f],[[n,tau,t],[j,h,x]],[0,2],2); [D 2 (F) (t, x) D 2,2 (u) (t, x) ν + D 1 (u) (t, x) 1/2 D 2,2 (u) (t, x) h 2, 1/2 D 1,1 (u) (t, x) ( 1/6 D 2,2,2 (F) (t, x) + 1/3 D 2,2,2,2 (u) (t, x)) νh 2 1/24 D 2,2,2,2 (u) (t, x) h 4, 1/6 D 1,1,1 (u) (t, x) D 2,2,2,2,2 (F) (t, x) D 2,2,2,2,2,2 (u) (t, x) νh 4 1 D 2,2,2,2,2,2 (u) (t, x) h 6 ] 720
50 >collect(%[1,1]/(4*tau*h^2),[tau,h,nu]); 1/2 F (n, j + 3) + 1/2 F (n, j + 1) (1/4 u (n, j + 4) 1/2 u (n, j + 2) + 1/4 u (n, j)) ν + h h 2 1/2 u (n, j + 3) + 1/2 u (n, j + 1) u (n + 1, j + 2) + >a:=-dform(%,[u,f],[[n,tau,t],[j,h,x]],[0,2],2); [D 2 (F) (t, x) D 2,2 (u) (t, x) ν + D 1 (u) (t, x) 1/2 D 2,2 (u) (t, x) h 2, 1/2 D 1,1 (u) (t, x) ( 1/6 D 2,2,2 (F) (t, x) + 1/3 D 2,2,2,2 (u) (t, x)) νh 2 1/24 D 2,2,2,2 (u) (t, x) h 4, 1/6 D 1,1,1 (u) (t, x) D 2,2,2,2,2 (F) (t, x) D 2,2,2,2,2,2 (u) (t, x) νh 4 1 D 2,2,2,2,2,2 (u) (t, x) h 6 ] 720
51 >collect(%[1,1]/(4*tau*h^2),[tau,h,nu]); 1/2 F (n, j + 3) + 1/2 F (n, j + 1) (1/4 u (n, j + 4) 1/2 u (n, j + 2) + 1/4 u (n, j)) ν + h h 2 1/2 u (n, j + 3) + 1/2 u (n, j + 1) u (n + 1, j + 2) + >a:=-dform(%,[u,f],[[n,tau,t],[j,h,x]],[0,2],2); [D 2 (F) (t, x) D 2,2 (u) (t, x) ν + D 1 (u) (t, x) 1/2 D 2,2 (u) (t, x) h 2, 1/2 D 1,1 (u) (t, x) ( 1/6 D 2,2,2 (F) (t, x) + 1/3 D 2,2,2,2 (u) (t, x)) νh 2 1/24 D 2,2,2,2 (u) (t, x) h 4, 1/6 D 1,1,1 (u) (t, x) D 2,2,2,2,2 (F) (t, x) D 2,2,2,2,2,2 (u) (t, x) νh 4 1 D 2,2,2,2,2,2 (u) (t, x) h 6 ] 720
52 >F:=u^2/2: >PForm(a); [D 2 (u) (t, x) u (t, x) D 2,2 (u) (t, x) ν + D 1 (u) (t, x) 1/2 D 2,2 (u) (t, x) h 2, ( ν D 2,2,2 (u) (t, x) u (t, x) 2 ν D 2,2 (u) (t, x) D 2 (u) (t, x) +1/2 ν 2 D 2,2,2,2 (u) (t, x) + 1/2 (u (t, x)) 2 D 2,2 (u) (t, x) + u (t, x) (D 2 (u) (t, x)) 2 + ( 1/3 D 2,2,2 (u) (t, x) u (t, x) 1/2 D 2,2 (u) (t, x) D 2 (u) (t, x) + 1/6 D 2,2,2,2 (u) (t, x) ν) h 2 + 1/12 D 2,2,2,2 (u) (t, x) h 4 ]
53 >F:=u^2/2: >PForm(a); [D 2 (u) (t, x) u (t, x) D 2,2 (u) (t, x) ν + D 1 (u) (t, x) 1/2 D 2,2 (u) (t, x) h 2, ( ν D 2,2,2 (u) (t, x) u (t, x) 2 ν D 2,2 (u) (t, x) D 2 (u) (t, x) +1/2 ν 2 D 2,2,2,2 (u) (t, x) + 1/2 (u (t, x)) 2 D 2,2 (u) (t, x) + u (t, x) (D 2 (u) (t, x)) 2 + ( 1/3 D 2,2,2 (u) (t, x) u (t, x) 1/2 D 2,2 (u) (t, x) D 2 (u) (t, x) + 1/6 D 2,2,2,2 (u) (t, x) ν) h 2 + 1/12 D 2,2,2,2 (u) (t, x) h 4 ]
54 One can also use the trapezoidal rule for spatial integration. This derives other schemes. By selecting either the midpoint or the trapezoidal rule for the spatial integrals, we obtain 8 possible schemes. Among them there are 7 dierent schemes: 2(u n+1 j+2 + un+1 j+1 ) (un j+3 + un j+2 + un j+1 + un j ) 4 2u n+1 j+1 (un j+2 + un j ) 2 (f n j+3 + fn j+2 ) (fn j+1 + fn j ) + = ν 4h + f n j+2 fn j 2h = ν u n j+2 2un j+1 + un j h 2, 2(u n+1 j+3 + 2un+1 j+2 + un+1 j+1 ) (un j+4 + 2un j+3 + 2un j+2 + 2un j+1 + un j ) 8 (f n j+4 + 2fn j+1 ) (2fn j+1 + fn j ) u n j+3 2un j+2 + un j+1 + = ν, 8h h 2 2(u n+1 j+3 + un+1 j+2 ) (un j+4 + un j+3 + un j+2 + un j+1 ) 4 2(u n+1 j+2 + un+1 j+1 ) (un j+3 + un j+2 + un j+1 + un j ) 4 + f n j+3 fn j+2 ((u n j+5 + un j+4 ) 2un j+3 ) (2un j+2 (un j+1 + un j )) = ν, 8h 2 + f n j+2 fn j+1 h = ν 2(u n+1 j+3 + 2un+1 j+2 + un+1 j+1 ) (un j+4 + 2un j+3 + 2un j+2 + 2un j+1 + un j ) 8 = ν u n j+3 2un j+2 + un j+1 h 2. h (u n j+3 un j+2 ) (un j+1 un j ) 2h 2, (u n j+3 un j+2 ) (un j+1 un j ) 2h 2, + f n j+3 fn j+1 2h
55 Computation of dierential approximations for them gives: (9) [..., (...) +( 1 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 2 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 2 uxxxxν 7 uxxxu uxxux)h uxxxx h 4 (13) These schemes have similar properties, and three of them have identical dierential approximations. By inspection of the schemes we see that these schemes have the same order of approximations; identical dissipative properties; very close dispersion properties with some small distinctions in the rational coecients at derivatives in the factors at h 2 and h 4 /.
56 Computation of dierential approximations for them gives: (9) [..., (...) +( 1 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 2 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 2 uxxxxν 7 uxxxu uxxux)h uxxxx h 4 (13) These schemes have similar properties, and three of them have identical dierential approximations. By inspection of the schemes we see that these schemes have the same order of approximations; identical dissipative properties; very close dispersion properties with some small distinctions in the rational coecients at derivatives in the factors at h 2 and h 4 /.
57 Computation of dierential approximations for them gives: (9) [..., (...) +( 1 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 2 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 2 uxxxxν 7 uxxxu uxxux)h uxxxx h 4 (13) These schemes have similar properties, and three of them have identical dierential approximations. By inspection of the schemes we see that these schemes have the same order of approximations; identical dissipative properties; very close dispersion properties with some small distinctions in the rational coecients at derivatives in the factors at h 2 and h 4 /.
58 Computation of dierential approximations for them gives: (9) [..., (...) +( 1 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 2 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 2 uxxxxν 7 uxxxu uxxux)h uxxxx h 4 (13) These schemes have similar properties, and three of them have identical dierential approximations. By inspection of the schemes we see that these schemes have the same order of approximations; identical dissipative properties; very close dispersion properties with some small distinctions in the rational coecients at derivatives in the factors at h 2 and h 4 /.
59 Computation of dierential approximations for them gives: (9) [..., (...) +( 1 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 2 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu uxxux)h uxxxx h 4 (??) [..., (...) +( 1 uxxxxν 1 uxxxu 2 2 uxxux)h uxxxx h 4 (??) [..., (...) +( 2 uxxxxν 7 uxxxu uxxux)h uxxxx h 4 (13) These schemes have similar properties, and three of them have identical dierential approximations. By inspection of the schemes we see that these schemes have the same order of approximations; identical dissipative properties; very close dispersion properties with some small distinctions in the rational coecients at derivatives in the factors at h 2 and h 4 /.
60 Denoting the values of functions on the intermediate time level by u, F we obtain the following dierence system: n n n u t j + F x j = ν u xx j u t n j = u n+1 j un j+2 +un j 2 2F x n j+1 h = F n j+2 Fn j 2u x n j+1 h = u n j+2 un j 2u xx n j+1 h = u x n j+2 u x n j u t n j + F x n j = ν u xx n j n u t j = u n+1 j u n j n 2F x j+1 h = Fn j+2 F n j n 2u x j+1 h = u n j+2 u n j 2u x x n j+1 h = u x n n j+2 u x j. The trapezoidal or midpoint rule for the integral relation between u x and u yields 36 dierent schemes whose are similar the Lax-Wendro scheme. (14)
61 Conclusions Gr obner bases provide algorithmic construction of nite dierence schemes for linear PDEs in two independent variables. Having a dierence scheme constructed the method of dierential approximation (modied equation) allows to study stability of schemes for a wide class of PDEs. In particular, the rst dierential approximation (FDA) plays an important role in the stability analysis. For linear and some quasilinear PDEs dierential approximations can be constructed algorithmically, and the underlying algorithms have been implemented in Maple. Algorithms for computing parabolic and hyperbolic forms of FDA are available together with their implementation in Maple. The methods and software designed were applied to many dierent PDEs, for example, to Burgers' equation. A number of dierence schemes for them was generated and their stability properties were studied by the method of dierential approximation.
62 Conclusions Gr obner bases provide algorithmic construction of nite dierence schemes for linear PDEs in two independent variables. Having a dierence scheme constructed the method of dierential approximation (modied equation) allows to study stability of schemes for a wide class of PDEs. In particular, the rst dierential approximation (FDA) plays an important role in the stability analysis. For linear and some quasilinear PDEs dierential approximations can be constructed algorithmically, and the underlying algorithms have been implemented in Maple. Algorithms for computing parabolic and hyperbolic forms of FDA are available together with their implementation in Maple. The methods and software designed were applied to many dierent PDEs, for example, to Burgers' equation. A number of dierence schemes for them was generated and their stability properties were studied by the method of dierential approximation.
63 Conclusions Gr obner bases provide algorithmic construction of nite dierence schemes for linear PDEs in two independent variables. Having a dierence scheme constructed the method of dierential approximation (modied equation) allows to study stability of schemes for a wide class of PDEs. In particular, the rst dierential approximation (FDA) plays an important role in the stability analysis. For linear and some quasilinear PDEs dierential approximations can be constructed algorithmically, and the underlying algorithms have been implemented in Maple. Algorithms for computing parabolic and hyperbolic forms of FDA are available together with their implementation in Maple. The methods and software designed were applied to many dierent PDEs, for example, to Burgers' equation. A number of dierence schemes for them was generated and their stability properties were studied by the method of dierential approximation.
64 Conclusions Gr obner bases provide algorithmic construction of nite dierence schemes for linear PDEs in two independent variables. Having a dierence scheme constructed the method of dierential approximation (modied equation) allows to study stability of schemes for a wide class of PDEs. In particular, the rst dierential approximation (FDA) plays an important role in the stability analysis. For linear and some quasilinear PDEs dierential approximations can be constructed algorithmically, and the underlying algorithms have been implemented in Maple. Algorithms for computing parabolic and hyperbolic forms of FDA are available together with their implementation in Maple. The methods and software designed were applied to many dierent PDEs, for example, to Burgers' equation. A number of dierence schemes for them was generated and their stability properties were studied by the method of dierential approximation.
65 Conclusions Gr obner bases provide algorithmic construction of nite dierence schemes for linear PDEs in two independent variables. Having a dierence scheme constructed the method of dierential approximation (modied equation) allows to study stability of schemes for a wide class of PDEs. In particular, the rst dierential approximation (FDA) plays an important role in the stability analysis. For linear and some quasilinear PDEs dierential approximations can be constructed algorithmically, and the underlying algorithms have been implemented in Maple. Algorithms for computing parabolic and hyperbolic forms of FDA are available together with their implementation in Maple. The methods and software designed were applied to many dierent PDEs, for example, to Burgers' equation. A number of dierence schemes for them was generated and their stability properties were studied by the method of dierential approximation.
66 References Gerdt V.P. and Blinkov Yu. A. and Mozzhilkin V. V. Gr obner bases and generation of dierence schemes for partial dierential equations. Symmetry, Integrability and Geometry: Methods and Applications, 2:26, Ganzha V.G. and Vorozhtsov E.V. Computer-aided analysis of dierence schemes for partial dierential equations. New York, Wiley-Interscience, Strikwerda J.C. Finite dierence schemes and partial dierential equations. Philadelphia, SIAM, Shokin Yu.I. and Yanenko N.N. Method of dierential approximation. Application to gas dynamics. Nauka, Siberian Division, 1985 (in Russian). Gerdt V.P. and Robertz D. A Maple package for computing Gr obner bases for linear recurrence relations. Nuclear Instruments and Methods in Physics Research, A559:215219, 2006.
67 References Gerdt V.P. and Blinkov Yu. A. and Mozzhilkin V. V. Gr obner bases and generation of dierence schemes for partial dierential equations. Symmetry, Integrability and Geometry: Methods and Applications, 2:26, Ganzha V.G. and Vorozhtsov E.V. Computer-aided analysis of dierence schemes for partial dierential equations. New York, Wiley-Interscience, Strikwerda J.C. Finite dierence schemes and partial dierential equations. Philadelphia, SIAM, Shokin Yu.I. and Yanenko N.N. Method of dierential approximation. Application to gas dynamics. Nauka, Siberian Division, 1985 (in Russian). Gerdt V.P. and Robertz D. A Maple package for computing Gr obner bases for linear recurrence relations. Nuclear Instruments and Methods in Physics Research, A559:215219, 2006.
68 References Gerdt V.P. and Blinkov Yu. A. and Mozzhilkin V. V. Gr obner bases and generation of dierence schemes for partial dierential equations. Symmetry, Integrability and Geometry: Methods and Applications, 2:26, Ganzha V.G. and Vorozhtsov E.V. Computer-aided analysis of dierence schemes for partial dierential equations. New York, Wiley-Interscience, Strikwerda J.C. Finite dierence schemes and partial dierential equations. Philadelphia, SIAM, Shokin Yu.I. and Yanenko N.N. Method of dierential approximation. Application to gas dynamics. Nauka, Siberian Division, 1985 (in Russian). Gerdt V.P. and Robertz D. A Maple package for computing Gr obner bases for linear recurrence relations. Nuclear Instruments and Methods in Physics Research, A559:215219, 2006.
69 References Gerdt V.P. and Blinkov Yu. A. and Mozzhilkin V. V. Gr obner bases and generation of dierence schemes for partial dierential equations. Symmetry, Integrability and Geometry: Methods and Applications, 2:26, Ganzha V.G. and Vorozhtsov E.V. Computer-aided analysis of dierence schemes for partial dierential equations. New York, Wiley-Interscience, Strikwerda J.C. Finite dierence schemes and partial dierential equations. Philadelphia, SIAM, Shokin Yu.I. and Yanenko N.N. Method of dierential approximation. Application to gas dynamics. Nauka, Siberian Division, 1985 (in Russian). Gerdt V.P. and Robertz D. A Maple package for computing Gr obner bases for linear recurrence relations. Nuclear Instruments and Methods in Physics Research, A559:215219, 2006.
70 References Gerdt V.P. and Blinkov Yu. A. and Mozzhilkin V. V. Gr obner bases and generation of dierence schemes for partial dierential equations. Symmetry, Integrability and Geometry: Methods and Applications, 2:26, Ganzha V.G. and Vorozhtsov E.V. Computer-aided analysis of dierence schemes for partial dierential equations. New York, Wiley-Interscience, Strikwerda J.C. Finite dierence schemes and partial dierential equations. Philadelphia, SIAM, Shokin Yu.I. and Yanenko N.N. Method of dierential approximation. Application to gas dynamics. Nauka, Siberian Division, 1985 (in Russian). Gerdt V.P. and Robertz D. A Maple package for computing Gr obner bases for linear recurrence relations. Nuclear Instruments and Methods in Physics Research, A559:215219, 2006.
Introduction to the Finite Element Method
Introduction to the Finite Element Method 09.06.2009 Outline Motivation Partial Differential Equations (PDEs) Finite Difference Method (FDM) Finite Element Method (FEM) References Motivation Figure: cross
More informationThe Heat Equation. Lectures INF2320 p. 1/88
The Heat Equation Lectures INF232 p. 1/88 Lectures INF232 p. 2/88 The Heat Equation We study the heat equation: u t = u xx for x (,1), t >, (1) u(,t) = u(1,t) = for t >, (2) u(x,) = f(x) for x (,1), (3)
More information5 Numerical Differentiation
D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Chapter 1: Initial value problems in ODEs Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the Numerical
More informationFourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions
Fourth-Order Compact Schemes of a Heat Conduction Problem with Neumann Boundary Conditions Jennifer Zhao, 1 Weizhong Dai, Tianchan Niu 1 Department of Mathematics and Statistics, University of Michigan-Dearborn,
More informationAn Introduction to Partial Differential Equations
An Introduction to Partial Differential Equations Andrew J. Bernoff LECTURE 2 Cooling of a Hot Bar: The Diffusion Equation 2.1. Outline of Lecture An Introduction to Heat Flow Derivation of the Diffusion
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Course objectives and preliminaries Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the Numerical Analysis
More informationN 1. (q k+1 q k ) 2 + α 3. k=0
Teoretisk Fysik Hand-in problem B, SI1142, Spring 2010 In 1955 Fermi, Pasta and Ulam 1 numerically studied a simple model for a one dimensional chain of non-linear oscillators to see how the energy distribution
More informationDoes Black-Scholes framework for Option Pricing use Constant Volatilities and Interest Rates? New Solution for a New Problem
Does Black-Scholes framework for Option Pricing use Constant Volatilities and Interest Rates? New Solution for a New Problem Gagan Deep Singh Assistant Vice President Genpact Smart Decision Services Financial
More informationFinite Difference Approach to Option Pricing
Finite Difference Approach to Option Pricing February 998 CS5 Lab Note. Ordinary differential equation An ordinary differential equation, or ODE, is an equation of the form du = fut ( (), t) (.) dt where
More informationNonlinear Algebraic Equations. Lectures INF2320 p. 1/88
Nonlinear Algebraic Equations Lectures INF2320 p. 1/88 Lectures INF2320 p. 2/88 Nonlinear algebraic equations When solving the system u (t) = g(u), u(0) = u 0, (1) with an implicit Euler scheme we have
More informationFinite cloud method: a true meshless technique based on a xed reproducing kernel approximation
INTERNATIONAL JOURNAL FOR NUMERICAL METHODS IN ENGINEERING Int. J. Numer. Meth. Engng 2001; 50:2373 2410 Finite cloud method: a true meshless technique based on a xed reproducing kernel approximation N.
More informationCollege of the Holy Cross, Spring 2009 Math 373, Partial Differential Equations Midterm 1 Practice Questions
College of the Holy Cross, Spring 29 Math 373, Partial Differential Equations Midterm 1 Practice Questions 1. (a) Find a solution of u x + u y + u = xy. Hint: Try a polynomial of degree 2. Solution. Use
More informationMATH 425, PRACTICE FINAL EXAM SOLUTIONS.
MATH 45, PRACTICE FINAL EXAM SOLUTIONS. Exercise. a Is the operator L defined on smooth functions of x, y by L u := u xx + cosu linear? b Does the answer change if we replace the operator L by the operator
More informationExact Solutions to a Generalized Sharma Tasso Olver Equation
Applied Mathematical Sciences, Vol. 5, 2011, no. 46, 2289-2295 Exact Solutions to a Generalized Sharma Tasso Olver Equation Alvaro H. Salas Universidad de Caldas, Manizales, Colombia Universidad Nacional
More informationSIXTY STUDY QUESTIONS TO THE COURSE NUMERISK BEHANDLING AV DIFFERENTIALEKVATIONER I
Lennart Edsberg, Nada, KTH Autumn 2008 SIXTY STUDY QUESTIONS TO THE COURSE NUMERISK BEHANDLING AV DIFFERENTIALEKVATIONER I Parameter values and functions occurring in the questions belowwill be exchanged
More informationNotes on metric spaces
Notes on metric spaces 1 Introduction The purpose of these notes is to quickly review some of the basic concepts from Real Analysis, Metric Spaces and some related results that will be used in this course.
More informationMATH 132: CALCULUS II SYLLABUS
MATH 32: CALCULUS II SYLLABUS Prerequisites: Successful completion of Math 3 (or its equivalent elsewhere). Math 27 is normally not a sufficient prerequisite for Math 32. Required Text: Calculus: Early
More informationAN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS
AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEY-INTERSCIENCE A John Wiley & Sons, Inc.,
More informationa 1 x + a 0 =0. (3) ax 2 + bx + c =0. (4)
ROOTS OF POLYNOMIAL EQUATIONS In this unit we discuss polynomial equations. A polynomial in x of degree n, where n 0 is an integer, is an expression of the form P n (x) =a n x n + a n 1 x n 1 + + a 1 x
More informationJUST THE MATHS UNIT NUMBER 1.8. ALGEBRA 8 (Polynomials) A.J.Hobson
JUST THE MATHS UNIT NUMBER 1.8 ALGEBRA 8 (Polynomials) by A.J.Hobson 1.8.1 The factor theorem 1.8.2 Application to quadratic and cubic expressions 1.8.3 Cubic equations 1.8.4 Long division of polynomials
More informationLecture 3 Fluid Dynamics and Balance Equa6ons for Reac6ng Flows
Lecture 3 Fluid Dynamics and Balance Equa6ons for Reac6ng Flows 3.- 1 Basics: equations of continuum mechanics - balance equations for mass and momentum - balance equations for the energy and the chemical
More informationHøgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver
Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin e-mail: chechkin@mech.math.msu.su Narvik 6 PART I Task. Consider two-point
More information5.4 The Heat Equation and Convection-Diffusion
5.4. THE HEAT EQUATION AND CONVECTION-DIFFUSION c 6 Gilbert Strang 5.4 The Heat Equation and Convection-Diffusion The wave equation conserves energy. The heat equation u t = u xx dissipates energy. The
More information1 Error in Euler s Method
1 Error in Euler s Method Experience with Euler s 1 method raises some interesting questions about numerical approximations for the solutions of differential equations. 1. What determines the amount of
More informationMean value theorem, Taylors Theorem, Maxima and Minima.
MA 001 Preparatory Mathematics I. Complex numbers as ordered pairs. Argand s diagram. Triangle inequality. De Moivre s Theorem. Algebra: Quadratic equations and express-ions. Permutations and Combinations.
More informationClass Meeting # 1: Introduction to PDEs
MATH 18.152 COURSE NOTES - CLASS MEETING # 1 18.152 Introduction to PDEs, Fall 2011 Professor: Jared Speck Class Meeting # 1: Introduction to PDEs 1. What is a PDE? We will be studying functions u = u(x
More informationNumerical Methods for Option Pricing
Chapter 9 Numerical Methods for Option Pricing Equation (8.26) provides a way to evaluate option prices. For some simple options, such as the European call and put options, one can integrate (8.26) directly
More informationConvolution, Correlation, & Fourier Transforms. James R. Graham 10/25/2005
Convolution, Correlation, & Fourier Transforms James R. Graham 10/25/2005 Introduction A large class of signal processing techniques fall under the category of Fourier transform methods These methods fall
More informationCritical Thresholds in Euler-Poisson Equations. Shlomo Engelberg Jerusalem College of Technology Machon Lev
Critical Thresholds in Euler-Poisson Equations Shlomo Engelberg Jerusalem College of Technology Machon Lev 1 Publication Information This work was performed with Hailiang Liu & Eitan Tadmor. These results
More informationScientic Computing 2013 Computer Classes: Worksheet 11: 1D FEM and boundary conditions
Scientic Computing 213 Computer Classes: Worksheet 11: 1D FEM and boundary conditions Oleg Batrashev November 14, 213 This material partially reiterates the material given on the lecture (see the slides)
More informationThe one dimensional heat equation: Neumann and Robin boundary conditions
The one dimensional heat equation: Neumann and Robin boundary conditions Ryan C. Trinity University Partial Differential Equations February 28, 2012 with Neumann boundary conditions Our goal is to solve:
More informationGrid adaptivity for systems of conservation laws
Grid adaptivity for systems of conservation laws M. Semplice 1 G. Puppo 2 1 Dipartimento di Matematica Università di Torino 2 Dipartimento di Scienze Matematiche Politecnico di Torino Numerical Aspects
More informationNumerical Analysis Lecture Notes
Numerical Analysis Lecture Notes Peter J. Olver. Finite Difference Methods for Partial Differential Equations As you are well aware, most differential equations are much too complicated to be solved by
More informationMathematical Finance
Mathematical Finance Option Pricing under the Risk-Neutral Measure Cory Barnes Department of Mathematics University of Washington June 11, 2013 Outline 1 Probability Background 2 Black Scholes for European
More informationPOLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS
POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS N. ROBIDOUX Abstract. We show that, given a histogram with n bins possibly non-contiguous or consisting
More informationSOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis
More informationRepresentation of functions as power series
Representation of functions as power series Dr. Philippe B. Laval Kennesaw State University November 9, 008 Abstract This document is a summary of the theory and techniques used to represent functions
More informationOpenStax-CNX module: m32633 1. Quadratic Sequences 1; 2; 4; 7; 11;... (1)
OpenStax-CNX module: m32633 1 Quadratic Sequences Rory Adams Free High School Science Texts Project Sarah Blyth Heather Williams This work is produced by OpenStax-CNX and licensed under the Creative Commons
More information3-17 15-25 5 15-10 25 3-2 5 0. 1b) since the remainder is 0 I need to factor the numerator. Synthetic division tells me this is true
Section 5.2 solutions #1-10: a) Perform the division using synthetic division. b) if the remainder is 0 use the result to completely factor the dividend (this is the numerator or the polynomial to the
More informationAlgebra I Vocabulary Cards
Algebra I Vocabulary Cards Table of Contents Expressions and Operations Natural Numbers Whole Numbers Integers Rational Numbers Irrational Numbers Real Numbers Absolute Value Order of Operations Expression
More informationOptimal Control of Switched Networks for Nonlinear Hyperbolic Conservation Laws
Optimal Control of Switched Networks for Nonlinear Hyperbolic Conservation Laws Stefan Ulbrich TU Darmstadt Günter Leugering Universität Erlangen-Nürnberg SPP 1253 Optimization with Partial Differential
More informationZeros of Polynomial Functions
Zeros of Polynomial Functions The Rational Zero Theorem If f (x) = a n x n + a n-1 x n-1 + + a 1 x + a 0 has integer coefficients and p/q (where p/q is reduced) is a rational zero, then p is a factor of
More informationNumerical methods for American options
Lecture 9 Numerical methods for American options Lecture Notes by Andrzej Palczewski Computational Finance p. 1 American options The holder of an American option has the right to exercise it at any moment
More informationApplication of Fourier Transform to PDE (I) Fourier Sine Transform (application to PDEs defined on a semi-infinite domain)
Application of Fourier Transform to PDE (I) Fourier Sine Transform (application to PDEs defined on a semi-infinite domain) The Fourier Sine Transform pair are F. T. : U = 2/ u x sin x dx, denoted as U
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationEXISTENCE AND NON-EXISTENCE RESULTS FOR A NONLINEAR HEAT EQUATION
Sixth Mississippi State Conference on Differential Equations and Computational Simulations, Electronic Journal of Differential Equations, Conference 5 (7), pp. 5 65. ISSN: 7-669. UL: http://ejde.math.txstate.edu
More informationTMA4213/4215 Matematikk 4M/N Vår 2013
Norges teknisk naturvitenskapelige universitet Institutt for matematiske fag TMA43/45 Matematikk 4M/N Vår 3 Løsningsforslag Øving a) The Fourier series of the signal is f(x) =.4 cos ( 4 L x) +cos ( 5 L
More informationIntermediate Microeconomics (22014)
Intermediate Microeconomics (22014) I. Consumer Instructor: Marc Teignier-Baqué First Semester, 2011 Outline Part I. Consumer 1. umer 1.1 Budget Constraints 1.2 Preferences 1.3 Utility Function 1.4 1.5
More informationCover Page. Author: Vu, Van Thieu Title: Opportunities for performance optimization of applications through code generation Issue Date: 2012-03-22
Cover Page The handle http://hdl.handle.net/1887/18622 holds various files of this Leiden University dissertation. Author: Vu, Van Thieu Title: Opportunities for performance optimization of applications
More informationParabolic Equations. Chapter 5. Contents. 5.1.2 Well-Posed Initial-Boundary Value Problem. 5.1.3 Time Irreversibility of the Heat Equation
7 5.1 Definitions Properties Chapter 5 Parabolic Equations Note that we require the solution u(, t bounded in R n for all t. In particular we assume that the boundedness of the smooth function u at infinity
More informationMultigrid preconditioning for nonlinear (degenerate) parabolic equations with application to monument degradation
Multigrid preconditioning for nonlinear (degenerate) parabolic equations with application to monument degradation M. Donatelli 1 M. Semplice S. Serra-Capizzano 1 1 Department of Science and High Technology
More informationHow To Price A Call Option
Now by Itô s formula But Mu f and u g in Ū. Hence τ θ u(x) =E( Mu(X) ds + u(x(τ θ))) 0 τ θ u(x) E( f(x) ds + g(x(τ θ))) = J x (θ). 0 But since u(x) =J x (θ ), we consequently have u(x) =J x (θ ) = min
More informationCS 294-73 Software Engineering for Scientific Computing. http://www.cs.berkeley.edu/~colella/cs294fall2013. Lecture 16: Particle Methods; Homework #4
CS 294-73 Software Engineering for Scientific Computing http://www.cs.berkeley.edu/~colella/cs294fall2013 Lecture 16: Particle Methods; Homework #4 Discretizing Time-Dependent Problems From here on in,
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationA Transmission Problem for Euler-Bernoulli beam with Kelvin-Voigt. Damping
Applied Mathematics & Information Sciences 5(1) (211), 17-28 An International Journal c 211 NSP A Transmission Problem for Euler-Bernoulli beam with Kelvin-Voigt Damping C. A Raposo 1, W. D. Bastos 2 and
More informationCITY UNIVERSITY LONDON. BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION
No: CITY UNIVERSITY LONDON BEng Degree in Computer Systems Engineering Part II BSc Degree in Computer Systems Engineering Part III PART 2 EXAMINATION ENGINEERING MATHEMATICS 2 (resit) EX2005 Date: August
More informationProbability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur
Probability and Statistics Prof. Dr. Somesh Kumar Department of Mathematics Indian Institute of Technology, Kharagpur Module No. #01 Lecture No. #15 Special Distributions-VI Today, I am going to introduce
More informationNotes for AA214, Chapter 7. T. H. Pulliam Stanford University
Notes for AA214, Chapter 7 T. H. Pulliam Stanford University 1 Stability of Linear Systems Stability will be defined in terms of ODE s and O E s ODE: Couples System O E : Matrix form from applying Eq.
More informationconstraint. Let us penalize ourselves for making the constraint too big. We end up with a
Chapter 4 Constrained Optimization 4.1 Equality Constraints (Lagrangians) Suppose we have a problem: Maximize 5, (x 1, 2) 2, 2(x 2, 1) 2 subject to x 1 +4x 2 =3 If we ignore the constraint, we get the
More informationFACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY
FACTORING LARGE NUMBERS, A GREAT WAY TO SPEND A BIRTHDAY LINDSEY R. BOSKO I would like to acknowledge the assistance of Dr. Michael Singer. His guidance and feedback were instrumental in completing this
More informationMath Review. for the Quantitative Reasoning Measure of the GRE revised General Test
Math Review for the Quantitative Reasoning Measure of the GRE revised General Test www.ets.org Overview This Math Review will familiarize you with the mathematical skills and concepts that are important
More informationExtrinsic geometric flows
On joint work with Vladimir Rovenski from Haifa Paweł Walczak Uniwersytet Łódzki CRM, Bellaterra, July 16, 2010 Setting Throughout this talk: (M, F, g 0 ) is a (compact, complete, any) foliated, Riemannian
More informationZeros of Polynomial Functions
Zeros of Polynomial Functions Objectives: 1.Use the Fundamental Theorem of Algebra to determine the number of zeros of polynomial functions 2.Find rational zeros of polynomial functions 3.Find conjugate
More informationChapter 9 Partial Differential Equations
363 One must learn by doing the thing; though you think you know it, you have no certainty until you try. Sophocles (495-406)BCE Chapter 9 Partial Differential Equations A linear second order partial differential
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More information1 Completeness of a Set of Eigenfunctions. Lecturer: Naoki Saito Scribe: Alexander Sheynis/Allen Xue. May 3, 2007. 1.1 The Neumann Boundary Condition
MAT 280: Laplacian Eigenfunctions: Theory, Applications, and Computations Lecture 11: Laplacian Eigenvalue Problems for General Domains III. Completeness of a Set of Eigenfunctions and the Justification
More informationThe continuous and discrete Fourier transforms
FYSA21 Mathematical Tools in Science The continuous and discrete Fourier transforms Lennart Lindegren Lund Observatory (Department of Astronomy, Lund University) 1 The continuous Fourier transform 1.1
More information4.3 Lagrange Approximation
206 CHAP. 4 INTERPOLATION AND POLYNOMIAL APPROXIMATION Lagrange Polynomial Approximation 4.3 Lagrange Approximation Interpolation means to estimate a missing function value by taking a weighted average
More informationA QUICK GUIDE TO THE FORMULAS OF MULTIVARIABLE CALCULUS
A QUIK GUIDE TO THE FOMULAS OF MULTIVAIABLE ALULUS ontents 1. Analytic Geometry 2 1.1. Definition of a Vector 2 1.2. Scalar Product 2 1.3. Properties of the Scalar Product 2 1.4. Length and Unit Vectors
More informationIntegrals of Rational Functions
Integrals of Rational Functions Scott R. Fulton Overview A rational function has the form where p and q are polynomials. For example, r(x) = p(x) q(x) f(x) = x2 3 x 4 + 3, g(t) = t6 + 4t 2 3, 7t 5 + 3t
More informationLinköping University Electronic Press
Linköping University Electronic Press Report Well-posed boundary conditions for the shallow water equations Sarmad Ghader and Jan Nordström Series: LiTH-MAT-R, 0348-960, No. 4 Available at: Linköping University
More informationPOLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS
POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS N. ROBIDOUX Abstract. We show that, given a histogram with n bins possibly non-contiguous or consisting
More informationSOLVING POLYNOMIAL EQUATIONS
C SOLVING POLYNOMIAL EQUATIONS We will assume in this appendix that you know how to divide polynomials using long division and synthetic division. If you need to review those techniques, refer to an algebra
More informationResearch Article The General Traveling Wave Solutions of the Fisher Equation with Degree Three
Advances in Mathematical Physics Volume 203, Article ID 65798, 5 pages http://dx.doi.org/0.55/203/65798 Research Article The General Traveling Wave Solutions of the Fisher Equation with Degree Three Wenjun
More informationSecond Order Linear Partial Differential Equations. Part I
Second Order Linear Partial Differential Equations Part I Second linear partial differential equations; Separation of Variables; - point boundary value problems; Eigenvalues and Eigenfunctions Introduction
More information1 Lecture: Integration of rational functions by decomposition
Lecture: Integration of rational functions by decomposition into partial fractions Recognize and integrate basic rational functions, except when the denominator is a power of an irreducible quadratic.
More informationGrade 6 Mathematics Performance Level Descriptors
Limited Grade 6 Mathematics Performance Level Descriptors A student performing at the Limited Level demonstrates a minimal command of Ohio s Learning Standards for Grade 6 Mathematics. A student at this
More informationLinear Equations in One Variable
Linear Equations in One Variable MATH 101 College Algebra J. Robert Buchanan Department of Mathematics Summer 2012 Objectives In this section we will learn how to: Recognize and combine like terms. Solve
More informationA power series about x = a is the series of the form
POWER SERIES AND THE USES OF POWER SERIES Elizabeth Wood Now we are finally going to start working with a topic that uses all of the information from the previous topics. The topic that we are going to
More information7 Gaussian Elimination and LU Factorization
7 Gaussian Elimination and LU Factorization In this final section on matrix factorization methods for solving Ax = b we want to take a closer look at Gaussian elimination (probably the best known method
More informationMany algorithms, particularly divide and conquer algorithms, have time complexities which are naturally
Recurrence Relations Many algorithms, particularly divide and conquer algorithms, have time complexities which are naturally modeled by recurrence relations. A recurrence relation is an equation which
More informationOn using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems
Dynamics at the Horsetooth Volume 2, 2010. On using numerical algebraic geometry to find Lyapunov functions of polynomial dynamical systems Eric Hanson Department of Mathematics Colorado State University
More informationLecture 13 Linear quadratic Lyapunov theory
EE363 Winter 28-9 Lecture 13 Linear quadratic Lyapunov theory the Lyapunov equation Lyapunov stability conditions the Lyapunov operator and integral evaluating quadratic integrals analysis of ARE discrete-time
More informationCorrections to the First Printing
Corrections to the First Printing Chapter 2 (i) Page 48, Paragraph 1: cells/µ l should be cells/µl without the space. (ii) Page 48, Paragraph 2: Uninfected cells T i should not have the asterisk. Chapter
More informationFINITE DIFFERENCE METHODS
FINITE DIFFERENCE METHODS LONG CHEN Te best known metods, finite difference, consists of replacing eac derivative by a difference quotient in te classic formulation. It is simple to code and economic to
More informationMoreover, under the risk neutral measure, it must be the case that (5) r t = µ t.
LECTURE 7: BLACK SCHOLES THEORY 1. Introduction: The Black Scholes Model In 1973 Fisher Black and Myron Scholes ushered in the modern era of derivative securities with a seminal paper 1 on the pricing
More informationAPPLIED MATHEMATICS ADVANCED LEVEL
APPLIED MATHEMATICS ADVANCED LEVEL INTRODUCTION This syllabus serves to examine candidates knowledge and skills in introductory mathematical and statistical methods, and their applications. For applications
More informationSTRUTS: Statistical Rules of Thumb. Seattle, WA
STRUTS: Statistical Rules of Thumb Gerald van Belle Departments of Environmental Health and Biostatistics University ofwashington Seattle, WA 98195-4691 Steven P. Millard Probability, Statistics and Information
More informationPrentice Hall Mathematics: Algebra 2 2007 Correlated to: Utah Core Curriculum for Math, Intermediate Algebra (Secondary)
Core Standards of the Course Standard 1 Students will acquire number sense and perform operations with real and complex numbers. Objective 1.1 Compute fluently and make reasonable estimates. 1. Simplify
More informationPOISSON AND LAPLACE EQUATIONS. Charles R. O Neill. School of Mechanical and Aerospace Engineering. Oklahoma State University. Stillwater, OK 74078
21 ELLIPTICAL PARTIAL DIFFERENTIAL EQUATIONS: POISSON AND LAPLACE EQUATIONS Charles R. O Neill School of Mechanical and Aerospace Engineering Oklahoma State University Stillwater, OK 74078 2nd Computer
More informationInvertible elements in associates and semigroups. 1
Quasigroups and Related Systems 5 (1998), 53 68 Invertible elements in associates and semigroups. 1 Fedir Sokhatsky Abstract Some invertibility criteria of an element in associates, in particular in n-ary
More informationTaylor and Maclaurin Series
Taylor and Maclaurin Series In the preceding section we were able to find power series representations for a certain restricted class of functions. Here we investigate more general problems: Which functions
More informationLecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 10
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 10 Boundary Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
More informationSolution of Linear Systems
Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start
More informationInternational College of Economics and Finance Syllabus Probability Theory and Introductory Statistics
International College of Economics and Finance Syllabus Probability Theory and Introductory Statistics Lecturer: Mikhail Zhitlukhin. 1. Course description Probability Theory and Introductory Statistics
More informationINTRODUCTION (Syllabus, Numerical Methods & Computational Tools)
INTRODUCTION (Syllabus, Numerical Methods & Computational Tools) A. J. Clark School of Engineering Department of Civil and Environmental Engineering by Dr. Ibrahim A. Assakkaf Spring 2001 ENCE 203 - Computation
More informationNonlinear Systems of Ordinary Differential Equations
Differential Equations Massoud Malek Nonlinear Systems of Ordinary Differential Equations Dynamical System. A dynamical system has a state determined by a collection of real numbers, or more generally
More information