Numerical solution of the space-time tempered fractional diffusion equation. finite differences
|
|
- Andra Quinn
- 7 years ago
- Views:
Transcription
1 Numerical solution of the space-time tempered fractional diffusion equation: Alternatives to finite differences Université catholique de Louvain Belgium Which numerical method is best suited to solve the space-time tempered fractional diffusion equation? γ,β,s t f (x, t) = d(x) α,θ,λ f (x, t) + q(x, t), where the tempered time and space fractional derivatives of order γ and α are defined as: γ,β,s t f (x, t) = f t (x, t) + βe st D γ t α,θ,λ f (x, t) = θ 2 e λx Dx α ( e st f (x, t) ) βs γ f (x, t), ( ) e λx f (x, t) λ α f (x, t) + αθλ α f (x, t), + + θ 2 eλx xd α L ( ) e λx f (x, t) where β is a capacity coefficient, s is the time truncation parameter, λ is the space truncation parameter and θ [, ] is a skewness parameter. That equation is defined for x L and t T.
2 OK, that s quite complicate. Let s start with something easier... We are first going to consider the space-fractional diffusion equation without tempering : where t f (x, t) = d(x) α,θ f (x, t) + q(x, t), α,θ f (x, t) = θ 2 Dx α f (x, t) + + θ 2 x DL α f (x, t). The fractional derivatives Dx α and x DL α the Riemann-Liouville or Caputo sense. can be defined either in A finite difference (FD) discretization of the diffusion term leads to a full diffusion matrix FD schemes are based on the shifted Grünwald approximation: i Dx α j= f (x i, t) w jf i j+ x α N i xdl α f (x j= i, t) w jf i+j x α where the domain has been divided in N segments of finite size x = L N and w k = for k =,, 2,... Γ(k α) Γ(k+)Γ( α) α = 2 α =.99 α =.9 e 2 e 2 e 2 e 4 e k e 4 e k e 4 e k e 2 e 2 e
3 The FD stencil covers the entire domain as soon as α < 2 D D The computational cost of the method is thus O(N 3 ) and storage is O(N 2 ). That s of course unless something clever is done... The finite element (FE) method is a bit more flexible than the FD method but not more efficient The exact solution is approximated by an expansion in terms of low-order compact-support basis functions φ j : f (x, t) N f j (t)φ j (x). j= The discrete equations are obtained by using a Galerkin formulation, which amounts to multiply the model equation by φ i (i =,..., N) and integrate by parts on [, L]. The diffusion term is then discretized as follows: d(x) α,θ f (x, t) D ij f j (t), where the elements of the diffusion matrix D read: D ij = L d dx (dφ i) α,θ φ j dx.
4 The fractional derivative of a compact-support FE basis function does not have a compact support anymore φ j (x) x j φ j (x) α,θ φ j (x) The diffusion matrix is thus again a full matrix. The FE diffusion matrix can be obtained quite easily with piecewise linear basis functions Assuming that the support of the basis function φ i corresponds to [x i, x i ] [x i, x i+ ], we see that D ij = d dφ i dx [x i,x i ] = d Γ(2 α) xi [ x α,θ x i φ j dx d dφx i dx [x i,x i+ ] ] xi φ j (y) dy (x y) α x i + x i x i [ L x xi+ x i α,θ φ j dx, φ j (y) dy (y x) α x i+ x i ] xi+ x i, where we assumed that the diffusivity d is constant. More generally, by interpreting the the FE diffusion matrix as a FD diffusion matrix, we could build FD schemes of arbitrary orders on non-equidistant grids.
5 The pseudo-spectral (PS) method seems better suited to global differential operators The PS method is quite similar to the FE method with the exception that basis functions φ j (x) are now global high-order functions, like Chebyshev polynomials. As a result, less degrees of freedom are required to achieve the same accuracy as with the FE method and the discrete operators are always represented by full matrices whatever the value of α. f (x, t) N f j (t)φ j (x). j= Here we use the Galerkin formulation to discretize the model equations. The diffusion matrix then reads: D ij = L φ i (x) d(x) α,θ φ j (x) w(x) dx. where w(x) is a weight function with respect to which the polynomial basis functions are orthogonal. Integer- and fractional-order derivatives of a PS basis function are global functions φ 8 (x) φ 8 (x) α,θ φ 8 (x) Going from an integer-order to a fractional-order diffusion operator does not significantly change the computational cost.
6 The radial basis function (RBF) method can be seen as a compromise between the FE and PS methods With the RBF method, the model solution is generally expressed as follows: N f (x, t) f j (t)φ( x x j ), j= where φ(r) is a radial function and x j its center. Here we consider the Gaussian radial functions φ(r) = e (εr)2, where the shape parameter ε controls the flatness of the function. A collocation method is usually used to derive the discrete equations. The diffusion matrix then reads: D ij = d(x i ) α,θ x φ j (x i ). It is a full matrix whatever the value of α. The RBF s are global functions that have a spatial location φ j (x) x j φ j (x) α,θ φ j (x) They can be clustered in the region where the solution is steep (like with the FE method) while preserving high-order accuracy (like with the PS method).
7 The fractional derivatives of RBF s can be computed analytically This can be done by expanding the Gaussian radial function in a MacLaurin series: ( 2j α,θ x e ε2 x x i 2 = ( ) j ε 2j j= j! k= (2j)!( ) k x 2j k i k!(2j k)! ) α,θ x k, and truncating the infinite sum once the terms are smaller in magnitude than machine precision. How to avoid ill conditionning? Try RBF-QR... The standard implementation of the RBF method exhibits an increasing ill conditioning when N increases and when ε decreases. This is due to the RBF basis that becomes increasingly near-linearly dependent. The RBF-QR algorithm avoids this issue by constructing a new basis spanning exactly the same function space but much better conditioned. The RBF-QR method converges towards a PS method when ε. RBF-Direct basis RBF-QR basis x x
8 Convergence analysis Find f (x, t) such that with f (x, t) t = d(x) D.2 x f (x, t) + q(x, t) for x [, ] and t >, d(x) = Γ(3.8)x.2 /24, q(x, t) = 2e t x 4, f (x, ) = x 4, f (, t) =, f (, t) = e t. In that case, the exact solution is: f (x, t) = e t x We solve that equation until t = with the 4 numerical schemes and then compute the L 2 error between the discrete and exact solutions The expected convergence rates are achieved log error 4 FD FE 8 RBF, ε = 5 2 RBF, ε = 4 PS N The RBF solution converges towards the PS solution as ε. The FD scheme is st-order accurate and the FE scheme is 2nd-order accurate.
9 By carefully selecting the shape parameter ε, RBF can yield better accuracy than PS Relative max-norm error in computing C D.8 x cos(6x) with respect to ε, for several Chebyshev distributions of N nodes. Now, let s consider the fully fractional equation with space and time tempering... Just to remind you, the model equation is: γ,β,s t f (x, t) = d(x) α,θ,λ f (x, t) + q(x, t), where the time and space fractional derivatives are both tempered: γ,β,s t f (x, t) = f t (x, t) + βe st D γ t α,θ,λ f (x, t) = θ 2 e λx Dx α ( e st f (x, t) ) βs γ f (x, t), ( ) e λx f (x, t) λ α f (x, t) + αθλ α f (x, t). + + θ 2 eλx xd α L ( ) e λx f (x, t) Since the PS method seems to work quite well, let s use that method for the time discretization as well...
10 For the space discretization, we leave it open... The discrete solution is expressed in terms of a matrix of unknown nodal values F jk as follows: f (x, t) f (x, t) = N x N t j= k= φ x j (x)f jk φ t k (t), where φ t k (t) is a Chebyshev polynomial of order k and φx j (x) could be either a FE, PS or radial basis function. We also introduce the following three intermediate variables and assume that they have the same discretization as the model solution: N x N t g(x, t) e st f (x, t) g(x, t) = φ x j (x)g jk φ t k(t), j= k= N x N t h l (x, t) e λx f (x, t) h l (x, t) = φ x j (x)h l jkφ t k(t), j= k= h r (x, t) e λx f (x, t) h N x N t r (x, t) = φ x j (x)h r jkφ t k(t), j= k= To derive the discrete equations, we use a Galerkin formulation in space and time The discrete equations read: φ x i γ,β,s t f (x, t)φ t l = φx i d(x) α,θ,λ f (x, t)φ t l + φx i q(x, t)φ t l, for i N x and l N t. The time derivative term can be expressed as follows: φ x i γ,β,s t = φ x i f φ t l f t φt l + β φ x i e st D γ t g φ t l βs γ φ x i f φ t l = φ x i φ x j x F jk dφt k dt φt l t + β φ x i φ x j x G jk e st D γ t φ t k φ t l t βs γ φ x i φ x j x F jk φ t kφ t l t = M ij F jk T kl + β M ij G jk T γ kl βs γ M ij F jk N kl, That s almost OK but we still have to express G jk in terms of F jk...
11 Tempering is easily handled with a L 2 projection The following L 2 projection can be used to express G jk in terms of F jk : φ x i g(x, t)φ t l = φx i e st f (x, t)φ t l, or φ x i φ x j x G jk φ t k φt l t = φ x i φ x j x F jk e st φ t k φt l t, which amounts to say that G = FE p N, where the matrix E p is such that E p kl = e st φ t k φt l t. The PS Galerkin discretization of the tempered fractional derivative can then be expressed as a product of 3 matrices: φ x i γ,β,s t f (x, t)φ t l = (MFT) il, where T T + β E p N T γ βs γ N. The same can be done for the tempered space derivative φ x i d α,θ,λ f φ t l = θ 2 φx i d e λx Dx α h l φ t l + + θ 2 φx i d e λx xdl α h r φ t l λ α φ x i d f φ t l + αθλ α φ x i d f φt l, = θ 2 φx i d e λx D α x φ x j x H l jk φ t kφ t l t + + θ 2 φx i d e λx xd α L φ x j x H r jk φ t kφ t l t λ α φ x i d φ x j x F jk φ t kφ t l t + αθλ α φ x i = D l ijh l jkn kl + D r ijh r jkn kl R ij F jk N kl + A ij F jk N kl, dφ x j dx x F jk φ t kφ t l t
12 Spatial tempering can again be handled with a L 2 -projection The L 2 projection leads to φ x i φ x j x H l jk φt k φt l t = φ x i e λx φ x j x F jk φ t k φt l t, φ x i φ x j x H r jk φt k φt l t = φ x i e λx φ x j x F jk φ t k φt l t. and by introducing the matrices E l ij = φx i eλx φ x j x and E r ij = φx i e λx φ x j x, we can express H l = M E l F and H r = M E r F. The PS Galerkin discretization of the tempered fractional diffusion term can then be expressed as the product of 3 matrices: φ x i d(x) α,θ,λ f (x, t)φ t l = (DFN) il, where D D l M E l + D r M E r R + A. Finally, the discrete equations have a very simple expression By putting everything together, we can express the discrete equations in matrix form: MFT = DFN + Q, where F is the matrix of unknown coefficients and where Q is the reaction matrix whose entries are Q il = φ x i q(x, t)φt l. That equation can be vectorized by using the Kronecker product (represented by ): ( ) T T M N T D vec(f) = vec(q), () where vec(f) is the vector obtained by stacking the columns of F on top of one another.
13 Dirichlet/Neumann boundary conditions can easily be imposed For instance, the left boundary condition f c d f (, t) + c n (, t) = f l (t) can be discretized as follows: ( c d φ x dφ x ) j j () + c n dx () F jk φ t k φt l t = f l (t)φ t l t. In matrix form, it translates to: ( N T (c d Φ x () T dφ x )) + c n dx ()T vec(f) = f l (t)φ t (t) t. The discretization of the right boundary condition, c d f (L, t) + c n f (L, t) = f r (t), is similar. Convergence analysis Let s consider a PS discretization in both space and time and evaluate the convergence rate. We take α =.8, γ =.8, β =, θ =, and the following diffusivity and reaction functions : d(x) = x where p and q R, and α Γ(p + α), Γ(p + ) q(x, t) = x p e λx e st (q γ,β,s (t) t q q α,λ (x)), q γ,β,s (t) = qt q st q Γ(q + ) + β Γ(q + γ) tq γ βs γ t q, q α,λ (x) = Γ(p + α) Γ(p + ) In that case, the exact solution is ( λ α x α + αλ α (px α λx α ) ). f (x, t) = x p t q e λx e st.
14 When p and q take integer values, the error convergence is exponential p = 3 and q = 3 When the polynomial powers p and q take integer values, the exact solution is C and convergence is exponential. When there is no truncation (i.e. when λ = s = ), only 4 modes in space and time are necessary to exactly represent the solution. When p and/or q take non-integer values, the error convergence is algebraic p = 2.8 and q = 2.6 Convergence is only algebraic since the exact solution has a singularity t = and x =. According to Darboux s principle, the algebraic rate of convergence is controlled by the gravest singularity, which here is due to t q since q < p. Numerical results are in agreement with a theoretical convergence rate of 2q + = 6.2.
15 Diffusion of a Gaussian hill This more qualitative test case just looks at the diffusion of a Gaussian hills. The initial and boundary conditions are: f (x) = f (x, ) = exp( (x L/2) 2 ), f l (t) = f (, t) =, f r (t) = f (L, t) =, for L = and T = 2. To account for the change of dimension of the diffusivity and capacity coefficients when changing the values of α and γ, we define them as d(x) = DL α T and β = T γ, where L and T are characteristic length and time scale, respectively, and where D is a dimensionless constant. We still consider a PS expansion in both space and time. Because of the steepness of the initial solution, we had to use a Chebyshev polynomial expansion with 9 modes in space and modes in time. Diffusion patterns for different values of α and γ without truncation α = 2 γ = α =.2 γ = α = 2 γ =.6 α =.2 γ =.6 f (x, t) f (x, t) 4 4 x x
16 Final solution for different values of the truncation parameters and for α =.2 and γ =.6 As the value of λ increases, the truncation length decreases and the diffusion process becomes subdiffusive. As the value of s increases, the truncation time decreases and the diffusion process becomes superdiffusive. Conclusions Different strokes for different folks Non-local differential operators are best discretized with non-local numerical methods that naturally take the global behavior of the solution into account. Unlike the FD and FE methods, the PS and RBF methods do not result in an extra computational cost when going from integer-order to fractional-order differential operators. The PS and RBF methods achieve exponential convergence rates and thus require a much less degrees of freedom than the FD and FE methods when the solution is smooth enough. Numerical methods that discretize the model solution (like the FE, PS and RBF methods) and not the differential operator (like the FD method) can easily handle tempered fractional derivatives.
17 References Hanert E. (2) A comparison of 3 Eulerian numerical methods for fractional-order transport models, Environmental Fluid Mechanics,, 7-2. Hanert E. (2) On the numerical solution of space-time fractional diffusion models, Computers and Fluids, 46, Piret C. and E. Hanert (23) A radial basis functions method for fractional diffusion equations, Journal of Computational Physics, 238, 7-8. Hanert E. and C. Piret (23) A Chebyshev pseudo-spectral method to solve the space-time tempered fractional diffusion equation, Journal of Computational Physics (in limbo). Hanert E. and C. Piret (23) Discretization of the fractional diffusion equation: Local vs global numerical methods (in preparation).
Lecture Notes to Accompany. Scientific Computing An Introductory Survey. by Michael T. Heath. Chapter 10
Lecture Notes to Accompany Scientific Computing An Introductory Survey Second Edition by Michael T. Heath Chapter 10 Boundary Value Problems for Ordinary Differential Equations Copyright c 2001. Reproduction
More information2x + y = 3. Since the second equation is precisely the same as the first equation, it is enough to find x and y satisfying the system
1. Systems of linear equations We are interested in the solutions to systems of linear equations. A linear equation is of the form 3x 5y + 2z + w = 3. The key thing is that we don t multiply the variables
More informationIntroduction to the Finite Element Method (FEM)
Introduction to the Finite Element Method (FEM) ecture First and Second Order One Dimensional Shape Functions Dr. J. Dean Discretisation Consider the temperature distribution along the one-dimensional
More information1 Determinants and the Solvability of Linear Systems
1 Determinants and the Solvability of Linear Systems In the last section we learned how to use Gaussian elimination to solve linear systems of n equations in n unknowns The section completely side-stepped
More information5.5. Solving linear systems by the elimination method
55 Solving linear systems by the elimination method Equivalent systems The major technique of solving systems of equations is changing the original problem into another one which is of an easier to solve
More informationPOLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS
POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS N. ROBIDOUX Abstract. We show that, given a histogram with n bins possibly non-contiguous or consisting
More informationNonlinear Algebraic Equations Example
Nonlinear Algebraic Equations Example Continuous Stirred Tank Reactor (CSTR). Look for steady state concentrations & temperature. s r (in) p,i (in) i In: N spieces with concentrations c, heat capacities
More informationthe points are called control points approximating curve
Chapter 4 Spline Curves A spline curve is a mathematical representation for which it is easy to build an interface that will allow a user to design and control the shape of complex curves and surfaces.
More information5 Numerical Differentiation
D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives
More informationIntroduction to the Finite Element Method
Introduction to the Finite Element Method 09.06.2009 Outline Motivation Partial Differential Equations (PDEs) Finite Difference Method (FDM) Finite Element Method (FEM) References Motivation Figure: cross
More informationHow High a Degree is High Enough for High Order Finite Elements?
This space is reserved for the Procedia header, do not use it How High a Degree is High Enough for High Order Finite Elements? William F. National Institute of Standards and Technology, Gaithersburg, Maryland,
More informationNumerical Analysis An Introduction
Walter Gautschi Numerical Analysis An Introduction 1997 Birkhauser Boston Basel Berlin CONTENTS PREFACE xi CHAPTER 0. PROLOGUE 1 0.1. Overview 1 0.2. Numerical analysis software 3 0.3. Textbooks and monographs
More informationPOLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS
POLYNOMIAL HISTOPOLATION, SUPERCONVERGENT DEGREES OF FREEDOM, AND PSEUDOSPECTRAL DISCRETE HODGE OPERATORS N. ROBIDOUX Abstract. We show that, given a histogram with n bins possibly non-contiguous or consisting
More informationVector and Matrix Norms
Chapter 1 Vector and Matrix Norms 11 Vector Spaces Let F be a field (such as the real numbers, R, or complex numbers, C) with elements called scalars A Vector Space, V, over the field F is a non-empty
More information1 Review of Least Squares Solutions to Overdetermined Systems
cs4: introduction to numerical analysis /9/0 Lecture 7: Rectangular Systems and Numerical Integration Instructor: Professor Amos Ron Scribes: Mark Cowlishaw, Nathanael Fillmore Review of Least Squares
More informationNovember 16, 2015. Interpolation, Extrapolation & Polynomial Approximation
Interpolation, Extrapolation & Polynomial Approximation November 16, 2015 Introduction In many cases we know the values of a function f (x) at a set of points x 1, x 2,..., x N, but we don t have the analytic
More informationLecture 3: Finding integer solutions to systems of linear equations
Lecture 3: Finding integer solutions to systems of linear equations Algorithmic Number Theory (Fall 2014) Rutgers University Swastik Kopparty Scribe: Abhishek Bhrushundi 1 Overview The goal of this lecture
More informationPartial Fractions. Combining fractions over a common denominator is a familiar operation from algebra:
Partial Fractions Combining fractions over a common denominator is a familiar operation from algebra: From the standpoint of integration, the left side of Equation 1 would be much easier to work with than
More information1 Finite difference example: 1D implicit heat equation
1 Finite difference example: 1D implicit heat equation 1.1 Boundary conditions Neumann and Dirichlet We solve the transient heat equation ρc p t = ( k ) (1) on the domain L/2 x L/2 subject to the following
More informationChebyshev Expansions
Chapter 3 Chebyshev Expansions The best is the cheapest. Benjamin Franklin 3.1 Introduction In Chapter, approximations were considered consisting of expansions around a specific value of the variable (finite
More informationContinuous Groups, Lie Groups, and Lie Algebras
Chapter 7 Continuous Groups, Lie Groups, and Lie Algebras Zeno was concerned with three problems... These are the problem of the infinitesimal, the infinite, and continuity... Bertrand Russell The groups
More informationAN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS
AN INTRODUCTION TO NUMERICAL METHODS AND ANALYSIS Revised Edition James Epperson Mathematical Reviews BICENTENNIAL 0, 1 8 0 7 z ewiley wu 2007 r71 BICENTENNIAL WILEY-INTERSCIENCE A John Wiley & Sons, Inc.,
More informationLinear Programming. March 14, 2014
Linear Programming March 1, 01 Parts of this introduction to linear programming were adapted from Chapter 9 of Introduction to Algorithms, Second Edition, by Cormen, Leiserson, Rivest and Stein [1]. 1
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationPartial Fractions. p(x) q(x)
Partial Fractions Introduction to Partial Fractions Given a rational function of the form p(x) q(x) where the degree of p(x) is less than the degree of q(x), the method of partial fractions seeks to break
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS 1. SYSTEMS OF EQUATIONS AND MATRICES 1.1. Representation of a linear system. The general system of m equations in n unknowns can be written a 11 x 1 + a 12 x 2 +
More informationLINEAR ALGEBRA W W L CHEN
LINEAR ALGEBRA W W L CHEN c W W L Chen, 1997, 2008 This chapter is available free to all individuals, on understanding that it is not to be used for financial gain, and may be downloaded and/or photocopied,
More informationInner Product Spaces
Math 571 Inner Product Spaces 1. Preliminaries An inner product space is a vector space V along with a function, called an inner product which associates each pair of vectors u, v with a scalar u, v, and
More informationINTEGRAL METHODS IN LOW-FREQUENCY ELECTROMAGNETICS
INTEGRAL METHODS IN LOW-FREQUENCY ELECTROMAGNETICS I. Dolezel Czech Technical University, Praha, Czech Republic P. Karban University of West Bohemia, Plzeft, Czech Republic P. Solin University of Nevada,
More informationIntroduction to Algebraic Geometry. Bézout s Theorem and Inflection Points
Introduction to Algebraic Geometry Bézout s Theorem and Inflection Points 1. The resultant. Let K be a field. Then the polynomial ring K[x] is a unique factorisation domain (UFD). Another example of a
More informationLINEAR ALGEBRA. September 23, 2010
LINEAR ALGEBRA September 3, 00 Contents 0. LU-decomposition.................................... 0. Inverses and Transposes................................. 0.3 Column Spaces and NullSpaces.............................
More informationThe Basics of FEA Procedure
CHAPTER 2 The Basics of FEA Procedure 2.1 Introduction This chapter discusses the spring element, especially for the purpose of introducing various concepts involved in use of the FEA technique. A spring
More information1 The Brownian bridge construction
The Brownian bridge construction The Brownian bridge construction is a way to build a Brownian motion path by successively adding finer scale detail. This construction leads to a relatively easy proof
More informationTo give it a definition, an implicit function of x and y is simply any relationship that takes the form:
2 Implicit function theorems and applications 21 Implicit functions The implicit function theorem is one of the most useful single tools you ll meet this year After a while, it will be second nature to
More information1 2 3 1 1 2 x = + x 2 + x 4 1 0 1
(d) If the vector b is the sum of the four columns of A, write down the complete solution to Ax = b. 1 2 3 1 1 2 x = + x 2 + x 4 1 0 0 1 0 1 2. (11 points) This problem finds the curve y = C + D 2 t which
More informationAn Overview of the Finite Element Analysis
CHAPTER 1 An Overview of the Finite Element Analysis 1.1 Introduction Finite element analysis (FEA) involves solution of engineering problems using computers. Engineering structures that have complex geometry
More informationSolving Systems of Linear Equations
LECTURE 5 Solving Systems of Linear Equations Recall that we introduced the notion of matrices as a way of standardizing the expression of systems of linear equations In today s lecture I shall show how
More information3. INNER PRODUCT SPACES
. INNER PRODUCT SPACES.. Definition So far we have studied abstract vector spaces. These are a generalisation of the geometric spaces R and R. But these have more structure than just that of a vector space.
More informationNumerical Methods for Differential Equations
Numerical Methods for Differential Equations Course objectives and preliminaries Gustaf Söderlind and Carmen Arévalo Numerical Analysis, Lund University Textbooks: A First Course in the Numerical Analysis
More informationWe shall turn our attention to solving linear systems of equations. Ax = b
59 Linear Algebra We shall turn our attention to solving linear systems of equations Ax = b where A R m n, x R n, and b R m. We already saw examples of methods that required the solution of a linear system
More informationAlgebra Unpacked Content For the new Common Core standards that will be effective in all North Carolina schools in the 2012-13 school year.
This document is designed to help North Carolina educators teach the Common Core (Standard Course of Study). NCDPI staff are continually updating and improving these tools to better serve teachers. Algebra
More informationMATH10212 Linear Algebra. Systems of Linear Equations. Definition. An n-dimensional vector is a row or a column of n numbers (or letters): a 1.
MATH10212 Linear Algebra Textbook: D. Poole, Linear Algebra: A Modern Introduction. Thompson, 2006. ISBN 0-534-40596-7. Systems of Linear Equations Definition. An n-dimensional vector is a row or a column
More informationMathematics Course 111: Algebra I Part IV: Vector Spaces
Mathematics Course 111: Algebra I Part IV: Vector Spaces D. R. Wilkins Academic Year 1996-7 9 Vector Spaces A vector space over some field K is an algebraic structure consisting of a set V on which are
More informationABSTRACT FOR THE 1ST INTERNATIONAL WORKSHOP ON HIGH ORDER CFD METHODS
1 ABSTRACT FOR THE 1ST INTERNATIONAL WORKSHOP ON HIGH ORDER CFD METHODS Sreenivas Varadan a, Kentaro Hara b, Eric Johnsen a, Bram Van Leer b a. Department of Mechanical Engineering, University of Michigan,
More information2.2 Creaseness operator
2.2. Creaseness operator 31 2.2 Creaseness operator Antonio López, a member of our group, has studied for his PhD dissertation the differential operators described in this section [72]. He has compared
More informationby the matrix A results in a vector which is a reflection of the given
Eigenvalues & Eigenvectors Example Suppose Then So, geometrically, multiplying a vector in by the matrix A results in a vector which is a reflection of the given vector about the y-axis We observe that
More informationIntegrals of Rational Functions
Integrals of Rational Functions Scott R. Fulton Overview A rational function has the form where p and q are polynomials. For example, r(x) = p(x) q(x) f(x) = x2 3 x 4 + 3, g(t) = t6 + 4t 2 3, 7t 5 + 3t
More informationSolving Systems of Linear Equations Using Matrices
Solving Systems of Linear Equations Using Matrices What is a Matrix? A matrix is a compact grid or array of numbers. It can be created from a system of equations and used to solve the system of equations.
More informationThe Quantum Harmonic Oscillator Stephen Webb
The Quantum Harmonic Oscillator Stephen Webb The Importance of the Harmonic Oscillator The quantum harmonic oscillator holds a unique importance in quantum mechanics, as it is both one of the few problems
More informationSolving simultaneous equations using the inverse matrix
Solving simultaneous equations using the inverse matrix 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More informationHøgskolen i Narvik Sivilingeniørutdanningen STE6237 ELEMENTMETODER. Oppgaver
Høgskolen i Narvik Sivilingeniørutdanningen STE637 ELEMENTMETODER Oppgaver Klasse: 4.ID, 4.IT Ekstern Professor: Gregory A. Chechkin e-mail: chechkin@mech.math.msu.su Narvik 6 PART I Task. Consider two-point
More informationEECS 556 Image Processing W 09. Interpolation. Interpolation techniques B splines
EECS 556 Image Processing W 09 Interpolation Interpolation techniques B splines What is image processing? Image processing is the application of 2D signal processing methods to images Image representation
More informationBack to Elements - Tetrahedra vs. Hexahedra
Back to Elements - Tetrahedra vs. Hexahedra Erke Wang, Thomas Nelson, Rainer Rauch CAD-FEM GmbH, Munich, Germany Abstract This paper presents some analytical results and some test results for different
More informationBasics of Polynomial Theory
3 Basics of Polynomial Theory 3.1 Polynomial Equations In geodesy and geoinformatics, most observations are related to unknowns parameters through equations of algebraic (polynomial) type. In cases where
More informationNatural cubic splines
Natural cubic splines Arne Morten Kvarving Department of Mathematical Sciences Norwegian University of Science and Technology October 21 2008 Motivation We are given a large dataset, i.e. a function sampled
More informationFinite Element Formulation for Beams - Handout 2 -
Finite Element Formulation for Beams - Handout 2 - Dr Fehmi Cirak (fc286@) Completed Version Review of Euler-Bernoulli Beam Physical beam model midline Beam domain in three-dimensions Midline, also called
More informationLeast-Squares Intersection of Lines
Least-Squares Intersection of Lines Johannes Traa - UIUC 2013 This write-up derives the least-squares solution for the intersection of lines. In the general case, a set of lines will not intersect at a
More informationMATH 4330/5330, Fourier Analysis Section 11, The Discrete Fourier Transform
MATH 433/533, Fourier Analysis Section 11, The Discrete Fourier Transform Now, instead of considering functions defined on a continuous domain, like the interval [, 1) or the whole real line R, we wish
More information1 Homework 1. [p 0 q i+j +... + p i 1 q j+1 ] + [p i q j ] + [p i+1 q j 1 +... + p i+j q 0 ]
1 Homework 1 (1) Prove the ideal (3,x) is a maximal ideal in Z[x]. SOLUTION: Suppose we expand this ideal by including another generator polynomial, P / (3, x). Write P = n + x Q with n an integer not
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationSOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis
More informationFINITE DIFFERENCE METHODS
FINITE DIFFERENCE METHODS LONG CHEN Te best known metods, finite difference, consists of replacing eac derivative by a difference quotient in te classic formulation. It is simple to code and economic to
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationLogistic Regression. Jia Li. Department of Statistics The Pennsylvania State University. Logistic Regression
Logistic Regression Department of Statistics The Pennsylvania State University Email: jiali@stat.psu.edu Logistic Regression Preserve linear classification boundaries. By the Bayes rule: Ĝ(x) = arg max
More informationLinear Programming. April 12, 2005
Linear Programming April 1, 005 Parts of this were adapted from Chapter 9 of i Introduction to Algorithms (Second Edition) /i by Cormen, Leiserson, Rivest and Stein. 1 What is linear programming? The first
More informationFinite Element Formulation for Plates - Handout 3 -
Finite Element Formulation for Plates - Handout 3 - Dr Fehmi Cirak (fc286@) Completed Version Definitions A plate is a three dimensional solid body with one of the plate dimensions much smaller than the
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationINTERPOLATION. Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y).
INTERPOLATION Interpolation is a process of finding a formula (often a polynomial) whose graph will pass through a given set of points (x, y). As an example, consider defining and x 0 =0, x 1 = π 4, x
More informationHow To Prove The Dirichlet Unit Theorem
Chapter 6 The Dirichlet Unit Theorem As usual, we will be working in the ring B of algebraic integers of a number field L. Two factorizations of an element of B are regarded as essentially the same if
More information8.2. Solution by Inverse Matrix Method. Introduction. Prerequisites. Learning Outcomes
Solution by Inverse Matrix Method 8.2 Introduction The power of matrix algebra is seen in the representation of a system of simultaneous linear equations as a matrix equation. Matrix algebra allows us
More information2.4 Real Zeros of Polynomial Functions
SECTION 2.4 Real Zeros of Polynomial Functions 197 What you ll learn about Long Division and the Division Algorithm Remainder and Factor Theorems Synthetic Division Rational Zeros Theorem Upper and Lower
More informationLinear Threshold Units
Linear Threshold Units w x hx (... w n x n w We assume that each feature x j and each weight w j is a real number (we will relax this later) We will study three different algorithms for learning linear
More information3. Interpolation. Closing the Gaps of Discretization... Beyond Polynomials
3. Interpolation Closing the Gaps of Discretization... Beyond Polynomials Closing the Gaps of Discretization... Beyond Polynomials, December 19, 2012 1 3.3. Polynomial Splines Idea of Polynomial Splines
More informationLecture 3: Linear methods for classification
Lecture 3: Linear methods for classification Rafael A. Irizarry and Hector Corrada Bravo February, 2010 Today we describe four specific algorithms useful for classification problems: linear regression,
More informationPartial Fractions. (x 1)(x 2 + 1)
Partial Fractions Adding rational functions involves finding a common denominator, rewriting each fraction so that it has that denominator, then adding. For example, 3x x 1 3x(x 1) (x + 1)(x 1) + 1(x +
More information13 MATH FACTS 101. 2 a = 1. 7. The elements of a vector have a graphical interpretation, which is particularly easy to see in two or three dimensions.
3 MATH FACTS 0 3 MATH FACTS 3. Vectors 3.. Definition We use the overhead arrow to denote a column vector, i.e., a linear segment with a direction. For example, in three-space, we write a vector in terms
More informationIntroduction to spectral methods
Introduction to spectral methods Eric Gourgoulhon Laboratoire de l Univers et de ses Théories (LUTH) CNRS / Observatoire de Paris Meudon, France Based on a collaboration with Silvano Bonazzola, Philippe
More informationScattered Node Compact Finite Difference-Type Formulas Generated from Radial Basis Functions
Scattered Node Compact Finite Difference-Type Formulas Generated from Radial Basis Functions Grady B. Wright a,,, Bengt Fornberg b,2 a Department of Mathematics, University of Utah, Salt Lake City, UT
More informationBindel, Spring 2012 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Feb 8
Spaces and bases Week 3: Wednesday, Feb 8 I have two favorite vector spaces 1 : R n and the space P d of polynomials of degree at most d. For R n, we have a canonical basis: R n = span{e 1, e 2,..., e
More informationSYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89. by Joseph Collison
SYSTEMS OF EQUATIONS AND MATRICES WITH THE TI-89 by Joseph Collison Copyright 2000 by Joseph Collison All rights reserved Reproduction or translation of any part of this work beyond that permitted by Sections
More informationMATHEMATICAL METHODS OF STATISTICS
MATHEMATICAL METHODS OF STATISTICS By HARALD CRAMER TROFESSOK IN THE UNIVERSITY OF STOCKHOLM Princeton PRINCETON UNIVERSITY PRESS 1946 TABLE OF CONTENTS. First Part. MATHEMATICAL INTRODUCTION. CHAPTERS
More informationDifferentiation and Integration
This material is a supplement to Appendix G of Stewart. You should read the appendix, except the last section on complex exponentials, before this material. Differentiation and Integration Suppose we have
More informationSeveral Views of Support Vector Machines
Several Views of Support Vector Machines Ryan M. Rifkin Honda Research Institute USA, Inc. Human Intention Understanding Group 2007 Tikhonov Regularization We are considering algorithms of the form min
More informationLecture Notes 2: Matrices as Systems of Linear Equations
2: Matrices as Systems of Linear Equations 33A Linear Algebra, Puck Rombach Last updated: April 13, 2016 Systems of Linear Equations Systems of linear equations can represent many things You have probably
More informationQuotient Rings and Field Extensions
Chapter 5 Quotient Rings and Field Extensions In this chapter we describe a method for producing field extension of a given field. If F is a field, then a field extension is a field K that contains F.
More informationSolution of Linear Systems
Chapter 3 Solution of Linear Systems In this chapter we study algorithms for possibly the most commonly occurring problem in scientific computing, the solution of linear systems of equations. We start
More informationLecture 2 Matrix Operations
Lecture 2 Matrix Operations transpose, sum & difference, scalar multiplication matrix multiplication, matrix-vector product matrix inverse 2 1 Matrix transpose transpose of m n matrix A, denoted A T or
More informationLinearly Independent Sets and Linearly Dependent Sets
These notes closely follow the presentation of the material given in David C. Lay s textbook Linear Algebra and its Applications (3rd edition). These notes are intended primarily for in-class presentation
More informationDERIVATIVES AS MATRICES; CHAIN RULE
DERIVATIVES AS MATRICES; CHAIN RULE 1. Derivatives of Real-valued Functions Let s first consider functions f : R 2 R. Recall that if the partial derivatives of f exist at the point (x 0, y 0 ), then we
More informationSecond Order Linear Nonhomogeneous Differential Equations; Method of Undetermined Coefficients. y + p(t) y + q(t) y = g(t), g(t) 0.
Second Order Linear Nonhomogeneous Differential Equations; Method of Undetermined Coefficients We will now turn our attention to nonhomogeneous second order linear equations, equations with the standard
More information1 Solving LPs: The Simplex Algorithm of George Dantzig
Solving LPs: The Simplex Algorithm of George Dantzig. Simplex Pivoting: Dictionary Format We illustrate a general solution procedure, called the simplex algorithm, by implementing it on a very simple example.
More informationUnified Lecture # 4 Vectors
Fall 2005 Unified Lecture # 4 Vectors These notes were written by J. Peraire as a review of vectors for Dynamics 16.07. They have been adapted for Unified Engineering by R. Radovitzky. References [1] Feynmann,
More informationAn important theme in this book is to give constructive definitions of mathematical objects. Thus, for instance, if you needed to evaluate.
Chapter 10 Series and Approximations An important theme in this book is to give constructive definitions of mathematical objects. Thus, for instance, if you needed to evaluate 1 0 e x2 dx, you could set
More informationElasticity Theory Basics
G22.3033-002: Topics in Computer Graphics: Lecture #7 Geometric Modeling New York University Elasticity Theory Basics Lecture #7: 20 October 2003 Lecturer: Denis Zorin Scribe: Adrian Secord, Yotam Gingold
More informationA Brief Review of Elementary Ordinary Differential Equations
1 A Brief Review of Elementary Ordinary Differential Equations At various points in the material we will be covering, we will need to recall and use material normally covered in an elementary course on
More informationChristfried Webers. Canberra February June 2015
c Statistical Group and College of Engineering and Computer Science Canberra February June (Many figures from C. M. Bishop, "Pattern Recognition and ") 1of 829 c Part VIII Linear Classification 2 Logistic
More informationTHE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS
THE FUNDAMENTAL THEOREM OF ALGEBRA VIA PROPER MAPS KEITH CONRAD 1. Introduction The Fundamental Theorem of Algebra says every nonconstant polynomial with complex coefficients can be factored into linear
More information