Professional Documents
Culture Documents
Dynamics
Harvard Lomax and Thomas H. Pulliam
NASA Ames Research Center
David W. Zingg
University of Toronto Institute for Aerospace Studies
August 26, 1999
Contents
1 INTRODUCTION 1
1.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2
1.2.1 Problem Specication and Geometry Preparation . . . . . . . 2
1.2.2 Selection of Governing Equations and Boundary Conditions . 3
1.2.3 Selection of Gridding Strategy and Numerical Method . . . . 3
1.2.4 Assessment and Interpretation of Results . . . . . . . . . . . . 4
1.3 Overview . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.4 Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5
2 CONSERVATION LAWS AND THE MODEL EQUATIONS 7
2.1 Conservation Laws . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
2.2 The Navier-Stokes and Euler Equations . . . . . . . . . . . . . . . . . 8
2.3 The Linear Convection Equation . . . . . . . . . . . . . . . . . . . . 12
2.3.1 Dierential Form . . . . . . . . . . . . . . . . . . . . . . . . . 12
2.3.2 Solution in Wave Space . . . . . . . . . . . . . . . . . . . . . . 13
2.4 The Diusion Equation . . . . . . . . . . . . . . . . . . . . . . . . . . 14
2.4.1 Dierential Form . . . . . . . . . . . . . . . . . . . . . . . . . 14
2.4.2 Solution in Wave Space . . . . . . . . . . . . . . . . . . . . . . 15
2.5 Linear Hyperbolic Systems . . . . . . . . . . . . . . . . . . . . . . . . 16
2.6 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17
3 FINITE-DIFFERENCE APPROXIMATIONS 21
3.1 Meshes and Finite-Dierence Notation . . . . . . . . . . . . . . . . . 21
3.2 Space Derivative Approximations . . . . . . . . . . . . . . . . . . . . 24
3.3 Finite-Dierence Operators . . . . . . . . . . . . . . . . . . . . . . . 25
3.3.1 Point Dierence Operators . . . . . . . . . . . . . . . . . . . . 25
3.3.2 Matrix Dierence Operators . . . . . . . . . . . . . . . . . . . 25
3.3.3 Periodic Matrices . . . . . . . . . . . . . . . . . . . . . . . . . 29
3.3.4 Circulant Matrices . . . . . . . . . . . . . . . . . . . . . . . . 30
iii
3.4 Constructing Dierencing Schemes of Any Order . . . . . . . . . . . . 31
3.4.1 Taylor Tables . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
3.4.2 Generalization of Dierence Formulas . . . . . . . . . . . . . . 34
3.4.3 Lagrange and Hermite Interpolation Polynomials . . . . . . . 35
3.4.4 Practical Application of Pade Formulas . . . . . . . . . . . . . 37
3.4.5 Other Higher-Order Schemes . . . . . . . . . . . . . . . . . . . 38
3.5 Fourier Error Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . 39
3.5.1 Application to a Spatial Operator . . . . . . . . . . . . . . . . 39
3.6 Dierence Operators at Boundaries . . . . . . . . . . . . . . . . . . . 43
3.6.1 The Linear Convection Equation . . . . . . . . . . . . . . . . 44
3.6.2 The Diusion Equation . . . . . . . . . . . . . . . . . . . . . . 46
3.7 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 47
4 THE SEMI-DISCRETE APPROACH 51
4.1 Reduction of PDE's to ODE's . . . . . . . . . . . . . . . . . . . . . . 52
4.1.1 The Model ODE's . . . . . . . . . . . . . . . . . . . . . . . . 52
4.1.2 The Generic Matrix Form . . . . . . . . . . . . . . . . . . . . 53
4.2 Exact Solutions of Linear ODE's . . . . . . . . . . . . . . . . . . . . 54
4.2.1 Eigensystems of Semi-Discrete Linear Forms . . . . . . . . . . 54
4.2.2 Single ODE's of First- and Second-Order . . . . . . . . . . . . 55
4.2.3 Coupled First-Order ODE's . . . . . . . . . . . . . . . . . . . 57
4.2.4 General Solution of Coupled ODE's with Complete Eigensystems 59
4.3 Real Space and Eigenspace . . . . . . . . . . . . . . . . . . . . . . . . 61
4.3.1 Denition . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 61
4.3.2 Eigenvalue Spectrums for Model ODE's . . . . . . . . . . . . . 62
4.3.3 Eigenvectors of the Model Equations . . . . . . . . . . . . . . 63
4.3.4 Solutions of the Model ODE's . . . . . . . . . . . . . . . . . . 65
4.4 The Representative Equation . . . . . . . . . . . . . . . . . . . . . . 67
4.5 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 68
5 FINITE-VOLUME METHODS 71
5.1 Basic Concepts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72
5.2 Model Equations in Integral Form . . . . . . . . . . . . . . . . . . . . 73
5.2.1 The Linear Convection Equation . . . . . . . . . . . . . . . . 73
5.2.2 The Diusion Equation . . . . . . . . . . . . . . . . . . . . . . 74
5.3 One-Dimensional Examples . . . . . . . . . . . . . . . . . . . . . . . 74
5.3.1 A Second-Order Approximation to the Convection Equation . 75
5.3.2 A Fourth-Order Approximation to the Convection Equation . 77
5.3.3 A Second-Order Approximation to the Diusion Equation . . 78
5.4 A Two-Dimensional Example . . . . . . . . . . . . . . . . . . . . . . 80
5.5 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83
6 TIME-MARCHING METHODS FOR ODE'S 85
6.1 Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 86
6.2 Converting Time-Marching Methods to OE's . . . . . . . . . . . . . 87
6.3 Solution of Linear OE's With Constant Coecients . . . . . . . . . 88
6.3.1 First- and Second-Order Dierence Equations . . . . . . . . . 89
6.3.2 Special Cases of Coupled First-Order Equations . . . . . . . . 90
6.4 Solution of the Representative OE's . . . . . . . . . . . . . . . . . 91
6.4.1 The Operational Form and its Solution . . . . . . . . . . . . . 91
6.4.2 Examples of Solutions to Time-Marching OE's . . . . . . . . 92
6.5 The ; Relation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 93
6.5.1 Establishing the Relation . . . . . . . . . . . . . . . . . . . . . 93
6.5.2 The Principal -Root . . . . . . . . . . . . . . . . . . . . . . . 95
6.5.3 Spurious -Roots . . . . . . . . . . . . . . . . . . . . . . . . . 95
6.5.4 One-Root Time-Marching Methods . . . . . . . . . . . . . . . 96
6.6 Accuracy Measures of Time-Marching Methods . . . . . . . . . . . . 97
6.6.1 Local and Global Error Measures . . . . . . . . . . . . . . . . 97
6.6.2 Local Accuracy of the Transient Solution (er ; jj ; er! ) . . . . 98
6.6.3 Local Accuracy of the Particular Solution (er ) . . . . . . . . 99
6.6.4 Time Accuracy For Nonlinear Applications . . . . . . . . . . . 100
6.6.5 Global Accuracy . . . . . . . . . . . . . . . . . . . . . . . . . 101
6.7 Linear Multistep Methods . . . . . . . . . . . . . . . . . . . . . . . . 102
6.7.1 The General Formulation . . . . . . . . . . . . . . . . . . . . . 102
6.7.2 Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 103
6.7.3 Two-Step Linear Multistep Methods . . . . . . . . . . . . . . 105
6.8 Predictor-Corrector Methods . . . . . . . . . . . . . . . . . . . . . . . 106
6.9 Runge-Kutta Methods . . . . . . . . . . . . . . . . . . . . . . . . . . 107
6.10 Implementation of Implicit Methods . . . . . . . . . . . . . . . . . . . 110
6.10.1 Application to Systems of Equations . . . . . . . . . . . . . . 110
6.10.2 Application to Nonlinear Equations . . . . . . . . . . . . . . . 111
6.10.3 Local Linearization for Scalar Equations . . . . . . . . . . . . 112
6.10.4 Local Linearization for Coupled Sets of Nonlinear Equations . 115
6.11 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 117
7 STABILITY OF LINEAR SYSTEMS 121
7.1 Dependence on the Eigensystem . . . . . . . . . . . . . . . . . . . . . 122
7.2 Inherent Stability of ODE's . . . . . . . . . . . . . . . . . . . . . . . 123
7.2.1 The Criterion . . . . . . . . . . . . . . . . . . . . . . . . . . . 123
7.2.2 Complete Eigensystems . . . . . . . . . . . . . . . . . . . . . . 123
7.2.3 Defective Eigensystems . . . . . . . . . . . . . . . . . . . . . . 123
7.3 Numerical Stability of OE 's . . . . . . . . . . . . . . . . . . . . . . 124
7.3.1 The Criterion . . . . . . . . . . . . . . . . . . . . . . . . . . . 124
7.3.2 Complete Eigensystems . . . . . . . . . . . . . . . . . . . . . . 125
7.3.3 Defective Eigensystems . . . . . . . . . . . . . . . . . . . . . . 125
7.4 Time-Space Stability and Convergence of OE's . . . . . . . . . . . . 125
7.5 Numerical Stability Concepts in the Complex -Plane . . . . . . . . . 128
7.5.1 -Root Traces Relative to the Unit Circle . . . . . . . . . . . 128
7.5.2 Stability for Small t . . . . . . . . . . . . . . . . . . . . . . . 132
7.6 Numerical Stability Concepts in the Complex h Plane . . . . . . . . 135
7.6.1 Stability for Large h. . . . . . . . . . . . . . . . . . . . . . . . 135
7.6.2 Unconditional Stability, A-Stable Methods . . . . . . . . . . . 136
7.6.3 Stability Contours in the Complex h Plane. . . . . . . . . . . 137
7.7 Fourier Stability Analysis . . . . . . . . . . . . . . . . . . . . . . . . 141
7.7.1 The Basic Procedure . . . . . . . . . . . . . . . . . . . . . . . 141
7.7.2 Some Examples . . . . . . . . . . . . . . . . . . . . . . . . . . 142
7.7.3 Relation to Circulant Matrices . . . . . . . . . . . . . . . . . . 143
7.8 Consistency . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 143
7.9 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 146
8 CHOICE OF TIME-MARCHING METHODS 149
8.1 Stiness Denition for ODE's . . . . . . . . . . . . . . . . . . . . . . 149
8.1.1 Relation to -Eigenvalues . . . . . . . . . . . . . . . . . . . . 149
8.1.2 Driving and Parasitic Eigenvalues . . . . . . . . . . . . . . . . 151
8.1.3 Stiness Classications . . . . . . . . . . . . . . . . . . . . . . 151
8.2 Relation of Stiness to Space Mesh Size . . . . . . . . . . . . . . . . 152
8.3 Practical Considerations for Comparing Methods . . . . . . . . . . . 153
8.4 Comparing the Eciency of Explicit Methods . . . . . . . . . . . . . 154
8.4.1 Imposed Constraints . . . . . . . . . . . . . . . . . . . . . . . 154
8.4.2 An Example Involving Diusion . . . . . . . . . . . . . . . . . 154
8.4.3 An Example Involving Periodic Convection . . . . . . . . . . . 155
8.5 Coping With Stiness . . . . . . . . . . . . . . . . . . . . . . . . . . 158
8.5.1 Explicit Methods . . . . . . . . . . . . . . . . . . . . . . . . . 158
8.5.2 Implicit Methods . . . . . . . . . . . . . . . . . . . . . . . . . 159
8.5.3 A Perspective . . . . . . . . . . . . . . . . . . . . . . . . . . . 160
8.6 Steady Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 160
8.7 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 161
9 RELAXATION METHODS 163
9.1 Formulation of the Model Problem . . . . . . . . . . . . . . . . . . . 164
9.1.1 Preconditioning the Basic Matrix . . . . . . . . . . . . . . . . 164
9.1.2 The Model Equations . . . . . . . . . . . . . . . . . . . . . . . 166
9.2 Classical Relaxation . . . . . . . . . . . . . . . . . . . . . . . . . . . 168
9.2.1 The Delta Form of an Iterative Scheme . . . . . . . . . . . . . 168
9.2.2 The Converged Solution, the Residual, and the Error . . . . . 168
9.2.3 The Classical Methods . . . . . . . . . . . . . . . . . . . . . . 169
9.3 The ODE Approach to Classical Relaxation . . . . . . . . . . . . . . 170
9.3.1 The Ordinary Dierential Equation Formulation . . . . . . . . 170
9.3.2 ODE Form of the Classical Methods . . . . . . . . . . . . . . 172
9.4 Eigensystems of the Classical Methods . . . . . . . . . . . . . . . . . 173
9.4.1 The Point-Jacobi System . . . . . . . . . . . . . . . . . . . . . 174
9.4.2 The Gauss-Seidel System . . . . . . . . . . . . . . . . . . . . . 176
9.4.3 The SOR System . . . . . . . . . . . . . . . . . . . . . . . . . 180
9.5 Nonstationary Processes . . . . . . . . . . . . . . . . . . . . . . . . . 182
9.6 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 187
10 MULTIGRID 191
10.1 Motivation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 191
10.1.1 Eigenvector and Eigenvalue Identication with Space Frequencies191
10.1.2 Properties of the Iterative Method . . . . . . . . . . . . . . . 192
10.2 The Basic Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192
10.3 A Two-Grid Process . . . . . . . . . . . . . . . . . . . . . . . . . . . 200
10.4 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 202
11 NUMERICAL DISSIPATION 203
11.1 One-Sided First-Derivative Space Dierencing . . . . . . . . . . . . . 204
11.2 The Modied Partial Dierential Equation . . . . . . . . . . . . . . . 205
11.3 The Lax-Wendro Method . . . . . . . . . . . . . . . . . . . . . . . . 207
11.4 Upwind Schemes . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 209
11.4.1 Flux-Vector Splitting . . . . . . . . . . . . . . . . . . . . . . . 210
11.4.2 Flux-Dierence Splitting . . . . . . . . . . . . . . . . . . . . . 212
11.5 Articial Dissipation . . . . . . . . . . . . . . . . . . . . . . . . . . . 213
11.6 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 214
12 SPLIT AND FACTORED FORMS 217
12.1 The Concept . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 217
12.2 Factoring Physical Representations | Time Splitting . . . . . . . . . 218
12.3 Factoring Space Matrix Operators in 2{D . . . . . . . . . . . . . . . . 220
12.3.1 Mesh Indexing Convention . . . . . . . . . . . . . . . . . . . . 220
12.3.2 Data Bases and Space Vectors . . . . . . . . . . . . . . . . . . 221
12.3.3 Data Base Permutations . . . . . . . . . . . . . . . . . . . . . 221
12.3.4 Space Splitting and Factoring . . . . . . . . . . . . . . . . . . 223
12.4 Second-Order Factored Implicit Methods . . . . . . . . . . . . . . . . 226
12.5 Importance of Factored Forms in 2 and 3 Dimensions . . . . . . . . . 226
12.6 The Delta Form . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 228
12.7 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 229
13 LINEAR ANALYSIS OF SPLIT AND FACTORED FORMS 233
13.1 The Representative Equation for Circulant Operators . . . . . . . . . 233
13.2 Example Analysis of Circulant Systems . . . . . . . . . . . . . . . . . 234
13.2.1 Stability Comparisons of Time-Split Methods . . . . . . . . . 234
13.2.2 Analysis of a Second-Order Time-Split Method . . . . . . . . 237
13.3 The Representative Equation for Space-Split Operators . . . . . . . . 238
13.4 Example Analysis of 2-D Model Equations . . . . . . . . . . . . . . . 242
13.4.1 The Unfactored Implicit Euler Method . . . . . . . . . . . . . 242
13.4.2 The Factored Nondelta Form of the Implicit Euler Method . . 243
13.4.3 The Factored Delta Form of the Implicit Euler Method . . . . 243
13.4.4 The Factored Delta Form of the Trapezoidal Method . . . . . 244
13.5 Example Analysis of the 3-D Model Equation . . . . . . . . . . . . . 245
13.6 Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 247
A USEFUL RELATIONS AND DEFINITIONS FROM LINEAR AL-
GEBRA 249
A.1 Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 249
A.2 Denitions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 250
A.3 Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 251
A.4 Eigensystems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 251
A.5 Vector and Matrix Norms . . . . . . . . . . . . . . . . . . . . . . . . 254
B SOME PROPERTIES OF TRIDIAGONAL MATRICES 257
B.1 Standard Eigensystem for Simple Tridiagonals . . . . . . . . . . . . . 257
B.2 Generalized Eigensystem for Simple Tridiagonals . . . . . . . . . . . . 258
B.3 The Inverse of a Simple Tridiagonal . . . . . . . . . . . . . . . . . . . 259
B.4 Eigensystems of Circulant Matrices . . . . . . . . . . . . . . . . . . . 260
B.4.1 Standard Tridiagonals . . . . . . . . . . . . . . . . . . . . . . 260
B.4.2 General Circulant Systems . . . . . . . . . . . . . . . . . . . . 261
B.5 Special Cases Found From Symmetries . . . . . . . . . . . . . . . . . 262
B.6 Special Cases Involving Boundary Conditions . . . . . . . . . . . . . 263
C THE HOMOGENEOUS PROPERTY OF THE EULER EQUATIONS265
Chapter 1
INTRODUCTION
1.1 Motivation
The material in this book originated from attempts to understand and systemize nu-
merical solution techniques for the partial dierential equations governing the physics
of
uid
ow. As time went on and these attempts began to crystallize, underlying
constraints on the nature of the material began to form. The principal such constraint
was the demand for unication. Was there one mathematical structure which could
be used to describe the behavior and results of most numerical methods in common
use in the eld of
uid dynamics? Perhaps the answer is arguable, but the authors
believe the answer is armative and present this book as justication for that be-
lief. The mathematical structure is the theory of linear algebra and the attendant
eigenanalysis of linear systems.
The ultimate goal of the eld of computational
uid dynamics (CFD) is to under-
stand the physical events that occur in the
ow of
uids around and within designated
objects. These events are related to the action and interaction of phenomena such
as dissipation, diusion, convection, shock waves, slip surfaces, boundary layers, and
turbulence. In the eld of aerodynamics, all of these phenomena are governed by
the compressible Navier-Stokes equations. Many of the most important aspects of
these relations are nonlinear and, as a consequence, often have no analytic solution.
This, of course, motivates the numerical solution of the associated partial dierential
equations. At the same time it would seem to invalidate the use of linear algebra for
the classication of the numerical methods. Experience has shown that such is not
the case.
As we shall see in a later chapter, the use of numerical methods to solve partial
dierential equations introduces an approximation that, in eect, can change the
form of the basic partial dierential equations themselves. The new equations, which
1
2 CHAPTER 1. INTRODUCTION
are the ones actually being solved by the numerical process, are often referred to as
the modied partial dierential equations. Since they are not precisely the same as
the original equations, they can, and probably will, simulate the physical phenomena
listed above in ways that are not exactly the same as an exact solution to the basic
partial dierential equation. Mathematically, these dierences are usually referred to
as truncation errors. However, the theory associated with the numerical analysis of
uid mechanics was developed predominantly by scientists deeply interested in the
physics of
uid
ow and, as a consequence, these errors are often identied with a
particular physical phenomenon on which they have a strong eect. Thus methods are
said to have a lot of \articial viscosity" or said to be highly dispersive. This means
that the errors caused by the numerical approximation result in a modied partial
dierential equation having additional terms that can be identied with the physics
of dissipation in the rst case and dispersion in the second. There is nothing wrong,
of course, with identifying an error with a physical process, nor with deliberately
directing an error to a specic physical process, as long as the error remains in some
engineering sense \small". It is safe to say, for example, that most numerical methods
in practical use for solving the nondissipative Euler equations create a modied partial
dierential equation that produces some form of dissipation. However, if used and
interpreted properly, these methods give very useful information.
Regardless of what the numerical errors are called, if their eects are not thor-
oughly understood and controlled, they can lead to serious diculties, producing
answers that represent little, if any, physical reality. This motivates studying the
concepts of stability, convergence, and consistency. On the other hand, even if the
errors are kept small enough that they can be neglected (for engineering purposes),
the resulting simulation can still be of little practical use if inecient or inappropriate
algorithms are used. This motivates studying the concepts of stiness, factorization,
and algorithm development in general. All of these concepts we hope to clarify in
this book.
1.2 Background
The eld of computational
uid dynamics has a broad range of applicability. Indepen-
dent of the specic application under study, the following sequence of steps generally
must be followed in order to obtain a satisfactory solution.
1.3 Overview
It should be clear that successful simulation of
uid
ows can involve a wide range of
issues from grid generation to turbulence modelling to the applicability of various sim-
plied forms of the Navier-Stokes equations. Many of these issues are not addressed
in this book. Some of them are presented in the books by Anderson, Tannehill, and
Pletcher [1] and Hirsch [2]. Instead we focus on numerical methods, with emphasis
on nite-dierence and nite-volume methods for the Euler and Navier-Stokes equa-
tions. Rather than presenting the details of the most advanced methods, which are
still evolving, we present a foundation for developing, analyzing, and understanding
such methods.
Fortunately, to develop, analyze, and understand most numerical methods used to
nd solutions for the complete compressible Navier-Stokes equations, we can make use
of much simpler expressions, the so-called \model" equations. These model equations
isolate certain aspects of the physics contained in the complete set of equations. Hence
their numerical solution can illustrate the properties of a given numerical method
when applied to a more complicated system of equations which governs similar phys-
ical phenomena. Although the model equations are extremely simple and easy to
solve, they have been carefully selected to be representative, when used intelligently,
of diculties and complexities that arise in realistic two- and three-dimensional
uid
ow simulations. We believe that a thorough understanding of what happens when
1.4. NOTATION 5
numerical approximations are applied to the model equations is a major rst step in
making condent and competent use of numerical approximations to the Euler and
Navier-Stokes equations. As a word of caution, however, it should be noted that,
although we can learn a great deal by studying numerical methods as applied to the
model equations and can use that information in the design and application of nu-
merical methods to practical problems, there are many aspects of practical problems
which can only be understood in the context of the complete physical systems.
1.4 Notation
The notation is generally explained as it is introduced. Bold type is reserved for real
physical vectors, such as velocity. The vector symbol ~ is used for the vectors (or
column matrices) which contain the values of the dependent variable at the nodes
of a grid. Otherwise, the use of a vector consisting of a collection of scalars should
be apparent from the context and is not identied by any special notation. For
example, the variable u can denote a scalar Cartesian velocity component in the Euler
and Navier-Stokes equations, a scalar quantity in the linear convection and diusion
equations, and a vector consisting of a collection of scalars in our presentation of
hyperbolic systems. Some of the abbreviations used throughout the text are listed
and dened below.
2 3 2 q3
3
6
F1 7 66 7
7
6
6 7
7 6
6 7
7
q3 q2
6
6 F2 7 66
7 q1 7
7
F = 666 7
7
7 = 666 7
7
7 (2.12)
F3 77 66 (
; 1)q4 + 3;2
qq31 ;
;2 1 qq21 77
2 2
6
6
6 7 6 7
4 5 6 4
7
5
q2 q
F4 q
;
4q13 ; 2 2q12 + q132
q 1 3 q 3
We have assumed that the pressure satises p = (
; 1)[e ; (u2 + v2)=2] from the
ideal gas law, where
is the ratio of specic heats, cp=cv . From this it follows that
the
ux Jacobian of E can be written in terms of the conservative variables as
2 3
6
0 1 0
7
0
6
6 q q 7
7
6
6 a21 (3 ;
) q21 (1 ;
) q31
; 1 777
A= @Ei = 666 7
7 (2.13)
@qj 66 q q q q 7
6 ; q1 q1
2 3 3
q1 2
q1 0 77
6
6 7
4 q 7 5
a41 a42 a43
q21
where
!2 !2
a21 =
;2 1 qq3 ; 3 ;2
qq2
1 1
2.2. THE NAVIER-STOKES AND EULER EQUATIONS 11
2 !3 !2 !3 ! !
a41 = (
; 1)4 q2 + qq3 q2 5;
q4 q2
q1 1 q1 q1 q1
! 2 !2 !2 3
a42 =
qq4 ;
;2 1 43 qq2 + qq3 5
1 1 1
! !
a43 = ;(
; 1) qq2 qq3 (2.14)
1 1
and in terms of the primitive variables as
2 3
6
0 1 0 0 7
6
6 7
7
6
6 a21 (3 ;
)u (1 ;
)v (
; 1) 7
7
A = 666 7
7
7 (2.15)
6
6 ;uv v u 0 7
7
6 7
4 5
a41 a42 a43
u
where
a21 =
;2 1 v2 ; 3 ;2
u2
2.6 Problems
1. Show that the 1-D Euler equations can be written in terms of the primitive
variables R = [; u; p]T as follows:
@R + M @R = 0
@t @x
where
2 3
u 0
M = 64 0 u ;1 75
0
p u
18 CHAPTER 2. CONSERVATION LAWS AND THE MODEL EQUATIONS
Assume an ideal gas, p = (
; 1)(e ; u2=2).
2. Find the eigenvalues and eigenvectors of the matrix M derived in question 1.
3. Derive the
ux Jacobian matrix A = @E=@Q for the 1-D Euler equations result-
ing from the conservative variable formulation (Eq. 2.5). Find its eigenvalues
and compare with those obtained in question 2.
4. Show that the two matrices M and A derived in questions 1 and 3, respectively,
are related by a similarity transform. (Hint: make use of the matrix S =
@Q=@R.)
5. Write the 2-D diusion equation, Eq. 2.31, in the form of Eq. 2.2.
6. Given the initial condition u(x; 0) = sin x dened on 0 x 2, write it in the
form of Eq. 2.25, that is, nd the necessary values of fm (0). (Hint: use M = 2
with 1 = 1 and 2 = ;1.) Next consider the same initial condition dened
only at x = 2j=4, j = 0; 1; 2; 3. Find the values of fm(0) required to reproduce
the initial condition at these discrete points using M = 4 with m = m ; 1.
7. Plot the rst three basis functions used in constructing the exact solution to
the diusion equation in Section 2.4.2. Next consider a solution with boundary
conditions ua = ub = 0, and initial conditions from Eq. 2.33 with fm(0) = 1
for 1 m 3, fm (0) = 0 for m > 3. Plot the initial condition on the domain
0 x . Plot the solution at t = 1 with = 1.
8. Write the classical wave equation @ 2 u=@t2 = c2 @ 2 u=@x2 as a rst-order system,
i.e., in the form
@U + A @U = 0
@t @x
where U = [@u=@x; @u=@t]T . Find the eigenvalues and eigenvectors of A.
9. The Cauchy-Riemann equations are formed from the coupling of the steady
compressible continuity (conservation of mass) equation
@u + @v = 0
@x @y
and the vorticity denition
@v + @u = 0
! = ; @x @y
2.6. PROBLEMS 19
where ! = 0 for irrotational
ow. For isentropic and homenthalpic
ow, the
system is closed by the relation
;1 1
;
= 1; 2 u +v ;11
2 2
Note that the variables have been nondimensionalized. Combining the two
PDE's, we have
@f (q) + @g(q) = 0
@x @y
where
u
q = v ; f = v ; g = ;u; u ; v
!"$#&%%'#&)(+*-,/.
,/.1003254768,9*:#&1;=<&#?>&0$@91*-1<A411;B,/0C68DFE
G141*:DHG1#I(KJL#&41@M%'#ND103OP03254768,9*:#&F;
"3#5,/6*:MQ76@R,9*S6OND10$@9*->868,9*->03;L(+*T,/.U@R03;9QV03"W,X,/#ZYV#,/.[;RQ76"$0+61DU,/*-%08\^]Z10_"C6`6QFQ1@9#Cab*:%68,/0
,/.F03;90c;9*:%M41O-,/6103#41;9OTE'61Dd,9.103e;R#&O->0c,/.10f@90$;941OT,/*:F<MD1*Tgh0$@903F"30Z0$2N4168,/*-#&1;3\jifO-,903@9168,/*T>&03OTE&J
#&10M"C6k6QFQ1@9#Cab*:%68,/0K,/.F0U;9Q76l,/*S68OmD10$@9*T>6l,/*->03;cn1@9;R,3Jh,/.F03@90$YoEQ1@R#bD14F"3*:F<e6d;REN;B,/03%p#qX#&@Br
D1*-76@RE`DF*-gs03@90$o,/*S68OV0$254768,/*-#&1;$\jtu.10f,9*:%'0fD10$@9*T>6l,/*->03;v6@90c6Q1Q1@R#CaF*-%d6l,/03D10WaN,3JFO:036D1*-1<w,9#
6kxzy|{d}W~!{'/Ny|N
{d}Wx|73'(+.1*-".HQ1@R#bD14F"303;M6;R0$,M#qD1*Tgh0$@90$1"30'03254768,9*:#&F;w(+.1*-"."C68HYV0
;9#O->&0$D\tu.1*-;+*:;u,/.10=6Q1QF@9#o6".03%'Q1.76;R*:$03D.F03@908\!,/.1*-;f".768QF,/0$@3J7,/.10w"3#1"30$QF,Z#qmn71*T,/0Wr
D1*Tgh0$@903F"3068Q1Q1@9#Cab*:%68,9*:#&1;Z,9#Q768@R,/*:6OjD10$@9*->868,9*->03;M*-;KQ1@90$;903o,903D\tu.103;R0"C6HYs06Q1Q1O-*:0$D
03*T,/.10$@f,9#d;9Q168,/*:6OmDF03@9*T>868,/*T>&03;f#&@+,/*:%'0wD103@R*->868,/*T>&0$;3\c]4F@c03%'Q1.768;9*:;f*:,/.1*-;_.76Qb,/03@c*:;#&
;9Q168,/*:6OhD10$@9*T>6l,/*->03;$F,/*-%0fD103@R*->868,/*T>&0$;u6@90Z,9@90368,/0$De*:_.76Qb,/03@+b\PN,/@968,/0$<&*:0$;_q#&@u6QFQ1O-EN*:F<
,/.F03;90Kn71*T,/0r!D1*Tgh0$@903F"30K6Q1QF@9#Cab*:%68,/*-#&1;_(+*-O:OhYV0KD1*:;R"341;R;90$D*:_.768QF,/0$@f1\
icO-OL#qj,9.10[%d6l,/03@R*S6OYV03O-#I(*-;ZQ1@90$;90$5,903D)*:A668@R,/0$;9*:6A;REN;R,903%\w
0U0$%Q1.16;9*-30U,/.F0
q6"W,,9.768,+2541*T,/0K<&03F03@/68O"3OS68;9;90$;f#8qL%'03;R.103;0WabQ1@R03;9;R03DA*-<0310$@/6O"$41@R>N*:O-*:1036@"$#b#&@RD1*:168,/0$;
*:A7N?Wy9 L!FN}"C68HYV0',9@/61;Bq#&@9%'03D),/#641F*-q#&@R%¡6@R,903;R*S6
%0$;9.
(+*T,/.
032541*:;RQ76"$03D
*:o,903@R>86O-;*:K6u;R#8r!"36O:O-03Dl{cV¢Nx£xylV 8!FN}WJI6;;R.1#?(+M*-K¤L*:<&4F@90^¥b\-¦&\§tu.10Zl{cV¢Nx£xylV
!FN}h*:;411*Tq#&@9%68O:O,9.10v<03#&%'0$,9@9*:"^>86@R*S68,9*:#&*-;§6Y1;9#@9YV03DM*-o,/#+>68@9*S68Y1O:0^"$#b0W¨'"3*:0$o,/;L#8qF,/.F0
,/@961;Bq#&@9%'03D)03254768,9*:#&F;3\e¤7#&@,/.F*:;w@90C68;9#&J§*:)%U41".
#q,9.10'q#O:O:#?(+*-1<6"3"$41@/68"$E
676OTEN;9*:;
(v041;R06©032541*:;RQ76"$03Dª6@B,/0$;9*S68«;REN;B,/03% (+*-,9.1#&4F,'YV03*-1<H41FD141O-E¬@R03;B,/@9*-"$,9*->&0#&@'O:#&;R*:1<
Q1@96"$,9*:"C68O6Q1Q1O-*:"368,/*-#&\
tu.10;R*:%'Q1O:0$;R,%'03;R.*:o>&#&OT>N*:1<UYV#,9.,/*:%'0Z681De;9Q768"30K*:;v;9.1#?(+*:¤L*-<&41@90c¥F\ \jice*-1;9QV03"r
,/*-#&Å#q,/.1*-;Un7<&41@R0Qs0$@9%'*-,/;M41;[,/#kD10$n110,9.10e,/0$@9%';`61D¬1#,/68,/*-#&Å1030$D103DÆ,/#kD10$;9"3@R*:YV0
¦
& Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
¤L*:<41@90K¥F\T¦&Û Üj.oEN;9*:"36O61D"3#%Q14b,68,9*:#&768Oh;9Q16"30$;3\
n71*T,/0ZDF*-gs03@90$1"30K68Q1Q1@9#Cab*:%68,9*:#&1;$\^!<&03F03@/68OJb,9.10D10$Qs0$1D103o,+>86@9*:6Y1O-03;3JbÝJbq#&@0aF6%QFO:0J
6@R0q41F"$,/*-#&1;v#q,/.F0c*:FD103QV031DF03o,>86@9*:6Y1O-03;jÞJF681Ddßà/áVàâF\j¤7#&@j,9.10fn7@R;R,_;90$>03@96Oh".768QF,/0$@9;
(v0["3#&1;R*:D10$@Q1@9*-%d68@9*:OTEd,9.10e¦$rÔãÏ"36;90[ÝAäåÝmæßà9ÞRç\Kª.F03k#&1OTE#&F0M>86@9*:6Y1O:0w*:;cD1031#8,/03DhJ
D10$Qs0$1D103F"30U#&,/.F0w#8,/.10$@f*-;+6;9;R41%0$D\_tu.F0=%'03;R.*:FD10Waeq#@+ß*:;w éèP?Xê7Jë61D,/.768,uq#@
Þ*-;w éèPI_ìL\jtu.F03#60$2N4F*:;9Q16"30$D<&@R*:D
ß ä ßNíuä«ê5îUß æ¥F\-¦?ç
Þ¡ä Þ!ï=äðìîUÞPäªìñ æ¥F\ ç
(+.10$@90[îUßk*:;u,9.10M;RQ76"3*-1<d*-ß)6FDîUÞu,/.10=;9Q768"3*:F<d*:ÞJs6;c;R.1#?(+A*:¤L*:<&4F@90w¥F\ \òf#,90
,/.168,cñeäóî[Þ_,/.1@R#&41<&.1#4F,C\vô68,/0$@Zõ61Döj6@90K41;R03Dq#@á61Dâ*:6`;9*:%'*:O:6@v(_6CE&\_ª.F03
ìLà£ê&àõsàö6@R04F;903D©q#&@#8,/.10$@Q14F@9QV#&;90$;Aæ(+.F*:".º*-;;R#&%0W,/*-%0$;'F03"30$;9;96@REFçWJ+O-#b"36Ou"3#&o,90WaN,
;9.F#&41O:D%6÷0,9.10K%0361*:F<[#&Yo>b*-#&41;$\
tu.10w"3#&o>&0$o,/*:#q#&@u;R41Y1;9"$@9*-QF,f61D;941QV03@R;9"3@R*:QF,*-1D10Wab*-1<`*:;+6;uq#&O-O:#?(+;3Û
ÝmæÞø«õFñVç¡ä ÝmæRùúì'ø©õNû|ñëçXäðÝ7ïCü1ý
ÝLæ|ß[ø¬þîUßsç¾ä ÝmæRù êcøÆþû:î[ßsçXäÿÝNíRü æ¥F\ ¥&ç
ï?ü1ý
Ýmæ|ß[ø¬þî[ßàRÞø«õFñVç¡ä ÝíR ü
ò #8,/*:"$0Z,/.76l,u(+.10341;90$D6O-#&108JFYV#,/.e,/.F0K,9*:%'061D;RQ76"30w*:FD1*:"$03;u6QFQs036@6;+6[;941Y1;R"3@R*:QF,3J
f
Y14F,[(+.F03Æ41;90$D¬,9#&<&0W,/.10$@3Jj,/*-%0*-;[6OT(6CEN;`6;941QV03@R;9"$@9*:Qb,'61D¬*:;U4F;9476O-O-E
031"$O:#&;R03DÅ(+*-,9.
Q76@R03o,/.F03;90$;f,9#'DF*:;R,9*:1<41*:;R.*T,q@9#% 60WabQV#&103o,3\
ÎNÐ&кÙÌvÚbÈcÌPÚÉcÓcÖÑLÒÔÓfÒ3ËmÌXÕÖZÒÔÑLÑ^ÌXÍfÌXÓUÇ^Ì ÓM×=Ë1Éc˧ÒW×uÓ ¥
t
Grid or
Node
Points
n+1
∆x
n
∆t
n-1
x
j-2 j-1 j j+1 j+2
¤L*-<&41@R0¥F\ Û bQ76"$0Wr,/*:%'0<&@R*:D6@R@/61<03%'03o,C\
ãZ03@R*->868,/*T>&0$;68@900WabQ1@R03;9;R03D 68"3"3#@9D1*-1<),9#A,/.1041;R476O+"3#&o>03o,/*-#&1;3\©tu.541;q#&@[Q16@R,9*S6O
D10$@9*->868,9*->03;+*:e;RQ76"30w#&@,9*:%'0c(_0w41;R0=*-5,903@R".761<&036Y1OTE
Ý
Ý
Ý
Ýeä à
Ýeä à
Ýeä à 0$,9"\ æ¥F\ oç
ß
Þ
ß
¤7#&@,/.F0w#@9D1*-76@RE,/*-%0ZDF03@9*T>868,/*T>&0*:e,9.10K;R,/4FDFE#q^]Kã ;u(_0K41;R0
Ý
Ýbä æ¥F\ç
Þ
!,/.F*:;+,/0WaN,;R41Y1;R"3@9*-QF,/;#D103QV03FD103o,>86@9*:6Y1O-03;f6@90=10$>03@41;R03D,/#d0WabQ1@90$;9;KD10$@9*->868,9*->03;3\
tu.541;Ý (+*-O:OhF#,Ys041;R03D,/#`@90$Q1@90$;903o,f,/.10n7@R;R,D103@R*->868,9*->&0#8qLÝ(+*-,/.@90$;9QV03"W,,9#'ß\
tu.10cF#,68,9*:#&[q#&@XD1*Tgh0$@90$1"30c6Q1Q1@R#?ab*-%d68,9*:#&F;^q#&O:O-#I(+;^,9.10;/6%'0fQF.1*:O-#&;9#&QF.5EUY14F,Zæ(+*-,9.
#&10P0Wab"$03QF,9*:#&ëç*-,§*-;§F#,L4F1*:254108\ vE,9.1*:;(v0_%'0C6K,/.76l,m,9.10v;BEN%UYs# O u*-;§4F;903D=,/#@903QF@903;R03o,
6[D1*-gs03@R031"$0M68Q1Q1@9#Cab*:%68,9*:#&d,9#'6`DF03@9*T>868,/*T>&0K;941".,/.76l,CJFq#&@u0aF6%QFO:0J
! à
æ¥F\ &ç
Y14F,u,9.10KQ1@90$"3*-;90K768,941@90'æ61D#&@9D10$@ç_#q§,/.F0K6Q1Q1@R#?ab*-%d68,9*:#&d*:;u1#,+"36@9@R*:0$D*-,/.10K;BEb%MYs#&O
5\U]c,/.F03@Z(_6?EN;w6@R0[41;90$Dk,9#D10$,903@9%'*:F0U*-,9;ZQ1@90$"3*-;90[%'0C61*-1<1\Ktu.10[#&F0[0Wab"30$QF,/*-#&k*:;Z,/.F0
;REN%UYV#&OîeJ1(+.1*-".*-;uD10$n7F03D;R41".,9.768,
ª.10$,9.103@R0=*-;u1#`;941Y1;R"3@R*:QF,f#&îUÞ#&@+îUßJ7,/.10K;RQ76"3*-1<`*:;u41F*-q#&@R%\
Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
iÆD1*-gs03@R031"$06Q1QF@9#Cab*:%68,/*-#&K"C6UYV0P<&0310$@/68,903DU#@m0W>68O:4768,903D=Y5Ew%'0C6F;L#që6;9*-%Q1O-0jtL6CENO:#@
;90$@9*-03;0aFQ161;9*-#&\ ¤ë#@0a168%Q1O-0Ju"$#&1;9*-D103@Ýmæßà9ÞRç[(+*-,/.©Þ[nFab03D\ótu.F03Juq#&O-O:#?(+*:1<k,/.F0
1#,/68,/*-#&A"3#5>03o,/*-#&)<&*->03k*:6j25;3\¥F\T¦U,/#¥F\ ¥FJß
ä ê5îUß6FD)Ýmæ|ßøðõbî[ßsçcä ÝmæTêNîUßø
õFîUßsçXäÿÝNí9ü1ýI7 \ LaFQ161D1*-1<',9.10KOS68,R,/0$@_,/0$@9%µ6YV#&4F,uß<&*->03;
ï
Ý ¦
Ý ¦ ï
Ý
ÝNí9ü1ý+äðÝbíLø æzõFîUßs ç 8 ø æzõFîUßsç 8 ø ;=;=;?ø
< æõFîUßsç 8 ø ;=;=;mæ¥F@\ ?&ç
<
:
ß 9 í
ß 9 í ì >
%
ß ï 9 í
ô#b"36OoD1*Tgh0$@903F"30P6Q1Q1@R#CaF*-%d6l,/*:#1;,/#6+<&*->03wQ76@R,9*S6OD103@R*->868,/*T>&0X"C68=YV0jq#&@9%'03DKq@9#&% O:*:F0C6@
"3#%UY1*:168,/*-#&1;#qmÝNíZ61DÝNí9ü1ýfq#&@õäBA`¦&àA à5;=;=;T\
¤7#&@u0WaF6%'Q1O:08J1"3#1;9*-D103@u,/.F0wtm6CENO:#&@u;R03@9*-03;0WabQ76F;9*:#q#&@uÝNíRü#"Û
ï
Ý ¦
Ý ¦ ï
Ý
ÝNíR#
ü "jäªÝNí^ø æîUßs ç 8 ø æî[ßsç 8 ø ;=;=;Iø
C æîUßsç 8 ø ;=;=;
< æ¥F\@D&ç
ß9 í
ß 9 í ì&>
ß ï 9 í
òf#?( ;941YF,9@/6"W,Ýbíc61DD1*->N*:DF0Y5Eeî[ß,/#'#&YF,/6*:
ÝbíRü#"&$ÝNí
Ý ¦
Ý
äE8 ø æîUßsç8 ø<;=;=; æz¥F\T¦ ç
î[ß
ßF9 í
ß 9 í
tu.541;L,9.100WabQ1@R03;R;9*:#æÝNí9ü#"G$=ÝNí3çIHîUß*-;L6f@90C68;9#&768Y1O:0v6Q1Q1@R#CaF*-%d6l,/*:#wq#&@JLKN
M O 6;LO-#&1<Z68;
K í
îUßA*:;u;R%d68O:O\Xò0WaN,f"3#&1;R*:D10$@,9.10K;9Q768"30wD1*-gs03@R031"$0M6QFQ1@9#Cab*:%68,/*-#&)æÝNíR# ü "%$ÅÝNí P"BçQHFæ îUßsçW\
LabQ761Dð,/.10A,/0$@9%';*: ,/.10k541%'03@968,/#&@6YV#&4F,'ê«61Dð@903<@9#&41Qª,/.F0)@R03;R41O-,e,9#Æq#&@R% ,/.F0
q#&O-O:#?(+*:1<M03254768,9*:#&
ÝNí9ü#"R$ÝNíP"
Ý ¦
T Ý ¦
VÝ
$S8 ä î[ß 8 ø îUßU8 æz¥F\T¦&¦Iç
îUß
ß 9 í
ß T 9 í ¦ 8
ß V 9 í&WNWNW
ª.10$0WabQ1@R03;R;903DA*-e,/.1*-;%61F03@3J7*T,+*:;+"3O-0C6@,9.768,+,/.F0=D1*-;9"$@90$,90,/03@R%;+#&,/.F0=O-0$q|,+;9*-D10K#q
,/.F0f0$2N4168,/*-#&@R03Q1@R03;R03o,u6n7@9;B,PD103@R*->868,/*T>&0u(+*-,9.d6K"30$@R,/6*:6%'#&41o,X#q0$@9@R#&@j(+.1*:".d6Q1QV0C6@R;
#&¬,/.10@R*:<&.o,[;R*:D10#q,/.100$2N416O+;9*:<\Å£,'*:;`6O-;9#k"3O-0C6@U,9.768,[,/.F00$@9@R#&@`D103QV031DF;#&¬,/.F0
<&@R*:DH;RQ76"$*:1<,9#6"$03@B,6*-H#&@RD103@$\tu.100$@9@R#&@w,903@R%¾"$#&o,6*-1*:1<,/.F0d<&@R*:DH;RQ76"$*:1<,9#,/.F0
O:#?(v03;B,jQs#?(v03@j<&*T>&0$;L,/.10u#@9D10$@L#që,/.F0%0W,/.1#ND\L¤ë@R#&X % j2V\&¥F\-¦ J8(v0u;90$0,/.768,m,/.10u0abQ1@90$;9;9*-#&
æÝNíR#ü "!$'Ýbí$Qç H8î[ß*:;X6cn1@9;R,Br!#&@RD103@X68Q1Q1@9#Cab*:%68,9*:#&M,9Y# JZKN M í O \^b*:%'*:O:6@9OTE&[J j2ë\5¥F\-¦¦u;9.1#?(+;j,/.76l,
K
æÝNíR#ü "$kÝN)í P"ÔQç H1æ îUßsçv*:;_6M;90$"3#&1DNr!#&@RD103@+6QFQ1@9#Cab*:%68,/*-#&,9#[6Mn7@R;R,uD10$@9*T>6l,/*->0\^tu.F0OS68,R,/03@
*:;X@R0$q03@R@90$D,/#=6;X,/.10+,/.F@9030r!QV#&*:o,X"$03o,/0$@903DeDF*-gs03@90$1"30f6Q1QF@9#Cab*:%68,/*-#&Jo6FD#&F0f#q|,903';90$03;
,/.F0w;R41%'%d6@BE@R03;94FO-,+Q1@R03;90$o,/03D*:e,/.10q#&@R%
Ý ÝbíRü#"R$ÅÝNí)P"
8 ä ø]\dæzîUß ç æz¥F\T¦ ç
ß 9 í îUß
ÎNÐ ÎNЫÑmÒÔÓfÒ3ËmÌXÕÖZÒÔÑ^ÑLÌPÍÌXÓUÇ^Ì ×uÊXÌXÍÉcË_×uÍfÚ
Ý ¦
8 ä æÝNíRü#"%$HÝbíP"Bçø~\æzîUß ç æz¥F\T¦?¥oç
ß 9 í î ß
U
Ý ¦
8 ä æÝbíRü#"&$ ÝNí^ø¬ÝbíP"Bçø~\æzîUß ç æz¥F\T¦C5ç
ß 9 í î ß
U
tu.10$;906@R0f,9.10cY768;9*:;Xq#&@j7ly|7xXy Z}W/}Wh}7}WRxÔl/X;R*:1"$0f,/.F0$E'<&*->0Z6d6Q1Q1@R#CaF*-%d6l,/*:#`,9#
6=DF03@9*T>868,/*T>&0f68,_#10cD1*-;9"$@90$,90cQV#&*:o,v*:6=%'03;R.*:',/03@R%;P#q;R41@9@R#&411DF*:1<=Qs#&*-o,/;3 \ #?(_0W>&03@$J
10$*-,/.F03@w#q_,9.103;R0d0WabQ1@R03;R;9*:#1;=,903O:Oj4F;=.1#?( #8,/.10$@=QV#&*:o,9;w*-),9.10'%0$;9.68@90'D1*-gs03@R031"$03DH#@
.1#?( YV#&411D768@RE"3#1D1*-,9*:#&F;c6@R0=0$Fq#&@R"303Dh\cN41".A6D1DF*-,/*-#&76O*-Fq#&@R%d68,9*:#&e@R032541*-@903;c6%'#&@90
;9#Q1.1*:;B,/*-"C68,903Deq#&@9%M41OS68,9*:#&h\
`ab`ao |%jrgo
lBgn{pRrpRiutvpxwmypRr|%je7r}
_#&1;R*:D10$@u,/.10K@90$OS68,9*:#&
¦
æ Ýsçzíä æÝNí9ü#"&$ ÝbíLøÆÝNí)P"Bç æz¥F\T¦G&ç
î ß
U
(+.1*-".e*:;u6MQV#&*-5,_D1*-gs03@R031"$06Q1QF@9#Cab*:%68,/*-#&,9#[6U;90$"3#&1DD10$@9*T>6l,/*->0\jò#?(ÿO-0$,_41;uD103@R*->06
{'xWy w#&QV03@/6l,/#&@+@90$Q1@90$;90$5,/68,/*-#&q#@+,9.10K;/6%'0=6Q1Q1@R#?ab*-%d68,9*:#&h\P_#&1;9*-D103@+,/.F0wq#&4F@QV#&*-5,
%'03;9.(+*T,/.YV#&41FD76@REQV#&*:o,/;Z68 , 61D6K;9.1#?(+kYV03O:#?(K\ò#,/*-"30M,9.768,f(+.103A(v0[;9QV0C6÷#q
,9.10=541%MYs0$@#8q^QV#&*:o,/;+*-6`%0$;9 . FJë(v0w%036,9.10wN4F%UYs0$@f#8qy|7x!}WWyl_Qs#&*-o,/;+0Wab"3O-41D1*-1<
,/.F0wYV#&41FD76@9*-03;$\
¦ ¥
ßeä $ $ $ $
ê[ä ¦ ; ;
¤ë#41@uQs#*:o,u%'03;9.h\vîUßäRH1æ øª¦Iç
ov@@¡ =£¢¤@¥¦%§¨G©Iª£«¦¬[ =I¢@¥§@¥¦«.®ZI¢¤)§«¦¢©¨G«¦¢§@¯¦°
Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
6@R@9*->0K68,+,/.10q#&4F@u03254768,9*:#&1;$Û
¦
æ Ýsç " ä æÝk$ Ýv"ø¬Ý
î ß
U ç
¦
æ Ýsç ä æÝ"&$ Ý
î ß
U øÆÝ T ç
¦
æ Ýsç
T
ä
î ß
U
æÝ
$ Ý
T øÆÝ U ç
¦
æ Ýsç
U
ä
î ß
U
æÝ
T $ Ý
U
øÆÝ!ç æz¥F\T¦?oç
@9*-,9*:1<U,9.103;R0K03254768,9*:#&1;+*-,9.10K%#@90;94F<&<&03;B,/*T>&0Kq#&@9%
æ Ýhç " ä æµÝ $ Ý" øZÝ çIHîUß
æ Ýhç ä æ Ý"±$ Ý øÝ T çIHîUß
æz¥F\T¦G'&ç
æ Ýhç ä æ Ý $ Ý T øZÝ çIHîUß
T U
æ Ýhç ä æ Ý T $ Ý øZÝ çIHîUß
U U
*-,w*-;w"$O:036@,/.768,K(v0d"36H0aFQF@903;R;M,/.F03% *:
6>03"W,/#&@Ôr!%68,/@R*TaAq#&@R%J§6FD)q41@B,/.10$@3J§,/.768,w,/.F0
@90$;941OT,/*-1<`%d68,9@9* a.768;f6U>03@RE;RQs0$"3*:6Oq#&@9%\^!o,/@R#bDF41"3*-1<
Ý" ¶¸· Ý ¸¶ ·
·· ·
Ý ¦ ·
² ä
Ý ³´´ à J ¦² º O ä ´³ æz¥F\T¦=?oç
µ´ Ý T ¹ îUß ´´µ
¹
Ý Ý
U
61D
$ ¦ ¶ ··
¦ ¦ $ ¦ ·
» ä ´³ æz¥F\T¦=Doç
î ß ´µ´
U ¦ $ ¦
¹
¦ $
(v0="36@90$(+@R*-,90j2ë\V¥F\T¦G'U6;
Ýe ² ø¼J )² º O
² ä »,Ý[ æz¥F\ ç
t .1*:;0aF6%QFO:0U*-O:O:4F;R,/@968,/0$;c6%68,9@9*TaD1*Tgh0$@90$1"30[#&QV03@968,/#@3\½X6".
O-*:10=#qv6%d6l,/@9* aD1*-qSr
u
q03@R031"$0Z#&QV03@968,/#&@X*-;vY768;903Dd#&e6=QV#&*-5,PD1*Tgh0$@90$1"30f#&Qs0$@/68,9#&@3JNY14F,P,/.F0cQV#&*:o,v#&Qs0$@/68,9#&@9;P41;R03D
q@9#% O:*-10,/#KO-*:10+6@R0u1#,P10$"303;R;/6@R*:OTEU,/.10+;96%08\j¤7#&@j0WaF6%'Q1O-0JoYV#&411D768@RE["$#&1D1*T,/*:#1;j%d6CE
D1*-"$,6l,/0Z,/.168,,/.F0wO-*:10$;u68,u#@u10C6@,9.10KYs#8,9,/#% #&@,9#&Q#q,/.10K%68,/@R*TaYV0%#ND1*-n103D\^!,/.F0
0WaN,9@903%'0M"36;90=#qL,9.10M%68,9@9*TaD1*-gs03@R031"$0M#&QV03@968,/#@@R03Q1@R03;R03o,/*-1<e6;RQs0$"$,9@/6O§%0W,/.1#NDJ71#10
#qX,/.F0[O:*:F03;Z*-;c,/.10[;96%'0\wtu.10`%d68,9@9* a#Qs0$@/68,9#&@9;Z@R03Q1@R03;R03o,/*-1<,9.10U,/.F@9030r!QV#&*:o,"$03o,/@96OTr
D1*Tgh0$@903F"306Q1Q1@R#?ab*-%d68,9*:#&F;Zq#&@w6n7@R;R,M61DH;R03"$#&1DD10$@9*T>6l,/*->0[(+*-,/.
ãZ*:@R*:".1O-0$,KYV#&411D16@RE
"3#1D1*-,9*:#&F;u#&6[q#41@Br£Qs#&*-o,u%0$;9.6@90
ÎNÐ ÎNЫÑmÒÔÓfÒ3ËmÌXÕÖZÒÔÑ^ÑLÌPÍÌXÓUÇ^Ì ×uÊXÌXÍÉcË_×uÍfÚ '
¦ ¶ ·· $ ¦ ¶ ··
¦ $ ¦
w ¦ · ¦ ¦ $ ¦ ·
ä ³´´ à ä ´³ æz¥F\ ¦Iç
î ß
U ´µ $ ¦
w ¦ î ß ´µ´
U ¦ $ ¦
¹ ¹
$ ¦
w ¦ $
ic;6Åq41@R,9.103@0WaF6%'Q1O:08Jc@R03Q1O:6"30k,/.10kq#&41@B,/.ðO:*-10A*:<j2ë\f¥b\-¦?¬YoE ,/.10kq#&O-O:#?(+*:1<ÅQV#&*-5,
#&QV03@968,/#&@q#@+6'ò0341%61YV#&411D768@REe"$#&1D1*T,/*:#)æb0$0MN03"$,9*:#&¥F\ F\ çWÛ
¦
Ý ¦
æ Ýsç ä 8 $ æ Ý $HÝ ç æz¥F\ & ç
U î ß
ß 9
¥ U î ß U
¥ [ T
(+.10$@90K,/.10KYV#&411D768@REe"$#&1D1*T,/*:#e*:;
Ý
Ý
8 ä 8 æz¥F\ ¥oç
ßh9 ¦¾¿
ß9
tu.10$º,/.10%d68,9@9* aÆ#&Qs0$@/68,9#&@`q#&@d6),/.1@R030Wr£Qs#*:o,d"$03o,/@96OTr£D1*-gs03@R031"$*:1<
;9".10$%068,d*-o,/03@R*:#&@
QV#&*:o,/;'6FDók?}lV~9lRN}WWoV/. &y|{'xylAq#&@'6)ò0341%61Æ"3#1D1*-,9*:#&¬#&¬,/.F0@R*:<&.o,`*-;
<&*T>&03YoE
$ ¦ ¶¸··
¦ ¦ $ ¦ ·
ä ´³ æz¥F\ 5ç
î ß ´µ´
[ ¦ $ ¦
¹
H¥ $ H¥
X6".H#qP,/.F03;90'%68,/@R*TaADF*-gs03@90$1"30`#&QV03@968,/#@9;K*:;K6e;9254768@90'%d68,9@9* a(+*-,9.k03O:0$%0$o,/;,/.76l,
6@R06O-O$03@R#&;0Wab"$03QF,q#@,/.F#&;90A68O:#&1<)Y76FD1;d(+.1*-".ª6@90"3O:4F;R,/0$@90$Dª6@9#&4F1D«,/.F0"30$o,/@/68O
D1*:6<&#&768O\m
0K"C6O-O;94F".6[%d6l,/@9* ae6ÀVN}9'{'xyM6FD*-o,/@9#ND141"$0,/.10K1#,/68,/*-#&
º ¶¸·· ¦
··
³´´ ĺ
··
Áeæ¤ ÛÂëàÃIàú3çjä ´´ · æz¥F\ &ç
´´ \\ \\
\ º \
´µ
¹
( .10$@9041;R0Z#q& *:,/.10c6@9<&4F%0$5,_*:;v#&QF,/*-#&76OV6FD,/.10f*:O:O-41;R,9@/68,9*:#&`*-;_<&*T>&03q#@_6M;R*:%'Q1O:0
+
xWyy?
NlV W%68,/@R*TaK68O-,/.F#&41<&.=6oEK541%UYV03@§#q1Y7681D1;§*:;§6fQV#&;9;R*:Y1*-O:*T,!E&\iÅ,/@R*:D1*:6<&#&768O%68,/@R*Ta
(+*-,9.1#&4F,"3#&1;B,6o,9;f68O:#&1<=,/.10ZY161D1;+"C68eYs00aFQF@903;R;90$D6 ; Áæ ë² à ?² à º3² ç\jtu.10K6@R<&41%'03o,/;_q#@
6dY7681D103DA%68,9@9*Ta6@90[68O-(_6?EN;f#bD1D*:541%UYV03@c61D,9.10U"$03o,/@96OL#&F0e éèP?@90$q0$@9;c,9#d,/.F0
"30$o,/@/68OD1*S6<#&76Oz\
? Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
H0K"36F#I( ² 68;
<&03F03@/68O:*:$0#&41@+Q1@R0$>N*:#&4F;0aF6%QFO:03;$\XãZ0$n7F*:1< Ý
Ý" ¶ ··
Ý · ··
³´´
² ä
Ý ´´ Ý T ·· æz¥F\ oç
´´ \\\
´µ ¹
Ý Å
² YoE
(v0="366Q1Q1@R#?ab*-%d68,90Z,/.10K;R03"3#1DD10$@9*T>6l,/*->0#q Ý
² ä ¦ ² ø¼J ) ² º O
Ýe ÁeæÔ¦&àN$ àC¦Iç ÝM æz¥F\ '&ç
î ß
U
¦
J ) ² º O ä ùúÝIà à5;=;=;$à à/ÝûÆ æz¥F\ ?oç
î ß
U
£q^(v0MQ1@R03;R"3@9*-Ys0Mòf0$41%d681YV#&411D16@RE"3#1D1*-,9*:#&F;#,/.F0=@R*:<&.o,f;9*:DF0JV6;c*-fj25;3\s¥F\ 681D
¥F\ & JF(v0Kn71D
¦
Ý ² ä Áeæ 7² à l² 3à ¦Iç ÝM ø J )² º O
² Ç æz¥F\ Doç
î ß
U
(+.10$@90
² ä ù ¦&à3¦&àN;=;=;Wà H¥8û Æ
² ä ù$ àN$ àN$ àN;=;=;$àN$ H¥8û Æ
¦ îUß
Ý Æ
J ¦ ² º O ä ÝIà à àN;=;=;à 8
î ß ÉÈ
[ ¥
ß 9 Ê
*:F"30v(v0_%6÷80v"$#&1;9*-D103@96Y1O-0v41;R0#qFYs#,9.M%68,/@R*Taw681DUQV#&*:o,§#&QV03@/6l,/#&@R;3J*T,§*:;§*:%'Qs#&@B,6o,
b
,/#'03;B,6YFO:*:;R.6'@R03OS6l,/*:#eYs0W,!(_0$03,9.103%\vi QV#&*:o,#&QV03@968,/#&@u*-;+<&0310$@/6O-O-E(+@9*-,R,/0$q#&@u;R#&%'0
D10$@9*->868,9*->0c68,v,/.10f@90Wq03@90$1"30QV#&*-5,LêU*:,/03@R%;P#q10$*:<&.5YV#&@9*-1<K>68O:410$;_#q,9.10cq41F"$,/*-#&\j¤7#&@
0WaF6%'Q1O-0
æ Ýhçíuä× ÝNí)P
ø~"BÝbíP"hø]ÝNíjø]ºN"BÝNí9ü#" æz¥F\ ¥ ç
%'*:<&.o,XYV0+,9.10Qs#&*-o,v#Qs0$@/68,9#&@^q#&@P6Kn1@9;R,vD10$@9*->868,9*->0\Ltu.F0c"3#@9@90$;9QV#&1D1*-1<w%d68,9@9* a[#&QV03@968,/#&@
.76;q#@u*-,/;6@9<&4F%0$5,9;u,/.10"$#b0W¨"$*:0$5,9;+<&*->N*:F<U,/.10Z(v03*-<&.o,/;u,/#[,/.F0Z>68O:410$;u#qm,9.10Zq411"W,/*-#&
68,w,/.10'>86@9*-#&41;wO:#N"C68,9*:#&1;$\ei êr£;9.1*Tq|,M*-),9.10dQV#&*:o,=#&QV03@/6l,/#&@w"3#&@R@90$;9QV#&1D1;M,9#6D1*S6<#&76O
;9.F*-q|,+*:e,9.10K%d68,9@9* a#&QV03@968,/#@3\jtu.541;+,/.10K%68,/@R*Tad032541*->86O-03o,+#%
q j2V\V¥F\ ¥ *:;
#Ý
² äBÁeæ à "Wà?àº="à ç Ý ² æz¥F\ ¥F¦Iç
ò #8,/0d,9.10e6D1DF*-,/*-#&H#8qc6303@R#A*:H,9.10n1q|,9.Å03O:0$%0$o,M(+.1*-".Æ%6÷803;U*T,U"3O-0C6@w,/.76l,Ó'*-;M,/.F0
f
"3#N0$¨'"$*:03o,#qmÝNíI\
tu.10%d68,9@9* aU,/.168,X@90$Q1@90$;903o,9;D1*-gs03@R031"$*:1<K;R".103%'03;Pq#&@j;9"36OS6@X0$2N4168,/*-#&1;X#&6wQV03@R*:#ND1*:"
% 03;9.w*:;@R0$q03@R@90$D=,/#f6;§67}WWy3yh%68,/@R*Tas\i¬,!ENQ1*-"C6O5QV03@R*:#ND1*:"L,9@9*-D1*S6<#&76O8%d68,9@9* a#&QV03@968,/#&@
'
(+*-,9.1#&5411*Tq#&@9% 03o,/@R*:03;*:;u<*->&0$eq#&@+6Ir!QV#&*:o,u%'03;R.YoE
5 " º !Ý ¸¶ ··
"Þ ºT ··
´³´ ··
T º
ÁkÜoæz`Û V² à I² à º3² çjä ´´ U ·· æz¥F\ ¥ ç
´´ T ºV
U
´µ´ V º)Ý
U ¹
ºN" V Ý
¥ Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
8 2
7 3
6 4
5
¤m*:<&41@R0K¥F\ ¥FÛ j*:<&.o,+QV#&*:o,/;u#6["3*-@9"$41OS6@_%0$;9.\
º ¸¶ ·· ¦
··
³´´ º
··
ÁkÜNæ ÛÂ7à?àº$çXä ´´ \\ æz¥F\ ¥5ç
\ ·
´´ \\
º \
´µ
º ¹
ª.103,/.10f;R,681D76@RD,/.F@9030r!QV#&*:o,P"30$o,/@/68OTr!DF*-gs03@90$1"3*-1<=6Q1Q1@R#?ab*-%d68,9*:#&F;^q#&@_6n7@R;R,u681D
ÎNÐçNÐóÇu×uÓcÚËmÍÏè_Ç˧ÒÔÓ{é ÖZÒÔÑ^Ñ^ÌXÍfÌXÓMÇLÒÔÓqé ÚÇ^ÈfÌvÙÌvÚ
×uѬÉcÓëê ×uÍfÖÌXÍ ¥F¦
9; 0$"3#&FDD10$@9*T>6l,/*->0J&;R030:j2ë\o¥F\ ¦&Jo6@R0u41;90$D[(+*-,/.[QV03@R*:#ND1*:"vYs#411D76@BEU"$#&1D1*T,/*:#1;3J,9.10$E=,6÷80
,/.F0Kq#@9%
¦ $=¦ ¸¶ ··
¦ $ ¦
w ¦ · ¦
æ ç Ü ä ³´´ ä ÁkÜNæ£$w¦&à à3¦Iç
î ß
U ´µ $ ¦
w ¦ î ß
U
¹
¦ $w¦
61D
$ ¦ ¦ ¶¸·
··
¦ ¦ $ ¦ ¦
æ ç Ü ä ³´ ä ÁkÜNæB¦&à5$ à3¦Iç æz¥F\ ¥!&ç
î ß ´µ´
U ¦ $ ¦ î ß
U
¹
¦ ¦ $
O:036@9OTE&Jh,9.103;R0`;9QV03"3*:6OL"36;90$;K#qPQs0$@9*:#ND1*-"M#&QV03@968,/#&@R;K6@90U6O:;R#e"3*:@R"341O:6o,#&QV03@968,/#&@R;3\=ô68,/0$@
_
#&(v0e,6÷806DF>86o,6<0#q+,/.1*-;U;9QV03"$*S6OvQ1@9#Qs0$@R,!E&\
òf#8,/*:"$0d,/.168,U,/.F03@9068@901#kYV#&411D16@RE
"3#1D1*-,9*:#&>03"W,/#&@R;f;R*:1"$0K,9.1*:;u*-Fq#&@R%d68,9*:#&d*:;+6O-Oh*:o,903@9*-#&@,/#[,9.10K%d68,9@9*-"303;,9.103%';90$O->03;3\
`aßõaIc öË|v÷õã£e7rCöË|øãps}
tu.10etm6CEbO-#&@U;R03@9*-03;[0aFQ161;9*-#&¬#q+q411"W,/*:#1;`6YV#&4F,`6nFab0$DÆQV#&*-5,UQ1@9#?>N*:D10$;`6%0361;Mq#@
"3#1;R,9@941"W,/*:F<¬n11*-,90Wr!DF*-gs03@90$1"30Qs#&*-o,Rr!#Qs0$@/68,9#&@9;#q=6oE #&@9DF03@3\i ;9*-%QFO:0681Dª;R,/@96*:<.5,
q#&@B(6@RD(_6CE',9#="36@9@BE[,/.1*-;v#4F,P*:;X,/#w"3#&1;B,/@R41"$,6 tm6CENO:#&@X,6YFO:0¸J K(+.1*:".%6÷803;P0WaN,/0$1;9*T>&0
41;R0#qZ,9.100aFQ161;9*-#&º<&*T>&0$ºYoz E j2ë\¥b@\ ?F\ªif;6º0aF6%QFO:0J_"3#&1;R*:D10$@dtm6Y1O-0¥F\T¦(+.F*:".
@90$Q1@90$;90$5,9;6Htm6?ENO-#&@,/6Y1O:0q#&@6 6QFQ1@9#Cab*:%68,/*-#&Æ#qK6H;R03"3#1D D103@R*->868,9*->&041;9*-1<
,9.1@90$0
>86O:4F03;#qM,9.10)q4F1"$,9*:#&ÿ"303o,903@90$D 6YV#&4F,,/.10)QV#&*:o,68,(+.1*:".ð,/.10)D103@R*->868,9*->&0)*:;e,9#«YV0
0$>86O-4768,903D\
¥ Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
Ý ¦
8 ø æ5ÝNíP"hø]ÝNíjø]ºÝNí9ü#"BçXä×ù
ß 9 í î ß
U
îUß; îUß ; îUß T ; îUß U ;
ÝNí JLKNM O í JLK¦ú¤M O í JLK)û¤M O í JZK)üb M O í
K K ú K û K ü
î[ß ; J K¦ú¤M O í ¦
K ú
" " " "
{;3ÝbíP" {;5æ|r/¦Içh; " ;NæSr¦Iç ; ½;Næ|r9¦Iç T ; Ý ;Næ|r9¦Iç U ;
k;?ÝNí U
" " " "
ºk?; ÝNíRü#" º ºh;NæB¦Içh; " ºkN; æB¦Iç ; ºk;oæB¦Iç T ; Ý ºÉ;5æB¦Iç U ;
U
tm6Y1O-0¥F\T¦&\¬tL6CENO:#&@U,/6Y1O-0q#&@["30$5,903@R03Dº¥Ir!QV#&*:o,`ô6<&@961<&*:6¬6Q1QF@9#Cab*:%68,/*-#&H,/#
6A;90$"3#&1D
DF03@9*T>868,/*T>&0\
t .10,6Y1O-0e*:;["$#&1;R,9@941"W,/0$Dº;9#k,/.76l,;R#&%'0e#qf,9.106O:<&0$Y1@/6*-;`;9*:%'Q1O-*-n70$D\i,`,/.10e,9#&Q
u
#qP,/.10[,/6Y1O:0=(_0';90$068
0aFQF@903;R;9*-#&)(+*T,/.)6e254103;B,/*:#
%6@9֑\[tu.1*-;@90$Q1@90$;903o,9;M#&10`#qP,/.F0
254103;B,/*-#&1;j,/.76l,P6Z;R,/4FDFE`#që,/.1*-;^,6YFO:0"36'61;R(v03@$F768%0$O-E&J8(+.768,X*:;^,9.10uO:#N"C68OF03@R@9#&@j"3641;R03D
YoE`,/.1041;90f#qh,9.1*:;P6QFQ1@9#Cab*:%68,/*-#&ùeòf#8,/*:"$0,9.768,v6O-O7#qh,9.10f,903@9%';X*:`,/.10f03254768,9*:#&6Q1QV0C68@
*:6"$#&O:41%'68,f,9.10MO-0$q|,#q^,9.10=,/6Y1O-0æ6O-,9.1#&41<&.hJ7*:,9.1*:;"C68;90JhîUß .76;fYs0$03%U4FO-,/*-Q1O:*-03D
*:o,9#
036".«,/0$@9% (+.1*-".«;R*:%'Q1O:*Tq03;U,/.F0,903@9%';`,/#)Ys0Q14F,*:o,/#k,/.F0,/6Y1O:08\ ç\«tu.10$º1#,9*:"$0
,/.168,+68,u,9.10.10C68D#8qm036"."3#&O-41%,9.103@R0K6Q1QV0C6@R;,/.10"$#&%'%#&q6"$,9#&@,/.76l,u#b"$"341@R;+*:,/.F0
0WabQ7681;9*-#qL036".,903@9% 6Ys#4F,u,/.10KQV#&*:o,Pê7JF,9.768,+*:;$J
ý
ý Ý
îUß ;8 õä àC¦&à àN;=;=;
ß ý 9 í
t .10+"3#O:41%'1;^,/#,9.10+@9*:<.5,^#qs,9.10+O:0Wq|,/%'#&;R,j#10J5411DF03@j,/.10+.1036D1*-1<&;3Jo%6÷804FQ',9.10utL6CENO:#@
u
,68Y1O:08\X6".`03o,/@BE[*:;m,/.10u"$#b0W¨"$*:0$5,X#8qV,9.10,/0$@9% 68,^,/.F0,/#&Q[#që,9.10u"3#&@R@90$;9QV#&1D1*-1<"3#&O-41%'
*:,/.10Utm6CENO:#&@Z;R03@R*:03;c0WabQ761;R*:#&A#8qP,9.10M,903@9% ,/#,9.10UO-0$q|,Z#8qj,/.10U"$#&@9@R03;RQs#&FD1*:1<e@R#?(K\=¤7#&@
0WaF6%'Q1O-0J&,/.F0uOS6;B,j@9#?(©*:U,/.F0,6Y1O-0"3#@9@90$;9QV#&1D1;X,/#Z,9.10utm6?ENO-#&@j;90$@9*:0$;j0WabQ76F;9*:#'#8
q ºÝNí9#
ü "Û
Ý ¦ ¦
Ý
ºÝbíRü#" ä ºWÝNíLø]ºk;NæÔ¦Içh; ø~ºk;NæB¦?ç ; îUß ;R8
îUß;R8
¦
ßF9 í
ß 9 í
¦
TÝ
¦
UÝ
øºk;NæB¦Iç T ; U î ß T ; 8 ; æB¦Iç U ;
ø]ºÉo îUß U ; 8 ø ;=;=;«æz¥F\ ¥&oç
<
ß T 9 í
ß U 9 í
i tm6?ENO-#&@c,68Y1O:0U*-;Z;9*-%QFO-E6"3#&o>031*-03o,K(6CEA#qXq#&@R%*-1<dO-*:1036@c"$#&%UY1*-768,9*:#&1;f#qPtL6CENO:#@
;90$@9*-03;+#&6[,903@R% YoEe,/03@R% Y76;R*:;$\
ÎNÐçNÐóÇu×uÓcÚËmÍÏè_Ç˧ÒÔÓ{é ÖZÒÔÑ^Ñ^ÌXÍfÌXÓMÇLÒÔÓqé ÚÇ^ÈfÌvÙÌvÚ
×uѬÉcÓëê ×uÍfÖÌXÍ ¥&¥
#&1;R*:D10$@w,9.10`;941% #8q0C68".
#qv,/.10$;90'"3#&O-41%'1;3\[t§#%6lab*:%'*:$0=,9.10#@9D10$@#qu6"$"341@96"$E
_
#qm,/.10w%0W,/.1#NDJ7(v0MQ1@R#b"$0303Dq@9#&%µO-0$q|,+,/#'@9*-<&.o,f61Dq#@9"308JëY5E,9.10=QF@9#&QV03@".1#&*-"30w#qj6FJëYJ
61D)"J,9.103;R0;R41%;K,/#YV0`303@R#1\]Z10"36)0C6;R*:O-E;9.1#?(Ï,9.768,,9.10`;941%';K#q_,9.10[n7@9;B,w,9.1@90$0
"3#O:41%'1;+6@R0303@R#*Tqm(v0K;/68,9*:;Bq|E,/.10K0$2N4168,/*-#&
¶· ¦ ¦ ¦ ¶· ¶·
³´µ $w¦ ¦ ¹ ´µ³ ¹ ä ³´µ
¹
¦ ¦ º $
tu.10w;9#&O-4F,/*-#&e*:;u<*->&0$Y5E
ùý7à?àºûsäX$Mù ¦&à5$ à3¦3û\
tu.10w"3#&O-41%F;,/.768,+DF#1#8,+;941%,9#$03@R#"$#&1;R,9*-,94F,/0Z,9.10K03@9@R#&@3\
0=D10$;9*-<&768,90K,9.10Kn7@9;B,c1#5>86F*:;9.F*:1<';941% ,9#dYV0½þNÿ
JV61D@90$q0$@,9#
*-,68;,/.10Ktm6?ENO-#&@+;903@R*:0$;0$@9@R#&@3\
!©,9.1*:;'"C68;90ðþNÿ
#N"3"34F@9;6l,',9.10nFq|,/.«"$#&O:4F%Æ*:¬,/.10,68Y1O:0
æq#@',9.1*:;`0WaF6%'Q1O-068O:Ou0$>03
"3#O:41%'1;(+*:O-Os>861*-;9.YoE;REN%'%0W,/@REFçu61D#&F0Kn11D1;
¦ º
UÝ î[ß
U Ý
þNÿ
ä ø îUß U#8 ä 8 æz¥F\ ¥!'&ç
î ß
U
ß U 9 í ¦
ß U 9 í
òf#8,/0K,/.768,+,9.10UîUß .16;cYV030$D1*T>b*-D103D,/.F@9#&41<.,/#%d68÷0,/.10=03@R@9#&@u,/0$@9%µ"$#&1;9*-;R,903o,C\u
0
.76C>&0ÛR41;R,uDF03@9*T>&0$D,/.10q6%*-O:*:6@j¥lr£Qs#&*-o,_"$03o,/@96OhD1*Tgh0$@90$1"3*-1<MQV#&*:o,_#&Qs0$@/68,9#&@Xq#&@6M;R03"$#&1D
D10$@9*->868,9*->0
Ý ¦
8 $ æÝbí P"R$ ÝNí^ø¬ÝbíR# ä \dæzîUß ç
ü "BçX× æz¥F\
¥ ?oç
ß 9 í îUß
t .10tm6?ENO-#&@_,68Y1O:0q#&@u6U¥lr£Qs#*:o,Y768"÷5(_6@RDbr!D1*Tgh0$@90$1"3*-1<[#&QV03@/6l,/#&@@R03Q1@R03;R03o,/*-1<'6=n7@9;B,
u
D10$@9*->868,9*->0*:;u;9.F#I(+*:tm6Y1O:0K¥b\ \
Ý ¦
8 ø æ ÝNí)P ø]"BÝNí)P"hø~Ýbí$çXäBù
ß 9 í î ß
U
î[ß; îUß ; îUß T ; îUß U ;
ÝNí J NK M O í J ¦K ú¤ M O í J )K ûb M O í J )K üb M O í
K K ú K û K ü
îUßf; J KN M O í ¦
K
" " " "
;?ÝNíP ;5æSr ç7; " ;Næ|r ç ; ;NæSr ç T ; Ý ;Næ|r ç U ;
" " " "
"%;?ÝNíP" "
";5æSr¦Iç7; " "&;Næ|r¦?ç ; ";NæSr/¦Iç T ; Ý "%;Næ|r9¦Iç U ; U
U
k?; ÝNí
tu.1*-;+,9*:%'0c,/.F0Kn1@9;R,+,9.1@90$0w"$#&O:4F%1;u;R41% ,/#`$03@9#'*-q
¦ ¦ ¦ ¶· ¶· ¶·
³´µ ¦ " ä ´µ³ ¦ ¹
¦
¹ ´µ³ ¹
"
(+.1*-".«<&*T>&03;ù¸ àÃ"WàÃûKä $ ù ¦&à5$f1à/¥8û\«!©,/.F*:;'"C6;R0,9.10q#&4F@R,/.Æ"3#O:41%'©QF@9#?>N*:D10$;,/.F0
O:036D1*-1<U,/@R411"C6l,/*:#0$@9@R#&@,/0$@9%Û
¦ ? "
T Ý îUß
T Ý
þNÿ
ä $ $ î[ß T 8 ä 8 æz¥F\ ¥Doç
î ß
U
ß T 9 í ¥
ß T 9 í
tu.541;`(_0.76C>&0D10$@9*->03D©6);R03"$#&1Dbr£#&@9D10$@`Y76"÷o(68@9D«DF*-gs03@90$1"306QFQ1@9#Cab*:%68,/*-#&#qc6n7@9;B,
D10$@9*->868,9*->0Û
Ý ¦
8 $ æÝNí)P $Å&ÝNíP"hø©¥ÝNíWçjäB\æîUß ç æz¥F\ ç
ß 9 í î ß
U
`aßõao ×p&iupsr|ã£gv|%jgekiæe,lBgn{pRrpRiutvp
ue7rÇâã|}
!)<&0310$@/6OzJ6eD1*-gs03@R031"$0d6QFQ1@9#Cab*:%68,/*-#&,9#,9.10`þ,/.)D103@R*->868,9*->&0`6l,K<&@9*-D)QV#&*-5,uê"C6)YV0
"C68;R,*:e,/0$@9%';u#
q +ø Uøð¦K10$*:<&.5YV#&@9*-1<[Qs#*:o,/;+6;
Ý
8 ø ÝNíRü äBþNÿ
æz¥F\ 1¦Iç
ß 9 í
¾ P[Ü
(+.10$@90d,9.10 6@R0d"$#b0W¨"$*:0$5,9;M,/#Ys0D10$,903@9%'*:F03DH,9.1@9#&4F<&.H,/.F041;90d#qutm6?ENO-#&@Mtm6Y1O-03;=,9#
Q1@R#bD14F"30e6QFQ1@9#Cab*:%68,/*-#&1;K#q6<*->&0$Å#&@9DF03@3\_O:036@9OTE),9.1*:;=Q1@9#N"30$;9;U"36ÅYV0d41;R03DÅ,/#n71D
q#&@B(6@RDJ5Y76"÷o(_6@9DJN;9÷80$(v03DJF#&@j"30$5,9@/6OëQV#&*:o,j#Qs0$@/68,9#&@9;X#qh6oE[#&@RD103@jq#&@X6oE[DF03@9*T>868,/*T>&0\
£,m"3#&41O-DMYV0_"$#&%QF4F,/0$@L64b,/#&%68,/0$DM681DM0ab,9031DF03D[,/#f.1*:<&.F03@D1*:%'03F;9*:#1;3 \ #&@R0_*:%'QV#&@R,/6o,CJ
.1#?(v0$>&0$@3Jv*:;U,/.F0q6"$,U,9.768,`*T,U"C68ÆYV0q41@B,/.10$@[<&0310$@/6O-*:$03D\)!¬#&@9D10$@U,/#AD1#A,9.1*:;$JjO:0$,U41;
6Q1QF@9#o6".¬,/.F0;R41¡ Y ÛR03"W,d*-Æ6);RO:*:<.5,9O-E
D1*-gs03@R03o,`(6CEJ_,/.76l,`*:;[q@9#&%¾,/.10QV#&*:o,`#q>N*:0$(#q
*:o,903@9QV#&O:68,/*-#&Åq#&@9%U4FOS6;$\ÿtu.10$;90q#&@R%U41O:6;'6@90D1*:;R"341;R;903Dª*-«%6oEÆ,90WaN,/;d#&º541%'03@9*-"C6O
6768O-EN;9*-;3\
(+.10$@905ý&æßsçu6@R0wQV#&OTEbF#&%*:6O:;P*:eßA#8qLD10$<&@90$0\vtu.10K"$#&1;R,9@941"W,/*-#qL,/.F0oý&æßsç"C6YV0
,68÷03q@9#&% ,/.10w;9*-%Q1O-0Kô6<&@/681<&*S68q#@9%U41O:6Mq#&@+25476D1@968,/*-"w*-o,/03@RQs#OS68,9*:#&)æ#&@u0WaN,/@96QV#&OS6lr
,/*-#&ëçP(+*T,/.1#&br£032541*-;9Q76"$03DQs#*:o,/;
Ý
ÝLæ|ßsçjä oýoæßsçÔÝëýPø ýoæßsç 8 æz¥F\ &5ç
ß 9 ý
] Yo>b*-#&41;RO-EU.F*:<&.10$@Br£#&@9D10$@^D10$@9*->868,9*->03;^"$#&41O:D`YV0u*:1"$O:41DF03D`6;^,9.10uQ1@9#Y1O:0$%;^DF*:"$,/68,/08\Li "$#&%`r
Z
Q1O-0$,/0MD1*:;R"341;R;9*:#A#qj,/.10$;90[QV#&O-EN1#%*:6O:;+"C68AYs0Mq#411DA*:%d6oE@90Wq03@90$1"30$;K#&541%'03@9*-"C6O
%'0$,/.F#bD1;$J7Y14F,+.10$@90K(_0K10$03D#&1O-E,/.10K"$#&1"30$QF,C\
tu.10MQF@90$>N*-#&41;c0aF6%QFO:03;#q^6tm6?ENO-#&@u,6Y1O-0="$#&1;B,/@94F"$,/0$D©I} $V éyWy|xQs#*:o,D1*-gs03@R031"$0M#&Qbr
03@968,/#@9;q@9#&%pô6<&@/681<&*S68*:o,/0$@9QV#&OS6l,/*:#q#&@9%M41OS6;$\`_#&1;R*:D10$@K10WaN,K,/.10`tm6CEbO-#&@Z,68Y1O:0Mq#@
6Æy|{cV éyWy|x^;9Q16"30'D1*-gs03@R031"$*:1<;R".103%'0'q#@K6n7@R;R,wD10$@9*->868,9*->0`6@9*-;9*:F<q@9#&%p,9.10`41;90'#q_6
f0$@9%'*-,90[*:o,/0$@9QV#&OS68,9*:#&q#&@9%M41OS6Fq \ 6;90$D
# j2ë\§¥F\ &1J6e<&03F03@/68O:*:368,/*-#&#k q j2ë\m¥b\ 1¦`"36
*:F"3O:4FD10D103@R*->868,9*->&0$;68,+103*-<&.5Ys#@9*:F<[Qs#&*-o,/;3JF*\ 0\TJ
% 8
Ý
ø ÝNí9ü ä<þNÿ
æz¥F\ Â&ç
¾ P'&
ß 9 íRü
¾ P[Ü
6 768O:#&<)m,9#3X2ë\o¥b\ &F\mif'0aF6%QFO:0vq#@9%U41O:6c*:;m*:O-O:41;B,/@/6l,/03DM68,^,9.10,/#&Q[#8qëtL6YFO:0u¥F\ ¥F\%f03@R0
1#,#&FO-E*-;,/.10KD10$@9*T>6l,/*->0K68,Qs#*:o,Pê@R03Q1@R03;90$o,/03DhJhY14F,f6O-;9#[*-1"3O-41D103D6@R0wDF03@9*T>868,/*T>&03;+6l,
QV#&*:o,/;^u ê $ƦK681D`ê+ø«¦&Jb(+.F*:".6O:;R#U%U41;B,uYV00WabQ761DF03D41;9*-1<[tm6?ENO-#&@+b0$@9*:0$;u6YV#&4F,uQV#&*-5,
¥& Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
ê7\=tu.F*:;@90$2541*:@R03;Z,/.F0Uq#&O:O-#I(+*-1<d<0310$@/6O-*:C6l,/*:##qX,/.10[tm6CENO:#&@Z;R03@R*:03;0abQ761;R*:#&k<&*T>&03k*-
j2ë\ë¥F@\ ?bÛ
ï
Ý ¦ ï
Ý
8 ä (
) æõbî[ßsç ï 8 æz¥F\ ooç
ß 9 íRü1ý +È ï * ¾ ä ì%>
ß Ê
ß 9-, í
tu.10D103@R*->868,9*->&0,903@R%;[1#?(.76C>&0"3#N0$¨'"3*-03o,/;æ,9.10"3#N0$¨'"3*-03o,'#&Æ,9.10'ê
QV#&*:o,`*-;U,6÷803
6;`#&10,/#);9*-%QFO:*-q|Ek,9.1068O:<&0$Y1@/6oç=(+.F*:".Æ%U41;R,YV0DF0$,/0$@9%'*:10$D©4F;9*:F<),9.10tL6CENO:#&@`tm6Y1O-0
6Q1QF@9#o6".6;+#&4F,9O:*-103DeYV03O-#I(K\
Ý
Ý
Ý ¦
8 ø 8 ø]þ 8 ø æ5ÝNíP"ø~ÝbíLøzºÝbíRü#"Bçjä ù
ß9 í)P"
ß9 í
ß9 9í ü#" î ß
U
îUß; îUß ; îUß T ; îUß U ; îUß V ;
ÝNí J NK
M O J ¦K ú¤M O í J )K û¤ M O í J )K üb M O í J /K .¤M O í
K í K ú K û K ü K .
;Næ|r9¦Içh; "" ;Næ|r9¦Iç ; "
"
î[ß; J KNM ;Næ|r¦?ç T ; Ý ;NæSr/¦?ç U ; "
K O í)P" U
î[ß; JZNK M O ¦
K í " " " "
îUß;GþJLKN M O þ þ ;NæB¦?çh; "
F þ ;NæÔ¦Iç ;
: þ ;NæB¦Iç T ; Ý
F þ ;5æB¦Iç U ;
:
K íRü#" " " " " U"
?; ÝNí)P" {;5æ|r/¦Içh; " ;NæSr¦Iç ; ½;Næ|r9¦Iç T ; Ý ;Næ|r9¦Iç U ; {;5æ|r/¦Iç V ; " ä
h;?ÝNí U
ºh;NæB¦Içh; ""
" ºk;NæÔ¦Iç T ; Ý " " ºh;NæB¦Iç V ; " ä "
ºk?; ÝNí9ü#" º ºkN; æB¦Iç ; ºÉ5; æB¦Iç U ;
U
tm6Y1O-0K¥F\ ¥F\XtL6CENO:#&@,/6Y1O-0Zq#&@u"30$5,9@/6O¥Ir!QV#&*:o,F03@9%'*-,9*S66Q1Q1@R#?ab*-%d68,9*:#&,9#'6[n1@9;R,D10$@9*T>6l,/*->0\
t§#%6lab*:%'*:$0f,/.F0w#@9D10$@#8q^6"$"341@96"$EJ1(_0w%U41;B,;/68,9*:;Rq|E,/.10K@R03OS6l,/*:#
¦ ¦ ¦ ¶· ¶· ¶ ··
· ·
$ ¦
w ¦ ¦ ¦ ·· ·· $ ¦
w ··
³´´ ¦ ¦ $ · ´³´ º · ä ³´´ ·
´´ ´ ´´
´µ $ ¦
w ¦ ¥ ¥ ¹ ´µ´ ¹ ´µ ¹
¦ ¦ $
þ
"
. 6C>N*:1<,/.10;9#&O-4F,/*-#&«ù¸7à?àºIà àþ3û_ä
7 ù ¥Fà àN$f¥FàC¦&àC¦$û\101D10$@M,/.10$;90"3#&1DF*-,/*-#&1;K,/.10;9* ab,9.
"3#O:41%'e;941%';u,/#
U
îUß U
V Ý
þNÿ
ä 8 æz¥F\ Â'&ç
¦ 8
ß V 9 í
ÎNÐçNÐóÇu×uÓcÚËmÍÏè_Ç˧ÒÔÓ{é ÖZÒÔÑ^Ñ^ÌXÍfÌXÓMÇLÒÔÓqé ÚÇ^ÈfÌvÙÌvÚ
×uѬÉcÓëê ×uÍfÖÌXÍ ¥!'
61D,/.F0w%'0$,9.1#ND"36Ys0K0aFQF@903;R;90$Dk6;
Ý
Ý
Ý ¥
8 ø¬8 ø 8 $ æ$fÝNíP"ø¬ÝNí9ü#"BçXäB\dæzîUßUWç æz¥F\ !?oç
ß 9 í)P"
ß 9 í
ß 9 íRü#" î ß
[
tu.1*-;*-;+6O:;R#[@90Wq03@9@R03D,/#'6;632uo5}P
4 q#&@R%U41OS6b\
`aßõaß d r|tÚjgtv|ã36<yyãIgtv|%jgehiEe,df|Ø8p
7 ue7rÇâã|}
£,f*:;+#&10K,/.1*-1<`,/#d"$#&1;B,/@94F"$,f%0W,/.1#ND1;41;9*-1<,9.10{03@R%*T,/*S68e"3#&1"$03QF,Z61D2N4F*-,/0=61#8,/.10$@
,/#w*:%'Q1O-03%'03o,L,9.103% *-6K"3#%Q14b,/03@X"$#bD108\^!`,/.10uq#&@R%Ï#qh6wQV#&*:o,X#&QV03@968,/#@j*-,X*:;jQF@9#&Y768Y1O-E
1#,+0W>N*:D10$5,6l,n7@9;B
, ÛR41;R,+.1#?(Bj2V\1¥F\ ?U"C6YV0K6Q1Q1O-*:03Dh\f#?(v0$>&0$@3Jë,/.10;R*-,94768,/*-#&*-;2541*-,90
0C68;REd,9#U"3#%Q1@R03.10$1De*-qh(_00aFQF@903;R;u,/.10Z;96%'0c%'0$,/.F#bD*-d,/.F0cq#&@9% #q§6U%68,9@9*Ta'#Qs0$@/68,9#&@3\
i Y761DF03D%d68,9@9* a1#8,68,9*:#&q#&F@ j2ë\V¥F\ ! ?[*:;
¦ ¦
ݲ ä
ÁeæÔ¦&à/1àC¦?çI e ² ø
Áæ£$w¦&à àC¦?ç ÝM J )² º O æz¥F\ !Doç
î ß
[
68,9.103%68,9*:"C68O:O-Ed,/.1*-;f*-;
*:(+.1*:".kãZ*-@9*-".1O:0W,fYV#&41FD76@RE"$#&1D1*T,/*:#1;f.16?>0UYV0303A*-%QV#&;R03D\ T
032541*T>86O:0$5,u,9#
P" ¦
² ð
Ý ä 7ù¸ÁæB¦&à/FàC¦IçÔû Áeæ£$w¦&à à3¦Iç ÝM ø J )² º O
² Ç æz¥F\@ ç
î ß
U
(+.1*-"."36YV0K@90$0WabQ1@90$;9;R03DYoEe,/.F0 Q1@90$D1*:"W,/#&@Ôr!"3#@9@90$"$,9#&@Q`;90$2541031"$0
¦
Ý ²9 ä ø J )² º O
² Ç
Áæ£$w¦&à àC¦?ç ÝM
î ß
U
P"
ݲ ä fýù ÁeæÔ¦&à/1àC¦?çÔû Ý ²9 æz¥F\@b¦Iç
*-,9.Å@903;RQs0$"$,`,/#Q1@/6"W,/*-"C6Ov*:%'Q1O:0$%0$5,/68,/*-#&J§,/.10%'0C681*:1<#q+,/.10eQ1@R03D1*-"$,9#&@U*:
,/.1*-;
ª
;90$2541031"$0k;9.1#&4FO:DºYV0"3O-0C6@$\ £,d;9*:%'Q1OTE¬;/6CEN;;:¬,68÷0,/.F0>&0$"$,9#&@6@9@96CE Ý ² J+D1*Tgh0$@90$1"30*T,CJ
6D1D,9.10UYV#&411D16@RE"3#1D1*-,9*:#&F;3J681D;R,9#&@90=,/.10U@R03;R41O-,*-,9.10U*:o,903@9%'03DF*S68,90U6@R@/6CE ݧ ²9 \ctu.10
%'0C61*-1<U#q§,/.F0;903"$#&1D@9#?(ÿ*:;%'#&@90c;941YF,9O:08J7;9*:F"30*-,*:;D10$%d681D1*:F<U,/.100W>68O:4768,9*:#&d#qm6
*:o>03@9;R0M#&QV03@968,/#@3J7Y14F,f*-,+;B,/*-O:O"36YV0K<&*->036`;9*-%QFO:0*:o,903@9QF@90$,/68,/*-#&\Pic*:o>&0$@9;90w%68,/@R*Ta
#&QV03@968,/#&@w*:%'Q1O-*:03;Z,9.10d;R#&O:4b,/*:#
#qu6"3#&4FQ1O:0$DH;90W,[#quO-*:1036@K03254768,9*:#&F;3\tu.103;R0#&QV03@/6l,/#&@R;
6@R0+>03@BE"$#&%'%#&`*-`n11*-,90DF*-gs03@90$1"30f6Q1QFO:*:"368,/*-#&1;$\mtu.10WE6Q1QV0C6@X*:`,/.F0+q#@9%Ï#qhY761DF03D
%68,/@R*:"30$;.16?>N*-1<6H;R%d68O:OuY76FDF(+*:DF,9.Ju*:Æ,/.1*-;"36;906),/@R*:D1*:6<&#&16O\ºtu.F00$>86O-4768,/*-#&¬#q
P"
ýù ÁeæB¦&à91àC¦Iç!û *-;Mq#&411DÅYoEH%0361;[#qf6,/@R*:D1*:6<&#&16O ;9#&OT>&0$Q@ 1Jj(+.1*-".Æ*-;U;9*-%QFO:0`,/#k"3#ND10J
0$¨'"$*:03o,,/#'@941hJs681D(+*-D103OTEe41;90$D\!<&0310$@/6Oz J f0$@9%'*-,/*:6#&@ÜL6 < 6QFQ1@9#Cab*:%68,/*-#&1;u"36
D 0M
YV0wQF@/6"W,/*:"36Oh(+.10$,9.10$Ee"36Ys0K*:%'Q1O-03%'03o,/0$DeY5Ed,/.10K41;R0=#qm0$¨'"$*:03o,Y76FD103D;9#&OT>&03@R;3\
=> ¬§¨[@©&ª£¦©§¤¨G¥¦Qªo§¤«¦¢Rª£«¦¬5§¤¦Õ¬G@¬@?ɧ¤¨GBAL«¦ÒG¬Z G)¢¤¯ª£«¦¬[ G¸§¤Õ«.¬[©vÚ«¦ÒG uÕ¬Zª@Ò[ =7¥¦ÕÒGQ©s«¦ÑCAL«)§¤¨ Ð ¦¬[
D ÐFE DHG )§IZA «¦§¨ZA «.ÒG¬[ G¦¢@I©I°
¥? Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
Ý ² ¦ ² <
$ ÁkÜNæ£$w¦&àC¦?bàN$c¥ àC¦?Fà5$=¦Iç Ý ä \ðJ9îUßU O æz¥F\@&ç
ß î ß
¦ [
! #@9D10$@f,/#';90$O:0$"$,6`n71*T,/0Wr£D1*-gs03@R031"$0=;R".103%'0=q#@c6'<&*->0368Q1Q1O:*-"C68,9*:#&#&F0=%U4F;R,fYs0M6Y1O:0
,/#=6;R;903;R;v,9.106"3"$41@/6"WE'#qs,9.10"C61DF*:D768,90+;9".10$%0$;3\Xtu.10f6"3"$41@/6"WE`#q68#&QV03@968,/#@j*:;X#q|,/0$
0WabQ1@R03;R;903DH*:,/0$@9%';#qP,/.10[#&@RD103@#8qv,9.10[O:036D1*:F<e03@9@R#&@c,903@9%pD10$,903@9%'*:F03DAq@9#&%p6tL6CENO:#@
,68Y1O:08\Lª.1*:O-0,9.1*:;P*:;_6M41;R0$q41Os%036;941@R0JN*-,vQ1@9#?>N*:DF03;u6=q68*:@9OTE[O:*-%*T,/0$D'DF03;9"$@9*-QF,/*-#&\j¤741@B,/.10$@
*:bq#&@9%68,/*-#&
6Ys#4F,U,/.F0e03@9@R#&@UYV03.76C>N*:#@U#qf6n71*T,/0Wr£D1*-gs03@R031"$0;9".F03%'0e"C6¬YV0#&YF,/6*:10$D
41;R*:1<'¤7#&41@R*:03@u0$@9@R#&@+676OTEN;9*:;$\
ÎNÐ[Z5ЫÑP×ÓèmÍ+ÒÔÌXÍóÌXÍfÍZ×+ÍóÉcÓfÉ]\RêXÚNÒBÚ ¥D
`a$JÉaIc 6×yyã£gtv|%jgeki
je ^
| Qõyu|%jg|ã,wzy{psr|%je7r
ic`68@9Y1*T,/@/68@RE=Qs0$@9*:#ND1*-"Pq41F"$,/*-#&["C68[Ys0uD10$"3#&%'QV#&;90$D[*:o,/#*T,/;^¤7#&4F@9*:0$@L"$#&%QV#&10$o,/;3J&(+.F*:".
6@R0*-',9.10uq#&@9% þ [_ Jo(+.103@R 0 `d*-;^,/.10+(6C>03541%UYV03@$\P£,v*:;^,9.103@R0$q#&@R0f#8q*:o,903@90$;R,P,/#K0WaF6%'*:F0
.1#?( (_0$O:OL6<&*->03n71*T,/0r!D1*Tgh0$@903F"30U#&QV03@968,/#@Z6Q1QF@9#Cab*:%68,/0$;cD10$@9*->868,9*->03;Z#7 q þ a_ \ZH0M(+*-O:O
"3#1"30$5,9@/68,90Jb.103@R0JF#n7@R;R,DF03@9*T>868,/*T>&0f6Q1Q1@R#?ab*-%d68,9*:#&F;3J56OT,/.1#&4F<&.',9.10Z6876O-EN;R*:;P*:;P0325476O-O-E
6Q1QFO:*:"36Y1O-0c,/#`.1*-<&.103@uDF03@9*T>868,/*T>&03;$\
tu.10w0WaF6"$,+n7@R;R,D10$@9*->868,9*->0#
q þ [_ *:;
þ [_ [_
äcb$`þ æz¥F\@oç
ß
£ q(v0d68Q1Q1O-EJ§q#@w0aF6%QFO:0Jm6;903"$#&1Dbr£#&@9DF03@M"$03o,/0$@90$DD1*-gs03@R031"$0d#&QV03@968,/#@K,9#ÝNí[äþ [_ d J
(+.10$@90KßNíuä«ê5îUßJ1(_0w<&0$,
ÝNí9ü#"R$ÅÝNí)P"
æ ÝVçí ä
îUß
þ [_Ue í9#ü " $ þ [_Ue í P"
ä
î[ß
æþ a_/e $ þ P [_Ue çIþ a_
ä
î[ß
ä
¦
ùTæ"3#;S`ëîUß'ø8bo;9*-f`ëîUßsç$ªæ"3#&;S`7îUß $gbo;R*:f`7îUßsçÔû þ [_
î ß
U
;R*:f`7îUß
ä b þ [_
îUß
ä b$`Lhþ [_ æz¥F\@'&ç
(+.10$@905` h *-;§,9.10_%'#ND1*-n70$Dw(_6C>&0$N4F%UYs0$@3\jtu.10v%#ND1*Tn703DK(6C>03541%UYV03@j*-;m;R#Z76%'03D=Ys0$"C641;R0
*-,m6QFQs036@9;(+.103@R0v,9.10P(_6C>&0$N4F%UYs0$@3Ji`J86Q1QV0C6@R;m*-w,9.10v0aF6"$,L0WabQ1@90$;9;R*:#&\Ltu.N4F;m,/.F0vD10$<&@90$0
,/#f(+.1*:".[,/.F0%#ND1*Tn703Dw(6C>&0$541%UYV03@P6Q1Q1@R#CaF*-%d6l,/03;§,/.106"$,9476Ob(_6C>&0$N4F%UYs0$@X*:;^6Z%'0C68;941@R0
#q§,/.10w6"$"341@96"$E#8qm,9.10w6Q1Q1@R#?ab*-%d68,9*:#&h\
¤7#&@,/.10A;R03"$#&1Dbr£#&@9D10$@"$03o,/0$@90$D D1*Tgh0$@903F"30k#&QV03@/6l,/#&@d,9.10k%#ND1*Tn703Dº(_6C>&03541%MYs0$@*-;
<&*T>&03YoE
;9*-f`ëîUß
`Lhvä æz¥F\@L?oç
î[ß
òf#8,/0,/.76l,j` h 6Q1QF@9#Cab*:%68,/0$;f`,/#`;90$"3#&FDbr!#&@RD103@f6"$"341@96"$EJë6;+*:;,/#'YV00WabQs0$"$,903DJV;9*-1"30
;R*:f`7îUß ` T î[ß
äk`Ó$ ø
îUß W5WNW
j254768,/*-#&ÿ¥F\ Z?¬*-;Q1O:#,R,/0$Dð*- ¤m*:<&41@R0k¥F\ 1JZ6O-#&1<Å(+*-,9.ÿ;R*:%'*:O:6@@R03O:68,/*-#&1;q#&@e,/.F0);B,6Nr
D76@RDdq#&41@B,/.br£#&@9DF03@P"303o,903@90$DD1*-gs03@R031"$0Z;9".10$%0Z61Dd,9.10fq#&4F@R,/.Nr!#&@RD103@vÜL6D0Z
< ;9".10$%08\Xtu.10
Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
2.5
2
κ*∆ x
th
1.5 4 Pade
th
4 Central
1
nd
2 Central
0.5
0
0 0.5 1 1.5 2 2.5 3
κ∆ x
0WabQ1@R03;R;9*:#¬q#@M,/.10d%#ND1*-n103DH(_6C>&03541%MYs0$@'QF@9#?>N*:D10$;U,/.10e68"3"34F@/6"WEH(+*-,9.(+.1*:".¬6<*->&0$
(_6?>03541%UYV03@K"$#&%QV#&10$o,#qj,/.F0U;9#&O-4F,/*-#&*-;c@90$;9#&OT>&0$Dkq#@f,/.F0U03o,/*-@90M(_6C>&0$N4F%UYs0$@K@/61<0
6C>86*:O:6Y1O:0f*:6[%0$;9.#qL6`<*->&0$;R*:$0J m l `ëîUß l j\
!<0310$@/6OzJFn71*T,/0Wr£D1*-gs03@R031"$0K#&Qs0$@/68,9#&@9;u"36Ys0(+@9*T,9,903*:e,/.F0Kq#@9%
æ çí+ä æ çzí^øÿæ % çzí
(+.10$@90æ çí=*-;6)6o,/*-;REN%%'0$,9@9*-"M#&QV03@968,/#&@Z61D©æ % çzíw*:;K6;REN%'%0W,/@R*:"U#&QV03@968,/#@3\ U £qv(v0
@90$;R,9@9*:"W,#&41@u*:o,903@90$;R,+,/#`;R".103%'03;f0WaN,/0$1D1*:F<'q@R#&%Ïê½$¬¥[,9#wêZø©¥bJ1,/.10$
¦
æ Ýsçíuä ù¸"3æÝbíRü#"R$ÅÝNí)P"Bçø~ æÝNí9ü $ÝNíP çø] æÝbíRü $ÝNí)P ç!û
T T T
î ß
U
61D
¦
æ % Ýsçzíä ù ä/ÝNíjø "WæÝNí9ü#"hø¬ÝbíP"Bçø æÝNí9ü øÆÝNíP çø æÝNí9ü T øÆÝNíP T çÔû
î ß
U T
tu.10w"3#&@R@90$;9QV#&1D1*-1<`%#ND1*-n103D(_6?>03541%UYV03@f*:;
¦
b$`Lh ä
î ß
[
ù äLø æ "N"$#&;n`ëîUß[ø
"3#&; `7îUßUø
T
"3#&;ë¥F`7îUßsç
ø bæ "b;R*:j`7î[ß[ø] ;9*- `7î[ß[ø] T ;9-* f¥o`ëîUßsç
æz¥F\@LDoç
p > ¬:§¤£¢¤Ô©#«¦Ñkª@¢¤ª£ÒG@¦¬5§#Ô§¤¢r qF«¦®L£¢b§¤«¦¢nsBtN§¨G¦¬.§¤@©¯NÔÉÔk£§¢¤@ªR®[)¢§@©Ú«/AG§¤)@¬GQ Ñ¢¤«¦Ôcuvsxw-s+yCz E/{
)¬Z F§¤¨G©¯NÔÉÔɧ¤¢ª®[)¢§Ñ¢«.Ô|uvs3}~s y z EU{ °
ÎNÐ[Z5ЫÑP×ÓèmÍ+ÒÔÌXÍóÌXÍfÍZ×+ÍóÉcÓfÉ]\RêXÚNÒBÚ 1¦
ª.10$w,9.10^n71*T,/0Wr£D1*-gs03@R031"$0j#&QV03@/6l,/#&@*-;6o,/*-;REN%'%0W,/@9*-"uæ"303o,903@90$DëçWJl,/.10j%'#ND1*-n70$Dc(_6?>03541%[r
YV03@_*-;vQF41@90$O-E'@9036O\§ª.103,9.10c#&QV03@968,/#@v*-1"3O-41D103;_6=;BEb%'%'0$,/@R*:""3#&%'QV#&103o,3JN,9.10c%'#bDF*-n70$D
(_6?>03541%UYV03@*:;`"3#%Q1O-0WasJj(+*-,9.Æ,9.10*:%6<&*:16@RE)"3#%QV#&10$5,'YV03*-1<k03o,/*-@903OTEÅ03@R@9#&@$\¬tu.10
q#&41@B,/.br£#&@9DF03@+ÜL68
D 0=< ;R".103%'0K*:;+<&*T>&03YoE
¥
æ ÝVçí)P"øÆ7æ ÝVçzíjøÿæ Ýhçí9ü#"^ä æÝNíRü#"R$ÅÝbíP"Bç
î ß
U
tu.10w%#ND1*Tn703D(_6C>&03541%MYs0$@fq#&@,9.1*:;u;R".103%'0=;968,/*-;Rn70$; V
¥
b`hþ P a _/e ø¬ob$`Lhmøb`hQþ [_Ue ä æþ [_Ue $áþ
P [_Ue ç
î ß
U
(+.1*-".<&*T>&0$;
b`h_ä H¥ bo;9*-f`7î[ß
æ ø¬"3#&;S`7îUßsçRîUß
tu.10[%'#bD1*Tn703D(6C>03541%UYV03@KQ1@R#I>N*-D103;K6d4F;90$q4FOL,/#N#&Oq#&@Z6;R;90$;9;9*-1<eD1*Tgh0$@903F"30`6Q1QF@9#Ca5r
*:%68,9*:#&1;$\!),/.10'"3#5,90WaN,U#8q,/.10'O:*-10C68@"3#&o>&0$"$,9*:#&0$254768,/*-#&J,/.1003@R@9#&@R;="36HYV0<*->&0$
6dQ1.oEN;9*-"C6O§*:o,903@9QF@90$,/68,/*-#&\c_#&1;R*:D10$@c#&1"$0[6<o68*:,/.10=O:*:F0C6@"3#&o>03"$,9*:#&A0$254768,/*-#&*-,/.F0
q#&@R%
Ý
Ý
ø
] ä
Þ
ß
#&¬6DF#&%d68*:H0aN,/03FD1*:1<Aq@R#&% $ ,/ # \ +03"36O:OXq@9#%ÄN03"$,9*:#& \ ¥F\ ,9.768,`6;R#&O:4b,/*:#
*:F*-,/*:68,/0$DYoE6[.76@9%'#&1*-"cq411"W,/*-#&e(+*-,/.e(_6C>&03541%MYs0$ @ `*-;
(+.10$@90
^æÞRç_;968,/*-;Rn70$;+,9.10=]ã
ä¼$fbbi`
Þ
b#&OT>N*:1<Uq#&@f
LæÞRçu61D;94FY1;R,9*-,/4b,/*:F<'*-o,/#ëj2V\ë¥b\ <&*T>&0$;+,9.10K0WaF6"W,c;R#&O:4F,9*:#&68;
a_ P¡
ÝLæ|ßà9ÞRçjä
^æ çIþ
£qj;90$"3#&FDbr!#&@RD103@"30$o,/03@R03DAD1*Tgh0$@90$1"30$;c6@R0M68Q1Q1O:*-03De,/#',/.10w;9Q168,/*:6Oh,/0$@9%J7,/.10Kq#&O:O-#?(+*:1<
]ã©*-;u#&YF,68*:10$Dq#f @
^æÞRçÛ
;9*-f`ëîUß
Þ
äX$fbb
äX$fbbi` h
î[ß
IÍ «¦§§¤¨[§§¤£¢¤Ô©7©Ò[ªb¨Ï¦©5u Ð zN )¢¤¨[¦¬[ =@I YAN¯½@§§@¬@? Ð38 "$ L ¦¬[ q£¥¦ÕÒ[)§@¬@?u§¨[
©¨G¸Ñ §s@¬5Z °
Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
#&OT>N*:1<,/.F*:;v]ã
0WaF6"W,/OTEæ;9*-1"30u(v0Z6@R0+"3#&1;R*:D10$@9*-1<,/.1003@R@9#&@jq@9#%
b ,/.10+;RQ768,/*:6Oë6Q1QF@9#Ca5r
*:%68,9*:#O-EFç61D;R41Y1;R,9*-,94F,/*-1<`*:o,/#ëj2ë\s¥b\ JF(_0K#&Yb,6*-
[_ P¡
Ý N4F%0$@9*:"36O æßàRÞRçPäk
^æ ç£þ æz¥F\ F¦Iç
(+.10$@90 h *:;P,/.10f541%0$@9*-"C6OLæ#&@P%'#bD1*Tn703D7çXQ1.16;90Z;RQs0$03DJb(+.1*:".e*-;v@R03OS6l,/03D,/#M,9.10c%'#bDF*-n70$D
(_6?>03541%UYV03@fYoE
h ä
` h
`
¤7#&@,/.F0=68Ys#?>&0K0a168%Q1O-0J
h ;9*-]`7îUß
ä
`7îUß
tu.10PN4F%0$@9*:"36OQF.76;90P;9QV030$D=*-;,/.10X;RQs0$03D=68,(+.1*:".=6u.76@R%#&F*:"Lq41F"$,/*-#&*:;QF@9#&Q768<o68,/0$D
541%'03@9*-"C6O-O-E\ b*-1"30f h HZ l ¦q#&@',/.1*-;d0WaF6%'Q1O-0J,/.F0AN4F%0$@9*:"36O;9#&O-4F,/*-#&«Q1@R#&Q76<&68,/0$;
,/#N#e;9O-#?(+O-E&\[b*:1"$0ë h *:;K6q41F"$,/*-#&A#qP,/.10[(_6C>&03541%MYs0$@3Jm,9.10[541%'03@9*-"C6O^6Q1Q1@R#?ab*-%d68,9*:#&
*:o,9@9#ND141"30$;dD1*-;9QV03@R;9*:#Ju6OT,/.1#&4F<&.Æ,9.10#@9*:<*:76O+ÜX ã Ï*-;1#1D1*:;RQs0$@9;R*->&08\ÿif;6H@R03;R41O-,3Ju6
(_6?>0$q#&@R%¡"3#&1;R*:;B,/*:F<#q%d6oEADF*-gs03@90$o,=(_6C>&03541%MYs0$@U"3#&%'QV#&103o,9;=0W>&03o,9476O:OTE)O:#&;R03;K*-,9;
#&@R*:<&*-76Oëq#&@9%\
¤L*:<41@90u¥b\ c;R.1#?(+;X,9.10u541%'03@9*-"C6ObQ1.76;R0+;9QV0303D[q#&@m,/.10u;R".103%'03;P"3#&F;9*:DF03@90$D`Q1@90W>b*-#&41;RO-E&\
tu.10541%MYs0$@M#q_7ly|7x|K7}WèPH }W :}WN
x|
æ çYoEk(+.1*-".¬6<&*T>&03
(6C>&0e*-;=@R03;R#&O->03D*-;
<&*T>&03ÅYoE RHo`7îUß\
tu.10e@R03;R#&O->N*:F<A0$¨'"3*-031"WEÅ#q6;9".F03%'0"36¬Ys0d0WabQ1@90$;9;R03D«*-,/0$@9%';
#q,/.1¡ 0 @90$2541*:@R03DÅ,/#)Q1@9#ND141"$003@9@R#&@9;[YV03O-#?(µ6A;9QV03"$*-n70$D©O-0$>&0$O\Ť7#&@[0aF6%QFO:0JX,/.F0
;90$"3#&FDbr!#&@RD103@d"303o,903@90$DªD1*-gs03@R031"$0;9".10$%0A@R032541*-@903ô ; ? ,9#HQ1@R#bD14F"30A6 0$@9@R#&@d*-
Q1.768;90U;RQs0$03DA#qXO-03;9;,/.768 \T¦UQs0$@9"$03o,C\Ztu.FÓ 0 Ir!QV#&*-5,+q#&4F@R,/.Nr!#&@RD103@f"303o,903@90$Dk;9".10$%0[681D
,/.F0q#&41@R,9.br!#@9D10$@`ÜL6 < ;R".103%'0@9032541*-@90AG¦ 681Dª¦ @903;RQs0$"$,9*->&0$O-E,9#k6".1*-0$>&0,/.F0
D 0
;/68%00$@9@9#@O-0$>03O\
¤7@9#&% ,/.10Zq#&@R%#& q j2ë\ë¥F\ F¦&Jb(v0K;90$0K,9.768,u,9.10@9036OQ76@B,+#q§,/.10%'#bDF*-n70$D(6C>&0$541%UYV03@
O:036D1;',/#Å6 0$@9@R#&@d*-«,/.10Q1@9#&Q16<o68,9*:#&©;9QV0303DhJ(+.1*-O:0,/.10*:%6<&*:16@REÅQ16@R,eO-0C6DF;,/#6
03@R@9#&@v*:d,9.106%'Q1O-*-,/4FD10+#q,/.10c;9#&O-4F,/*-#&\Ltu.541;,9.10Z685,9*:;BEb%'%'0$,/@R*:"Qs#@R,/*-#&d#8q,/.10Z;RQ768,9*S6O
D1*Tgh0$@903F"30+#&QV03@/6l,/#&@jD10W,/0$@9%'*:10$;^,/.10+03@R@9#&@j*-`;9QV0303Dd61D[,/.F0;BEN%%'0$,9@9*:"_Qs#&@B,/*-#&U,/.10+0$@9@9#@
*:6%'Q1O-*-,/4FD10\mtu.1*:;+*:;q4F@R,/.F03@+D1*:;R"341;R;90$D*:b0$"$,9*:#&)¦&¦&\ \
1.2
0.8 nd
2 Central
a*
_
a
0.6 th
4 Central
th
0.4 4 Pade
0.2
0
0 0.5 1 1.5 2 2.5 3
κ ∆x
¤L*-<&41@R0K¥F\NÛ òf41%'03@R*:"C68OhQ1.768;90w;9QV0303Dq#&@>86@9*-#&41;u;R".103%'03;$\
Ý ² äÏù Ý"à+Ý
e
à W5WNW à+ÝÅ=û Æ æz¥F\ ç
61DÝä+*:;u;9QV03"$*-n70$D\
_#&1;R*:D10$@^n7@9;B,^,/.10_*:FG7#?(ÆYV#&411D768@RE&\m£,j*:;m"3O-0C6@L,9.768,^6;^O:#1<6;L,9.10*-5,903@R*:#&@§D1*-gs03@R031"$0
6Q1QF@9#Cab*:%68,/*-#&
DF#b0$;M1#,M0WaN,/0$1DÅYV0$ED¬Ýbí P"JL,9.103H1#;9QV03"$*S6OX,/@R0C68,9%0$o,U*:;w@90$2541*:@R03D
q#&@,9.1*:;uYV#&411D16@RE\v¤7#&@u0aF6%QFO:0Jb(+*-,/.;R03"3#1Dbr!#@9D10$@f"$03o,/0$@903DD1*-gs03@R031"$03;+(_0w#&YF,/6*:
Ý
² ä »,Ý[
² ø J ¦ ² º O æz¥F\ &¥oç
(+*-,9.
¦ ¶ ·· $Ýä ¶ ··
$w¦ $w¦ ¦ ·· $w¦ ´³ ··
» ä ³´´ à J )² º O ä æz¥F\ 5ç
îUß ´´µ $ ¦
w ¦ îUß ´´
\\ ¹ ´µ \\ ¹
\ \
& Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
f#?(v0$>03@3Jc*-q(v0)4F;90,/.F0q#&41@R,9.br!#@9D10$@*:o,/0$@9*-#&@d#&QV03@968,/#@<&*->03 *-CX2ë\u¥b\8FJ+,9.103ª,/.F0
6Q1QF@9#Cab*:%68,/*-#&e68,PêMäå¦K@9032541*-@90$;f6U>86O-410Z#qmÝNí)P J1(+.F*:".*:;u#&4b,/;9*-D10Z,/.F0wDF#&%d68*:\031"$0
6D1*-gs03@R03o,w#&Qs0$@/68,9#&@K*:;K@90$2541*:@R03D6l,cêä ¦`(+.1*:".
0WaN,/0$1D1;=#&1O-E,/#êëÿ $ ¦&J§(+.F*:O:0[.16?>N*-1<
,/.F0Z6Q1QF@9#&Q1@R*S68,90f#@9D10$@_#q68"3"34F@/6"WE&\vb41".6#&QV03@/6l,/#&@$Jb÷51#?(+6;_6d7¢b{d}Wy9 #WÀ l¢NVoW
?7}W{d}WJP"C6©.76C>&068«#&@RD103@`#qZ6"3"$41@/6"WE¬(+.1*:".©*:;lh}AlRN}We :lè_}WM,/.768©,/.168,'#qZ,/.F0
*:o,903@9*-#&@c;R".103%'0J681DA,/.10U<O:#&Y768OL6"$"341@96"$E(+*:O:O§03254768OL,/.76l,#qj,/.F0[*:o,/0$@9*:#@c;9".F03%'0\U¤7#&@
0WaF6%'Q1O-0JF(+*T,/.q#&41@B,/.br£#&@9DF03@"$03o,/0$@903DD1*-gs03@R031"$03;$J1(_0K"C684F;90,/.10Zq#O:O:#?(+*-1<=,9.1*:@RDbr!#&@RD103@
#&QV03@968,/#&@+6l,Pê[ä¦&Û
¦
æ Ýsç " ä æ$ Ýä$¬¥Ý"høÆÝ
&îUß $ÅÝ T ç æz¥F\ !&ç
(+.1*-".d*:;X036;9*-O-EUDF03@9*T>&0$Dd41;R*:1<=6wtm6CENO:#&@j,68Y1O:08\^tu.10@903;R41O-,9*:1<KD1*Tgh0$@90$1"30#&QV03@/6l,/#&@X.76;X,/.F0
q#&@R%#%
q j2V\V¥F\ &¥U(+*-,9.
tu.1*-;f68Q1Q1@9#Cab*:%68,9*:#&*-;u<&O:#Y76O:OTE`q#&41@R,9.br!#@9D10$@+6"3"$41@/68,90\
i,=,9.10'#&4F,9G1#I( Ys#411D76@BE&Jm1#YV#&41FD76@RE"3#&1DF*-,/*-#&k*:;K;9QV03"$*-n70$D\d
0`%U41;R,M6Q1QF@9#Ca5r
*:%68,90
# Ý H
ß 68,U1#bDF, 0 (+*-,/.H1#A*:Fq#@9%68,/*-#&H68Ys#&4b,U Ý Å#
ü "\ktu.541;U,/.10e;R03"$#&1Dbr£#&@9D10$@
"30$o,/03@R03Dbr£D1*-gs03@R031"$0=#Qs0$@/68,9#&@3JN(+.1*:".@90$2541*:@R03;uÝNí9#
ü "/J1"C6F1#,uYV041;90$D6l,XêUä \Pi Y76"÷&r
(_6@9DÆD1*-gs03@R031"$0eq#&@9%U4FOS6%U4F;R,`YV04F;903Dh\ª*-,/.Æ6A;90$"3#&FDbr!#&@RD103@`*-5,903@R*:#&@U#Qs0$@/68,9#&@3Jj,/.F0
q#&O-O:#?(+*:1<=n7@9;B,Rr!#@9D10$@Y16"÷o(6@RDq#&@R%U41O:6U"C6YV0w4F;903DhÛ
¦
æ s
Ý çÅ ä æÝÅÙ$ÝÅP"Rç æz¥F\ !'&ç
î ß
U
tu.1*-;QF@9#ND141"30$;6'D1*Tgh0$@90$1"30K#&QV03@968,/#&@(+*T,/.
¦ ¶ ··
·· $Ýä ¶ ··
´³´ $w¦ ¦
·· ³´´ ··
$w¦ ´ $ ¦
= ¦
·· à $=¦ ··
» ä ´ \\ J ¦ ² º O ä ´´ · æz¥F\ ?oç
îUß ´´ \ · îUß ´´ \\
´´ $w¦ ¦ ´µ
\
µ´ ¹ ¹
$
!d,9.10Z"C68;90Z#q6=q#&41@B,/.br£#&@9D10$@_"$03o,/0$@903D*-5,903@R*:#&@X#&QV03@968,/#&@P,/.10fOS6;B,v,!(v#[@9#?(+;#8q » @90$2541*:@R0
%'#bD1*Tn7"C6l,/*:#\
ÎNЦ¥oЫÖZÒÔÑLÑ^ÌXÍfÌXÓUÇ^Ìó×+ÊXÌXÍ+ÉcË_×+ÍfÚeÉcË8§×ÓèmÓfÖÉcÍÒÔÌPÚ Â
i 1#8,/.10$@=68Q1Q1@9#&6".A,/#e,/.10[DF0$>&0$O:#&QF%0$5,w#qvYV#&411D768@RE;R".103%'03;w*:;c*:,/0$@9%';#qv;9Q76"$0
c
0WaN,9@/6QV#&OS6l,/*:#\tu.10vq#&O-O:#?(+*:F<q#&@9%U4FOS6+6O:O-#?(+;§ÝÅü#"h,/#Ys0v0WaN,/@96Qs#OS68,903DKq@9#&%ó,9.10v*-o,/03@R*:#&@
D768,/6U,/#'6@9YF*-,/@96@REd#&@9DF03@+#&6032541*:;RQ76"$03D<@9*:DhÛ
P" Ü
æB¦F$8® ç ÝÅü#"^ä æz¥F\ Doç
(+.10$@90® *-;P,9.10Z;R.1*-q|,_#&Qs0$@/68,9#&@PD10$n7F03DYoE¯®wÝbíäðÝNí9ü#"P681Dd,/.F0Z#&@9DF03@_#8q,/.1068Q1Q1@9#Cab*:%6lr
,/*-#&*:°
; ë$º¦&\P¤7#&@0aF6%QFO:0Jb(+*-,/.~dä (_0w#&YF,/6*:
P" P
æB¦F$ ® ø® çÔÝ#Åü#"^äÿÝÅü#"&$ ÝÅðøÆÝÅP"^ä æz¥F\@' ç
(+.1*-".<&*T>&0$;+,9.10q#&O:O-#?(+*:1<Mn1@9;R,Br!#&@RD103@6QFQ1@9#Cab*:%68,/*-#&d,9#'ÝÅü#"Û
b41YF;R,/*T,/4F,9*:1<,/.1*-;Z*:o,/#,/.10[;R03"3#1Dbr!#@9D10$@"303o,903@90$D
DF*-gs03@90$1"30[#Qs0$@/68,9#&@Z6QFQ1O:*-03DA68,Z1#bDF0
<&*->03;
¦ ¦
æ s
Ý çÅ ä æÝ#Åü#"&$ÝÅP"Rç¡ä æ ÝÅÙ$ÝÅP"%$ÅÝÅP"Ôç
î ß
[ î ß
[
¦
ä æÝ#ÅÙ$ÅÝÅP"Bç æz¥F\@' ç
î ß
U
(+.1*-".*-;u*:D10$5,9*:"36Oh,/#ëj2ë\V¥F\ 'b\
¦
æ s
Ý çí ä æÝNí9ü#"&$ ÝbíLøÆÝNí)P"Bç æz¥F\@'¥oç
î ß
U
1#f%#ND1*-n1"C68,9*:#&1;6@90P@90$2N4F*:@90$DU1036@mYV#&41FD76@9*-03;$J8O-0C6D1*-1<u,/#,/.10PD1*-gs03@R031"$0_#&QV03@968,/#@§<*->&0$
*:Yj2ë\ë¥F\ 'b\
¤7#&@M6òf034F%d6FYs#411D76@BEH"$#&1D1*T,/*-#&J(_0e68;9;94F%0d,9.768,
Ú Ý H
ß©*:;w;9QV03"$*-n70$D¬68,ê)ä
øð¦&JF,9.768,*:;
Ý
Ý
8 äE8 æz¥F\@'85ç
ß 9 Åü#"
ß 9
o Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
tu.541;+(_0wD103;R*:<&6#&QV03@968,/#&@+6l,+1#bDF0{ (+.1*-".*-;u*:e,/.10q#&O-O:#?(+*:F<Mq#&@9%Û
¦ º
Ý
æ h
Ý çÅ ä æoÝÅÿø~Ý#ÅP"Bçø 8 æz¥F\@'&ç
î ß
U îUß
ß 9 Åü#"
(+.10$@90ëJIJë681Dfºc6@90K"3#1;R,/6o,/;u(+.1*:"."C68036;9*-O-EYs0KD10W,/03@R%*-103D41;R*:1<'6`tL6CENO:#@,6Y1O-0J
6;+;9.F#I(+*:etm6Y1O-0=¥b\ 1\
Ý ¦ º
Ý
8 ø æ5ÝNíP"ø~ÝbíWçø 8 ä×ù
ß 9 í î ß
U î[ß
ß 9 íRü#"
îUß; îUß ; îUß T ; îUß U ;
ÝNí J KNM O í J K ú M O í J K û M O í J K ü M O í
K K ú K û K ü
î[ß ; JZK ú M O í ¦
K ú
{;5æ|r/¦Içh; "" ;NæSr¦Iç ; "
"
{;3ÝbíP" ½;Næ|r9¦Iç T ; Ý ;Næ|r9¦Iç U ; "
k;?ÝNí U
" " "
î[ß ;=ºÉ; J KM O 9í ü#" º ºkN; æÔ¦Içh; " ºk;oæB¦Iç ; ºkN; æÔ¦Iç T ; Ý
K
tL68Y1O:0K¥F\ 1\jtm6CEbO-#&@,68Y1O:0Zq#&@+ò0341%61YV#&411D768@REe"$#&1D1*T,/*:#\
b#&OT>N*:1<Uq#&@F7J?Jë61DºIJF(_0w#&YF,/6*:,9.10q#&O:O-#?(+*:1<U#Qs0$@/68,9#&@3Û
¦
Ý
æ s
Ý çÅ ä æ ÝÅP"R$ ÝÅUçø 8 æz¥F\@'oç
¥&îUß ¥î[ß
ß 9 Åü#"
(+.1*-".)QF@9#ND141"30$;,/.10[D1*Tgh0$@90$1"30[#&QV03@968,/#@Z<&*->03k*:6j2ë\¥F\ DF\=òf#8,/*:"$0M,/.168,Z,/.F*:;#&QV03@968,/#&@
*:;=;90$"3#&1DNr!#&@RD103@[68"3"34F@/68,90\!,9.10"C68;90#q6N4F%0$@9*:"36Ov6Q1Q1@R#?ab*-%d68,9*:#&k,/#6òf0$41%d681
YV#&411D768@RE"3#1D1*-,9*:#&hJF,/.1*-;u*:;+10$"303;R;/6@BE,9##YF,6*-6'<&O-#&Y76O-O-E';90$"3#&FDbr!#&@RD103@f6"$"341@968,/0Kq#&@Br
%U41O:68,/*-#&\mtu.1*:;+"3#5,9@/6;B,/;+(+*-,9.,9.10K541%0$@9*-"C6OYV#&41FD76@RE;9".10$%0$;fD10$;9"$@9*:YV03DQ1@90W>N*:#&41;RO-E
(+.1*-"."36YV0K#&10K#&@RD103@uO-#I(v03@u,9.76,/.10K*:o,903@9*-#&@;R".103%'0\
H0`"36H68O:;9#e#YF,6*-A,/.10`#&QV03@968,/#&@*-6j2V\§¥F@\ '41;R*:1<,/.F0[;9Q76"$00aN,/@/68Qs#&O:68,/*-#&*-D10C6F\
_#&1;R*:D10$@6`;R03"$#&1Dbr£#&@9D10$@fY16"÷o(6@RDbr!DF*-gs03@90$1"30=6Q1QF@9#Cab*:%68,/*-#&6Q1Q1O-*:0$D68,+1#ND1
0 øª¦&Û
Ý ¦
8 ä æÝÅP"&$Å&ÝŪø©¥ÝÅü#"Rçø~\æzîUß ç æz¥F\@''&ç
ß 9 Åü#" î ß
U
b#&OT>N*:1<Uq#&@uÝÅü#"v<&*T>&03;
¦
Ý
ÝÅü#"jä &ÝÅÙ$ÝÅP"ø îUßð8 ø]\dæzîUß T ç æz¥F\@'L?oç
¥ È
ß 9 Åü#"¤Ê
ÎNв±?ЫÊXÍ׳§ª\ÌPÙÚ Â'
41YF;R,/*T,/4F,9*:1<©,/.1*-;*:o,/#º,9.10;R03"3#1Dbr!#@9D10$@)"$03o,/0$@90$DåD1*Tgh0$@90$1"30Å#&QV03@968,/#@q#&@A6º;R03"$#&1D
b
D10$@9*->868,9*->0K6Q1Q1O-*:03D68,+F#bD10½ <&*->03;
¦
æ s
Ý çÅ ä æ ÝÅü#"&$ ÝŪøÆÝÅP"Rç æz¥F\@'LDoç
î ß
U
¦
Ý
ä ¥ÝÅP"&$ÅÝÅðøÆ&ÝÅ $ÅÝÅP"ø îUßð8
¥&îUß ,È
ß 9 Åü#"¤Ê
¦
Ý
ä æ Ý#ÅP"&$ Ý#ÅUçø 8 æz¥F\Õ? ç
¥&îUß ¥&îUß
ß79 Åü#"
(+.1*-".*-;u*:D10$5,9*:"36Oh,/#ëj2ë\V¥F\'8F\
®/´ µ ÀjÃ;¶·X3±4 ²
¦&\ãZ0$@9*->0[6d,/.F*:@9DNr!#&@RD103@n71*-,90Wr£D1*-gs03@R031"$0[6Q1Q1@R#CaF*-%d6l,/*:#,/#6dn7@9;B,KD103@R*->868,/*T>&0=*:,/.F0
q#&@R%
¦
æ Ýhçíuä æoÝNí)P ø~ÝNíP"høzºWÝNíLø ÝNí9ü#"Bç
î ß
U
¤L*-1De,/.10KO-0C6D1*-1<[03@R@9#&@,903@R%\
\ãZ0$@9*->0K6`n11*-,90Wr!DF*-gs03@90$1"30K68Q1Q1@9#Cab*:%68,9*:#&,9#6Un7@R;R,D10$@9*->868,9*->0*:e,/.10q#&@R%
¦
Væ Ýhçí)P"høÿæ Ýhçíuä æÝNí)P"ø~ºWÝNí^ø ÝbíRü#"Bç
î ß
U
¤L*-1De,/.10KO-0C6D1*-1<[03@R@9#&@,903@R%\
¥F\f0;9*:F<`6Uæ*-5,903@R*:#&@/çPQV#&*:o,%'03;R.JF(+@R*-,/0c#&4F,,9.10I¸X[%d68,9@9*-"303;_61D,9.10Ys#411D76@BEor
"$#&1D1*T,/*:#>&0$"$,9#&@Zq#&@9%'03DY5E41;9*-1<d,9.10U;9".F03%'0[D103@R*->&0$Dk*:25410$;R,/*-#& (+.10$kYs#,9.
Ý61D
# Ý H
ßk68@90<&*T>&0368,Pê[ä 681DÝ*:;u<*->&0$6l,Pê[ä b\
1\f+03QV0C68,25410$;R,/*-#& (+*T,/. ä \
b\ãZ0$@9*->0K6`n11*-,90Wr!DF*-gs03@90$1"30K68Q1Q1@9#Cab*:%68,9*:#&,9#6U,9.1*:@RDDF03@9*T>868,/*T>&0*:e,9.10q#&@9%
¦
æ ÝVçíuä æoÝNí)P ø~ÝNíP"ø~ºWÝNíLø ÝNí9ü#"hø]þCÝNíRü ç
î ß T
U
¤L*-1De,/.10KO-0C6D1*-1<[03@R@9#&@,903@R%\
!? Ç^ÈÉZÊcËmÌXÍÏÎ5ЫÑLÒÔÓÒ3ËmÌPÕzÖZÒÔÑ^Ñ^ÌXÍÌPÓMÇ^Ì«ÉZÊXÊXÍ×jØZÒBÙÉc˧ÒW×uÓZÚ
F\ãZ0$@9*->0K6["3#&%'Q76"W,=æ#&@+Üm6D0?< çn71*T,/0r!D1*Tgh0$@903F"30K6Q1QF@9#Cab*:%68,/*-#&d,/#'6[;90$"3#&FDD10$@9*->86lr
,9*->&0K*-,/.10q#&@R%
¦
æ ÝVçzí)P"øÿæ ÝVçzíjø~þ5æ ÝVçzí9ü#"jä æ5ÝNíP"ø~ÝbíLø]ºÝNí9ü#"Rç
î ß
U
¤L*-1De,/.10KO-0C6D1*-1<[03@R@9#&@,903@R%\
'b\¤L*-1D,9.10Z%'#bDF*-n70$Dd(6C>03541%UYV03@uq#&@X,/.10c#&Qs0$@/68,9#&@_DF03@9*T>&0$D*-d25410$;R,/*-#&A¦&\XÜjO:#8,_,/.F0
@R0C6O681De*:%6<&*-76@RE'Q768@R,/;_#q` h îUß>b;$\`7îUßq#&@ ml `7îUß l j \P_#&%'Q76@R0Z,/.10@R0C6O
Q768@R,u(+*-,9.e,/.768,#&Yb,6*-103Deq@9#% ,/.F0Kq#41@R,9.br!#&@RD103@u"$03o,/0$@90$D#&QV03@/6l,/#&@wæX
2ë\ë¥F\@8 5ç\
?F\+ifQ1Q1O:*-"C68,9*:#&d#qm,9.10K;90$"3#&1DNr!D10$@9*->868,9*->0w#Qs0$@/68,9#&@,/#[,/.F0Kq4F1"$,9*:#&þ [_ <&*->03;
þ [_
ä $ ` þ [_
ß
ifQ1Q1O:*-"C68,9*:#&d#q^6`D1*Tgh0$@903F"30K#&QV03@/6l,/#&@q#&@,9.10K;90$"3#&1DD103@R*->868,9*->&0<*->&0$;
a_ í e [_
æ þ çíuäX$]` h þ
,9.N4F;wDF0$n71*-1<e,/.10[%'#ND1*-n70$D(6C>03541%UYV03@` h q#@K6;903"$#&1D)D103@R*->868,9*->&0`68Q1Q1@9#Cab*:%6lr
,9*:#&\¤L*-1D
,9.10%'#bDF*-n70$D)(_6C>&03541%MYs0$@`q#@w,9.10d;R03"3#1Dbr!#@9D10$@U"30$5,903@R03D¬D1*-gs03@R031"$0
#&QV03@968,/#@`q#@6k;90$"3#&FDºD103@R*->868,9*->&08Jv,9.10F#&1"3#%Q768"$,'q#&41@R,9.br!#@9D10$@'#Qs0$@/68,9#&@æ j2ë\
¥F@\ &çJ16FD,/.10"$#&%Q16"$,q#41@R,9.br!#&@RD103@_#&Qs0$@/68,9#&@_DF03@9*T>&0$D*-e254103;B,/*:#F\XÜjO:#f
, ` h îUß
>N;3S \ `7îUßq#&@ m l `7îUß l j\
¦ \f_#&F;9*:DF03@v,9.10fq#O:O:#?(+*-1<K#&10Wr£;9*-D103DD1*-gs03@R031"$*:1<=;9".10$%0$;3JF(+.1*-".e6@R0fn7@R;R,Rr/Jb;R03"$#&1Dbr/J
6FD,9.1*:@RDbr!#&@RD103@$JF@R03;9QV03"W,/*T>&03OTEVÛ
æ ÝVçíuäÏæÝNí7$ÅÝbíP"BçHîUß
¤ *-1D,/.F0e%#ND1*-n103D(_6?>03541%UYV03@`q#&@U036".Æ#q+,/.10$;90;9".10$%0$;3\¬ÜjO:#,M,/.10e@R0C6Ou681D
L
*-%d6<*:76@BEQ768@R,/;M#qf` h îUßÆ>N;$\`7îUßÆq#@ ¹l `7î[ß l j\ãZ0$@9*->0,9.10d,!(v#AO:0C68D1*:1<
,903@9%';u*:e,9.10,/@94F1"C68,9*:#&0$@9@9#@+q#@u0C6".;9".10$%08\
Chapter 4
THE SEMI-DISCRETE
APPROACH
One strategy for obtaining nite-dierence approximations to a PDE is to start by
dierencing the space derivatives only, without approximating the time derivative.
In the following chapters, we proceed with an analysis making considerable use of
this concept, which we refer to as the semi-discrete approach. Dierencing the space
derivatives converts the basic PDE into a set of coupled ODE's. In the most general
notation, these ODE's would be expressed in the form
d~u = F~ (~u; t) (4.1)
dt
which includes all manner of nonlinear and time-dependent possibilities. On occasion,
we use this form, but the rest of this chapter is devoted to a more specialized matrix
notation described below.
Another strategy for constructing a nite-dierence approximation to a PDE is
to approximate all the partial derivatives at once. This generally leads to a point
dierence operator (see Section 3.3.1) which, in turn, can be used for the time advance
of the solution at any given point in the mesh. As an example let us consider the
model equation for diusion
@u = @ u 2
@t @x 2
Using three-point central-dierencing schemes for both the time and space derivatives,
we nd 2 n n +un 3
ujn ; ujn;
( +1) ( 1)
u
4 j ;
( )
2 u j
( ) ( )
j; 5
2h = +1
x 2
1
or
ujn = ujn; +
( +1) ( 1) 2h hu n ; 2u n + u n i
( ) ( ) ( )
(4.2)
x j 2 +1 j j; 1
51
52 CHAPTER 4. THE SEMI-DISCRETE APPROACH
Clearly Eq. 4.2 is a dierence equation which can be used at the space point j to
advance the value of u from the previous time levels n and n ; 1 to the level n + 1.
It is a full discretization of the PDE. Note, however, that the spatial and temporal
discretizations are separable. Thus, this method has an intermediate semi-discrete
form and can be analyzed by the methods discussed in the next few chapters.
Another possibility is to replace the value of ujn in the right hand side of Eq. 4.2
( )
with the time average of u at that point, namely (ujn + ujn; )=2. This results in
( +1) ( 1)
the formula
2 0 1 3
un + ujn; A n 5
= ujn; + 2h 4ujn ; 2 @ j
( +1) ( 1)
ujn
( +1) ( 1) ( )
+ uj ; ( )
(4.3)
x 2 +1
2 1
which can be solved for u n and time advanced at the point j . In this case, the
( +1)
spatial and temporal discretizations are not separable, and no semi-discrete form
exists.
Equation 4.2 is sometimes called Richardson's method of overlapping steps and
Eq. 4.3 is referred to as the DuFort-Frankel method. As we shall see later on, there
are subtle points to be made about using these methods to nd a numerical solution
to the diusion equation. There are a number of issues concerning the accuracy,
stability, and convergence of Eqs. 4.2 and 4.3 which we cannot comment on until we
develop a framework for such investigations. We introduce these methods here only to
distinguish between methods in which the temporal and spatial terms are discretized
separately and those for which no such separation is possible. For the time being, we
shall separate the space dierence approximations from the time dierencing. In this
approach, we reduce the governing PDE's to ODE's by discretizing the spatial terms
and use the well-developed theory of ODE solutions to aid us in the development of
an analysis of accuracy and stability.
~ ) vector.
with Dirichlet boundary conditions folded into the (bc
The inverse is the left-hand eigenvector matrix, and together they have the property
that
X ; AX =
1
(4.8)
where is a diagonal matrix whose elements are the eigenvalues of A.
4.2. EXACT SOLUTIONS OF LINEAR ODE'S 55
Defective Systems
If an M M matrix does not have a complete set of linearly independent eigenvectors,
it cannot be transformed to a diagonal matrix of scalars, and it is said to be defective.
It can, however, be transformed to a diagonal set of blocks, some of which may be
scalars (see Appendix A). In general, there exists some S which transforms any
matrix A such that
S ; AS = J
1
where 2J 3
66 J 77
1
66 2
. .. 77
J =6 77
64 Jm 5
...
and 2 1 3
m 1.
66 m . . . 7
7 ..
Jmn = 66
( ) 7
. . . 1 5 ...
7
4
m n
The matrix J is said to be in Jordan canonical form, and an eigenvalue with multi-
plicity n within a Jordan block is said to be a defective eigenvalue. Defective systems
play a role in numerical stability analysis.
Second-Order Equations
The homogeneous form of a second-order equation is given by
d u + a du + a u = 0
2
(4.11)
dt dt 2 1 0
where a and a are complex constants. Now we introduce the dierential operator
1 0
D such that
D dtd
and factor u(t) out of Eq. 4.11, giving
(D + a D + a ) u(t) = 0
2
1 0
P () = + a + a = 0 2
1 (4.12)
0
where c and c are constants determined from initial conditions. The proof of this
1 2
is simple and is found by substituting Eq. 4.13 into Eq. 4.11. One nds the result
c e1 t ( + a + a ) + c e2 t ( + a + a )
1
2
1 1 1 0 2
2
2 1 2 0
which is identically zero for all c , c , and t if and only if the 's satisfy Eq. 4.12.
1 2
u0 = a u + a u
2 21 1(4.14) 22 2
u = c x e1 t + c x e2 t
2 1 21 (4.15) 2 22
u0 = 2u (4.17)
1
A Defective System
If A is defective, then it can be represented by the Jordan canonical form
" # " #" #
u0 = 0 u
1 1
(4.18)
u02 1 u 2
whose solution is not obvious. However, in this case, one can solve the top equation
rst, giving u (t) = u (0)et . Then, substituting this result into the second equation,
1 1
one nds
du = u + u (0)et
2
dt 2 1
is a solution to 2 03 2 32 3
64 u0 75 = 64 1 75 64 uu 75
u 1 1
2
2
u03 1 u 3
if
a = u (0) ; b = u (0) ; c = 21 u (0)
3 2 1 (4.19)
The general solution to such defective systems is left as an exercise.
4.2. EXACT SOLUTIONS OF LINEAR ODE'S 59
4.2.4 General Solution of Coupled ODE's with Complete Eigen-
systems
Let us consider a set of coupled, nonhomogeneous, linear, rst-order ODE's with
constant coecients which might have been derived by space dierencing a set of
PDE's. Represent them by the equation
d~u = A~u ; ~f (t) (4.20)
dt
Our assumption is that the M M matrix A has a complete eigensystem and can 1
matrix having diagonal elements which are the eigenvalues of A, see Section 4.2.1.
Now let us multiply Eq. 4.20 from the left by X ; and insert the identity combination
1
~
X ; ddtu = X ; AX X ; ~u ; X ; ~f (t)
1 1 1 1
(4.21)
Since A is independent of both ~u and t, the elements in X ; and X are also indepen-
1
dt
Finally, by introducing the new variables w~ and ~g such that
w~ = X ; ~u ; ~g(t) = X ; ~f (t)
1 1
(4.22)
we reduce Eq. 4.20 to a new algebraic form
dw~ = w~ ; ~g(t) (4.23)
dt
It is important at this point to review the results of the previous paragraph. Notice
that Eqs. 4.20 and 4.23 are expressing exactly the same equality. The only dierence
between them was brought about by algebraic manipulations which regrouped the
variables. However, this regrouping is crucial for the solution process because Eqs.
1In the following, we exclude defective systems, not because they cannot be analyzed (the example
at the conclusion of the previous section proves otherwise), but because they are only of limited
interest in the general development of our theory.
60 CHAPTER 4. THE SEMI-DISCRETE APPROACH
4.23 are no longer coupled. They can be written line by line as a set of independent,
single, rst-order equations, thus
w0 = w ; g (t)
1 1 1 1
...
wm0 = mwm ; gm (t)
...
wM0 = M wM ; gM (t) (4.24)
For any given set of gm (t) each of these equations can be solved separately and then
recoupled, using the inverse of the relations given in Eqs. 4.22:
~u(t) = X w~ (t)
X
M
= wm(t)~xm (4.25)
m=1
where ~xm is the m'th column of X , i.e., the eigenvector corresponding to m .
We next focus on the very important subset of Eq. 4.20 when neither A nor ~f has
any explicit dependence on t. In such a case, the gm in Eqs. 4.23 and 4.24 are also
time invariant and the solution to any line in Eq. 4.24 is
wm (t) = cm em t + 1 gm
m
where the cm are constants that depend on the initial conditions. Transforming back
to the u-system gives
~u(t) = X w~ (t)
X
M
= wm(t)~xm
m=1
XM XM 1
= cm em t ~xm +
gm~xm
m =1 m m =1
XM
= cm em t ~xm + X ; X ; ~f 1 1
m=1
XM
= cm em t ~xm + A; ~f 1
m=1
| {z } | {z } (4.26)
Transient Steady-state
4.3. REAL SPACE AND EIGENSPACE 61
Note that the steady-state solution is A; ~f , as might be expected.
1
The rst group of terms on the right side of this equation is referred to classically
as the complementary solution or the solution of the homogeneous equations. The
second group is referred to classically as the particular solution or the particular
integral. In our application to
uid dynamics, it is more instructive to refer to these
groups as the transient and steady-state solutions, respectively. An alternative, but
entirely equivalent, form of the solution is
~u(t) = c e1 t ~x + + cmem t ~xm + + cM eM t ~xM + A; ~f
1 1
1
(4.27)
w~ = X ; ~u 1 ~u = X w~
~g = X ; ~f1 ~f = X~g
The elements of ~u relate directly to the local physics of the problem. However, the
elements of w~ are linear combinations of all of the elements of ~u, and individually
they have no direct local physical interpretation.
When the forcing function ~f is independent of t, the solutions in the two spaces
are represented by
~u(t) = X cm em t ~xm + X ; X ; ~f1 1
and
wm(t) = cm em t + 1 gm ; m = 1; 2; ; M
m
for real space and eigenspace, respectively. At this point we make two observations:
1. the transient portion of the solution in real space consists of a linear combination
of contributions from each eigenvector, and
2. the transient portion of the solution in eigenspace provides the weighting of
each eigenvector component of the transient solution in real space.
= ; 4 sin
2 m ; m = 1; 2; ; M (4.29)
x
2
2(M + 1)
and, from Section B.4, for the model biconvection equation
; ia 2m
m = x sin M m = 0; 1; ; M ; 1
= ;im a m = 0; 1; ; M ; 1 (4.30)
where
m x
m = sin m = 0; 1; ; M ; 1 (4.31)
x
is the modied wavenumber from Section 3.5, m = m, and x = 2=M . Notice
that the diusion eigenvalues are real and negative while those representing periodic
convection are all pure imaginary. The interpretation of this result plays a very
important role later in our stability analysis.
3 3 3 3
sin (x ) sin (2x ) sin (3x ) sin (4x )
4 4 4 4
The columns of the matrix are proportional to the eigenvectors. Recall that xj =
j x = j=(M + 1), so in general the relation ~u = X w~ can be written as
X
M
uj = wm sin mxj ; j = 1; 2; ; M (4.32)
m=1
64 CHAPTER 4. THE SEMI-DISCRETE APPROACH
For the inverse, or left-hand eigenvector matrix X ; , we nd 1
64 sin (3x )1 2
sin (3x )
3
sin (3x )
4
sin (3x ) 5
1 2 3 4
sin (4x )1 sin (4x )
2 sin (4x )
3 sin (4x )
4
gives
X
M
wm = uj sin mxj ; m = 1; 2; ; M (4.33)
j =1
In the eld of harmonic analysis, Eq. 4.33 represents a sine transform of the func-
tion u(x) for an M -point sample between the boundaries x = 0 and x = with the
condition u(0) = u() = 0. Similarly, Eq. 4.32 represents the sine synthesis that
companions the sine transform given by Eq. 4.33. In summary,
space.
~u = X w~ is a sine synthesis from wave space back to real
space.
3 3
w 4 1 e; i= e; i= e; i=
6 4 12 4 18 4
u4
In general
1 MX ; 1
wm = M uj e;imxj ; m = 0; 1; ; M ; 1
j =0
wave space.
~u = X w~ is a complex Fourier synthesis from wave space
back to real space.
4.5 Problems
1. Consider the nite-dierence operator derived in question 1 of Chapter 3. Using
this operator to approximate the spatial derivative in the linear convection equa-
tion, write the semi-discrete form obtained with periodic boundary conditions
on a 5-point grid (M = 5).
2. Consider the application of the operator given in Eq. 3.52 to the 1-D diusion
equation with Dirichlet boundary conditions. Write the resulting semi-discrete
ODE form. Find the entries in the boundary-condition vector.
3. Write the semi-discrete form resulting from the application of second-order cen-
tered dierences to the following equation on the domain 0 x 1 with
boundary conditions u(0) = 0, u(1) = 1:
@u = @ u ; 6x
2
@t @x 2
4.5. PROBLEMS 69
4. Consider a grid with 10 interior points spanning the domain 0 x . For
initial conditions u(x; 0) = sin(mx) and boundary conditions u(0; t) = u(; t) =
0, plot the exact solution of the diusion equation with = 1 at t = 1 with
m = 1 and m = 3. (Plot the solution at the grid nodes only.) Calculate the
corresponding modied wavenumbers for the second-order centered operator
from Eq. 4.37. Calculate and plot the corresponding ODE solutions.
5. Consider the matrix
A = ;Bp(10; ;1; 0; 1)=(2x)
corresponding to the ODE form of the biconvection equation resulting from the
application of second-order central dierencing on a 10-point grid. Note that
the domain is 0 x 2 and x = 2=10. The grid nodes are given by
xj = j x; j = 0; 1; : : : 9. The eigenvalues of the above matrix A, as well as the
matrices X and X ; , can be found from Appendix B.4. Using these, compute
1
and plot the ODE solution at t = 2 for the initial condition u(x; 0) = sin x.
Compare with the exact solution of the PDE. Calculate the numerical phase
speed from the modied wavenumber corresponding to this initial condition
and show that it is consistent with the ODE solution. Repeat for the initial
condition u(x; 0) = sin 2x.
70 CHAPTER 4. THE SEMI-DISCRETE APPROACH
Chapter 5
FINITE-VOLUME METHODS
We will begin by presenting the basic concepts which apply to nite-volume strategies.
Next we will give our model equations in the form of Eq. 5.1. This will be followed
by several examples which hopefully make these concepts clear.
71
72 CHAPTER 5. FINITE-VOLUME METHODS
5.1 Basic Concepts
The basic idea of a nite-volume method is to satisfy the integral form of the con-
servation law to some degree of approximation for each of many contiguous control
volumes which cover the domain of interest. Thus the volume V in Eq. 5.1 is that of a
control volume whose shape is dependent on the nature of the grid. In our examples,
we will consider only control volumes which do not vary with time. Examining Eq.
5.1, we see that several approximations must be made. The
ux is required at the
boundary of the control volume, which is a closed surface in three dimensions and a
closed contour in two dimensions. This
ux must then be integrated to nd the net
ux through the boundary. Similarly, the source term P must be integrated over the
control volume. Next a time-marching method1 can be applied to nd the value of
Z
V
QdV (5.2)
at the next time step.
Let us consider these approximations in more detail. First, we note that the
average value of Q in a cell with volume V is
1 Z
Q V QdV (5.3)
V
and Eq. 5.1 can be written as
I Z
V dtd Q + S n:FdS = V PdV (5.4)
for a control volume which does not vary with time. Thus after applying a time-
marching method, we have updated values of the cell-averaged quantities Q . In order
to evaluate the
uxes, which are a function of Q, at the control-volume boundary, Q
can be represented within the cell by some piecewise approximation which produces
the correct value of Q . This is a form of interpolation often referred to as recon-
struction. As we shall see in our examples, each cell will have a dierent piecewise
approximation to Q. When these are used to calculate F(Q), they will generally
produce dierent approximations to the
ux at the boundary between two control
volumes, that is, the
ux will be discontinuous. A nondissipative scheme analogous
to centered dierencing is obtained by taking the average of these two
uxes. Another
approach known as
ux-dierence splitting is described in Chapter 11.
The basic elements of a nite-volume method are thus the following:
1 Time-marching methods will be discussed in the next chapter.
5.2. MODEL EQUATIONS IN INTEGRAL FORM 73
1. Given the value of Q for each control volume, construct an approximation to
Q(x; y; z) in each control volume. Using this approximation, nd Q at the
control-volume boundary. Evaluate F(Q) at the boundary. Since there is a
distinct approximation to Q(x; y; z) in each control volume, two distinct values
of the
ux will generally be obtained at any point on the boundary between two
control volumes.
2. Apply some strategy for resolving the discontinuity in the
ux at the control-
volume boundary to produce a single value of F(Q) at any point on the bound-
ary. This issue is discussed in Section 11.4.2.
3. Integrate the
ux to nd the net
ux through the control-volume boundary
using some sort of quadrature.
4. Advance the solution in time to obtain new values of Q .
The order of accuracy of the method is dependent on each of the approximations.
These ideas should be claried by the examples in the remainder of this chapter.
In order to include diusive
uxes, the following relation between rQ and Q is
sometimes used: Z I
V
rQdV = nQdSS
(5.5)
or, in two dimensions, Z I
A
rQdA = C nQdl (5.6)
where the unit vector n points outward from the surface or contour.
∆ x
and
f^j;1=2 = 21 [f (uLj;1=2) + f (uRj;1=2)]
= 1 (;uj+1 + 7uj + 7uj;1 ; uj;2) (5.41)
12
Substituting these expressions into the integral form, Eq. 5.23, gives
x ddtuj + 121 (;u + 8u ; 8u + u ) = 0
j +2 j +1 j ;1 j ;2 (5.42)
This is a fourth-order approximation to the integral form of the equation, as can be
veried using Taylor series expansions (see question 1 at the end of this chapter).
With periodic boundary conditions, the following semi-discrete form is obtained:
d~u = ; 1 B (1; ;8; 0; 8; ;1)~u (5.43)
dt 12x p
This is a system of ODE's governing the evolution of the cell-average data.
p 1
d l a
4 ∆
0
5
e f
where we have ignored the source term. The contour in the line integral is composed
of the sides of the hexagon. Since these sides are all straight, the unit normals can
be taken outside the integral and the
ux balance is given by
d Z Q dA + X 5 Z
dt A n Fdl = 0
=0
where indexes a side of the hexagon, as shown in Figure 5.2. A list of the normals
for the mesh orientation shown is given in Table 5.1.
5.5 Problems
1. Use Taylor series to verify that Eq. 5.42 is a fourth-order approximation to Eq.
5.23.
2. Find the semi-discrete ODE form governing the cell-average data resulting from
the use of a linear approximation in developing a nite-volume method for the
linear convection equation. Use the following linear approximation:
u( ) = a + b
84 CHAPTER 5. FINITE-VOLUME METHODS
where b = uj and
; uj;1
a = uj+12 x
and use the average
ux at the cell interface.
3. Using the rst approach given in Section 5.3.3, derive a nite-volume approx-
imation to the spatial terms in the two-dimensional diusion equation on a
square grid.
4. Repeat question 3 for a grid consisting of equilateral triangles.
Chapter 6
TIME-MARCHING METHODS
FOR ODE'S
After discretizing the spatial derivatives in the governing PDE's (such as the Navier-
Stokes equations), we obtain a coupled system of nonlinear ODE's in the form
d~u = F~ (~u; t) (6.1)
dt
These can be integrated in time using a time-marching method to obtain a time-
accurate solution to an unsteady
ow problem. For a steady
ow problem, spatial
discretization leads to a coupled system of nonlinear algebraic equations in the form
F~ (~u) = 0 (6.2)
As a result of the nonlinearity of these equations, some sort of iterative method is
required to obtain a solution. For example, one can consider the use of Newton's
method, which is widely used for nonlinear algebraic equations (See Section 6.10.3.).
This produces an iterative method in which a coupled system of linear algebraic
equations must be solved at each iteration. These can be solved iteratively using
relaxation methods, which will be discussed in Chapter 9, or directly using Gaussian
elimination or some variation thereof.
Alternatively, one can consider a time-dependent path to the steady state and use
a time-marching method to integrate the unsteady form of the equations until the
solution is suciently close to the steady solution. The subject of the present chapter,
time-marching methods for ODE's, is thus relevant to both steady and unsteady
ow
problems. When using a time-marching method to compute steady
ows, the goal is
simply to remove the transient portion of the solution as quickly as possible; time-
accuracy is not required. This motivates the study of stability and stiness, topics
which are covered in the next two chapters.
85
86 CHAPTER 6. TIME-MARCHING METHODS FOR ODE'S
Application of a spatial discretization to a PDE produces a coupled system of
ODE's. Application of a time-marching method to an ODE produces an ordinary
dierence equation (OE ). In earlier chapters, we developed exact solutions to our
model PDE's and ODE's. In this chapter we will present some basic theory of linear
OE's which closely parallels that for linear ODE's, and, using this theory, we will
develop exact solutions for the model OE's arising from the application of time-
marching methods to the model ODE's.
6.1 Notation
Using the semi-discrete approach, we reduce our PDE to a set of coupled ODE's
represented in general by Eq. 4.1. However, for the purpose of this chapter, we need
only consider the scalar case
du = u0 = F (u; t) (6.3)
dt
Although we use u to represent the dependent variable, rather than w, the reader
should recall the arguments made in Chapter 4 to justify the study of a scalar ODE.
Our rst task is to nd numerical approximations that can be used to carry out the
time integration of Eq. 6.3 to some given accuracy, where accuracy can be measured
either in a local or a global sense. We then face a further task concerning the numerical
stability of the resulting methods, but we postpone such considerations to the next
chapter.
In Chapter 2, we introduced the convention that the n subscript, or the (n) su-
perscript, always points to a discrete time value, and h represents the time interval
t. Combining this notation with Eq. 6.3 gives
u0n = Fn = F (un; tn) ; tn = nh
Often we need a more sophisticated notation for intermediate time steps involving
temporary calculations denoted by u~, u, etc. For these we use the notation
u~0n+ = F~n+ = F (~un+; tn + h)
The choice of u0 or F to express the derivative in a scheme is arbitrary. They are
both commonly used in the literature on ODE's.
The methods we study are to be applied to linear or nonlinear ODE's, but the
methods themselves are formed by linear combinations of the dependent variable and
its derivative at various time intervals. They are represented conceptually by
un+1 = f 1 u0n+1; 0u0n; ;1u0n;1; ; 0un; ;1un;1; (6.4)
6.2. CONVERTING TIME-MARCHING METHODS TO OE'S 87
With an appropriate choice of the 0s and 0s, these methods can be constructed
to give a local Taylor series accuracy of any order. The methods are said to be
explicit if 1 = 0 and implicit otherwise. An explicit method is one in which the new
predicted solution is only a function of known data, for example, u0n, u0n;1, un; and
un;1 for a method using two previous time levels, and therefore the time advance is
simple. For an implicit method, the new predicted solution is also a function of the
time derivative at the new time level, that is, u0n+1. As we shall see, for systems of
ODE's and nonlinear problems, implicit methods require more complicated strategies
to solve for un+1 than explicit methods.
which must be zero for all u1 and u2. Again we are led to a characteristic polynomial,
this time having the form P (E ) = det [ C ; E I ]. The -roots are found from
(c ; ) c
P () = det 11 12
c21 (c22 ; ) = 0
6.4. SOLUTION OF THE REPRESENTATIVE OE'S 91
Obviously the k are the eigenvalues of C and, following the logic of Section 4.2,
~
if x are its eigenvectors, the solution of Eq. 6.17 is
~un = X ck (k )n~xk
2
k=1
where ck are constants determined by the initial conditions.
A Defective System
The solution of OE's with defective eigensystems follows closely the logic in Section
4.2.2 for defective ODE's. For example, one can show that the solution to
2 3 2 32 3
64 u^n+1 75 = 64 1 75 64 uu^nn 75
un+1
un+1 1 un
is
un = uh0n i
u^n = u^0 + u0n;1 n
" #
;1 n( n
un = u0 + u^0n + u0 2 n; 1) ; 2 (6.18)
where the cm and the ~xm in the two equations are identical and m = (1 + m h).
Comparing Eq. 6.27 and Eq. 6.28, we see a correspondence between m and em h.
Since the value of eh can be expressed in terms of the series
Now we notice that each produces two -roots. For one of these we nd
q
m = mh + 1 + 2mh2 (6.31)
= 1 + mh + 21 2m h2 ; 18 4mh4 + (6.32)
3 3
q is 2an2 approximation to e m with an error O( h ). The other root, mh ;
This h
1 + mh , will be discussed in Section 6.5.3.
2 Based on Section 4.4.
3 The error is O(2 h2 ).
6.5. THE ; RELATION 95
6.5.2 The Principal -Root
Based on the above we make the following observation:
Application of the same time-marching method to all of the equations in
a coupled system linear ODE's in the form of Eq. 4.6, always produces
one -root for every -root that satises the relation
k+1 (6.33)
1 2 2 1
= 1 + h + 2 h + + k! h + O h
k k
and the solution to the representative OE's, including only the contribution from
the principal root, which can be written as
h
un = c1 (1)n + aehn Q(eh ) (6.39)
P (e )
where
co = hlim h( ; )
!0 P eh
and
" !#
Er! N !h ; tan;1 ((1))i
1r
; 1
= !T ; N tan [(1)i =(1)r ] (6.50)
102 CHAPTER 6. TIME-MARCHING METHODS FOR ODE'S
Global error in the particular solution
Finally, the global error in the particular solution follows naturally by comparing the
solutions to the ODE and the OE. It can be measured by
Q eh
Er ( ; ) h ; 1
P e
6.7.2 Examples
There are many special explicit and implicit forms of linear multistep methods. Two
well-known families of them, referred to as Adams-Bashforth (explicit) and Adams-
Moulton (implicit), can be designed using the Taylor table approach of Section 3.4.
The Adams-Moulton family is obtained from Eq. 6.51 with
1 = 1; 0 = ;1; k = 0; k = ;1; ;2; (6.53)
The Adams-Bashforth family has the same 's with the additional constraint that
1 = 0. The three-step Adams-Moulton method can be written in the following form
un+1 = un + h(1u0n+1 + 0 u0n + ;1 u0n;1 + ;2u0n;2) (6.54)
A Taylor table for Eq. 6.54 can be generated as
un h u0n h2 u00n h3 u000n h4 u0000
n
un+1 1 1 1 1 1
2 6 24
;un ;1
;h1 u0n+1 ;1 ;1 ;1 21 ;1 16
;h0 u0n ; 0
;h;1 un;1
0 ;;1 ;1 ;;1 21 ;1 61
;h;2 u0n;2 ;(;2)0 ;2 ;(;2)1 ;2 ;(;2)2 ;2 21 ;(;2)3 ;2 16
Table 6.1. Taylor table for the Adams-Moulton three-step linear multistep method.
104 CHAPTER 6. TIME-MARCHING METHODS FOR ODE'S
This leads to the linear system
2 1 1 1 1 32 3 2 1 3
66 2 0 ;2 ;4 77 66 10 77 66 1 77
64 3 0 3 12 75 64 75 = 64 1 75 (6.55)
;1
4 0 ;4 ;32 ;2 1
to solve for the 's, resulting in
1 = 9=24; 0 = 19=24; ;1 = ;5=24; ;2 = 1=24 (6.56)
which produces a method which is fourth-order accurate.4 With 1 = 0 one obtains
2 32 3 2 3
1 1 1
64 0 ;2 ;4 75 64 ;1 75 = 64 11 75
0
(6.57)
0 3 12 ;2 1
giving
0 = 23=12; ;1 = ;16=12; ;2 = 5=12 (6.58)
This is the third-order Adams-Bashforth method.
A list of simple methods, some of which are very common in CFD applications,
is given below together with identifying names that are sometimes associated with
them. In the following material AB(n) and AM(n) are used as abbreviations for the
(n)th order Adams-Bashforth and (n)th order Adams-Moulton methods. One can
verify that the Adams type schemes given below satisfy Eqs. 6.55 and 6.57 up to the
order of the method.
Explicit Methods
un+1 = un + hu0n Euler
un+1 0
= un;1 + 2hhun Leapfrog
1 i
un+1 = un + 2 h 3un ; un;1
0 0 AB2
h
h 23u0n ; 16u0n;1 + 5u0n;2 i
un+1 = un + 12 AB3
Implicit Methods
un+1 = un + hu0nh+1 i Implicit Euler
un+1 1
= unh + 2 h u0n + u0n+1 i Trapezoidal (AM2)
un+1 1
= 3 4un ; un;1 + 2hun+1 0
h h 0 i 2nd-order Backward
un+1 = un + 12 5un+1 + 8un ; un;1
0 0 AM3
4 Recall from Section 6.5.2 that a kth-order time-marching method has a leading truncation error
term which is O(hk+1 ).
6.7. LINEAR MULTISTEP METHODS 105
6.7.3 Two-Step Linear Multistep Methods
High resolution CFD problems usually require very large data sets to store the spatial
information from which the time derivative is calculated. This limits the interest
in multistep methods to about two time levels. The most general two-step linear
multistep method (i.e., K=2 in Eq. 6.51), that is at least rst-order accurate, can be
written as
h i
(1 + )un+1 = [(1 + 2 )un ; un;1] + h u0n+1 + (1 ; + ')u0n ; 'u0n;1 (6.59)
Clearly the methods are explicit if = 0 and implicit otherwise. A list of methods
contained in Eq. 6.59 is given in Table 6.2. Notice that the Adams methods have
= 0, which corresponds to ;1 = 0 in Eq. 6.51. Methods with = ;1=2, which
corresponds to 0 = 0 in Eq. 6.51, are known as Milne methods.
Table 6.2. Some linear one- and two-step methods, see Eq. 6.59.
One can show after a little algebra that both er and er are reduced to 0(h3)
(i.e., the methods are 2nd-order accurate) if
' = ; + 21
The class of all 3rd-order methods is determined by imposing the additional constraint
= 2 ; 56
Finally a unique fourth-order method is found by setting = ;' = ;=3 = 61 .
106 CHAPTER 6. TIME-MARCHING METHODS FOR ODE'S
6.8 Predictor-Corrector Methods
There are a wide variety of predictor-corrector schemes created and used for a variety
of purposes. Their use in solving ODE's is relatively easy to illustrate and understand.
Their use in solving PDE's can be much more subtle and demands concepts5 which
have no counterpart in the analysis of ODE's.
Predictor-corrector methods constructed to time-march linear or nonlinear ODE's
are composed of sequences of linear multistep methods, each of which is referred to
as a family in the solution process. There may be many families in the sequence, and
usually the nal family has a higher Taylor-series order of accuracy than the inter-
mediate ones. Their use is motivated by ease of application and increased eciency,
where measures of eciency are discussed in the next two chapters.
A simple one-predictor, one-corrector example is given by
u~n+ = un + hu 0
h n0 i
un+1 = un + h u~n+ +
u0n (6.60)
where the parameters ; and
are arbitrary parameters to be determined. One
can analyze this sequence by applying it to the representative equation and using
the operational techniques outlined in Section 6.4. It is easy to show, following the
example leading to Eq. 6.26, that
h i
P (E ) = E E ; 1 ; (
+ )h ; 2h2 (6.61)
Q(E ) = E h [E +
+ h] (6.62)
Considering only local accuracy, one is led, by following the discussion in Section 6.6,
to the following observations. For the method to be second-order accurate both er
and er must be O(h3). For this to hold for er, it is obvious from Eq. 6.61 that
+ = 1 ; = 21
which provides two equations for three unknowns. The situation for er requires some
algebra, but it is not dicult to show using Eq. 6.44 that the same conditions also
make it O(h3). One concludes, therefore, that the predictor-corrector sequence
u~n+ = un + hu0n 2 ; 1
1 1
un+1 = un + 2 h u~n+ + u0n
0 (6.63)
is a second-order accurate method for any .
5 Such as alternating direction, fractional-step, and hybrid methods.
6.9. RUNGE-KUTTA METHODS 107
A classical predictor-corrector sequence is formed by following an Adams-Bashforth
predictor of any order with an Adams-Moulton corrector having an order one higher.
The order of the combination is then equal to the order of the corrector. If the order
of the corrector is (k), we refer to these as ABM(k) methods. The Adams-Bashforth-
Moulton sequence for k = 3 is
h i
u~n+1 = un + 21 h 3u0n ; u0n;1
un+1 = un + 12 h h5~u0 + 8u0 ; u0 i (6.64)
n+1 n n;1
Some simple, specic, second-order accurate methods are given below. The Gazdag
method, which we discuss in Chapter 8, is
h i
u~n+1 = un + 21 h 3~u0n ; u~0n;1
h i
un+1 = un + 12 h u~0n + u~0n+1 (6.65)
The Burstein method, obtained from Eq. 6.63 with = 1=2 is
u~n+1=2 = un + 21 hu0n
un+1 = un + hu~0n+1=2 (6.66)
and, nally, MacCormack's method, presented earlier in this chapter, is
u~n+1 = un + hu0n
un+1 = 21 [un + u~n+1 + hu~0n+1] (6.67)
Note that MacCormack's method can also be written as
u~n+1 = un + hu0n
un+1 = un + 12 h[u0n + u~0n+1] (6.68)
from which it is clear that it is obtained from Eq. 6.63 with = 1.
F~ (~u) = F~ n + An ~u ; ~un + O(h2) (6.105)
where t ; tn and the argument for O(h2) is the same as in the derivation of Eq. 6.88.
Using this we can write the local linearization of Eq. 6.102 as
6.11 Problems
1. Find an expression for the nth term in the Fibonacci series, which is given
by 1; 1; 2; 3; 5; 8; : : : Note that the series can be expressed as the solution to a
dierence equation of the form un+1 = un + un;1. What is u25 ? (Let the rst
term given above be u0.)
118 CHAPTER 6. TIME-MARCHING METHODS FOR ODE'S
2. The trapezoidal method un+1 = un + 21 h(u0n+1 + u0n) is used to solve the repre-
sentative ODE.
(a) What is the resulting OE?
(b) What is its exact solution?
(c) How does the exact steady-state solution of the OE compare with the
exact steady-state solution of the ODE if = 0?
3. The 2nd-order backward method is given by
h i
un+1 = 31 4un ; un;1 + 2hu0n+1
(a) Write the OE for the representative equation. Identify the polynomials
P (E ) and Q(E ).
(b) Derive the - relation. Solve for the -roots and identify them as principal
or spurious.
(c) Find er and the rst two nonvanishing terms in a Taylor series expansion
of the spurious root.
(d) Perform a -root trace relative to the unit circle for both diusion and
convection.
4. Consider the time-marching scheme given by
un+1 = un;1 + 23h (u0n+1 + u0n + u0n;1)
(a) Write the OE for the representative equation. Identify the polynomials
P (E ) and Q(E ).
(b) Derive the ; relation.
(c) Find er .
5. Find the dierence equation which results from applying the Gazdag predictor-
corrector method (Eq. 6.65) to the representative equation. Find the - rela-
tion.
6. Consider the following time-marching method:
u~n+1=3 = un + hu0n=3
un+1=2 = un + hu~0n+1=3 =2
un+1 = un + hu0n+1=2
6.11. PROBLEMS 119
Find the dierence equation which results from applying this method to the
representative equation. Find the - relation. Find the solution to the dier-
ence equation, including the homogeneous and particular solutions. Find er
and er . What order is the homogeneous solution? What order is the particular
solution? Find the particular solution if the forcing term is xed.
7. Write a computer program to solve the one-dimensional linear convection equa-
tion with periodic boundary conditions and a = 1 on the domain 0 x 1.
Use 2nd-order centered dierences in space and a grid of 50 points. For the
initial condition, use
u(x; 0) = e;0:5[(x;0:5)=]2
with = 0:08. Use the explicit Euler, 2nd-order Adams-Bashforth (AB2), im-
plicit Euler, trapezoidal, and 4th-order Runge-Kutta methods. For the explicit
Euler and AB2 methods, use a Courant number, ah=x, of 0.1; for the other
methods, use a Courant number of unity. Plot the solutions obtained at t = 1
compared to the exact solution (which is identical to the initial condition).
8. Repeat problem 7 using 4th-order (noncompact) dierences in space. Use only
4th-order Runge-Kutta time marching at a Courant number of unity. Show
solutions at t = 1 and t = 10 compared to the exact solution.
9. Using the computer program written for problem 7, compute the solution at
t = 1 using 2nd-order centered dierences in space coupled with the 4th-order
Runge-Kutta method for grids of 100, 200, and 400 nodes. On a log-log scale,
plot the error given by
v
u
u X
t (uj ;Muj )
M exact 2
u
j =1
where M is the number of grid nodes and uexact is the exact solution. Find the
global order of accuracy from the plot.
10. Using the computer program written for problem 8, repeat problem 9 using
4th-order (noncompact) dierences in space.
11. Write a computer program to solve the one-dimensional linear convection equa-
tion with in
ow-out
ow boundary conditions and a = 1 on the domain 0
x 1. Let u(0; t) = sin !t with ! = 10. Run until a periodic steady state
is reached which is independent of the initial condition and plot your solution
120 CHAPTER 6. TIME-MARCHING METHODS FOR ODE'S
compared with the exact solution. Use 2nd-order centered dierences in space
with a 1st-order backward dierence at the out
ow boundary (as in Eq. 3.69)
together with 4th-order Runge-Kutta time marching. Use grids with 100, 200,
and 400 nodes and plot the error vs. the number of grid nodes, as described in
problem 9. Find the global order of accuracy.
12. Repeat problem 11 using 4th-order (noncompact) centered dierences. Use a
third-order forward-biased operator at the in
ow boundary (as in Eq. 3.67). At
the last grid node, derive and use a 3rd-order backward operator (using nodes
j ; 3, j ; 2, j ; 1, and j ) and at the second last node, use a 3rd-order backward-
biased operator (using nodes j ; 2, j ; 1, j , and j +1; see problem 1 in Chapter
3).
13. Using the approach described in Section 6.6.2, nd the phase speed error, erp,
and the amplitude error, era , for the combination of second-order centered dif-
ferences and 1st, 2nd, 3rd, and 4th-order Runge-Kutta time-marching at a
Courant number of unity. Also plot the phase speed error obtained using exact
integration in time, i.e., that obtained using the spatial discretization alone.
Note that the required -roots for the various Runge-Kutta methods can be
deduced from Eq. 6.69, without actually deriving the methods. Explain your
results.
!"$#&%('*)",+-".0/&.21(3154768/&%(9".:'2.:/<;.26="$.:/&>?!#@6A.2BDC"':E"1#=F"".0G!#86&%('H%(?)I)"$CJ$")"6K1(/&>?
C-%(#L/&.:M!F"'2%(#NC">"$"1BD!"1O9J$.2"PM$1"6A.:)"!#8!)RQS<O/&>?M!%(6A31(4K/A>"3"1"':.2"!%(#UTWVWXZY[6\1(4
.2]/A!#A$68/^.:P_"F".2)`)?;a-%5Bb.:M!6!c*6L/d%(9".:'2.0/<;I.:6e1(4f/&$P)".268M!F"686A!)g.2h/A!#ABD6E1(4Z+?ij!)kCl1.2]/&6^%5")
%5/8/&#&%5M$/&1(#A6!QmS</&>"$6AK/A!#8Bb6W%b68;a68/A!Bn.:6m6A%(.2)o/&1p9le68/&%(9"':K.2%qM!$#8/&%(.2)?1Bq%5.2U.:4rcs4t#A1B
uCl1.:/A.2]/>"z.2\/Q|{}&>">"%5!/v68W)"%(1(#ABq~%(.2.:BDRc-Cl6A11(#8Bb/&%(w]/"1%5")#ABxq.:15/4yA!.:#8/A!6m6868/A1.2"'2F?K/AM!.211U."M$2!6mC?%(/A'6!u cj%z9";aF?6W/ %5/8v/&#&)"%51wM$/&"1$)o(//A)1b/&!>?'2K'l16&%5q/BbA>"@!+?Bij!.:)
/&>?.26 u 1#AsQHTvF"#y9-%(68.2M}M$1"M!$#AD.26 u .0/&>E/&.:Bb
<)"$CJ$")"!]/TWVWX}u Y6*%(?)pTW^Xgu Y[6*.2 u >".2Md>^/&>?
M!1a$DM$.2!]/@Bb%5/.2M!$6=%(#A^.:")"!Cl!?)"!]/w1(49l1(/A>I%(")
|6A$pa!M$/A.21"QjQE u .:'2'#8$4t$#
/&1^68F"Md>Bb%5/.2M$!6Z%(6,(l(
Q>-%(C?/A!#A6~D%(")o E)"$G(!'21(CJ$)U/A>"=#A!C?#A!68!]/d%/&.:G(w4t1#8Bb6
1(4TWVWX}Y6e(!"$#&%5/A!)`4t#A1B¡/A>"N9-%(68.2MN¢*VWX}Y6K9;/&>"N68!BD.2)".:6AM$#A$/AN%(C"C?#A1]%(Md>£c*%(")h/&>?!
/&>?vTW^X}Y6!"$#&%5/A!)D4t#A1B¤/A>"m#8!C"#8!68!]/d%5/A.:G(WTWVWX}Y6H9];q%5C"C"'2.:Mz%5/A.21E154£/&.:Bb
<Bb%(#AMd>?.2"
BD$/&>?1j)"6$Qy{}>"!68K$¥aF"%5/&.:1"6~%(#AW#8!C"#8!68!]/&$)9];
¦y § b§ « ¬|§ 8® ¯ Q:°±®
¦ ©¨Oª
%(")
-§ ²z³J´ ¨Oµ -§ ²W« ¶ § ² ¯ Q·(®
#A$6ACl!M,/&.:G(!'0;Q}¸-1#~%^1",¹68/A!CBD$/A>"1j)£c"/&>"@'º%5/8/&$#74t1#ABx.:6~1(9?/d%(.:"!)U9];U%(C"C"'0;a.2"b%^/A.2BD,
Bb%(#AMd>".:"pBD$/A>"1j)/A1p/&>"E(!"$#A.2MET=VWX»4t1#AB¼.2%N4½%5.2#A'0;\68/A#&%(.:>]/A4t1# u %(#8)©Bq%5""!#$QK¸-1#
,i?%(BDC"':(c-/&>"@,ijC"':.2M$.:/mXyF"'2$#~BD$/A>"1a)'2!%()"6}/&1q¾ ¨À¿=ÁÃÂ-ª cl%(") ¶ § ² ¨ ħ¬ ½Å  ®
Q~Æo$/A>"1a)"6
.2]G(1':Ga.2?Z/ u 1~1#ÇBb1#8y68/A!C"6ÈMz%(w%(' u %z;a6Ç9J u #A.0/A/A!@.2W/&>"y4t1#8BÀ1(4?Xy¥lQ ¯ Q}9;v.2]/Qj)"F?M!.2?
" u )?!Cl!")"$]/WG(%5#A.º%59"'2$6!Q~Ém1(/Ae%(':6A1D/&>-%5/m1"'0;UBb,/&>"1a)"6.: u >".:Md>/&>?w/&.:Bbw%(")6AC-%(M$
)".:6AM!#8$/A.2Êz%/&.21("67%(#8m/A#Az%/&!)N68!C-%5#&%5/A!':;bMz%5N9J u #8.:/8/&!q.2N%(q.2]/&$#ABD!)".2%5/&m6A!BD.0¹)".268M!#8$/&
4t1#8BË68F"Md>P%(6EXy¥sQ ¯ Q:°QU{}>"q4tF?'2':;]¹)".268M!#A,/&^4t1#ABUcXy¥sQ ¯ Q·%5")I/&>?N%(6A681jM$.º%5/A!)h6L/d%(9?.2'2.0/<;
)",+-".:/A.21?6Z%(")o%(-%('0;j68.26Z%(#8=%(C"C"':.2M!%(9"'2m/&1D%('2'£Bb,/&>"1a)"6!Q
°Ì(Í
°Ì5 ÎÏmÐÑvÒÄÓ*ÔxÕ±ÖÃ×ÇÒ"ÐØÙrÚÛÙ!ÒZÜÞÝ}ßPÚÛÙràÓyÐvÔá×ÇÜ*×ÇÒÄÓHâ×
ãpä±å æèçWéIçWê©ëçWê©ìZçîíDê ïðç ñÀò!ó^çWê©ôÄõUôÈïçWö
TvF"#e)",+-".0/&.21("6e1(4~68/&%(9".:'2.:/<;%(#8p9-%(68!)P!]/A.2#A$':;1h/&>?N9J$>-%zGj.:1#e1(4Z/A>"N>"1BD1$"!1F?6
C-%(#L/&´ 6m1(4HXy¥a6$Q ¯ Q0°e%(?) ¯ Q·aQ{}>"e6L/d%(9?.2'2.0/<;N1(4HXy¥sQ ¯ Q0°e)"$CJ$")"6W$/A.2#8!':;U1o/&>"w!.2(!"6L;j6r
/&$B 1(4 ª QD{}>"b6L/d%(9?.2'2.0/<;154}Xy¥sQ ¯ Q·NMz%(31(4f/A!%('2681U9lD#A!'2%5/&$)©/&1\/&>"D!.:!"6L;a68/&$B¡1(4
.:/A6KBb%5/.0iJQ÷~1 u ,G!#$c.:I/&>?.26KM!%(6Ap/A>"p68.:/&F"%5/&.:1I.:6K"1(/e¥aF?.:/&b6A1©68.2BDC"'2D6A.:"M!5cy.2h1F?#
%(C"C?'2.2M!%5/&.:1"6Z/&1NC-%5#8/&.2%('È)".:øJ!#8!]/&.2%('Ä$¥F-%5/&.:1"6 !6ACl!M$.º%(':':;U>];aCJ$#A9l1'2.:Me1"$6d®,cÇ%p6L/d%(9?.2'2.0/<;
)",+-".:/A.21Mz%()"$CJ$")1©9J15/&>/&>?e/&.2BDe%5")©6AC-%5M!^)".:øJ!#8!"M$.2"?Q@{}>?.26v.:6v)".268M!F"686A$).:
j$M$/&.:1 ¯ Q?Qy-%('0;a6A.26Z1(4È/&>?!6A@!.:!?68;a68/A!BD6m>-%56~/A>"=.2BDCJ1#L/d%(]/Z%5)")"!)o%()?G5%(]/&%(W/&>-%/
.:/e.:G(!6D%(P!6L/&.2Bb%5/AN1(4m/A>"8(rùe%5/ u >".:Md>Ã%©6A1('2F?/A.21P%(C?C"#A1]%5Md>"!6D%68/&!%()?;]<6L/d%5/A\.:4m%
68;a6L/&!Bú.26w68/d%59"'25Q©1"68.2)"$#&%5/A.21 u .2':'H9lp.0G$I/&1Bb%5/A#A.2M$!6=/&>-%/e>-%zGN9l1(/A>hM!1BDC"':$/&
%(")^)",4t!M,/&.:G(}!.:!"6L;a68/&$Bb6$cj68!~j$M$/A.21^"QjQÍ?c u .:/A>^%W#A!BD.2?)"!#È/&>-%5/H%vM$1BDC"'2,/&76L;j6L/&$B
Mz%5I9lp%(#89".:/A#&%(#8.2':;oM!':16A^/&1%o)",4t!M,/&.:G(q1?(c|.: u >?.2Md>hM!%(6AbC"#&%(M,/&.:Mz%('H%(C"C?'2.2M!%5/&.:1"6WM!%(
Bb%((W/&>?@C?#A1Cl!#L/&.2$6}1(4È/&>"='º%/A/&$#Z%(C"Clz%(#7/A1b)?1Bb.:-%5/A(Q
S¹4 ª %(") µ %(#A=68/&%5/&.:1-%(#L;c u KM!%(Rcs.2N/&>?!1#L;U%5/~'2z%568/zc-$68/A.2Bb%5/&W/&>?!.2#}4tF"?)-%(BD!]/d%('
C"#81CJ$#8/A.2!6$Q¸-1#@,i?%(BDC"'25c|.:`j$M$/&.:1h"QÍ?Q q4t1F"")4t#A1Bè1F"#@BD1j)"$'7TWVWX}Y[6w4t1#@)".:4º
4tF"68.21o%(")oCJ$#A.21a)".:MWM!1]G$M$/A.21 u >"%5/M$1F"':)u 9lw
i?Cl!M,/&$)4t1#Z/&>"@!.:!]G5%('2F?@68CJ$M$/A#AF"BD6
1(4C"#&%5M$/&.:Mz%('|C">];j68.2M!%('*C"#A19?'2!BD6WM!1(/&%(.2?.2"p/A>"!68bC">?!"1BD!"%?cÄ68!D¸|.:"QR"Q0°QE{}>"$6Aq
i
Cl!M$/&%5/&.:1"6%(#A~#A,4t!#8#A!)b/&1@Bq%(];E/A.2BD!6H.2^/&>"Z4t1'2':1 u .2"@%(-%5':;a6A.:6H154Û68/&%(9".2':.:/<;KC"#A1Cl!#L/&.:!6!Q
{}>",;U%(#A=.2BDCl1#8/&%(]/7!?1F">\/&1^9l@68F"BDBq%(#8.2Ê$!)\9];p/&>"W4t1':'21 u .2?"û
ü #8-¸ z 1%(#v'Ç)?%.:ijøJ.:F"6!Q 6A.:1©)"1BD.2-%/&!)_"1 u 6W/A>"bý"¹!.2(!]G5%('2F"$6/&$")/&1\'2.:E%('21("q/&>?D?!]%5/A.:G(
mÉ 1 u '2,/vF"6WM$1BbC"%(#AK/A>"E,i?%(M,/J<#81j15//&#A%(M!$6 u .:/A>©6A1BDK/&>"%5/=%(#8EC"#A1a)"F"M$!)9];©%(M,/&F-%('
/&.:Bb
<Bb%(#AMd>?.2"EBD$/A>"1j)?6!Q7{Ä%(9"': ¯ Q0°@6A>"1 u 6/A>"eý?U3#A$'º%5/A.21?6Z4t1(#m%^G5%(#A.:$/<;\1(4|Bb,/&>"1a)"6!Q
¸|.:F"#A$6 ¯ Q·K%5") ¯ QÍK.2':'2F"6L/&#A%5/&}/&>?#A$6AF"'0/&67C?#A1a)"F"M!$)N9];bG5%(#8.21F"6HBD$/&>?1j)"6 u >"!p/A>"$;q%(#8
%(C"C?'2.2$)/&1b/&>"eBD1a)"!'|TWVWXZY[64t1#)".:øJF"6A.:1%5")©CJ$#A.:1j)".:M,¹M!1]G$M$/A.21Rc£Xy¥a6$QR"Q[N%(")©?Q@jQ
S¹/W.:6v.2BDC"'2.:!)U/&>-%5//&>"E9l!>-%zGa.21(#v6A>"1 u .26m/<;jC?.2Mz%5'1(4 u >-%5/ u .:'2'È>-%(C"Cl!.04y/&>"EBD$/A>"1j)?6
%(#87%(C"C?'2.2$)@/A1v)".0ø£F"68.21a 1#È)".2686A.2C"%5/&.:1jL®R)"1(Bb.:-%5/&$)w1(#ÄCl!#8.21a)".2MHM!1]G(!M$/A.21a<)"1BD.2"%5/&$)
C"#819"'2$Bb6K%(6 u !':'%(6 u >-%5/E)"1a!6K>-%(C"Cl!`.:I/&>"qBb1a)"!'HMz%56A!6$QÆo168/e1(4}/&>"q.2BDCJ1#L/d%(]/
Cl16A68.29".:'2.:/A.2$67%(#8WM!1±G$#A!)9;q/&>"=.2':'2F"6L/&#A%5/&.:1"6!Q
° ©« þ°Z«Pý ¨ z |X ijC"'2.:M!.0/~X*F?'2!#
« ký Â ©« þ° ¨ z ´ Õ z%(C?4t#81
Í « ° Á U ý  ® Á ý ´ ¨ z }
« ° Á ´ ý Â ® Á ´ = ý Â ©« ´ 9 ý Âo¨ z 7Í
_
« ° ý 9 ý ® ý ° 9 ý ® z Á ´ Â
_}ÆÍ
°z « ° ÁÁ (´ ý  Âb® ´ Á Á ý   ©« Á ´ ý´ ¨ z Á  ¨
@%(Ê$)-%(
°° ©«þ°Z«Pý Â « ´ ý Â ¨ z´ ´ ÞL@
°Ì ©«þ°Z«Pý « ý « ý « ý> z ÞLW
°±Í °~« ´ ý   ®|« ý   « = ° Á ´ ý  ® ¨  z ¨ Æo.:'2"W(/A>
{Ä%(9"': ¯ Q0°QHj1BD@ýb« ÉÞ~$'º%5/A.21?6
Rv]QCxGz'BEK}vmDOz'NUTNKMO@C
λ h= 0 ωh= 0
λ h= οο
R (σ) R (σ)
i ωh
σ = e λ h , λh - oo σ=e , ωh oo
a) Diffusion b) Convection
|¸ .2F?#A ¯ Q0°û*X|i?%(M$/Z/&#A%(M!$6m154ËJ¹#A1a1(/&64t1#}Bb1a)"$'R!¥F-%5/A.21?6!Q
#A1a1(/@.26=6L/d%(9"':E4t1#@%o#&%5"^1(4Zý Â c|9"Fj/@/A>"D6AC"F"#8.21F?6w#81j1(/@.:6@?1(/zQpS<34½%(M$/!cÈ/A>"D6AC"F"#8.21F?6
#A1a1(/W6L/d%(#L/&6W1/A>"EF"".0/WM!.:#AM$'2E%(?)4½%('2':61F?/A6A.:)"E1(4H.:/m4t1#^1eÁe7w ý Â ®l©z?Qe÷~1 u $G(!#$cÇ4t1(#
9".:M!1]G$M$/A.21Mz%56A!6$c u >"!Iý3.:*6 ²j&ù^ÁÀDå(fl(
cJ/A>"EBb,/&>"1a)©.26"1(/=1"'0;6L/d%(9?'2(c£9"F?/=.:/
%(':6A1©C"#81j)"F?M!!6^%þ/A>-%5/e4½%(':'26wC"#A$M!.268!'0;h1h/A>"NF"".0/EM!.:#AM!':q.:h/&>"N#A%(" z x x¡°Q
6 u %(6^CJ1(.2]/&$)k1(F?/D%(9l1ÌG((c*/&>".:6E)"1a!6^"1(/^BDz%(£c*/A>-%5/E/A>"\Bb,/&>"1a)`.26 u .0/&>"1FjY/^Â !#A#81#!Q
'0/&>"1(F">o/A>"=+-F"#8K6A>?1 u 6m/&>-%5/~/&>?!#Aw.26m%b#A%("@1(4 YÂ .: u >".:Md>/&>?K'2!%(C?4t#81bBD$/A>"1a)
C"#81j)"F?M!!6H"1=!#8#A1#*.:b%5BbC"':.:/AF")"(c5.:/*6A%±;a6H"1(/A>".2"@%(9l1F?/y/A>"Z!#8#A1#*.2d?±ù,QÆo1#8~.:6y6&%(.:)
%(9l1F?/}/A>".26}.:>"%(C?/&$u# ?Q
B>N|BW@OCHUONUkRwFRF:MOI@JUKMNEKMO@
{}>".:6E.26^%(':6A13%/ u 15¹#A1a1(/EBD$/A>"1j)P9"Fj/zcHF""'2.:(p/A>"\'2z%5C?4t#A1©68Md>"!BD(cH/&>"N68C"F"#8.21F"6^#81j1(/
68/&%(#8/A6@%5/W/&>"D1#8.2.:Rc£#A%5/&>"$#W/&>-%(31©/&>?DF?".:/=M$.2#AM$'25cÈ68!D¸|.:"Q ¯ QjQE{}>"$#A$4t1(#A(cÇ/&>?!#A^.:6
%o#A%("D1(4}#8z%('H"$]%5/&.0Gqý Â 4t1(# u >".:Md>I/&>?qBD$/&>?1j) u .2':'y9Jb68/d%59"'25QN{}>"q+-F?#AD6A>"1 u 6
/&>"%5/}/&>"=#A%(" W$")"6 u >"!ý Â © «@W°
z^6A.:"M!@%5/}/A>-%5/ZCl1.2]/7/A>"=6AC"F?#A.21(F"6Z#A1a1(/}'2!%zG!6Z/&>?
M!.:#AM$'2^%(") Æ Æ 9l!M$1Bb$6=#A!%5/&$#=/A>-%(31"5Qq{}>"D6A.0/&F-%5/A.21©.:6=¥aF?.:/&^)".0ø£$#A$/ u >"$I/&>?
ý?<#A1a1(/W.:6vC"F"#8^.2Bb%(.2"%(#8;(Q@S</&>"%5/=Mz%(68D%(6 YÂ .:"M!#8z%(68!6@% u %z;©4t#81BnÊ$!#A1N/A>"^6AC"F"#8.21F?6
#A1a1(/K#A!Bb%(.:"6K.:"6A.:)"q/&>?pM!.:#AM!':N%(")`#8!Bb%(.2?6K68/&%(9"':q4t1#E%#A%("N154 YÂ Q3÷~1 u $G(!#$c/&>?
C"#8.2"M$.2C-%('H#A1a1(/@4½%('2':6w1(F?/&68.2)"q/A>"pF"?.:/eM$.2#8M!'2D4t1#E%(':' YÂ z?cy%(")h4t1(#w/&>?N9".2M$1]G!M,/&.:1
Õ±ÖqpÖÃàsr|âÓ*ÔZÙ,Î|ÐvÚP×ÇÒ?ÐvØÙrÚÇÙ!ÒZÜÀÎ}Ý}àeÎÓ*ÑÒ|×oÙrà ÒÄÏÓáÎ}ÝZâÑ*ÚÇÓutNÃÑ*ÚÛÐvàÓ °±Í(Í
σ1
σ1
λ h=-2
a) Euler Explicit
ωh = 1
σ2 σ1
σ2 σ1
b) Leapfrog
σ1
σ2 σ1 σ2
λ h=-1
c) AB2
Diffusion Convection
|¸ .:F"#A ¯ Q·jûy{È#&%5M!!6Z1(4âJ¹#A1a1(/&674t1#7G5%(#8.21F?6}Bb,/&>"1a)"6!Q
BD1j)"$'R!¥F-%/&.21(\/A>"=Bb,/&>"1a)\.26}F"?68/d%59"'2W4t1#Z%(':' Â Q
A¡hUR¢xN|£E@'OR>z#NKMO@C
}{ >"7/A#&%(Cl!Ê$1.2)-%5'jBD$/A>"1j)K.26%G(!#L;eCl1C"F"'2%(#|1?4t1#|#8z%(681"6/A>-%5/*%(#87C-%(#L/&.2%('2'0;W.2':'2F"6L/&#&%/&!)
.23¸|.:"Q ¯ QÍ?QES¹/A6J<#81j1(/A6v4½%('2'Ä131#W.2"68.2)"e/A>"^F"".0/=M!.2#8M!':e4t1#W9J15/&>©/&>"^)".:6A68.2C-%5/A.2"\%5")
/&>?qCl!#A.:1j)?.2MEM!1(G(!M,/&.2?Mz%(68N%(")£c|.24½%(M,/zcfm2^,¹f'e2ùL¤zb1eÁeä1esùdN6¤Ký Â ¤zËdad
ýÀft±4ù e ¤q2\f9 d-ù,&ù,-+ e , f'e2ù,Q (F"6L/D'2.25q/&>?U':z%(Cj4t#A1©BD$/A>"1j)P.0/E>-%(6e/A>"\Mz%(C-%59".2':.:/<;31(4
C"#81j)"F?M!.2?I1"'0;`C">-%56A$#A#81#b4t1#E/A>"Cl!#8.21a)".2MNM$1]G!M,/&.:"`Mz%(68(c}9"Fj/b/A>"!#8.26b%Bb% ¥81#
)".0ø£$#A!?M!~9J,/ $!p/&>?Z/ 1e68.2"M$Z/A>"Z/&#&%5CJ$Ê!1.:)-%('-BD$/&>?1j)DC"#A1a)"F"M$!6H"1e%5BbC"':.:/AF")"7$#A#A1(#
4t1#@(- Ys ¦ u "1( / ¥8F"6L/%Eu ':.2BD.:/&$)p#&%5"W9l$/ u !!zLx Y xÞ°Q
°±Í( ÎÏmÐÑvÒÄÓ*ÔxÕ±ÖÃ×ÇÒ"ÐØÙrÚÛÙ!ÒZÜÞÝ}ßPÚÛÙràÓyÐvÔá×ÇÜ*×ÇÒÄÓHâ×
NJ§R>£kR>NEKMO@
{È#&%(M$!6\1(4=/&>"öl<#A1a1(/A6q4t1#q/A>"6A!M$1")jb%5")þ4t1F"#8/A>j<1(#A)"$#ÔÞ~F?",WF?/A/&%hBb,/&>"1a)"6\%(#8
6A>?1 u Ã.2g¸|.2"Q ¯ QÍjQ {}>"o+"F"#A$6b68>"1 u /&>-%/q9l1(/&>kBD$/&>?1j)"6b%(#8o6L/d%(9"':N4t1#D%#&%5"\1(4
ý >"$3ý .26m#A!%('%(?)"!%5/&.0G(c£9"F?/v/A>-%5//A>"e#A%("e154*68/d%59".2':.:/<;N4t16# Þ*Wp.:6#8z%5/A!#!c
1Â .:"u w%('2BD1Â68/H%5'2'"/&>? u %±;^/A1@LaQ
?c u >"$#A!%(6SÞL@@.26H'2.:Bb.0/&$)e/&1@rjQyTvD/&>"m1(/&>"$#>"%(")b4t1(#
9".:M!1]G$M$/A.21öÞL@^.:6mF?"68/&%(9"'2=4t1#m%('2' YÂ c u >"$#Az%5l6 Þ*Wb#A!Bb%(.:"6Z.2"68.2)"=/&>"@F"".0/M$.2#8M!'2
4t1c# zx YÂ x ³ aQ*Tv"vMz%5p6A>"1 u /&>"%5//A>"l ÞLWK68/&%(9".:'2.:/<;e'2.2BD.:/*.:6%59J1Fj/ Æ ý Â Æ ©»´ @4t1(#
%(':'£M!1(BbC"':,ioý Â 4t1(# u >".2MdÚ> w ýJS® x{z?Q
QSR.SRUT $µ `>4A¶l^k^U`1tF)ac\·µ/i¸4kkT¹»º
¹S /H.26*.2]/A!#A$68/A.2"=/&1@C"F"#86AF"~/&>"~¥F"!6L/&.21(q1(4£68/d%59".2':.:/<; u >?!b/A>"Z/&.2BD}68/A!Cb6A.2Ê$(c  ca.:6*6ABb%('2'
6A1b/&>-%5/%(M$M!F"#A%(M$;o1(4*%(':'Û/&>"eý"¹#A1a1(/&6~.26~1(4y.:BbCl1#8/&%("M$(Qmj.:/AF-%5/A.21"6}4t1# u >".:Md>/&>".:6m.:6m"15/
/&>?@M!%(6A@%(#8=M!1"68.2)"$#A$).2U>"%(C?/&$#6jQ
8z'5'OF<KR z'K¼
':'|M$1]G!]/A.21-%5'|/&.:Bb
<Bb%(#AMd>".:"qBD$/A>"1a)"6vC"#81j)"F?M!^%NC"#A.:"M!.:C-%('È#A1a1(/v/A>-%5/W.:6G$#8;©M$'2168
/&1 ¡ ¢X 4t1(#p6ABb%('2'~G5%('2F"$6\1(4Eý Â Q {}>"!#8$4t1#8(cv1(»/A>"9-%(68.26N1(4@/&>"C"#8.2"M$.2C-%5'#A1a1(/!cm/&>?
68/&%(9".:'2.:/<;b1(4|%EBb,/&>"1a)N/&>-%5/Z.:6}#A$¥aF?.2#A$)U/A1^#A!681':G(K%e/A#&%("68.2$/Z681'2Fj/&.21(N1ÌG(!#m%E#A!'2%5/&.0G$':;
6A>?1#8/m/&.2BD@6AC-%(Bq%z;U9JK%qBD1j1(/~.:6A6AF?(QWaF"Md>©Mz%(68!6W%5#Aw/<;aC".0+-!)©9];\/&>?e_ }b%(")öÞL@
BD$/&>?1j)"6 >"$/&>",;%5#Aw%(C"C"':.2!)\/&1q%b9".:M!1]G(!M$/A.21C"#A19?'2!BUQ}¸|.:6!Q ¯ Q5Mw%(") ¯ QÍ4y6A>"1
/&>"%5/m4t1(#~9lu 1(/A>BD$/&>?1j)"6}/A>"KC"#8.2"M$.2C-%5'R#A1a1(/Z4½%('2':6}1F?/A6A.2)?@/A>"wF?".:/~M!.:#AM$'2@%(")o.26~F""68/&%(9"u':
4t1#m%('2' YÂ QZ÷~1 u $G(!#$cR.:4Ä/&>"=/&#A%("6A.:!]/v681'2Fj/&.21(U154y.2]/&$#A$68/vM!%(9l@#A!681':G(!)©.:%D'2.2BD.:/A!)
F"Be9l!#*1(4l/&.:Bb76L/&$C"6H/A>-%5/H%(#8}6ABb%('2'j.2E/&>?~68!"68m154J/A>"}+-F"#8(c]/&>"Z$#A#A1(#yMz%(F"68!)b9;K/&>".:6
.2?68/d%59".2':.:/<;DBq%z;N9lW#A$'º%5/A.:G(!':;qF"".:BbCl1#8/&%(]/zQS¹4È/&>?w#81j1(/7>-%()\4½%('2':!N.2?6A.2)?v/&>"=M!.:#AM$'2v/&>?
BD$/&>?1j) u 1F"':)>-%zGE9l!$)"!M$'º%(#8!)6L/d%(9"':e9"F?/W%(!#8#A1#1(4y/&>"K6&%(BD ÀD å(-f
aù u 1F"':)
>-%zG~9l!!bM!1BDBD.:/A/A!)Rc¥8F"68/H.2E/A>"Z1C"Cl16A.0/&})".:#A!M,/&.:1RQ¸-1#/A>".26y#8z%(681b/A>"Z_}=%(")^/&>?
ÞLweBD$/A>"1j)?6~>"%±G(w9l1(/A>U9l!$F"68!)o.2\6A$#A.21(F"6Z¥aF"%(]/&.:/&%5/&.0G=68/AF")".:!6Z.2]G1(':Ga.2"^Cl!#8.21a)".2M
M!1(G(!M,/&.21(RQþ{}>".26D.2")k1(4.2"6L/d%(9".:'2.0/<;h.26^#8$4t!#8#A$)g/&1%(6DBb.:'2)P.2?68/d%59".2':.:/<;I%(")Ã.:6^"1(/b%
6A$#A.:1F"6ZC"#A1(9"'2$BF"")?!#Z/&>"=M!.:#AM$F"Bb6L/d%(?M!!6Z)".:6AM$F"6A68!)RQ
Õ±ÖqpÖÃàsr|âÓ*ÔZÙ,Î|ÐvÚP×ÇÒ?ÐvØÙrÚÇÙ!ÒZÜÀÎ}Ý}àeÎÓ*ÑÒ|×oÙrà ÒÄÏÓáÎ}ÝZâÑ*ÚÇÓutNÃÑ*ÚÛÐvàÓ °±Í@
σ1 σ1
σ3 σ1
σ1
σ2 σ3
e) Gazdag
σ1 σ1
λ h=-2 f) RK2
σ1 σ1
g) RK4
λ h=-2.8 ωh= 2 2
Diffusion Convection
jSg3&
°zz ÎÏmÐÑvÒÄÓ*ÔxÕ±ÖÃ×ÇÒ"ÐØÙrÚÛÙ!ÒZÜÞÝ}ßPÚÛÙràÓyÐvÔá×ÇÜ*×ÇÒÄÓHâ×
ï î í
I( λ h) I(λ h) I(λ h)
Stable
Unstable
1 1
Stable Unstable
Stable ï î í
R(λ h) R(λ h) Unstable R( λ h)
ð ñò
a) Euler Explicit θ=0 b) Trapezoid Implicit θ = 1/2 c) Euler Implicit θ=1
ó ôöõW÷¢øùú´ûýü>þhÿ>ô%ô
S÷>ø
Wø¢ù
ù
! û
õWô#"Wù%$'&û)(*
+,{ø
ÿ´ù-ô
ú|û/.01
2
>ù3ô¢ù3
4>ô5-6
S÷>ø¢ù3÷ù:øô-7
ù8
!ô9:% ù+> ô% ù
;>ù2
>ù:ø<Aôô÷8:=1öù3û?> ùøù@{ù:øA
Çô6<B>ù<øù@
Wøù1<51C
, f -
D6EGFHE JILK=MON PMOQR û
ST > U ô-7VW=> ôö ô#
9-6
X
W÷>ø:TW
ø,Y
ù@Z!U% ô<- ôTô[U% ô:- ô#\ù
!853 øùÛôö ÷WeøOeù6Hô
ó ô%õ>ûú´ûýü<8+¢ ô-=Ë
ô]>ù:ø ôS" ù6%{ø
^>ù_
> ù` ø:
!
a
ù
! õWô#W" ù¨ ôP
ÿ´ù6-@eô
c´
b ûe´
d ûýü>û
fgYh'igYjlkOmCn*gVk2op4qsrJtvutGixwyoi{z|g4}sm
ó ô%õ>ûú´ûýü~:
+3>ù:>ôöô
2-6
S÷>ø
Wø¢ùù@Z!U%ô-<ô÷öù<øù
! û](
>ù
+Ûô>õ
fgYh'igYjlkOmCn*gVkLjlhsugYhl}stGi{tgYhl0rvrG mi¡sro¢tvwyqBrvtvutiAwyoi{z|g4}sm
ó ô%õ>ûkú´ûýü-C8
{+>ùxW=>ôöô#
¢-6
X
W÷>ø
Wø>ùTô~U8öô-<ô3÷öù<øù
ûx(*ô
U>ô-6)
~ 2:>ô öô
~-6
X
W÷>:ø
Sø
÷ -6
>ôô
# x:=1öùmô ~U%ô -<ô TT@ù
<5
û a
eô-:
ù 01]¢ù
ù 8
!°ôW=8ö9 ù
W ù
5-6
[Uö`ù Z£$Y&?01v MOQ¤¥@Ev >x
ø >ùH6ù eô%øù}ø 1>õWx ù Y
W÷ 03:ø Wû
¦§©¨§«ª2¬Bc®T¯°@±B²³ ´4µ²3¶°P³4°6µ·¸±]¹]ª9±\®,º3µB´°Pª»µs¼®¸±]¹º,³l®\½ $Y¾ º,³4²ª® ü
óGôöõW÷>ø ùú´û/d´þØÿ>ô%ô
2
W÷¢ø
Wø]
ùmù@Z!U%ô-<ô]ù
!8:û
I( λh)
3.0
Stable RK4
Regions
RK3
2.0
RK2
1.0
RK1
R(λ h)
ó ôöõS÷>øù^ú´ûb¢þØÿ>ôöô
W÷>ø
WøÛ÷>õWù`Pm÷8:=CTù@
<û
ü ±\¼²3ºµs®,¯¿¦§À´|µ²3¶°P³4°6µ·¸¹]Á ³4°Pª3®)²¯Â´|·,´|µs®T¢´
I(λh)
I(λh)
Stable Outside Stable Outside
2.0 2.0
R(λ h) 1.0
R( λh)
1.0 2.0 3.0 4.0 2.0
ó ôöõW÷¢øùú´ûbú´þhÿ>ô%ô
S÷>ø
Wø¢ù ÷8-6
¢ôeô
0 [:%ùmô[Uöô-:ô5ù8
!<û
fgYh'igYjlkOmCn*gVkLugYhl}stGi{tg'h|0rvrämi¡srvotJwqBrvtJutGiAwyoi{zlg}sm
å ÷WC-ù-7S ÷8 ù%¢
S ù8
!ô ô~U% ô<- ô_
|ù698
9ù7;01ôô÷8-6
¢ôeô
0 W=8öùSû
S+5
¨ô%÷:ø1ô
)>ôSøù9:
+°ôÇó ô%õ>û ú´û/æ´û΢ù9
)¢ù6ù}ô3¢ù9301~PWãc
W÷8
. ø:!
W
ø:>ù:ø3T
S ù@
Åv>
ûAæ8<Ss% ùú´û ûA
>ù:ømô3>ù}ü1!*
Wø>ù<øãPô>ù9ù
!ÇõSô"Wù
2¢ùUYW
ôX
- U ù<ø1
Wø
Ú0ÛÜ × Ö Ú0Û1Ý ×Þ & ß Ú à7Û Ü ü
. × Þ Ú àÛ Þ Ú àOÛ Ý
× á
+° ô¢Ss% ù}ú´û >
û ¢. û3(*mô3W=% ù MON0FHI W
ø$Öç vè +> ù6?é%ê è ê ¢ . û
(*W=>ôöô#
~Y
W÷80Sø: sô"Sù:ø: 2ôôSø,
C0O
Wø¢ùöù71U8{ø
WõCù
£vù<ùóGôöõ>û¢ú´û/d1Vû
¦§¦§ÀÁT¹x¬s¯°P®,¯¸´|µ8²¶°P³4°6µ·Å²ªa²³l·)´!°W´ ü.
I(λh)
I(λh)
3.0
3.0
Stable
only on 2.0
2.0 Imag Axis
Stable 1.0
1.0
ó ôöõS÷>øù^ú´ûæ¢þØÿ>ôöô
W÷>ø
Wø>ù -
>ô#eô
0 [:öùmô~U8öô-<ô5Tù@
<û
!#"%$&('*)+$,.-0/'*
¢ù:÷0eô#
Ú,] W Û=[ ô5-
[~
x
ù"Sù:ø: [eù<ø 82-7~-ùav-
Wøù
W÷!Vû\(
>ùLøù6~Sô>ô>õ
ù@Z!U>ø ù6:ô
6<0+hù
08>ùeù:ø:A C ` E +>ô-=%+1ùø ù6U>ø ù6ù \<|÷8:þ
84ADC ` E
Û
S]>ù<Vô8-:ùpA CDE Ö ßA C ` E Ö Û <>ô#Ûô]-6%ù7Sø01
R
á
óV
Sø]|÷8Tù<øô-6W=>ôöô#
( Xê nú´û .
Å>ùU>ø
öù ôC
;:
"Sù
Wøx¢ù\ÐÑU>ø:
!¢÷-:ù õWô#"Wù6ÅTù@
1<~
>ù:- ù6:S øW £-6
¢ôeô
¢
WøW=>ôöô#
<~21Sùx ÷>øùC17<kô>ùC+
Wø::UY
ô%ùC-6
9¢ô01ô
sU0S øT ù@eù<ø6<0-
>ô#eô
¨
ú´û }
. ô]OeôW
ù6_û
)y ¡v.
T@
Ö Ý × ß A ILK ` M Þ A Ý ILK ` M
ÞP£ T> Ø ¥ á
Wø
ü T@
Ø £ -
O*T>'%¨ Ö é nú´û d
Þ§¦ Q> Ø ¥ ¥
© ª%« ¬
S]÷y:JûGú´û ô_%
%÷8eô
y:JûOú´û ü ô~ ô_ ø
y:JûOú´û d´ûxS]>ùx
+5
Pø:
!
ú´û dCS øù
Ø Ö Ø
× ¥® ® Þ
{ø
+> ô-= ô#ôC-6ö ù6S øA01C
¢ ù Côx+7 ¯ û£>yù2
<,>ù<øù
Søù<)01x ;¢ù
ó0W
÷>ø ôöù:ø]W=¢ ôö ô#
~ù6W7<VÛ
ô-=0S ø:
Ða ù8
!%
s
"Wù:ø:ÔU8U>ô>õxWeù6U8*ôL÷8:öù
Wø1 <
£
O88T@û
v° ±²q³
2gHf|Hj|=fHj9x\x~t´xmkjµJHtuk\j9|Tt}f¶n·S¸¹Lº²»yh\tuj|=g{¼ntuf¾½#h\iHjz%g{f|=t}h\tugft´xmgqLh\jf¿Hkjx\jvfJh\j9|QnxÀ ÁSÀGÂ
ÃGĶÅÆ¢Ç~ÈaÉ
¦§´Ê§ ±]¹]ª3´!°W´|µs®,ª9±· üd
ÛÜ × [ Ö ÛD[ @
T ÛD[ ÛD[
Ú ]W Ú ] W ¥§ Ë T> ß Ú ] W Ü ×³¥ Ú ] W Ý × á nú´û b
(
%>ô]-7 ù
T@
cÖ F F ôO*T>
¥ Ë T>
{ø
+>ô-= ô^ô_-6%ù7Sø_1Ì ³¯
Wø)
:ù<ø
8ÍOû2S]÷A+hù07"Sù2
1>ù<ø
0> ô#eù`
>ô ù<øù68-:ù_UU¢ø
7Z´ô~1eô
20O7< 2>ù^óV
S÷>øô%ù:øË W=>ôöô#
~ù6:6<ô÷8:=1öù
Wø1X
-=W
ô:- ù_
l>ù{ø ù:ù_U0SøTù@eù<ø:û
+5}
ù@Z8[Uö ù. Ù ÷W]U>øù ùXù6
W÷8öô¢ ù3A ô[Uö ùa> U ø:
!<- ù6>÷>ø ù3W
øT
0>ô> õA¢ù @E#Ì@N0ÃOËFHQ0=¥
¢ù<- ôöø<- ÷Ô1X~1øô<- ù6W
ø:T ùc U8Uö ô-71ô
L
s>ù
+5
ù
!8
[>ù~
>ù6Ó> U ø
ö ù~< ûAS]> ùx-=S
ô:- ùC
1~ äW
ø>ùC:> ôö ô
U03 ø ùù:ømô¢>ùHó0W
÷>ø ôöù:ø0# ! ô<Ó>ù<øù@W
øù1<
ô
a-:- ô¢ù6Vû)(*Ûô# ù@Z8-@ >ùT ù?h + ù_07W" ù_ ù:ù6 ÷ ô> õHô%'
lW
÷>ø> U ø ù|" ôS
÷
>ô:- ÷8 ô
<0> ÷8Søø ôS" ù6c1]{ø
»[¢ô¢-ù:øùU-ù<ø U ù6-@eô#W" ùSû
(*1
+ ùÍù`Z8T ô> ù~>ù¢ U øù6<- ù6>ô>
õÇù@Z8[U% ù6{ ø:
>ù~´ " ô%ù+UYW
ôA
]:- ô%ø<- ÷ÔA1øô:- ù6
¢>ùA ù6 ô#*>ô::- øù@eùAU> U ø:
-=<Ó>ùø ù6 ÷83> U øù ù6ø1>ù<ø3
|" ôS
÷-6
-6% ÷ ô
: û3S]> ù
U:- ù>ô ù<øù:- ô> õô2L ô-=0S ø8
ÐÑ] ù8
!2U¢ø
>÷:- ù>ù~1øô#; Z ÚFÛÜ ? ? )+> ù:ø ù
¥
ÚLô)UY
ô#eôS" ù-6Ô3 ø\-6|
ù{Ý[:- ô%ù6VûuóJø:
þ3U U ù6¢ô#Zx;h + ù]
0C0O\>ùÛù<ôöõWùX"1% ÷>ù6B
V>ô
~1eø ô#Z~S ø ù_øù6Ó> ù<õ1ôW" ù ÷9 ù:ø< û5ö ù73 ø <>ù3ô ù@
~S ø:-=> ô>
õ^ô5- ù<ô>
õA-7S ø øôöùL
W÷8X
¢ùT% ù7U!{ øW
õ] ù
!8<{ ø
· ó ôöõ>ûVú´û/d!<>ô4T ù@
ôC ÷W=8ö ù\W
ø ËFGF ù:ô%õWù6"1ö ÷¢ù6Û + ô
ù<õ1eô#W" ù^øù64U0S øW:ûÎ>ù
1>ù<ø01<0>ù_:U0:- ùOeøô©
> Z ôc! :Jû-ú´û b ô ÛÜ ?=_ é ? @<
¥
%1-6-6S
ø>ô> õ9
9U U ù6>ô©Z%3<!>ô~1eø ô#Z~0¢ U ÷>øùmôS õSô0S øWH ù:ô%õWù6"1ö ÷¢ù6: û,a
1 + ù@W" ù:ø<
ô9>ôB-7 ù>ùù@Z!U% ô<- ô)÷% ù:ø) ù
!}ô\ ù:ô¢
õm÷ ù[W
ø\>ùeôT ù`
~S ø-=A<--6W
ø:>ô¢ õ
ó ô%õ>ûú|û\ü<>ô] ù
¨ô+7 L ÷8:ö ùW
ø] ÷-=-
>ô#eô
: û
ë2ìÞ ß^î[ûý\ñ7ýsõBòûáà]ù
â Ú â Ø Ú
Ö nú´û ú
â @ £ â > Ø
üb ±\¼²3ºµs®,¯¿¦§À´|µ²3¶°P³4°6µ·¸¹]Á ³4°Pª3®)²¯Â´|·,´|µs®T¢´
£ T@
ð nú´û
Q> Ø
¨øù6Søø>õWùù:ø:~
Ö ð -
GO*Q>C
¥ ð Ø ô Ø O*T>
Þ ð
S]>ù<øù[Søù ãôYø
B
,+>ô-=ySø ù2ê
Sø Çøù6 ð ô¢>ù}ø>õWùxéê ð êöõ·û
S]>ôaù710Oa>ù_Tù@
ô QNÓK=MONYEG¤JEÍMONYËFGFHI9¥@¤ÍËD6F ÷
S]>ù5'
"SùØø ù6 ÷| ù:ù6[4
Ûõ
!
ù\eø ÷>ù<O ô:- ù)h + ùT"SùT
S÷^÷-6
>ôô
#
:%ùTù@
}÷ ô>õ_ ø{ùYFHEÍK@EG¤ -6
A>ô0Oeô
A
'â|S õWø>
õWô
ôXù:ø:U'
1eô
AUY
# !8
T
ô< û
:û-ú´û úô ù8ËR:ËD@MOFHEÍK û,!:Jû ú|û/. ô ÆI ù0@RD@MOFHEÍK û,S]|÷8*ô# T@mý é~8T>ý éHô%÷-=
!
c+7 y1 ` ` E ø ù6~Sô-6
:7<)>ùsùJ:÷01ô
y+hù%-@e÷0 ?:
"Sù2 y¢ù2Tù@
ô
M 7"Wùù{:|÷1eô
<V
3[¢ô¢-÷ô
Pù{:÷01eô
û](
c÷-=?[-7 ù É
!:Jûú´û ô[+
E¥ANÓMO¤
QN0E 7MOR
CFHI%K=MON8¥@E¥@¤P@N0¤TÄ)EG¤GƤGÆ0x QˤvEÍMON?Ä_¥@¤aMOQ¤¤PMx¥MOFHà ùW" ù¢W
ø]"1>ô:>ô¢õ ~
:ù6U ô: ù6< û,S]> ù_ ô÷01ô
Í ô] ÷[~S øô: ù6ôLSB1ö ù^ú´û¢
. û)(*b
T@yý é[1Q>ý é ôL ÷-=
c+7 y1 ` ` E øù6~S ôA-
:7<\>ù6 Ø ô 2a Q@:`<)>ù2 ù
ô-6
ôWeù6:û
þ
h + ùS" ù:ø6<l>ôM
ö ù6
L-6
:øS ôX
>ùCeô ù9Weù6U?+> ô-= ô~ Ù ÷:_ ùW" ù<øù0O
ô[UY
ùX >ùx:> ôö ô
c-6
>ôô
1T>ùx ù-6
W
ø:>ù:øÛ ÷> õWù`Pm ÷8LT
ù@
?
+
ôL>ù=% ùSû
!*
Wø>ù<øL÷8>õWù@
m÷8 Ï_÷ó0
Wø:´óø_1Sù6
ó0
WøLÿ>ôöô
Q@ê ` M T@êõ
Ø
>ô#eô
0 sÿ=1öù 8-6
¢ôeô
0 Tÿ%ù
ó0
Wøa
ô:ù6-@
ë2ì! "çð)î[÷ø6ò$# ý
ã
û
8ô¢ù:ø]>ùÎÏ ã
Ú Ö&%
Ú0à Ö @ Ú (
Þ '
+Ûô#
é é # é #
¥ ¥ ¥ ¥
%ÙÖ è) +î * ? Ö è) é +î *
¥ '
é é ï é é ï
¥
¦§-,X§Àº,¯¹]¶³|®T¢´ ü
ÛÜ × Ö Û
Ú ] Ú ] ¥ × Û Û
Ú ]Ý × Þ × ÛØ Ú Û Ü Ú ]Û Þ Ú ]Û Ý
Û Ú ]Ü × ¥ ] × ¥ ×
+>ù<øù¶× Û <.1X
+;1>ù
W÷>ø2
Wø#ó\âl÷9ù:ø6<kô & ç T>kû7 ô>õ¨ó0
W÷>ø ôöù:ø
W=>
ôö ô#
2 ô6<8
>ùø¢õWù
!× Û
Wø+>ô-=%¢ùùË
¨ô]:öù3û
ü>ûaÏ_ù@eù:ø:Tô>ùLU
>ù:>ôöô
9-6
S÷>ø
WøT>ù330[W
:8
Wø:2ù8
!5
W:ø >ù:ø >:ø
W÷>õ Tü>,
û
[U0Sø
ù +Û#ô [>
ù L8÷ >õW@ù
m8
÷ ù
!8T
14
Wø ¢ù:ø >ø
W÷¢
õ
ü>û
â Ú â Ø Ú
Ö
â @ â > Ø
+>ù<øù Ö û3>Õ>ô-=~ù@Z!U%ô-:ô#ôù@*Sø:-=>ô¢õ[ù
3+5
W÷-ù÷>ô#=%ù
Sø
¥
ôXù:õWø1eô>õ>ô TÏ]<hô
Wø:>ù:ø~-:ù6ù:øù ¢ô¢-ù:øù-:ô>õ»ôT÷ùÒ
Wø¢ù¢U0{
ôÔT>ô¢-ù:ø ù6<- ù6x8 >ù2Y
W÷Sø: y-6
¢ôeô
ASøùLUù:ø ô
>ô-D< ó ô8y>ùLW=¢ôöô#
-
>ô#eô
2W
ø]
> ù_
l>ù ùT
ù@
<û
æ¢ûaô¢õËó0
W÷>ø ôöù<ø10 ô6<l :ùx¢ù~W=>ôöô#
¢
>ø:W
Wø:>ù:ø0-1+Søy>ô¢-ù:ø ù6-`
ô> õ~-W
÷U% ù6+Ûô¨ù@Z!U%ô-<ôa÷öù<øaôù_Sø:-=>ô¢õ~1UUöô%ù6%
x>ùöô>ù7Sø]-
"Wù-eô
ù{:|÷1eô
LÛ + ô%UY
ô#eô#W" ù ûØó ôL>ù_O´ Z ô
÷»W
÷>ø1Xa÷9 ù:ø]W
ø]W=¢
ôö ô#
Wû
Ë
û
8ô¢ù:ø¢ù)öô¢ù7Sø'-6
"Wù-ô
_+ÛôUY
ôeô#"WùB+7"WùTUù:ùACôU>ø
öù æ¢ûl3U8U
C_ Ï ô%øô-=8ö ù'S
÷0SøW 2-
>ô#eô
L1]¢ùö ùG'
W÷80SøW Wû,
xY
W÷Sø: -6
¢ôeô
Íô
U ù:ø:T
ô#eùx1\>ùÛøôöõX\'W
÷80SøWW ûB> øô#eù>ù: :ù6
ÓÎÏ]Ð\+> ô-=T
ø ù6 ÷\{ ø
ø::W
W
ø:>ù:øs0- 1+3 øxU0OeôÔ1!>ô ù<øù:- ô>
õ]ô9Oeøô©ZX*W" ù-
WølS
ø¨ ûFa ô¢ õ33U8- U ù>ô#Z
û <
08>ù$ ù:ôöõSù6"1ö ÷>ù: û)> øôù>ù
] Î xÅ+> ô-=Ë
øù ÷#]{ ø
¢ùAU8Uö ô-71ô
G ù@Z!U% ô<- ô÷% ù:ø]eôT
ù~S ø:-=>
ô>
ä õ}ô%1øä ô©ZÍW" ùä -
SøW
ø¢ < ôû\ù3û<
Ö × Ú0Û
Ú0ÛÜ × R ä
¥ GOÛ
> øô#eù× ô«0>ùÀ~1eø ô#Z 8
=1ô
«85õWô#"Wù%>ù¨ù6eø ôöù~
G û ô>õ?>ù¢$
øù61eô
Ò
WøL>ù ù@Z!U%ô-<ôc÷ö ù<ø ù
<
0Ù>ù ' ù<ôöõWù"1ö÷>ù:û¿1ù6
>ù6 ù<+01#ô>ù~OZ´ô÷ W
÷¢ø÷9 ù:ø]1
h + ù62W
ø: [U8
1eô-3:=1> ô%ô
_<
BZ!UÔ3ôL+ L>ô]>ô¢-ù:ø:{ ø
»>ùW1 + ù<øa
[¢ U ø
% ù6»¢æ û,* ôX:þô ×çS
ø~ <
Chapter 8
CHOICE OF TIME-MARCHING
METHODS
In this chapter we discuss considerations involved in selecting a time-marching method
for a specic application. Examples are given showing how time-marching methods
can be compared in a given context. An important concept underlying much of this
discussion is stiness, which is dened in the next section.
1 R(λ h)
Accurate
Region
Figure 8.1: Stable and accurate regions for the explicit Euler method.
the homogeneous part, we exclude the forcing function from further discussion in this
section.
Consider now the form of the exact solution of a system of ODE's with a com-
plete eigensystem. This is given by Eq. 6.27 and its solution using a one-root, time-
marching method is represented by Eq. 6.28. For a given time step, the time integra-
tion is an approximation in eigenspace that is dierent for every eigenvector ~xm . In
many numerical applications the eigenvectors associated with the small jmj are well
resolved and those associated with the large jmj are resolved much less accurately,
if at all. The situation is represented in the complex h plane in Fig. 8.1. In this
gure the time step has been chosen so that time accuracy is given to the eigenvectors
associated with the eigenvalues lying in the small circle and stability without time
accuracy is given to those associated with the eigenvalues lying outside of the small
circle but still inside the large circle.
The whole concept of stiness in CFD arises from the fact that we often do
not need the time resolution of eigenvectors associated with the large jm j in
the transient solution, although these eigenvectors must remain coupled into
the system to maintain a high accuracy of the spatial resolution.
8.1. STIFFNESS DEFINITION FOR ODE'S 151
8.1.2 Driving and Parasitic Eigenvalues
For the above reason it is convenient to subdivide the transient solution into two
parts. First we order the eigenvalues by their magnitudes, thus
j1j j2j jM j (8.1)
Then we write
p M
Transient = X m t
cm e xm +~ X
cmem t ~xm (8.2)
Solution m =1 m =p+1
| {z } | {z }
Driving Parasitic
This concept is crucial to our discussion. Rephrased, it states that we can separate
our eigenvalue spectrum into two groups; one [1 ! p] called the driving eigenvalues
(our choice of a time-step and marching method must accurately approximate the time
variation of the eigenvectors associated with these), and the other, [p+1 ! M ], called
the parasitic eigenvalues (no time accuracy whatsoever is required for the eigenvectors
associated with these, but their presence must not contaminate the accuracy of the
complete solution). Unfortunately, we nd that, although time accuracy requirements
are dictated by the driving eigenvalues, numerical stability requirements are dictated
by the parasitic ones.
The most important information found from this example is the fact that the
stiness of the transient solution is directly related to the grid spacing. Furthermore,
in diusion problems this stiness is proportional to the reciprocal of the space mesh
size squared. For a mesh size M = 40, this ratio is about 680. Even for a mesh of
this moderate size the problem is already approaching the category of strongly sti.
For the biconvection model a similar analysis shows that
jM j = j1j 1x
Here the stiness parameter is still space-mesh dependent, but much less so than for
diusion-dominated problems.
We see that in both cases we are faced with the rather annoying fact that the more
we try to increase the resolution of our spatial gradients, the stier our equations tend
to become. Typical CFD problems without chemistry vary between the mildly and
strongly sti categories, and are greatly aected by the resolution of a boundary layer
since it is a diusion process. Our brief analysis has been limited to equispaced
8.3. PRACTICAL CONSIDERATIONS FOR COMPARING METHODS 153
problems, but in general the stiness of CFD problems is proportional to the mesh
intervals in the manner shown above where the critical interval is the smallest one in
the physical domain.
In this example we see that, for a given global accuracy, the method with the
highest local accuracy is the most ecient on the basis of the expense in evaluating
Fev . Thus the second-order Adams-Bashforth method is much better than the rst-
order Euler method, and the fourth-order Runge-Kutta method is the best of all. The
main purpose of this exercise is to show the (usually) great superiority of second-order
over rst-order time-marching methods.
0 T uN
k=1 j j [(h1 )]84
k = 2 j 2h1 j [(2h1)]2
k=4 j 4h1 j [(4h1)]
Step sizes and powers of for k-evaluation methods used to get to the same value
of T if 8 evaluations are allowed.
In general, after K evaluations, the global amplitude and phase error for k-
evaluation methods applied to systems with pure imaginary -roots can be written1
Era = 1 ; j1(ik!h1 )jK=k (8.4)
1 See Eqs. 6.38 and 6.39.
8.4. COMPARING THE EFFICIENCY OF EXPLICIT METHODS 157
2The 1 root for the Gazdag method can be found using a numerical root nding routine to trace
the three roots in the -plane, see Fig. 7.3e.
158 CHAPTER 8. CHOICE OF TIME-MARCHING METHODS
Using analysis such as this (and also considering the stability boundaries) the
RK4 method is recommended as a basic rst choice for any explicit time-accurate
calculation of a convection-dominated problem.
In order to resolve the initial transient of the term e;100t , we need to use a step size
of about h = 0:001. This is the same step size used in applying the explicit Euler
method because here accuracy is the only consideration and a very small step size
must be chosen to get the desired resolution. (It is true that for the same accuracy
we could in this case use a larger step size because this is a second-order method,
but that is not the point of this exercise). After 70 time steps the 1 term has
amplitude less than 0.001 and can be neglected. Now with the implicit method we
can proceed to calculate the remaining part of the event using our desired step size
h = 0:1 without any problem of instability, with 69 steps required to reduce the
amplitude of the second term to below 0.001. In both intervals the desired solution
is second-order accurate and well resolved. It is true that in the nal 69 steps one
-root is [1 ; 50(0:1)]=[1 + 50(0:1)] = 0:666 , and this has no physical meaning
whatsoever. However, its in
uence on the coupled solution is negligible at the end
of the rst 70 steps, and, since (0:666 )n < 1, its in
uence in the remaining 70
160 CHAPTER 8. CHOICE OF TIME-MARCHING METHODS
steps is even less. Actually, although this root is one of the principal roots in the
system, its behavior for t > 0:07 is identical to that of a stable spurious root. The
total simulation requires 139 time steps.
8.5.3 A Perspective
It is important to retain a proper perspective on a problem represented by the above
example. It is clear that an unconditionally stable method can always be called upon
to solve sti problems with a minimum number of time steps. In the example, the
conditionally stable Euler method required 405 time steps, as compared to about
139 for the trapezoidal method, about three times as many. However, the Euler
method is extremely easy to program and requires very little arithmetic per step. For
preliminary investigations it is often the best method to use for mildly-sti diusion
dominated problems. For rened investigations of such problems an explicit method
of second order or higher, such as Adams-Bashforth or Runge-Kutta methods, is
recommended. These explicit methods can be considered as eective mildly sti-
stable methods. However, it should be clear that as the degree of stiness of the
problem increases, the advantage begins to tilt towards implicit methods, as the
reduced number of time steps begins to outweigh the increased cost per time step.
The reader can repeat the above example with 1 = ;10; 000, 2 = ;1, which is in
the strongly-sti category.
There is yet another technique for coping with certain sti systems in
uid dynamic
applications. This is known as the multigrid method. It has enjoyed remarkable
success in many practical problems; however, we need an introduction to the theory
of relaxation before it can be presented.
un = c11 (1 )n1 ~x1 + + cm1(m )n1 ~xm + + cM 1 (M )n1 ~xM + P:S:
+c12 (1)n2 ~x1 + + cm2 (m )n2 ~xm + + cM 2 (M )n2 ~xM
+c13 (1)n3 ~x1 + + cm3 (m )n3 ~xm + + cM 3 (M )n3 ~xM
+etc., if there are more spurious roots (8.8)
When solving a steady problem, we have no interest whatsoever in the transient por-
tion of the solution. Our sole goal is to eliminate it as quickly as possible. Therefore,
8.7. PROBLEMS 161
the choice of a time-marching method for a steady problem is similar to that for a
sti problem, the dierence being that the order of accuracy is irrelevant. Hence the
explicit Euler method is a candidate for steady diusion dominated problems, and
the fourth-order Runge-Kutta method is a candidate for steady convection dominated
problems, because of their stability properties. Among implicit methods, the implicit
Euler method is the obvious choice for steady problems.
When we seek only the steady solution, all of the eigenvalues can be considered to
be parasitic. Referring to Fig. 8.1, none of the eigenvalues are required to fall in the
accurate region of the time-marching method. Therefore the time step can be chosen
to eliminate the transient as quickly as possible with no regard for time accuracy.
For example, when using the implicit Euler method with local time linearization, Eq.
6.96, one would like to take the limit h ! 1, which leads to Newton's method, Eq.
6.98. However, a nite time step may be required until the solution is somewhat close
to the steady solution.
8.7 Problems
1. Repeat the time-march comparisons for diusion (Section 8.4.2) and periodic
convection (Section 8.4.3) using 2nd- and 3rd-order Runge-Kutta methods.
2. Repeat the time-march comparisons for diusion (Section 8.4.2) and periodic
convection (Section 8.4.3) using the 3rd- and 4th-order Adams-Bashforth meth-
ods. Considering the stability bounds for these methods (see problem 4 in
Chapter 7) as well as their memory requirements, compare and contrast them
with the 3rd- and 4th-order Runge-Kutta methods.
3. Consider the diusion equation (with = 1) discretized using 2nd-order central
dierences on a grid with 10 (interior) points. Find and plot the eigenvalues
and the corresponding modied wavenumbers. If we use the explicit Euler time-
marching method what is the maximum allowable time step if all but the rst
two eigenvectors are considered parasitic? Assume that sucient accuracy is
obtained as long as jhj 0:1. What is the maximum allowable time step if all
but the rst eigenvector are considered parasitic?
162 CHAPTER 8. CHOICE OF TIME-MARCHING METHODS
Chapter 9
RELAXATION METHODS
In the past three chapters, we developed a methodology for designing, analyzing,
and choosing time-marching methods. These methods can be used to compute the
time-accurate solution to linear and nonlinear systems of ODE's in the general form
d~u = F~ (~u; t) (9.1)
dt
which arise after spatial discretization of a PDE. Alternatively, they can be used to
solve for the steady solution of Eq. 9.1, which satises the following coupled system
of nonlinear algebraic equations:
F~ (~u) = 0 (9.2)
In the latter case, the unsteady equations are integrated until the solution converges
to a steady solution. The same approach permits a time-marching method to be used
to solve a linear system of algebraic equations in the form
A~x = ~b (9.3)
To solve this system using a time-marching method, a time derivative is introduced
as follows
d~x = A~x ; ~b (9.4)
dt
and the system is integrated in time until the transient has decayed to a suciently
low level. Following a time-dependent path to steady state is possible only if all of
the eigenvalues of the matrix A (or ;A) have real parts lying in the left half-plane.
Although the solution ~x = A; ~b exists as long as A is nonsingular, the ODE given by
1
Eq. 9.4 has a stable steady solution only if A meets the above condition.
163
164 CHAPTER 9. RELAXATION METHODS
The common feature of all time-marching methods is that they are at least rst-
order accurate. In this chapter, we consider iterative methods which are not time
accurate at all. Such methods are known as relaxation methods. While they are
applicable to coupled systems of nonlinear algebraic equations in the form of Eq. 9.2,
our analysis will focus on their application to large sparse linear systems of equations
in the form
Ab~u ; ~f b = 0 (9.5)
where Ab is nonsingular, and the use of the subscript b will become clear shortly. Such
systems of equations arise, for example, at each time step of an implicit time-marching
method or at each iteration of Newton's method. Using an iterative method, we seek
to obtain rapidly a solution which is arbitrarily close to the exact solution of Eq. 9.5,
which is given by
~u1 = A;b ~f b1
(9.6)
In the following we will see that our approach to the iterative solution of Eq. 9.7
depends crucially on the eigenvalue and eigenvector structure of the matrix CAb, and,
equally important, does not depend at all on the eigensystem of the basic matrix Ab .
For example, there are well-known techniques for accelerating relaxation schemes if
the eigenvalues of CAb are all real and of the same sign. To use these schemes, the
9.1. FORMULATION OF THE MODEL PROBLEM 165
conditioning matrix C must be chosen such that this requirement is satised. A
choice of C which ensures this condition is the negative transpose of Ab.
For example, consider a spatial discretization of the linear convection equation
using centered dierences with a Dirichlet condition on the left side and no constraint
on the right side. Using a rst-order backward dierence on the right side (as in
Section 3.6), this leads to the approximation
82 3 2 39
77 66 ;0ua
> >
>
> 66 ;01 10 1 77> >
<6 77 ~ 66 77=
x~u = 21 x >66 ;1 0 1 77 u + 66 0 77> (9.9)
> 64 ;1 0 15 4 0 5>
>
: >
;2 2 0 ;
The matrix in Eq. 9.9 has eigenvalues whose imaginary parts are much larger than
their real parts. It can rst be conditioned so that the modulus of each element is 1.
This is accomplished using a diagonal preconditioning matrix
2 3
66 10 0
1
0
0
0
0
0
0 77
6 77
D = 2x 66 0 0 1 0 0 77 (9.10)
64 0 0 0 1 0 5
0 0 0 0 1
2
which scales each row. We then further condition with multiplication by the negative
transpose. The result is
A = ;AT A =
2 1 1
2 32 3
66 ;10 10 1 77 66 ;10 10 1 77
66 77 66 77
66 ;1 0 1 77 66 ;1 0 1 7
4 ;1 0 154 ;1 0 1 75
;1 ;1 ;1 1
2 3
66 ;10 ;20 10 1 77
6 7
= 66 1 0 ;2 0 1 77 (9.11)
64 1 0 ;2 1 75
1 1 ;2
166 CHAPTER 9. RELAXATION METHODS
If we dene a permutation matrix P and carry out the process P T [;AT A ]P (which
1
1 1
just reorders the elements of A and doesn't change the eigenvalues) we nd
1
2 32 32 3
66 001 0 0 0 7 6 ;1 0 1 77 66 0 0 0 0 17
66 0 0 1 0 77 66 0 ;2 0 1 76 1 0 0 0 0 77
66 0
0 0 0 1 77 66 1 0 ;2 0 1 77 66 0 0 0 1 0 77
400 1 0 0 75 64 1 0 ;2 1 75 64 0 1 0 0 0 75
1 0 0 0 0 1 1 ;2 0 0 1 0 0
2 3
66 ;21 ;21 1 77
6 77
= 66 1 ;2 1 7 (9.12)
64 1 ;2 1 75
1 ;1
which has all negative real eigenvalues, as given in Appendix B. Thus even when
the basic matrix Ab has nearly imaginary eigenvalues, the conditioned matrix ;ATb Ab
is nevertheless symmetric negative denite (i.e., symmetric with negative real eigen-
values), and the classical relaxation methods can be applied. We do not necessarily
recommend the use of ;ATb as a preconditioner; we simply wish to show that a broad
range of matrices can be preconditioned into a form suitable for our analysis.
A~ ; ~f = 0 (9.13)
where A is symmetric negative denite. The symbol for the dependent variable has
2
been changed to as a reminder that the physics being modeled is no longer time
1 A permutation matrix (dened as a matrix with exactly one 1 in each row and column and has
the property that P T = P ;1 ) just rearranges the rows and columns of a matrix.
2 We use a symmetric negative denite matrix to simplify certain aspects of our analysis. Relax-
ation methods are applicable to more general matrices. The classical methods will usually converge
if Ab is diagonally dominant, as dened in Appendix A.
9.1. FORMULATION OF THE MODEL PROBLEM 167
accurate when we later deal with ODE formulations. Note that the solution of Eq.
9.13, ~ = A; ~f , is guaranteed to exist because A is nonsingular. In the notation of
1
@u = @ u ; g(x)
2
(9.15)
@t @x 2
@ u = g(x)
2
(9.16)
@x 2
which is the one-dimensional form of the Poisson equation. Introducing the three-
point central dierencing scheme for the second derivative with Dirichlet boundary
conditions, we nd
where (b~c) contains the boundary conditions and ~g contains the values of the source
term at the grid nodes. In this case
Ab = 1 B (1; ;2; 1)
x 2
either a Dirichlet or a Neumann condition on the right side, then A has the form
A = B 1; ~b; 1
168 CHAPTER 9. RELAXATION METHODS
~b = [;2; ;2; ; ;2; s]T
s = ;2 or ;1 (9.20)
Note that s = ;1 is easily obtained from the matrix resulting from the Neumann
boundary condition given in Eq. 3.24 using a diagonal conditioning matrix. A tremen-
dous amount of insight to the basic features of relaxation is gained by an appropriate
study of the one-dimensional case, and much of the remaining material is devoted to
this case. We attempt to do this in such a way, however, that it is directly applicable
to two- and three-dimensional problems.
~1 = A; ~f
1
(9.22)
the old values of j; and j , the j th row of Eq. 9.29 is satised. The Gauss-Seidel
1 +1
method is
h i
jn = 21 jn; + jn ; fj
( +1) ( +1)
1
( )
+1 (9.31)
This operator is a simple extension of the point-Jacobi method which uses the most
recent update of j; . Hence the j th row of Eq. 9.29 is satised using the new values of
1
j and j; and the old value of j . The method of successive overrelaxation (SOR)
1 +1
170 CHAPTER 9. RELAXATION METHODS
is based on the idea that if the correction produced by the Gauss-Seidel method tends
to move the solution toward ~1, then perhaps it would be better to move further in
this direction. It is usually expressed in two steps as
h i
~j = 21 jn; + jn ; fj
( +1) ( )
h i
1 +1
written as
~ = c e1 t~x + + cM eM t~xM +~1 (9.37)
|1 1
{z }
error
where what is referred to in time-accurate analysis as the transient solution, is now
referred to in relaxation analysis as the error. It is clear that, if all of the eigenvalues
of H ; A have negative real parts (which implies that H ; A is nonsingular), then the
1 1
been decided upon), the only free choice remaining to accelerate the removal of the
error terms is the choice of h. As we shall see, the three classical methods have all
been conditioned by the choice of H to have an optimum h equal to 1 for a stationary
iteration process.
172 CHAPTER 9. RELAXATION METHODS
9.3.2 ODE Form of the Classical Methods
The three iterative procedures dened by Eqs. 9.30, 9.31 and 9.32 obey no apparent
pattern except that they are easy to implement in a computer code since all of the
data required to update the value of one point are explicitly available at the time
of the update. Now let us study these methods as subsets of ODE as formulated in
Section 9.3.1. Insert the model equation 9.29 into the ODE form 9.35. Then
~
H ddt = B (1; ;2; 1)~ ; ~f (9.40)
As a start, let us use for the numerical integration the explicit Euler method
n = n + h0n
+1 (9.41)
with a step size, h, equal to 1. We arrive at
H (~n ; ~n) = B (1; ;2; 1)~n ; ~f
+1 (9.42)
It is clear that the best choice of H from the point of view of matrix algebra is
;B (1; ;2; 1) since then multiplication from the left by ;B ; (1; ;2; 1) gives the cor-
1
rect answer in one step. However, this is not in the spirit of our study, since multi-
plication by the inverse amounts to solving the problem by a direct method without
iteration. The constraint on H that is in keeping with the formulation of the three
methods described in Section 9.2.3 is that all the elements above the diagonal (or
below the diagonal if the sweeps are from right to left) are zero. If we impose this
constraint and further restrict ourselves to banded tridiagonals with a single constant
in each band, we are led to
B (;; !2 ; 0)(~n ; ~n) = B (1; ;2; 1)~n ; ~f
+1 (9.43)
where and ! are arbitrary. With this choice of notation the three methods presented
in Section 9.2.3 can be identied using the entries in Table 9.1.
TABLE 9.1: VALUES OF and ! IN EQ. 9.43 THAT
LEAD TO CLASSICAL RELAXATION METHODS
! Method Equation
0 1 Point-Jacobi 6:2:3
1 h 1 i Gauss-Seidel 6:2:4
1 2= 1 + sin M + 1 Optimum SOR 6:2:5
9.4. EIGENSYSTEMS OF THE CLASSICAL METHODS 173
The fact that the values in the tables lead to the methods indicated can be veried
by simple algebraic manipulation. However, our purpose is to examine the whole
procedure as a special subset of the theory of ordinary dierential equations. In this
light, the three methods are all contained in the following set of ODE's
d~ = B ; (;; 2 ; 0)B (1; ;2; 1)~ ; ~f
1
(9.44)
dt !
and appear from it in the special case when the explicit Euler method is used for its
numerical integration. The point operator that results from the use of the explicit
Euler scheme is
! !h n ! !h
n ! n ! n n
j = 2 j; + 2 (h ; )j; ; (!h ; 1)j + 2 j ; 2 fj(9.45)
( +1) ( +1) ( ) ( ) ( )
1 1 +1
three classical methods, Point-Jacobi, Gauss-Seidel, and SOR, are identied for the
one-dimensional case by Eq. 9.44 and Table 9.1.
174 CHAPTER 9. RELAXATION METHODS
Given our assumption that the component of the error associated with each eigen-
vector is equally likely to be excited, the asymptotic convergence rate is determined
by the eigenvalue m of G ( I + H ; A) having maximum absolute value. Thus
1
The eigensystem can be determined from Appendix B.1 since both d and f are zero.
The eigenvalues are given by the equation
m
m = ;1 + cos M + 1 ; m = 1; 2; : : : ; M (9.53)
The - relation for the explicit Euler method is m = 1 + m h. This relation can
be plotted for any h. The plot for h = 1, the optimum stationary case, is shown in
Fig. 9.1. For h < 1, the maximum jmj is obtained with m = 1, Fig. 9.2 and for
h > 1, the maximum jm j is obtained with m = M , Fig. 9.3. Note that for h > 1:0
(depending on M ) there is the possibility of instability, i.e. jm j > 1:0. To obtain the
optimal scheme we wish to minimize the maximum jm j which occurs when h = 1,
j j = jM j and the best possible convergence rate is achieved:
1
jm jmax = cos M + 1 (9.54)
9.4. EIGENSYSTEMS OF THE CLASSICAL METHODS 175
For M = 40, we obtain jmjmax = 0:9971. Thus after 500 iterations the error content
associated with each eigenvector is reduced to no more than 0.23 times its initial level.
Again from Appendix B.1, the eigenvectors of H ; A are given by
1
~xj = (xj )m = sin j m ; j = 1; 2; : : : ; M (9.55)
M +1
This is a very \well-behaved" eigensystem with linearly independent eigenvectors and
distinct eigenvalues. The rst 5 eigenvectors are simple sine waves. For M = 5, the
eigenvectors can be written as
2 1=2 3 2 p3=2 3 2 3
p
66 3=2 77 p
66 3=2 77 66 10 77
~x = 666 p 1 777 ; ~x = 666 p0 777 ; ~x = 666 ;1 777 ;
1
64 3=2 75 2
64 ; 3=2 75 3
64 0 75
p
1=2 ; 3=2 1
2 p 3 2 3
p3=2 1=2
p
66 ; 3=2 77 66 ; 3=2 77
~x = 66 p 0 77 ; ~x = 666 p1 777
6 7
(9.56)
4
64 3=2 75 5
64 ; 3=2 75
p
; 3=2 1=2
The corresponding eigenvalues are, from Eq. 9.53
p
= ;1 + 23 = ;0:134
1
= ;1 + 12 = ;0:5
2
=
3 ;1 = ;1:0 (9.57)
= ;1 ; 12 = ;1:5
4
p
= ;1 ; 23 = ;1:866
5
1
+ c [1 ; (1 ; 2 )h]n~x
2 2
176 CHAPTER 9. RELAXATION METHODS
1.0
h = 1.0
m=5 m=1
σm
m=4 m=2
Μ=5
m=3
0.0
-2.0 -1.0 0.0
+ c [1 ; (1
3 )h]n~x 3
+ c [1 ; (1 + 12 )h]n~x
p
4 4
+ c [1 ; (1 + 23 )h]n~x
5 5 (9.58)
which can be studied using the results in Appendix B.2. One can show that the H ; A 1
h < 1.0
h
σm
De
ng
cr
si
ea
ea
si
cr
ng
De
h
0.0
-2.0 -1.0 0.0
λ mh
Exceeds 1.0 at h ∼
∼ 1.072 / Ustable h > 1.072
1.0
h > 1.0
In
cr
ea
h
si
σm
ng
ng
si
ea
h
cr
In
M = 5
0.0
-2.0 -1.0 0.0
λmh
+1 ) ; m = 1 ; 2 ; : : : ; M +1
2 (9.61)
and the corresponding eigenvectors are given by
j; m
~xm = cos m M +1
1
M +1 sin j M +1 ; m = 1; 2 ; : : : ; 2 (9.62)
The - relation for h = 1, the optimum stationary case, is shown in Fig. 9.4. The
m with the largest amplitude is obtained with m = 1. Hence the convergence rate is
jm jmax = cos M + 1
2
(9.63)
Since this is the square of that obtained for the Point-Jacobi method, the error associ-
ated with the \worst" eigenvector is removed in half as many iterations. For M = 40,
jm jmax = 0:9942. 250 iterations are required to reduce the error component of the
worst eigenvector by a factor of roughly 0.23.
The eigenvectors are quite unlike the Point-Jacobi set. They are no longer sym-
metrical, producing waves that are higher in amplitude on one side (the updated side)
than they are on the other. Furthermore, they do not represent a common family for
dierent values of M .
The Jordan canonical form for M = 5 is
2 h~ i 3
66 h~ i 1
77
66 2~ 3 777
6
2
;
X AGS X = JGS = 6 (9.64)
66 ~1 77 777
1
66 3
4 4 1 55
3
~ 3
9.4. EIGENSYSTEMS OF THE CLASSICAL METHODS 179
1.0
h = 1.0
σm
Μ=5
2 defective λ m
0.0
-2.0 -1.0 0.0
λmh
The eigenvectors and principal vectors are all real. For M = 5 they can be written
2 3 2 p 3 2 3 2 3 2 3
1 = 2 3= 2 1 0
66 3=4 77 66 p3=4 77 66 0 77 66 2 77 66 00 77
~x = 666 3=4 777 ; ~x = 666 p0 777 ; ~x = 666 0 777 ; ~x = 666 ;1 777 ; ~x = 666 4 777 (9.65)
1
64 9=16 75 2
64 ; 3=16 75 3
64 0 75 4
64 0 75 5
64 ;4 75
p
9=32 ; 3=32 0 0 1
The corresponding eigenvalues are
= ;1=4
1
= ;3=4
2
) = ;13
+ c (1 ; 4h )n~x
2
3
2
180 CHAPTER 9. RELAXATION METHODS
" #
n n n ; n( n ; 1)
+ c (1 ; h) + c h 1! (1 ; h) + c h 2! (1 ; h) ~x
n; 1 2 2
3 4 5 3
+ c (1 ; h)n + c h n (1 ; h)n; ~x 1
4 5
1! 4
+ c (1 ; h)n~x
5 5 (9.67)
One can show that this can be written in the form given below for M = 5. The
generalization to any M is fairly clear. The H ; A matrix for the SOR method, 1
2 3
66 ;2;x2x+ x x 0 0 0
4 4
77
1 66 ;2x + x x x; 2;x2x+ x x 0 0 77
3 4 3 4 4
2 3
x
2
; 2
x 664 ;2x + x x ; 2x + x x ; 2x + x
x3
x 4 3 4 4
0 77 (9.68)
x ; 2x
5
2 2 3 2 3 4 3 4
x4
5
;2 + x 1 ; 2x + x x ; 2x + x x ; 2x + x x
2 2 3 2 3 4 3
; 2x 4
pm = cos[m=(M + 1)]
If ! = 1, the system is Gauss-Seidel. If 4(1 ; !) + ! pm < 0; zm and m are complex. 2
Using the explicit Euler method to integrate the ODE's, m = 1 ; h + hm , and if 2
h = 1, the optimum value for the stationary case, the - relation reduces to that
shown in Fig. 9.5. This illustrates the fact that for optimum stationary SOR all the
jm j are identical and equal to !opt ; 1. Hence the convergence rate is
jm jmax = !opt ; 1 (9.72)
!opt = 2= 1 + sin M + 1
For M = 40, jmjmax = 0:8578. Hence the worst error component is reduced to less
than 0.23 times its initial value in only 10 iterations, much faster than both Gauss-
Seidel and Point-Jacobi. In practical applications, the optimum value of ! may have
to be determined by trial and error, and the benet may not be as great.
For odd M , there are two real eigenvectors and one real principal vector. The
remaining linearly independent eigenvectors are all complex. For M = 5 they can be
written
2 3 2 3 2 p3(1 3 2 3
1= 2
66 1=2 77 ;
66 9 776 p p )=2
66 3(1 i 2)=6 77 1
66 0 77
6 7 6 7 6
~x = 66 1=3 77 ; ~x = 66 16 77 ; ~x ; = 66 p 7
77 ; ~x = 666 1=3 777 (9.73)
0p
1
64 1=6 75 2
64 13 75 34
64 3(5 i 2)=54 75 5
64 0 75
p p
1=18 6 3(7 4i 2)=162 1=9
The corresponding eigenvalues are
1 = ;2=3
(2) Defectiveplinked to 1
3 = ;(10 ; 2p2i)=9
4 = ;(10 + 2 2i)=9
5 = ;4=3 (9.74)
182 CHAPTER 9. RELAXATION METHODS
1.0
h = 1.0
2 real defective λ m
σm 2 complex λ m
1 real λ m
Μ=5
0.0
-2.0 -1.0 0.0
λmh
+ c (1 ; 2h=3)n~xp
2 2
+ c [1 ; (10 ; 2p2i)h=9]n~x
3 3
+ c [1 ; (10 + 2 2i)h=9]n~x
4 4
+ c (1 ; 4h=3)n~x
5 5 (9.75)
approach this could also be considered and would lead to a study of equations with
nonconstant coecients. It is much simpler, however, to study the case of xed
H and C but variable step size, h. This process changes the Point-Jacobi method
to Richardson's method in standard terminology. For the Gauss-Seidel and SOR
methods it leads to processes that can be superior to the stationary methods.
The nonstationary form of Eq. 9.39 is
9.5. NONSTATIONARY PROCESSES 183
h = 4=(6 ; p
2 0)
h = 4=(6 + 3)
3
Return now to Eq. 9.76. This was derived from Eq. 9.37 on the condition that the
explicit Euler method, Eq. 9.41, was used to integrate the basic ODE's. If instead
the implicit trapezoidal rule
n = n + 21 h(0n + 0n)
+1 +1 (9.89)
is used, the nonstationary formula
0 1 1
N 1 + hn m C
~N = X cm~xm Y B
M
B@ 2 CA + ~1 (9.90)
m =1 n 1
1 ; 2 hnm
=1
would result. This calls for a study of the rational \trapezoidal" polynomial, Pt:
0 1 1
Y B 1 + 2 hn CC
N
(Pt )N () = B @ 1 A (9.91)
n =1 1 ; 2 hn
under the same constraints as before, namely that
max j(Pt)N ()j = minimum ,
b a
(9.92)
with (Pt)N (0) = 1
186 CHAPTER 9. RELAXATION METHODS
0.9
0.8
0.7
0.6
(Pe )3 (λ)
0.5
0.4
0.3
0.2
0.1
0.015
0.01
0.005
(P ) (λ)
e 3
−0.005
−0.01
−0.015
−0.02
−2 −1.8 −1.6 −1.4 −1.2 −1 −0.8 −0.6 −0.4 −0.2 0
λ
(9.93)
b
hn b
This process is also applied to problem 9.85. The results for (Pt) () are shown in
3
Fig. 9.7. The error amplitude is about 1/5 of that found for (Pe) () in the same 3
interval of . The values of h used in Fig. 9.7 are
h = 1p 1
h = 2 2
h = 2 3
9.6 Problems
1. Given a relaxation method in the form
H ~n = A~n ; f~
show that
~n = Gn~ + (I ; Gn)A; f~
0
1
where G = I + H ; A.
1
(I + A )~x = (I ; A )xn + b
1 2
(I + A )xn = (I ; A )~x + b
2 +1 1
where is a parameter. Show that this iterative method can be written in the
form
H (xk ; xk ) = (A + A )xk ; b
+1 1 2
0.9
0.8
0.7
0.6
(P ) (λ)
0.5
t 3
0.4
0.3
0.2
0.1
1.5
0.5
(Pt )3 (λ)
−0.5
−1
−1.5
−2
−2 −1.8 −1.6 −1.4 −1.2 −1 −0.8 −0.6 −0.4 −0.2 0
λ
For the initial condition, use u(x) = 0. Use second-order centered dierences
on a grid with 40 cells (M = 39). Iterate to steady state using
(a) the point-Jacobi method,
(b) the Gauss-Seidel method,
(c) the SOR method with the optimum value of !, and
(d) the 3-step Richardson method derived in Section 9.5.
Plot the solution after the residual is reduced by 2, 3, and 4 orders of mag-
nitude. Plot the logarithm of the L -norm of the residual vs. the number of
2
iterations. Determine the asymptotic convergence rate. Compare with the the-
oretical asymptotic convergence rate.
190 CHAPTER 9. RELAXATION METHODS
Chapter 10
MULTIGRID
The idea of systematically using sets of coarser grids to accelerate the convergence of
iterative schemes that arise from the numerical solution to partial dierential equa-
tions was made popular by the work of Brandt. There are many variations of the
process and many viewpoints of the underlying theory. The viewpoint presented here
is a natural extension of the concepts discussed in Chapter 9.
10.1 Motivation
10.1.1 Eigenvector and Eigenvalue Identication with Space
Frequencies
Consider the eigensystem of the model matrix B (1; ;2; 1). The eigenvalues and
eigenvectors are given in Sections 4.3.2 and 4.3.3, respectively. Notice that as the
magnitudes of the eigenvalues increase, the space-frequency (or wavenumber) of the
corresponding eigenvectors also increase. That is, if the eigenvalues are ordered such
that
j j j j jM j
1 2 (10.1)
then the corresponding eigenvectors are ordered from low to high space frequencies.
This has a rational explanation from the origin of the banded matrix. Note that
@ sin(mx) = ;m sin(mx)
2
2
(10.2)
@x 2
191
192 CHAPTER 10. MULTIGRID
where D(~) is a diagonal matrix containing the eigenvalues. We have seen that
X ; ~ represents a sine transform, and X ~, a sine synthesis. Therefore, the opera-
1
tion 1x D(~) represents the numerical approximation of the multiplication of the
2
appropriate sine wave by the negative square of its wavenumber, ;m . One nds
2
that
1 = M + 1 ;2 + 2 cos m ;m ; m << M
2
2
(10.4)
x m
2
M +1
Hence, the correlation of large magnitudes of m with high space-frequencies is to be
expected for these particular matrix operators. This is consistent with the physics of
diusion as well. However, this correlation is not necessary in general. In fact, the
complete counterexample of the above association is contained in the eigensystem
for B ( 21 ; 1; 12 ). For this matrix one nds, from Appendix B, exactly the opposite
behavior.
(10.10)
m=1 n=1 m=M=2+1 n=1
| {z }
very low amplitude
Combining our basic assumptions, we can be sure that the high frequency content of
~e has been greatly reduced (about 1% or less of its original value in the initial guess).
In addition, assumption 4 ensures that the error has been smoothed.
Next we construct a permutation matrix which separates a vector into two parts,
one containing the odd entries, and the other the even entries of the original vector
(or any other appropriate sorting which is consistent with the interpolation approxi-
mation to be discussed below). For a 7-point example
2 3 2 32 3
66
e
2
77 66
0 1 0 0 0 0 0 76 e1
77
66 e
4
77 66 0 0 0 1 0 0 0 77 66 e2
77 " #
66 e 77 66 0 0 0 0 0 1 0 77 66 e 77 ~
0 777 666 77 ; ~ee = P ~e
6 3
66 e 77 = 66 1 0 0 0 0 0 e (10.11)
66
1
e
3
77 66 0 0 1 0 0 0 0 77 66 e
4
5
77 eo
64 e
5
75 64 0 0 0 0 1 0 0 75 64 e6
75
e
7 0 0 0 0 0 0 1 e7
Multiply Eq. 10.7 from the left by P and, since a permutation matrix has an inverse
which is its transpose, we can write
PA[P ; P ]~e = P ~r 1
(10.12)
The operation PAP ; partitions the A matrix to form
1
2 3
A1 A2 " ~e # " ~r #
64 75 e = e (10.13)
~ ~ro
A 3 A4 e o
Notice that
A ~ee + A ~eo = ~re
1 2 (10.14)
10.2. THE BASIC PROCESS 195
is an exact expression.
At this point we make our one crucial assumption. It is that there is some connec-
tion between ~ee and ~eo brought about by the smoothing property of the Richardson
relaxation procedure. Since the top half of the frequency spectrum has been removed,
it is reasonable to suppose that the odd points are the average of the even points.
For example
e 21 (ea + e )
1 2
e 12 (e + e )
3 2 4
e 12 (e + e )
5 4 6 or ~eo = A0 ~ee 2 (10.15)
e 12 (e + eb )
7 6
It is important to notice that ea and eb represent errors on the boundaries where the
error is zero if the boundary conditions are given. It is also important to notice that we
are dealing with the relation between ~e and ~r so the original boundary conditions and
forcing function (which are contained in ~f in the basic formulation) no longer appear
in the problem. Hence, no aliasing of these functions can occur in subsequent steps.
Finally, notice that, in this formulation, the averaging of ~e is our only approximation,
no operations on ~r are required or justied.
If the boundary conditions are Dirichlet, ea and eb are zero, and one can write for
the example case
2 3
1 0 0
1 6 77
A02 = 2 664 10 11 01 75 (10.16)
0 0 1
With this approximation Eq. 10.14 reduces to
A ~ee + A A0 ~ee = ~re
1 2 2 (10.17)
or
Ac~ee ; ~re = 0 (10.18)
where
Ac = [A + A A0 ]
1 2 2 (10.19)
196 CHAPTER 10. MULTIGRID
The form of Ac, the matrix on the coarse mesh, is completely determined by the
choice of the permutation matrix and the interpolation approximation. If the original
A had been B (7 : 1; ;2; 1), our 7-point example would produce
2 3
66
;2 1 1
77
66 ;2 1 1
66 ;2 1 1 777 2 A A 3
77 6 1 2 7
PAP = 666 1
;1
;2 77 = 4 5 (10.20)
66 77 A3 A4
66 1 1 ;2 77
4 1 1 ;2 5
1 ;2
and Eq. 10.18 gives
A
0
{3 2 1 }|
A1 A2 z 2
3{ 2z Ac
z2 }| {3 2z }| }| 3{
64
;2 7
1 1 16 1 1 77 6 ; 1 1 =2
;2 5 + 4 1 1 75 664 1 1
6 75 = 4 1=2 ;1 1=2 75 (10.21)
;2 1 1 2 1 1=2 ;1
If the boundary conditions are mixed Dirichlet-Neumann, A in the 1-D model
equation is B (1; ~b; 1) where ~b = [;2; ;2; :::; ;2; ;1]T . The eigensystem is given by
Eq. B.19. It is easy to show that the high space-frequencies still correspond to the
eigenvalues with high magnitudes, and, in fact, all of the properties given in Section
10.1 are met. However, the eigenvector structure is dierent from that given in
Eq. 9.55 for Dirichlet conditions. In the present case they are given by
" !#
(2
xjm = sin j 2M + 1 m ; 1) ; m = 1; 2; ; M (10.22)
and are illustrated in Fig. 10.1. All of them go through zero on the left (Dirichlet)
side, and all of them re
ect on the right (Neumann) side.
For Neumann conditions, the interpolation formula in Eq. 10.15 must be changed.
In the particular case illustrated in Fig. 10.1, eb is equal to eM . If Neumann conditions
are on the left, ea = e . When eb = eM , the example in Eq. 10.16 changes to
1
2
1 0 03
6 7
A0 = 21 664 10 11 01 775
2 (10.23)
0 0 2
10.2. THE BASIC PROCESS 197
{3 2 1 }|
A1 A2 z 2
3{ 2z Ac
z2 }| {3 z2 }| }| 3{
64
;2 7
1 1 16 1 1 77 6 ; 1 1= 2
;2 5 + 4 1 1 75 664 1 1
6 75 = 4 1=2 ;1 1=2 75 (10.24)
;2 1 1 2 2 1=2 ;1=2
which gives us what we might have \expected."
We will continue with Dirichlet boundary conditions for the remainder of this
Section. At this stage, we have reduced the problem from B (1; ;2; 1)~e = ~r on the
ne mesh to 21 B (1; ;2; 1)~ee = ~re on the next coarser mesh. Recall that our goal is
to solve for ~e, which will provide us with the solution ~1 using Eq. 10.9. Given ~ee
computed on the coarse grid (possibly using even coarser grids), we can compute ~eo
using Eq. 10.15, and thus ~e. In order to complete the process, we must now determine
the relationship between ~ee and ~e.
In order to examine this relationship, we need to consider the eigensystems of A
and Ac:
A = X X ; ;
1
Ac = XccXc; 1
(10.25)
For A = B (M : 1; ;2; 1) the eigenvalues and eigenvectors are
m m j = 1; 2; ; M
~
m = ;2 1 ; cos M + 1 ; xm = sin j M + 1 ; m = 1; 2; ; M (10.26)
198 CHAPTER 10. MULTIGRID
Based on our assumptions, the most dicult error mode to eliminate is that with
m = 1, corresponding to
= ;2 1 ; cos M + 1 ; ~x = sin j M + 1 ; j = 1; 2; ; M (10.27)
1 1
(c) approaches 2 . In addition, one can easily see that (~xc) coincides with ~x at
1 1 1 1
every second point of the latter vector, that is, it contains the even elements of ~x . 1
Now let us consider the case in which all of the error consists of the eigenvector
component ~x , i.e., ~e = ~x . Then the residual is
1 1
~r = A~x = ~x
1 1 1 (10.29)
and the residual on the coarse grid is
~re = (~xc) 1 1 (10.30)
since (~xc) contains the even elements of ~x . The exact solution on the coarse grid
1 1
satises
~ee = A;c ~re = Xc;c Xc; (~xc)
1 1 1
1 1
(10.31)
2 3
1
66 0 77
= Xc;c 66 .. 77 1
4 . 5
1
0
(10.32)
2 3
1=(c)
66 0 77
1
= Xc 66 .. 77
4 . 5
1
0
(10.33)
10.2. THE BASIC PROCESS 199
= (~x )
1
(c) c 1
1
(10.34)
12 (~xc) 1 (10.35)
C = x I
2
(10.39)
Applying the discretization on the coarse grid with the same preconditioning matrix
as used on the ne grid gives, since xc = 2x,
2
x 2 c
4 c (10.40)
c c
which is precisely the matrix appearing in Eq. 10.37. Thus we see that the process is
recursive. The problem to be solved on the coarse grid is the same as that solved on
the ne grid.
The remaining steps required to complete an entire multigrid process are relatively
straightforward, but they vary depending on the problem and the user. The reduction
can be, and usually is, carried to even coarser grids before returning to the nest level.
However, in each case the appropriate permutation matrix and the interpolation
approximation dene both the down- and up-going paths. The details of nding
optimum techniques are, obviously, quite important but they are not discussed here.
200 CHAPTER 10. MULTIGRID
10.3 A Two-Grid Process
We now describe a two-grid process for the linear problem A~ = f~, which can be easily
generalized to a process with an arbitrary number of grids due to the recursive nature
of multigrid. Extension to nonlinear problems requires that both the solution and the
residual be transferred to the coarse grid in a process known as full approximation
storage multigrid.
1. Perform n iterations of the selected relaxation method on the ne grid, starting
with ~ = ~n. Call the result ~ . This gives
1
(1) 1
where
G = I + H; A 1 1
1
1(10.42)
and H is dened as in Chapter 9 (e.g., Eq. 9.21). Next compute the residual based
1
on ~ :(1)
~r = R ~r (2) 2 (1)
1 (10.44)
In our example in the preceding section, the restriction matrix is
2 3
0 1 0 0 0 0 0
R = 64 0 0 0 1 0 0 0 75
2
1 (10.45)
0 0 0 0 0 1 0
that is, the rst three rows of the permutation matrix P in Eq. 10.11. This type of
restriction is known as \simple injection." Some form of weighted restriction can also
be used.
3. Solve the problem A ~e = ~r on the coarse grid exactly:
2
(2) (2) 2
~e = A; ~r (2)
2
1 (2)
(10.46)
1 See problem 1 of Chapter 9.
2 Note that the coarse grid matrix denoted A2 here was denoted Ac in the preceding section.
10.3. A TWO-GRID PROCESS 201
Here A can be formed by applying the discretization on the coarse grid. In the
preceding example (eq. 10.40), A = 41 B (Mc : 1; ;2; 1). It is at this stage that the
2
2
generalization to a multigrid procedure with more than two grids occurs. If this is the
coarsest grid in the sequence, solve exactly. Otherwise, apply the two-grid process
recursively.
4. Transfer (or prolong) the error back to the ne grid and update the solution:
~n = ~ ; I ~e
+1
(1) 1 (2)
2 (10.47)
In our example, the prolongation matrix is
2 3
66
1=2 0 0 77
66 1 0 0 77
6 1=2 1=2 0 77
I21 = 666 0 1 0 77 (10.48)
66 0 1=2 1=2 77
64 0 0 1 75
0 0 1=2
which follows from Eq. 10.15.
Combining these steps, one obtains
~n = [I ; I A; R A]Gn1 ~ n ; [I ; I A; R A]Gn1 A; f~ + A; f~
+1
1
2 2
1 2
1 1
1
2 2
1 2
1 1
1 1
(10.49)
Thus the basic iteration matrix is
[I ; I A; R A]Gn1
1
2 2
1 2
1 1 (10.50)
The eigenvalues of this matrix determine the convergence rate of the two-grid process.
The basic iteration matrix for a three-grid process is found from Eq. 10.50 by
replacing A; with (I ; G )A; , where
2
1 2
3 2
1
G = [I ; I A; R A ]Gn2
2
3
2
3 3
1 3
2 2 2 (10.51)
In this expression n is the number of relaxation steps on grid 2, I and R are the
2
2
3
3
2
transfer operators between grids 2 and 3, and A is obtained by discretizing on grid 3
3. Extension to four or more grids proceeds in similar fashion.
202 CHAPTER 10. MULTIGRID
10.4 Problems
1. Derive Eq. 10.51.
2. Repeat problem 4 of Chapter 9 using a four-grid multigrid method together
with
(a) the Gauss-Seidel method,
(b) the 3-step Richardson method derived in Section 9.5.
Solve exactly on the coarsest grid. Plot the solution after the residual is reduced
by 2, 3, and 4 orders of magnitude. Plot the logarithm of the L -norm of the
2
residual vs. the number of iterations. Determine the asymptotic convergence
rate. Calculate the theoretical asymptotic convergence rate and compare.
Chapter 11
NUMERICAL DISSIPATION
For j ahx j 1 all of the eigenvalues have modulus less than or equal to unity and hence
the method is stable independent of the sign of a. The quantity j ahx j is known as the
Courant (or CFL) number. It is equal to the ratio of the distance travelled by a wave
in one time step to the mesh spacing.
208 CHAPTER 11. NUMERICAL DISSIPATION
The nature of the dissipative properties of the Lax-Wendro scheme can be seen
by examining the modied partial dierential equation, which is given by
@u + a @u = ; a (x2 ; a2h2 ) @ 3 u ; a2 h (x2 ; a2 h2) @ 4 u + : : :
@t @x 6 @x3 8 @x4
This is derived by substituting Taylor series expansions for all terms in Eq. 11.9 and
converting the time derivatives to space derivatives using Eq. 11.8. The two leading
error terms appear on the right side of the equation. Recall that the odd derivatives on
the right side lead to unwanted dispersion and the even derivatives lead to dissipation
(or amplication, depending on the sign). Therefore, the leading error term in the
Lax-Wendro method is dispersive and proportional to
a @ 3u a x 2 @ 3u
2 2 2
; 6 (x ; a h ) @x3 = ; 6 (1 ; Cn) @x3 2
where u and H = (e + p)= are the velocity and the total enthalpy per unit mass,
respectively.3
11.6 Problems
1. A second-order backward dierence approximation to a 1st derivative is given
as a point operator by
(xu)j = 1 (uj;2 ; 4uj;1 + 3uj )
2x
11.6. PROBLEMS 215
(a) Express this operator in banded matrix form (for periodic boundary condi-
tions), then derive the symmetric and skew-symmetric matrices that have
the matrix operator as their sum. (See Appendix A.3 to see how to con-
struct the symmetric and skew-symmetric components of a matrix.)
(b) Using a Taylor table, nd the derivative which is approximated by the
corresponding symmetric and skew-symmetric operators and the leading
error term for each.
2. Find the modied wavenumber for the rst-order backward dierence operator.
Plot the real and imaginary parts of x vs. x for 0 x . Using
Fourier analysis as in Section 6.6.2, nd jj for the combination of this spatial
operator with 4th-order Runge-Kutta time marching at a Courant number of
unity and plot vs. x for 0 x .
3. Find the modied wavenumber for the operator given in Eq. 11.6. Plot the real
and imaginary parts of x vs. x for 0 x . Using Fourier analysis
as in Section 6.6.2, nd jj for the combination of this spatial operator with
4th-order Runge-Kutta time marching at a Courant number of unity and plot
vs. x for 0 x .
4. Consider the spatial operator obtained by combining second-order centered dif-
ferences with the symmetric operator given in Eq. 11.44. Find the modied
wavenumber for this operator with = 0; 1=12; 1=24, and 1=48. Plot the real
and imaginary parts of x vs. x for 0 x . Using Fourier analysis
as in Section 6.6.2, nd jj for the combination of this spatial operator with
4th-order Runge-Kutta time marching at a Courant number of unity and plot
vs. x for 0 x .
5. Consider the hyperbolic system derived in problem 8 of Chapter 2. Find the
matrix jAj. Form the plus-minus split
ux vectors as in Section 11.4.1.
6. Show that the
ux Jacobian for the 1-D Euler equations can be written in terms
of u and H . Show that the use of the Roe average state given in Eqs. 11.38 and
11.39 leads to satisfaction of Eq. 11.37.
216 CHAPTER 11. NUMERICAL DISSIPATION
Chapter 12
SPLIT AND FACTORED FORMS
In the next two chapters, we present and analyze split and factored algorithms. This
gives the reader a feel for some of the modications which can be made to the basic
algorithms in order to obtain ecient solvers for practical multidimensional applica-
tions, and a means for analyzing such modied forms.
where A = [A + A ] but A and A are not unique. For the time march let us choose
1 2 1 2
the simple, rst-order, explicit Euler method. Then, from observation 2 (new data
1
Notice that Eqs. 12.3 and 12.4 have the same formal order of accuracy and, in
this sense, neither one is to be preferred over the other. However, their numerical
stability can be quite dierent, and techniques to carry out their numerical evaluation
can have arithmetic operation counts that vary by orders of magnitude. Both of these
considerations are investigated later. Here we seek only to apply to some simple cases
the concept of factoring.
where Ac and Ad are matrices representing the convection and dissipation terms,
respectively; and their sum forms the A matrix we have considered in the previous
sections. Choose again the explicit Euler time march so that
+1
~ ) + O (h )
~un = [ I + hAd + hAc]~un + h(bc 2
(12.6)
1 Second-order time-marching methods are considered later.
12.2. FACTORING PHYSICAL REPRESENTATIONS | TIME SPLITTING 219
Now consider the factored form
~un +1 = [ I + hAd ] [ I + hAc]~un + h(bc~)
~ ) + h Ad Ac~un + (bc
= [| I + hAd + h{zAc]~un + h(bc ~ ) +O(h ) (12.7)
2 2
} | {z }
Original Unfactored Terms Higher Order Terms
and we see that Eq. 12.7 and the original unfactored form Eq. 12.6 have identical
orders of accuracy in the time approximation. Therefore, on this basis, their selection
is arbitrary. In practical applications equations such as 12.7 are often applied in a
2
if h jjAdjj < 1, where jjAd jj is some norm of [Ad ]. This time a predictor-corrector
interpretation leads to the sequence
u~n +1
~)
= [ I + hAc]~un + h(bc
[ I ; hAd]~un +1 = u~n +1 (12.10)
The convection operator is applied explicitly, as before, but the diusion operator is
now implicit, requiring a tridiagonal solver if the diusion term is central dierenced.
Since numerical stiness is generally much more severe for the diusion process, this
factored form would appear to be superior to that provided by Eq. 12.8. However,
the important aspect of stability has yet to be discussed.
2 We do not suggest that this particular method is suitable for use. We have yet to determine its
stability, and a rst-order time-march method is usually unsatisfactory.
220 CHAPTER 12. SPLIT AND FACTORED FORMS
We should mention here that Eq. 12.9 can be derived for a dierent point of view
by writing Eq. 12.6 in the form
un ; un = A u + A u + (bc
+1 ~ ) + O(h ) 2
h c n d n +1
Then
~)
[ I ; hAd ]un = [ I + hAc]un + h(bc
+1
We begin by reducing this PDE to a coupled set of ODE's by dierencing the space
derivatives and inspecting the resulting matrix operator.
A clear description of a matrix nite-dierence operator in 2- and 3-D requires some
reference to a mesh. We choose the 3 4 point mesh shown in the Sketch 12.12.
3
My 13 23 33 43
k 12 22 32 42
1 11 21 31 41 (12.12)
1 j Mx
Mesh indexing in 2-D.
3 This could also be called a 5 6 point mesh if the boundary points (labeled in the sketch)
were included, but in these notes we describe the size of a mesh by the number of interior points.
12.3. FACTORING SPACE MATRIX OPERATORS IN 2{D 221
12.3.2 Data Bases and Space Vectors
The dimensioned array in a computer code that allots the storage locations of the
dependent variable(s) is referred to as a data-base. There are many ways to lay out
a data-base. Of these, we consider only two: (1), consecutively along rows that are
themselves consecutive from k = 1 to My , and (2), consecutively along columns that
are consecutive from j = 1 to Mx. We refer to each row or column group as a
space vector (they represent data along lines that are continuous in space) and label
their sum with the symbol U . In particular, (1) and (2) above are referred to as x-
vectors and y-vectors, respectively. The symbol U by itself is not enough to identify
the structure of the data-base and is used only when the structure is immaterial or
understood.
To be specic about the structure, we label a data{base composed of x-vectors with
U x , and one composed of y-vectors with U y . Examples of the order of indexing
( ) ( )
for these space vectors are given in Eq. 12.16 part a and b.
dU = A U + (bc
~) (12.14)
dt x y +
2 3
x j o j 11
6
6
6
x x j o j 7
7
7
21
6
6 x x j o j 7
7 31
6
6 x j o j 7
7 41
6
6
6
7
7
7
;;
6
6 o j x j o 7
7 12
6
A(xx+)y U (x) = 666 o j x x j o 7
7
7 22
6 o j x x j o 7
7 32
6
6
6
o j x j o 777 42
6
6
7
7 ;;
6
6 j o j x 7
7 13
6
6
6
j o j x x 7
7 23
4 j o j x x 75 33
j o j x 43
a:Elements in 2-dimensional, central-dierence, matrix
operator, Ax y , for 34 mesh shown in Sketch 12.12.
+
Data base composed of My x{vectors stored in U x . ( )
and
Axx = Pxy Axy Pyx
( ) ( )
The splittings in Eqs. 12.17 and 12.18 can be combined with factoring in the
manner described in Section 12.2. As an example (rst-order in time), applying the
implicit Euler method to Eq. 12.14 gives
h i
Unx = Unx + h Axx + Ayx Unx + h(bc~ )
( )
+1
( ) ( ) ( ) ( )
+1
or
h i
I ; hAxx ; hAyx Unx = Unx + h(bc~ ) + O(h )
( ) ( ) ( )
+1
( ) 2
(12.19)
As in Section 12.2, we retain the same rst order accuracy with the alternative
h ih i
( ) ( ) ~ ) + O(h )
I ; hAxx I ; hAyx Unx = Unx + h(bc ( )
+1
( ) 2
(12.20)
Write this in predictor-corrector form and permute the data base of the second row.
There results
h i
( ) ( ) ~)
I ; hAxx U~ x = Unx + h(bc ( )
h i y
I ; hAyy Un = U~ y
( ) ( )
+1
( )
(12.21)
224 CHAPTER 12. SPLIT AND FACTORED FORMS
2 3
x x j j
6
6
6
x x x j j 7
7
7
6
6 x x x j j 7
7
6
6
6
x x j j 7
7
7
6
6
7
7
6
6 j x x j 7
7
(x) (x)
6
Ax U = 666 j x x x j 7
7
7 U (x)
6 j x x x j 7
7
6
6
6
j x x j 7
7
7
6
6 7
7
6
6 j j x x 7
7
6
6
6
j j x x x 7
7
4 j j x x x 75
j j x x
2 3 (12.22)
o j o j
6
6
6
o j o j 7
7
7
6
6 o j o j 7
7
6
6
6
o j o j 7
7
7
6
6 77
6
6 o j o j o 7
7
6
A(yx) U (x) = 666 o j o j o 7
o 777 U
7 x ( )
6 o j o j
6
6
6
o j o j o 777
6
6 77
6
6 j o j o 7
7
6
6
6
j o j o 7
7
4 j o j o 75
j o j o
The splitting of Axx y .
( )
+
12.3. FACTORING SPACE MATRIX OPERATORS IN 2{D 225
2
x j x j j 3
6
6 x j x j j 7
7
6
6
6
x j x j j 7
7
7
6
6 7
7
6
6
6
x j x j x j 7
7
7
6
6 x j x j x j 7
7
6
6 x j x j x j 7
7
A(xy) U (y) = 666 7
7
7 U (y)
6
6 j x j x j x 7
7
6
6
6
j x j x j x 7
7
6
6 j x j x j x 777
6
6 7
7
6 7
6
6 j j x j x 7
7
4 j j x j x 5
j j x j x
(12.23)
2
o o j j j 3
6
6 o o o j j j 7
7
6
6
6
o o j j j 7
7
7
6
6 7
7
6
6
6
j o o j j 7
7
7
6
6 j o o o j j 7
7
6
6 j o o j j 7
7
Ay U = 666
(y ) (y ) 7
7
7 U (y)
6
6 j j o o j 7
7
6
6
6
j j o o o j 7
7
7
6
6 j j o o j 7
7
6
6 7
7
6 7
6
6 j j j o o 7
7
4 j j j o o o5
j j j o o
The splitting of Axy y .
( )
+
226 CHAPTER 12. SPLIT AND FACTORED FORMS
12.4 Second-Order Factored Implicit Methods
Second-order accuracy in time can be maintained in a certain factored implicit meth-
ods. For example, apply the trapezoidal method to Eq. 12.14 where the derivative
operators have been split as in Eq. 12.17 or 12.18. Let the data base be immaterial
and the (bc~ ) be time invariant. There results
1 1 1 1
I ; 2 hAx ; 2 hAy Un = I + 2 hAx + 2 hAy Un + h(bc ~ ) + O(h ) (12.24)
3
+1
2 2 4
Then notice that the combination 14 h [AxAy ](Un ; Un) is proportional to h since
2
+1
3
and both the factored and unfactored form of the trapezoidal method are second-order
accurate in the time march.
An alternative form of this kind of factorization is the classical ADI (alternating
direction implicit) method usually written
5
1
I ; 2 hAx U = I + 2 hAy Un + 12 hFn
~ 1
I ; 2 hAy Un = I + 2 hAx U~ + 12 hFn + O(h )
1
+1
1
+1
3
(12.27)
For idealized commuting systems the methods given by Eqs. 12.26 and 12.27 dier
only in their evaluation of a time-dependent forcing term.
Forming the right hand side poses no problem, but nding Un requires the solution
+1
of a sparse, but very large, set of coupled simultaneous equations having the matrix
form shown in Eq. 12.16 part a and b. Furthermore, in real cases involving the Euler
or Navier-Stokes equations, each symbol (o; x; ) represents a 4 4 block matrix with
entries that depend on the pressure, density and velocity eld. Suppose we were to
solve the equations directly. The forward sweep of a simple Gaussian elimination lls 6
all of the 4 4 blocks between the main and outermost diagonal (e.g. between
7
and o in Eq. 12.16 part b.). This must be stored in computer memory to be used to
nd the nal solution in the backward sweep. If Ne represents the order of the small
block matrix (4 in the 2-D Euler case), the approximate memory requirement is
(Ne My ) (Ne My ) Mx
oating point words. Here it is assumed that My < Mx. If My > Mx, My and Mx
would be interchanged. A moderate mesh of 60 200 points would require over 11
million words to nd the solution. Actually current computer power is able to cope
rather easily with storage requirements of this order of magnitude. With computing
speeds of over one giga
op, direct solvers may become useful for nding steady-state
8
words and, for well resolved
ow elds, this probably exceeds memory availability for
some time to come.
On the other hand, consider computing a solution using the factored implicit equa-
tion 12.25. Again computing the right hand side poses no problem. Accumulate the
result of such a computation in the array (RHS ). One can then write the remaining
terms in the two-step predictor-corrector form
I ; 21 hAxx U~ x = (RHS ) x
( ) ( ) ( )
I ; 12 hAyy Uny = U~ y
( ) ( )
+1
( )
(12.28)
6 For matrices as small as those shown there are many gaps in this \ll", but for meshes of
practical size the ll is mostly dense.
7 The lower band is also computed but does not have to be saved unless the solution is to be
repeated for another vector.
8 One billion
oating-point operations per second.
228 CHAPTER 12. SPLIT AND FACTORED FORMS
which has the same appearance as Eq. 12.21 but is second-order time accurate. The
rst step would be solved using My uncoupled block tridiagonal solvers . Inspecting 9
the top of Eq. 12.22, we see that this is equivalent to solving My one-dimensional
problems, each with Mx blocks of order Ne . The temporary solution U~ x would then ( )
be permuted to U~ y and an inspection of the bottom of Eq. 12.23 shows that the nal
( )
one nds
1 1 h
I ; 2 hAx ; 2 hAy Un = h Ax y Un + (bc ~ )i + O(h ) 3
(12.29)
+
Notice that the right side of this equation is the product of h and a term that is
identical to the right side of Eq. 12.14, our original ODE. Thus, if Eq. 12.29 converges,
it is guaranteed to converge to the correct steady-state solution of the ODE. Now we
can factor Eq. 12.29 and maintain O(h ) accuracy. We arrive at the expression
2
1 1 h i
I ; 2 hAx I ; 2 hAy Un = h Ax y Un + (bc~ ) + O(h ) (12.30)
3
+
h i
~)
[I ; hAx][I ; hAy ]Un = h Ax y Un + (bc + (12.31)
In spite of the similarities in derivation, we will see in the next chapter that the
convergence properties of Eq. 12.20 and Eq. 12.31 are vastly dierent.
12.7 Problems
1. Consider the 1-D heat equation:
@u = @ u 2
0x9
@t @x 2
Let u(0; t) = 0 and u(9; t) = 0, so that we can simplify the boundary conditions.
Assume that second order central dierencing is used, i.e.,
(xxu)j = 1 (uj; ; 2uj + uj )
x 2 1 +1
ii. If we reorder the points with the odd points rst and then the even
points, write the space vector, u ? (2)
10 Notice that the only dierence between the O(h2 ) method given by Eq. 12.30 and the O(h)
method given by Eq. 12.31 is the appearance of the factor 1 on the left side of the O(h2 ) method.
2
230 CHAPTER 12. SPLIT AND FACTORED FORMS
iv. The generic ODE representing the discrete form of the heat equation
is
du = A u + f
(1)
(1)
dt 1
du = A u
(2)
(2)
dt 2
7 5
6 0 0 0 0 7
6
60 0 0 0
6 0 0 0 0 777 0 0 4 4
40 0 0 0 0 0 0 05
0 0 0 0 0 0 0 0
20 0 0 0 0 0 0 03
6
6 0 0 0 0 0 0 0 0 77
6
6 0 0 0 0 0 0 0 0 777 2 0 3
6 0
I e = 66 00 00 00 00 0 0 0 0 7 = 64
( )
6 7 7
4 4
7 5
6
6
1 0 0 0 7
7 0 I
60 0 0 0
6 0 1 0 0 77 4 4
40 0 0 0 0 0 1 05
0 0 0 0 0 0 0 1
12.7. PROBLEMS 231
which extract the odd even points from u as follows: u o = I o u and
(2) ( ) ( ) (2)
ue =Ieu .
( ) ( ) (2)
233
234 CHAPTER 13. LINEAR ANALYSIS OF SPLIT AND FACTORED FORMS
Suppose, as a result of space dierencing the PDE, we arrive at a set of ODE's
that can be written
d~u = A ~u + A ~u ; ~f (t) (13.1)
dt ap bp
where the subscript p denotes a circulant matrix. Since both matrices have the same
set of eigenvectors, we can use the arguments made in Section 4.2.3 to uncouple the
set and form the M set of independent equations
w10 = (a + b)1 w1 ; g1 (t)
...
wm0 = (a + b)m wm ; gm(t)
...
wM0 = (a + b)M wM ; gM (t) (13.2)
The analytic solution of the m'th line is
wm(t) = cm e(a+b)mt + P:S:
Note that each a pairs with one, and only one2 , b since they must share a common
eigenvector. This suggests (see Section 4.4:
C C
n n
0.4 0.4
0 0
0 4 8 0 4 8
R∆ R∆
Explicit-Implicit Explicit-Explicit
A simple numerical parametric study of Eq. 13.7 shows that the critical range of
m for any combination of Cn and R occurs when m is near 0 (or 2). From this
we nd that the condition on Cn and R that make jj 1 is
i 2
h
2 2 C n 2
1 + Cn sin = 1 + 4 R sin 2
As ! 0 this gives the stability region
Cn < R2
which is bounded by a hyperbola and shown in Fig. 13.1.
2. The Explicit-Explicit Method
An analysis similar to the one given above shows that this method produces
q " #
2 C n 2 m
jj = 1 + Cn2 sin m 1 ; 4 R sin 2 ; 0 m 2
Again a simple numerical parametric study shows that this has two critical ranges
of m , one near 0, which yields the same result as in the previous example, and the
13.2. EXAMPLE ANALYSIS OF CIRCULANT SYSTEMS 237
other near 180o, which produces the constraint that
Cn < 21 R for R 2
The resulting stability boundary is also shown in Fig. 13.1. The totaly explicit,
factored method has a much smaller region of stability when R is small, as we
should have expected.
From this equation it is clear that 61 3 = 61 (c + d)3 does not match the coecient
of h3 in 1 , so
er = O(h3)
Using P (eh) and Q(eh ) to evaluate er in Section 6.6.3, one can show
er = O(h3)
using either Eq. 13.8 or Eq. 13.9. These results show that, for the model equation,
the hybrid method retains the second-order accuracy of its individual components.
Stability
The stability of the method can be found from Eq. 13.10 by a parametric study of cn
and R dened in Eq. 13.7. This was carried out in a manner similar to that used
to nd the stability boundary of the rst-order explicit-implicit method in Section
13.2.1. The results are plotted in Fig. 13.2. For values of R 2 this second-order
method has a much greater region of stability than the rst-order explicit-implicit
method given by Eq. 12.10 and shown in Fig. 13.1.
0.8
Cn
Stable
0.4
0 4 8
R
∆
_
Figure 13.2: Stability regions for the second-order time-split method.
and
@u + a @u + a @u = 0 (13.12)
@t x @x y @y
Reduce either of these, by means of spatial dierencing approximations, to the coupled
set of ODE's:
dU = [A + A ]U + (bc ~) (13.13)
x y
dt
for the space vector U . The form of the Ax and Ay matrices for three-point central
dierencing schemes are shown in Eqs. 12.22 and 12.23 for the 3 4 mesh shown
in Sketch 12.12. Let us inspect the structure of these matrices closely to see how we
can diagonalize [Ax + Ay ] in terms of the individual eigenvalues of the two matrices
considered separately.
First we write these matrices in the form
2 3 2 ~ ~b1 I 3
B b0 I
A(xx) = 64 B 75 A(yx) = 64 ~b;1 I ~b0 I ~b1 I 75
B ~b;1 I ~b0 I
where B is a banded matrix of the form B (b;1 ; b0; b1 ). Now nd the block eigenvector
240 CHAPTER 13. LINEAR ANALYSIS OF SPLIT AND FACTORED FORMS
matrix that diagonalizes B and use it to diagonalize A(xx). Thus
2 ;1 32 32 3 2 3
X B X
6
4 X ;1 76
54 B 75 64 X 7=6
5 4 75
X ;1 B X
where 2 3
1
6 2 7
= 664 3
7
7
5
4
( )
Notice that the matrix Ay is transparent to this transformation. That is, if we
x
set X diag(X )
2 ~ 3 2 ~ 3
b0 I ~b1 I b0 I ~b1 I
X ;1 64 ~b;1 I ~b0 I ~b1 I 75 X = 64 ~b;1 I ~b0 I ~b1 I 75
~b;1 I ~b0 I ~b;1 I ~b0 I
One now permutes the transformed system to the y-vector data-base using the per-
mutation matrix dened by Eq. 12.13. There results
h i
Pyx X ;1 A(xx) + A(yx) X Pxy =
2 3 2 ~ 3
1 I 6
B 7
6
6 2 I 7
7 6 ~
B 7
6 7+6 6 7 (13.14)
4 3 I 5 4 B~ 75
4 I B~
where B~ is the banded tridiagonal matrix B (~b;1 ; ~b0 ; ~b1), see the bottom of Eq. 12.23.
Next nd the eigenvectors X~ that diagonalize the B~ blocks. Let B~ diag(B~ ) and
X~ diag(X~ ) and form the second transformation
2~ 3
2~
3
6 ~ 7 1
X~ ;1B~ X~ = 664 ~ 775 ; ~ = 64 ~2 7
5
~
3
~
This time, by the same argument as before, the rst matrix on the right side of
Eq. 13.14 is transparent to the transformation, so the nal result is the complete
diagonalization of the matrix Ax+y :
h ih ih i
X~ ;1 Pyx X ;1 A(xx+)y X Pxy X~ =
2 3
1 I + ~
6 7
6
6 2 I + ~ 7
7 (13.15)
6
4 3 I + ~ 7
5
4I + ~
13.3. THE REPRESENTATIVE EQUATION FOR SPACE-SPLIT OPERATORS241
It is important to notice that:
The diagonal matrix on the right side of Eq. 13.15 contains every possible com-
bination of the individual eigenvalues of B and B~ .
Now we are ready to present the representative equation for two dimensional sys-
tems. First reduce the PDE to ODE by some choice4 of space dierencing. This
results in a spatially split A matrix formed from the subsets
1. Is unconditionally stable.
2. Produces the exact (see Eq. 13.18) steady-state solution (of the ODE) for any
h.
3. Converges very rapidly to the steady-state when h is large.
Unfortunately, however, use of this method for 2-D problems is generally impractical
for reasons discussed in Section 12.5.
13.4. EXAMPLE ANALYSIS OF 2-D MODEL EQUATIONS 243
13.4.2 The Factored Nondelta Form of the Implicit Euler
Method
Now apply the factored Euler method given by Eq. 12.20 to the 2-D representative
equation. There results
(1 ; h x)(1 ; h y )un+1 = un + ha
from which
P (E ) = (1 ; h x)(1 ; h y )E ; 1
Q(E ) = h (13.20)
giving the solution
" #n
un = c (1 ; h )(1 ; h ) ; + a; h
1
x y x y x y
We see that this method:
1. Is unconditionally stable.
2. Produces a steady state solution that depends on the choice of h.
3. Converges rapidly to a steady-state for large h, but the converged solution is
completely wrong.
The method requires far less storage then the unfactored form. However, it is not
very useful since its transient solution is only rst-order accurate and, if one tries to
take advantage of its rapid convergence rate, the converged value is meaningless.
1 ; 2 hx 1 ; 2 hy x y
This method:
1. Is unconditionally stable.
2. Produces the exact steady{state solution for any choice of h.
3. Converges very slowly to the steady{state solution for large values of h, since
jj ! 1 as h ! 1.
All of these properties are identical to those found for the factored delta form of the
implicit Euler method. Since it is second order in time, it can be used when time
accuracy is desired, and the factored delta form of the implicit Euler method can be
used when a converged steady-state is all that is required.5 A brief inspection of eqs.
12.26 and 12.27 should be enough to convince the reader that the 's produced by
those methods are identical to the produced by this method.
5In practical codes, the value of h on the left side of the implicit equation is literally switched
from h to 12 h.
13.5. EXAMPLE ANALYSIS OF THE 3-D MODEL EQUATION 245
13.5 Example Analysis of the 3-D Model Equation
The arguments in Section 13.3 generalize to three dimensions and, under the condi-
tions given in 13.16 with an A(zz) included, the model 3-D cases6 have the following
representative equation (with = 0):
du = [ + + ]u + a (13.21)
x y z
dt
Let us analyze a 2nd-order accurate, factored, delta form using this equation. First
apply the trapezoidal method:
un+1 = un + 12 h[(x + y + z )un+1 + (x + y + z )un + 2a]
Rearrange terms:
1 ; 21 h(x + y + z ) un+1 = 1 + 21 h(x + y + z ) un + ha
Put this in delta form:
1 ; 1 h(x + y + z ) un = h[(x + y + z )un + a]
2
Now factor the left side:
1
1; 2 x h ; 1 h ; 1
1 2 y 1 2 z un = h[(x + y + z )un + a] (13.22)
h
This preserves second order accuracy since the error terms
1 h2( + + )u and 1 h3
4 x y x z y z n 8 x y z
are both O(h3). One can derive the characteristic polynomial for Eq. 13.22, nd the
root, and write the solution either in the form
2 1 1 1 3n
2 3
6 1 + h(x + y + z ) + 4 h (x y + x z + y z ) ; 8 h x y z 7
un = c64 21 1 1
7
5
2 3
1 ; 2 h(x + y + z ) + 4 h (xy + xz + y z ) ; 8 h xy z
; + a + (13.23)
x y z
6 Eqs. 13.11 and 13.12, each with an additional term.
246 CHAPTER 13. LINEAR ANALYSIS OF SPLIT AND FACTORED FORMS
or in the form
2 1
1
1
1 3n
3
6 1 + 2 hx 1 + 2 hy 1 + 2 hz ; 4 h x y z 7
7 ; a (13.24)
un = c64
1
1
1 5 x + y + z
1 ; hx 1 ; hy 1 ; hz
2 2 2
It is interesting to notice that a Taylor series expansion of Eq. 13.24 results in
= 1 + h(x + y + z ) + 21 h2(x + y + z )2 (13.25)
+ 14 h3 3z + (2y + 2x) + 22y + 3xy + 22y + 3y + 2x2y + 22xy + 3x +
h i
which veries the second order accuracy of the factored form. Furthermore, clearly,
if the method converges, it converges to the proper steady-state.7
With regards to stability, it follows from Eq. 13.23 that, if all the 's are real and
negative, the method is stable for all h. This makes the method unconditionally stable
for the 3-D diusion model when it is centrally dierenced in space.
Now consider what happens when we apply this method to the biconvection model,
the 3-D form of Eq. 13.12 with periodic boundary conditions. In this case, central
dierencing causes all of the 's to be imaginary with spectrums that include both
positive and negative values. Remember that in our analysis we must consider every
possible combination of these eigenvalues. First write the root in Eq. 13.23 in the
form
+ i ; + i
= 11 ; i ; + i
where , and
are real numbers that can have any sign. Now we can always nd
one combination of the 's for which , and
are both positive. In that case since
the absolute value of the product is the product of the absolute values
(1 ; )2 + ( +
)2
2
jj = (1 ; )2 + ( ;
)2 >1
and the method is unconditionally unstable for the model convection problem.
From the above analysis one would come to the conclusion that the method rep-
resented by Eq. 13.22 should not be used for the 3-D Euler equations. In practical
cases, however, some form of dissipation is almost always added to methods that are
used to solve the Euler equations and our experience to date is that, in the presence
of this dissipation, the instability disclosed above is too weak to cause trouble.
7 However, we already knew this because we chose the delta form.
13.6. PROBLEMS 247
13.6 Problems
1. Starting with the generic ODE,
du = Au + f
dt
we can split A as follows: A = A1 + A2 + A3 + A4. Applying implicit Euler time
marching gives
un+1 ; un = A u + A u + A u + A u + f
h 1 n+1 2 n+1 3 n+1 4 n+1
(a) Write the factored delta form. What is the error term?
(b) Instead of making all of the split terms implicit, leave two explicit:
un+1 ; un = A u + A u + A u + A u + f
h 1 n+1 2 n 3 n+1 4 n
Write the resulting factored delta form and dene the error terms.
(c) The scalar representative equation is
du = ( + + + )u + a
dt 1 2 3 4
For the fully implicit scheme of problem 1a, nd the exact solution to the
resulting scalar dierence equation and comment on the stability, conver-
gence, and accuracy of the converged steady-state solution.
(d) Repeat 1c for the explicit-implicit scheme of problem 1b.
248 CHAPTER 13. LINEAR ANALYSIS OF SPLIT AND FACTORED FORMS
Appendix A
USEFUL RELATIONS AND
DEFINITIONS FROM LINEAR
ALGEBRA
A basic understanding of the fundamentals of linear algebra is crucial to our develop-
ment of numerical methods and it is assumed that the reader is at least familar with
this subject area. Given below is some notation and some of the important relations
between matrices and vectors.
A.1 Notation
1. In the present context a vector is a vertical column or string. Thus
2 v1 3
6 7
~v = 66 v..2 77
4 . 5
vm
T
and its transpose ~v is the horizontal row
~vT = [v1 ; v2; v3; : : : ; vm] ; ~v = [v1 ; v2; v3 ; : : : ; vm ]T
2. A general m m matrix A can be written
2 a11 a12 a1m 3
6a a a2m 777
A = (aij ) = 664 21 22 ... 5
am1 am2 amm
249
250APPENDIX A. USEFUL RELATIONS AND DEFINITIONS FROM LINEAR ALGEBRA
3. An alternative notation for A is
h i
A = ~a1; ~a2; : : : ; ~am
and its transpose AT is 2 ~T 3
66 ~a1T 77
AT = 666 a.2 777
4 ..T 5
~am
4. The inverse of a matrix (if it exists) is written A;1 and has the property that
A;1A = AA;1 = I , where I is the identity matrix.
A.2 Denitions
1. A is symmetric if AT = A.
2. A is skew-symmetric or antisymmetric if AT = ;A.
3. A is diagonally dominant if aii Pj6=i jaij j ; i = 1; 2; : : : ; m and aii > Pj6=i jaij j
for at least one i.
4. A is orthogonal if aij are real and AT A = AAT = I
5. A is the complex conjugate of A.
6. P is a permutation matrix if P ~v is a simple reordering of ~v.
7. The trace of a matrix is Pi aii.
8. A is normal if AT A = AAT .
9. det[A] is the determinant of A.
10. AH is the conjugate transpose of A, (Hermitian).
11. If a b
A= c d
then
det[A] = ad ; bc
and
A;1 = det[1 A] ;dc ;ab
A.3. ALGEBRA 251
A.3 Algebra
We consider only square matrices of the same dimension.
1. A and B are equal if aij = bij for all i; j = 1; 2; : : : ; m.
2. A + (B + C ) = (C + A) + B , etc.
3. sA = (saij ) where s is a scalar.
4. In general AB 6= BA.
5. Transpose equalities:
(A + B )T = AT + B T
(AT )T = A
(AB )T = B T AT
6. Inverse equalities (if the inverse exists):
(A;1);1 = A
(AB );1 = B ;1 A;1
(AT );1 = (A;1 )T
7. Any matrix A can be expressed as the sum of a symmetric and a skew-symmetric
matrix. Thus:
A = 21 A + AT + 12 A ; AT
A.4 Eigensystems
1. The eigenvalue problem for a matrix A is dened as
A~x = ~x or [A ; I ]~x = 0
and the generalized eigenvalue problem, including the matrix B , as
A~x = B~x or [A ; B ]~x = 0
2. If a square matrix with real elements is symmetric, its eigenvalues are all real.
If it is asymmetric, they are all imaginary.
252APPENDIX A. USEFUL RELATIONS AND DEFINITIONS FROM LINEAR ALGEBRA
3. Gershgorin's theorem: The eigenvalues of a matrix lie in the complex plane in
the union of circles having centers located by the diagonals with radii equal to
the sum of the absolute values of the corresponding o-diagonal row elements.
4. In general, an m m matrix A has n~x linearly independent eigenvectors with
n~x m and n distinct eigenvalues (i) with n n~x m.
5. A set of eigenvectors is said to be linearly independent if
a ~xm + b ~xn 6= ~xk ; m 6= n 6= k
for any complex a and b and for all combinations of vectors in the set.
6. If A posseses m linearly independent eigenvectors then A is diagonalizable, i.e.,
X ;1AX =
where X is a matrix whose columns are the eigenvectors,
h i
X = ~x1 ; ~x2; : : : ; ~xm
and is the diagonal matrix
2 0 03
66 01 . . . ... 77
= 66 .. . .2 . . 7
4. . . 0 75
0 0 m
If A can be diagonalized, its eigenvectors completely span the space, and A is
said to have a complete eigensystem.
7. If A has m distinct eigenvalues, then A is always diagonalizable, and with
each distinct eigenvalue there is one associated eigenvector, and this eigenvector
cannot be formed from a linear combination of any of the other eigenvectors.
8. In general, the eigenvalues of a matrix may not be distinct, in which case the
possibility exists that it cannot be diagonalized. If the eigenvalues of a matrix
are not distinct, but all of the eigenvectors are linearly independent, the matrix
is said to be derogatory, but it can still be diagonalized.
9. If a matrix does not have a complete set of linearly independent eigenvectors,
it cannot be diagonalized. The eigenvectors of such a matrix cannot span the
space and the matrix is said to have a defective eigensystem.
A.4. EIGENSYSTEMS 253
10. Defective matrices cannot be diagonalized but they can still be put into a com-
pact form by a similarity transform, S , such that
2J 0 0 3
66 01 J . . . ... 77
J = S ;1AS = 66 .. . .2 . . 7
4 . . . 0 75
0 0 Jk
where there are k linearly independent eigenvectors and Ji is either a Jordan
subblock or i.
11. A Jordan submatrix has the form
2 1 0 0 3
66 0i 1 ... ... 77
66 i 7
Ji = 66 0 0 i ... 0 777
64 ... ... ... 1 75
0 0 0 i
12. Use of the transform S is known as putting A into its Jordan Canonical form.
A repeated root in a Jordan block is referred to as a defective eigenvalue. For
each Jordan submatrix with an eigenvalue i of multiplicity r, there exists one
eigenvector. The other r ; 1 vectors associated with this eigenvalue are referred
to as principal vectors. The complete set of principal vectors and eigenvectors
are all linearly independent.
13. Note that if P is the permutation matrix
2 3
0 0 1
P = 64 0 1 0 75 ; P T = P ;1 = P
1 0 0
then 2 3 2 3
1 0 0 0
P ;1 64 0 1 75 P = 64 1 0 75
0 0 0 1
14. Some of the Jordan subblocks may have the same eigenvalue. For example, the
254APPENDIX A. USEFUL RELATIONS AND DEFINITIONS FROM LINEAR ALGEBRA
matrix 2 2 1 1 3 3
66 64 1 1 75 77
66 1 77
66 1 77
66 1 77
66 1
1 77
66 2 1
77
64 75
2
3
is both defective and derogatory, having:
9 eigenvalues
3 distinct eigenvalues
3 Jordan blocks
5 linearly independent eigenvectors
3 principal vectors with 1
1 principal vector with 2
257
258 APPENDIX B. SOME PROPERTIES OF TRIDIAGONAL MATRICES
These vectors are the columns of the right-hand eigenvector matrix, the elements of
which are
j ; 1
X = (xjm) = ac 2 sin Mjm ; j = 1; 2; ; M (B.4)
+1 m = 1; 2; ; M
Notice that if a = ;1 and c = 1,
j ; 1
a 2 = ei j; 2 ( 1)
(B.5)
c
The left-hand eigenvector matrix of B (a; b; c) can be written
m ; 1
;
X = M +1 a
1
2 c 2 mj
sin M + 1 ; m = 1; 2; ; M
j = 1; 2; ; M
In this case notice that if a = ;1 and c = 1
m ; 1
c 2 = e;i m; 2 ( 1)
(B.6)
a
B.2 Generalized Eigensystem for Simple Tridiag-
onals
This system is dened as follows
2 32
b c x 3 2e f
1
32
x 3
1
6
6 a b c 7
7 6
6 x 777 666 d e f 7
7 6
6 x 777
2 2
6 7 6 7 6
6
6 a b 7
7 6
6 x 77 = 66 d e 7
7 6
6 x 77
6
4
. . .
3
. c 5 4 .. 5 4
7 6 7 6 . . . f 5 4 ... 75
7 6
3
a b xM d e xM
In this case one can show after some algebra that
det[B (a ; d; b ; e; c ; f ] = 0 (B.7)
if
q m
b ; m e + 2 (a ; md)(c ; m f ) cos M + 1 = 0 ; m = 1; 2; ; M (B.8)
If we dene
m = Mm ; p = cos m
+1 m
B.3. THE INVERSE OF A SIMPLE TRIDIAGONAL 259
q
m = eb ; 2(cd + af )pm + 2pm (ec ; fb)(ea ; bd) + [(cd ; af )pm ]
2 2
e ; 4fdpm
2 2
D = 1
0
D = b
1
D = b ; ac
2
2
D = b ; 2abc
3
3
(B.9)
One can also nd the recursion relation
DM = bDM ; ; acDM ;1 2 (B.10)
Eq. B.10 is a linear OE the solution of which was discussed in Section 4.2. Its
characteristic polynomial P (E ) is P (E ; bE + ac) and the two roots to P () = 0
2
!M
DM = (M + 1) 2b ; b = 4ac2
260 APPENDIX B. SOME PROPERTIES OF TRIDIAGONAL MATRICES
Then for M = 4
2 3
D ;cD 3cD ;c D 2
2
1
3
0
and for M = 5
2 3
D4 ;cD
cD ;c D c D 3
2
2
3
1
4
0
Diagonal:
n = m = 1; 2; ; M
dmm = DM ; DM ;m =DM 1
Lower triangle:
m = n + 1; n + 2; ; M ; n = 1; 2; ; M ; 1
dmn = DM ;mDn; (;a)m;n=DM 1
conjugate transpose of X .
for the tridiagonal circulant matrix given by eq. B.12 do not depend on the elements
a; b; c in the matrix. In fact, all circulant matrices of order M have the same set of
linearly independent eigenvectors, even if they are completely dense. An example of
a dense circulant matrix of order M = 4 is
2
b b b b 3
0 1 2 3
6
6
6
b b b b 777
3 0 1 2
(B.15)
4 b b b b 5
2 3 0 1
b b b b
1 2 3 0
The eigenvectors are always given by eq. B.14, and further examination shows that
the elements in these eigenvectors correspond to the elements in a complex harmonic
analysis or complex discrete Fourier series.
Although the eigenvectors of a circulant matrix are independent of its elements,
the eigenvalues are not. For the element indexing shown in eq. B.15 they have the
general form
MX; 1
m = bj ei jm=M (2 )
j =0
of which eq. B.13 is a special case.
262 APPENDIX B. SOME PROPERTIES OF TRIDIAGONAL MATRICES
B.5 Special Cases Found From Symmetries
Consider a mesh with an even number of interior points such as that shown in Fig.
B.1. One can seek from the tridiagonal matrix B (2M : a; b; a; ) the eigenvector subset
that has even symmetry when spanning the interval 0 x . For example, we seek
the set of eigenvectors ~xm for which
2 32x 3 2 3
x1
b a 6
1
7 6
6
6 a b a 7
7 6 x 2 7 6 x2 777
6
6 a ... 7
7
6
6 ... 77 6
6 ... 7
6 7 6 7 = m 66 .. 777
6
6
6
... a 7
7
6
6 .
.
.
7
7 .7
6 76 7 6
6 7
4 a b a 5 4 x2 75
6
4 x2 5
a b x 1 x 1
2 3
b a
6 7
a b a
6
6 7
7
6
6 a . . . 7
7
~ ~
B (M : a; b; a)xm = 6
6 ... a 7
7
~xm = m~xm (B.16)
6
6 7
7
6 a b a 75
4
a b+a
By folding the known eigenvectors of B (2M : a; b; a) about the center, one can show
from previous results that the eigenvalues of eq. B.16 are
!
m = b + 2a cos (22mM;+1)1 ; m = 1; 2; ; M (B.17)
B.6. SPECIAL CASES INVOLVING BOUNDARY CONDITIONS 263
F (u; v) = nF (u; v) (C.1)
for a xed n, F is called homogeneous of degree n. Dierentiating both sides with
respect to and setting = 1 (since the identity holds for all ), we nd
u @F + v @F = nF (u; v)
@u @v (C.2)
Consider next the theorem as it applies to systems of equations. If the vector
F (Q) satises the identity
F (Q) = nF (Q) (C.3)
for a xed n, F is said to be homogeneous of degree n and we nd
" #
@F Q = nF (Q) (C.4)
@q
265
266APPENDIX C. THE HOMOGENEOUS PROPERTY OF THE EULER EQUATIONS
Now it is easy to show, by direct use of eq. C.3, that both E and F in eqs. 2.11 and
2.12 are homogeneous of degree 1, and their Jacobians, A and B , are homogeneous
of degree 0 (actually the latter is a direct consequence of the former).1 This being
the case, we notice that the expansion of the
ux vector in the vicinity of tn which,
according to eq. 6.105 can be written in general as,
E = An Q + O(h2)
F = BnQ + O(h2) (C.6)
since the terms En ; AnQn and Fn ; BnQn are identically zero for homogeneous
vectors of degree 1, see eq. C.4. Notice also that, under this condition, the constant
term drops out of eq. 6.106.
As a nal remark, we notice from the chain rule that for any vectors F and Q
" #
@F (Q) = @F @Q = A @Q (C.7)
@x @Q @x @x
We notice also that for a homogeneous F of degree 1, F = AQ and
" #
@F = A @Q + @A Q (C.8)
@x @x @x
Therefore, if F is homogeneous of degree 1,
" #
@A Q = 0 (C.9)
@x
in spite of the fact that individually [@A=@x] and Q are not equal to zero.
1Note that this depends on the form of the equation of state. The Euler equations are homoge-
neous if the equation of state can be written in the form p = f (), where is the internal energy
per unit mass.
Bibliography
[1] D. Anderson, J. Tannehill, and R. Pletcher. Computational Fluid Mechanics and
Heat Transfer. McGraw-Hill Book Company, New York, 1984.
[2] C. Hirsch. Numerical Computation of Internal and External Flows, volume 1,2.
John Wiley & Sons, New York, 1988.
267