Partititioned Methods for Multifield Problems
|
|
- Magnus Hensley
- 5 years ago
- Views:
Transcription
1 Partititioned Methods for Multifield Problems Joachim Rang, Joachim Rang Partititioned Methods for Multifield Problems Seite 1
2 Non-matching matches usually the fluid and the structure mesh do not match transfer informations from fluid to structure and vice versa use an interpolation or projection step Examples: nearest neighbour interpolation, projection methods, scattered data interpolation Joachim Rang Partititioned Methods for Multifield Problems Seite 2
3 The setting boundary conditions at the interface: u f = u s and p s n s = p f n f u f, u s... displacements p f... fluid pressure p s... stress tensor n f, n s... outer normals Joachim Rang Partititioned Methods for Multifield Problems Seite 3
4 Discretisation discretisation of u and p n: N u u(x) = N j (x)u j, j=1 N p p(x) n(x) = D j (x)p j j=1 discrete form of interface conditions U f = H fs U s and P s = H sf P f where H fs R nf u,ns u and Hsf R ns p,nf p H... transformation matrices between fluid and structure mesh Joachim Rang Partititioned Methods for Multifield Problems Seite 4
5 Energy conservation Condition: u f p f n f ds = Γ f u s p s n s ds Γ s discrete form of lhs: N f N u p f ( ) u f p f n f ds Di f (x)nj f (x)ds Γ f Γ f j=1 Let M ij ff R nf p,n f u be given by Then M ij ff := i=1 Γ f D f i (x)n f j (x)ds Γ f u f p f n f ds [M ff U f ] P f U f j P f i, Joachim Rang Partititioned Methods for Multifield Problems Seite 5
6 Energy conservation Condition: discrete form of rhs: u f p f n f ds = u s p s n s ds Γ f Γ s Γ s u s p s n s ds [M ss U s ] P s where Mss ij R ns p,ns u be given by Mss ij := Di s (x)ns j (x)ds Γ s Joachim Rang Partititioned Methods for Multifield Problems Seite 6
7 Conservation of energy It follows Then Chose [M ff U f ] P f = [M ss U s ] P s P s = [ ] M ff H fs Mss 1 Pf H sf := [ ] M ff H fs Mss Joachim Rang Partititioned Methods for Multifield Problems Seite 7
8 Consistent interpolation Aim: constant displacement and constant pressure should be exactly interpolated over the interface row-sum of H fs and H sf = [ ] M ff H fs Mss 1 should be equal to one Note, this is not the case for general transformation matrices H sf Joachim Rang Partititioned Methods for Multifield Problems Seite 8
9 Coupling methods Nearest neighbour interpolation Weighted residual method scattered data interpolation Joachim Rang Partititioned Methods for Multifield Problems Seite 9
10 Nearest neighbour interpolation Idea: Find the nearest point x A in the mesh A and assign the variable x B with the value X A transformation matrix H BA... Boolean matrix condition for exact interpolation of pressure values n f u i=1 Hfs ik xi f xk s Example: (equidistant grid) = 1, k = 1,..., n s u n f u i=1 H ik fs = xs x f, condition not satisfied in general k = 1,..., ns u Joachim Rang Partititioned Methods for Multifield Problems Seite 1
11 Weighted residual method interface condition in weak formulation: (w B (x) w A (x))λ(x)dx =, where w {u, pn}. λ... Lagrangian multiplier discretisation w A (x) = w B (x) = n A j=1 n B i=1 Γ Ψ A j (x)w Aj, Ψ B i (x)w Bi Joachim Rang Partititioned Methods for Multifield Problems Seite 11
12 Weighted residual method Then Γ λ(x) n B i=1 Ψ B i (x)w Bi dx = Γ λ(x) n A j=1 Ψ A j (x)w Aj dx mortar approach: λ(x) = n α k=1 Ψ α k (x), α {A, B} optimal for non-conforming but matching grids Joachim Rang Partititioned Methods for Multifield Problems Seite 12
13 Weighted residual method Then n B i=1 ( ) Ψ A k (x)ψ B i (x)dx W Bi = Γ n A j=1 ( ) Ψ A j (x)ψ B k (x)dx Γ W Aj Let Then Cki αb := Ψ A k (x)ψ B i (x)dx, Γ C αb W B = C alphaa W A Ckj αa := Ψ A j (x)ψ B k (x)dx Γ Joachim Rang Partititioned Methods for Multifield Problems Seite 13
14 Transformation matrix Assume that W A is known and that W B is unknown. Then transformation matrix W B = C 1 αb C αaw A H BA = C 1 αb C αa Joachim Rang Partititioned Methods for Multifield Problems Seite 14
15 Consistent approach We require C BB β B = C BA β A, where β B R n B and β A R n A approach is consistent, if Γ A = Γ B Joachim Rang Partititioned Methods for Multifield Problems Seite 15
16 Conservative approach We start with H fs = C 1 ff C fs ] Pf. Then P s = [ M ff C 1 ff C fs Mss 1 Assumption: same discretisation for displacement and pressure in the fluid, i. e. N f = D f and nu f = np f. Then M ss P s = C sf P f Only if Γ f = Γ s the approach is consistent and energy conservative need the convergence to a matching mesh. A conforming mesh is not needed Joachim Rang Partititioned Methods for Multifield Problems Seite 16
17 Scattered Data Interpolation Let the points x i = (x (1) i,..., x (d) i ) R d, d > 1 and values y i R, i = 1,..., N be given. Aim: Find a function S : R d R, which yields a data value for each point of the observation space and which satisfies the interpolation condition S(x i ) = y i, i = 1,..., N. Idea: Try to reduce the numerical complexing in reducing the problem from R d to R by using so-called radial basis functions Joachim Rang Partititioned Methods for Multifield Problems Seite 17
18 Radial basis functions The function ˆϕ : R d R is called radial basis function if it satisfies the condition x y = ˆx y ˆϕ(x) = ˆϕ(ˆx). for all x, ˆx, y R d. Note that a function ϕ : R + R which depends on the scalar parameter r = x y is a radial basis function Joachim Rang Partititioned Methods for Multifield Problems Seite 18
19 Examples The Gauss function is given by ϕ : R [, 1], ϕ(r) = exp( αr 2 ), α R 1.9 α = 1/1 α = 1/1 α = φ r Joachim Rang Partititioned Methods for Multifield Problems Seite 19
20 Examples The multi-quadric from Hardy (1971) is given by ϕ : R [ δ, ), ϕ(r) = r 2 + δ 2, δ > 12 1 δ = 1/1 δ = 1 δ = 2 8 φ r Joachim Rang Partititioned Methods for Multifield Problems Seite 2
21 Examples The inverse multi-quadric from Hardy (1971) is given by ϕ : R [ δ, ), ϕ(r) = 1/ r 2 + δ 2, δ > 1 9 δ = 1/1 δ = 1 δ = φ r Joachim Rang Partititioned Methods for Multifield Problems Seite 21
22 Examples The volume spline function is given by ϕ : R R, ϕ(r) = r \varphi r Joachim Rang Partititioned Methods for Multifield Problems Seite 22
23 Examples Wendland uses the function ( r 3 ϕ : R R, ϕ(r) = π 12 α2 r + 4 ) 3 α3, where α > is given. 3 α = 1/1 α = 1/1 α = 1/2 25 α = \varphi r Joachim Rang Partititioned Methods for Multifield Problems Seite 23
24 Examples Wendland uses the function { ϕ : R R, ϕ(r) = (1 r) 2 (1 r) + = 2, if r 2, else \varphi r Joachim Rang Partititioned Methods for Multifield Problems Seite 24
25 Examples Wendland uses the function ϕ : R R, ϕ(r) = (1 r) 4 +(4r + 1) \varphi r Joachim Rang Partititioned Methods for Multifield Problems Seite 25
26 Ansatz For the spline function S(x) we make the ansatz S(x) := N a i ϕ( x x i ) + p(x), i=1 where x := (x 1,..., x d ) R d is a d-dimensional vector and p(x) : R d R is a low degree d-variate polynomial. d By x := j=1 x2 j we denote Euclidian norm. The function ϕ : R R is a radial basis functions Joachim Rang Partititioned Methods for Multifield Problems Seite 26
27 The coefficients The coefficients a i and the polynomial p are determined by the interpolation condition S(x i ) = w i, i = 1,..., N and the additional requirements N α j q(x j ) = j=1 for all polynomials q with deg q deg p Joachim Rang Partititioned Methods for Multifield Problems Seite 27
28 Polynomials For simplicity we consider only linear polynomials, i.e. q(x) = c + c 1 x 1 + c 2 x c d x d, x = (x 1,..., x d ). To determine the coefficients c i of q we need a basis of polynomials, i.e. the set of polynomials {1, x 1, x 2,..., x d } Joachim Rang Partititioned Methods for Multifield Problems Seite 28
29 Linear system Using theses monomials we obtain a linear system of equations N a i ϕ( x 1 x i ) + q(x 1 ) = w 1 i=1 N a i ϕ( x N x i ) + q(x N ) = w N i=1. a + + a N = N a i x (1) i = i=1 N. a i x (d) i =, Joachim Rang i=1 Partititioned Methods for Multifield Problems Seite 29
30 Linear system This system can be written as ( A B B with B = ) ( a c ) = ( y ϕ( x 1 x 1 )... ϕ( x 1 x N ) ϕ( x 2 x 1 )... ϕ( x 2 x N ) A =.. ϕ( x N x 1 )... ϕ( x N x N ) 1 x (1) 1 x (2) 1 x (3) x (1) N x (2) N x (3) N a = (a 1,..., a N ), R N,4 y = (y 1,..., y N ) ) RN,N Joachim Rang Partititioned Methods for Multifield Problems Seite 3
31 Strong positive definite matrices A matrix A R N,N is called strong positive definite on L R N, if A is symmetric and the inequality is valid. Remark: Ax, x > x L \ {} A is strong positive definite on R N, if all eigenvalues of A are positive. A is strong positive definite on R N, if all sub-determinants are positive Joachim Rang Partititioned Methods for Multifield Problems Seite 31
32 Strong negative definite matrices A matrix A R N,N is called strong negative definite on L R N, if A is symmetric and the inequality is valid. Ax, x < x L \ {} Joachim Rang Partititioned Methods for Multifield Problems Seite 32
33 Positive definite matrices A matrix A is called positive definite on L R N, if A is symmetric and the inequality Ax, x x L is valid. A is called negative definite on L R N, if A is symmetric and the inequality Ax, x x L is valid Joachim Rang Partititioned Methods for Multifield Problems Seite 33
34 Strong positive definite functions A function ϕ C[, ) is called (conditionally) strong positive definite of order m in R d, if for every m > 1 and all {x 1,..., x N } R d with x i x j for i j the symmetric matrix A = (ϕ( x j x i ) N i,j=1 is (strong) positive definite on the sub-space { N a R n, a = (a 1,..., a N ), a i Q n (x i ) =, i=1 n =,..., m } Joachim Rang Partititioned Methods for Multifield Problems Seite 34
35 Solvability The interpolation problem S(x i ) = w i, i = 1,..., N is uniquely solvable, if the matrix A = (ϕ( x j x i ) N i,j=1 is strong positive definite on the sub-space N L = {a R N, a i Q n (x i ) =, n =,..., M}. i= Joachim Rang Partititioned Methods for Multifield Problems Seite 35
36 Conditionally positive definite functions A function ϕ is conditionally positive definite in R d (d 1), if and only if it holds If further the condition ( 1) j ( d dt ) j ϕ( t), t >, j. ϕ( t) const is valid, then ϕ is conditionally strong positive definite in R N. see Micchelli (1986) Joachim Rang Partititioned Methods for Multifield Problems Seite 36
37 Example Let us consider the two-dimensional function f : (, 1) (, 1) (, 1/2) given by f(x, y) = xy 1 + y. 2 Here: N = Joachim Rang Partititioned Methods for Multifield Problems Seite 37
38 Example Let us consider the two-dimensional function f : (, 1) (, 1) (, 1/2) given by f(x, y) = xy 1 + y. 2 Here: N = Joachim Rang Partititioned Methods for Multifield Problems Seite 38
39 Example Let us consider the two-dimensional function f : (, 1) (, 1) (, 1/2) given by f(x, y) = xy 1 + y. 2 Here: N = Joachim Rang Partititioned Methods for Multifield Problems Seite 39
40 Example Let us consider the two-dimensional function f : (, 1) (, 1) (, 1/2) given by f(x, y) = xy 1 + y. 2 Here: N = Joachim Rang Partititioned Methods for Multifield Problems Seite 4
41 The choice of α Joachim Rang Partititioned Methods for Multifield Problems Seite
42 Application to non-matching meshes interpolation condition: ( WA ) = ( ΦAA Q A QA ) ( γ β ) Φ Ai,A j Then Finally := φ( x Ai x Aj ). ( γ W B = [Φ BA Q B ] β ( ΦAA Q W B = [Φ BA Q B ] A QA ) ) 1 ( WA ) Joachim Rang Partititioned Methods for Multifield Problems Seite 42
43 Transformation matrix Let H := [Φ BA Q B ] ( ΦAA Q A Q A ) 1 transformation matrix H BA... first n B rows and n A columns Remember, linear functions are interpolated exactly, if linear polynomials are included. Consistent approach: possible, if ansatz with linear polynomials is used Joachim Rang Partititioned Methods for Multifield Problems Seite 43
44 Conservative approach transformation of displacements: ( Φss Q U f = [Φ fs Q f ] s Qs transformation of pressure forces ( ) ( Fs Φss Q = s Qs condition: and finally F s = Φ 1 ss Φ fs F f ) 1 ( Us ) 1 ( Φ fs Q f M ss P s = Φ 1 ss Φ fs M ff P f conservative, if both meshes converge to a matching mesh ) ) F f Joachim Rang Partititioned Methods for Multifield Problems Seite 44
Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions
Chapter 3 Scattered Data Interpolation with Polynomial Precision and Conditionally Positive Definite Functions 3.1 Scattered Data Interpolation with Polynomial Precision Sometimes the assumption on the
More informationBasic Concepts in Linear Algebra
Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University February 2, 2015 Grady B Wright Linear Algebra Basics February 2, 2015 1 / 39 Numerical Linear Algebra Linear
More informationReview of Basic Concepts in Linear Algebra
Review of Basic Concepts in Linear Algebra Grady B Wright Department of Mathematics Boise State University September 7, 2017 Math 565 Linear Algebra Review September 7, 2017 1 / 40 Numerical Linear Algebra
More informationInterpolation. 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter
Key References: Interpolation 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter 6. 2. Press, W. et. al. Numerical Recipes in C, Cambridge: Cambridge University Press. Chapter 3
More informationPartitioned Methods for Multifield Problems
C Partitioned Methods for Multifield Problems Joachim Rang, 6.7.2016 6.7.2016 Joachim Rang Partitioned Methods for Multifield Problems Seite 1 C One-dimensional piston problem fixed wall Fluid flexible
More informationNumerical solution of nonlinear sine-gordon equation with local RBF-based finite difference collocation method
Numerical solution of nonlinear sine-gordon equation with local RBF-based finite difference collocation method Y. Azari Keywords: Local RBF-based finite difference (LRBF-FD), Global RBF collocation, sine-gordon
More informationMatrices: 2.1 Operations with Matrices
Goals In this chapter and section we study matrix operations: Define matrix addition Define multiplication of matrix by a scalar, to be called scalar multiplication. Define multiplication of two matrices,
More informationGAKUTO International Series
GAKUTO International Series Mathematical Sciences and Applications, Vol.28(2008) Proceedings of Fourth JSIAM-SIMMAI Seminar on Industrial and Applied Mathematics, pp.139-148 A COMPUTATIONAL APPROACH TO
More informationMath 4310 Solutions to homework 7 Due 10/27/16
Math 4310 Solutions to homework 7 Due 10/27/16 1. Find the gcd of x 3 + x 2 + x + 1 and x 5 + 2x 3 + x 2 + x + 1 in Rx. Use the Euclidean algorithm: x 5 + 2x 3 + x 2 + x + 1 = (x 3 + x 2 + x + 1)(x 2 x
More informationEXAMPLES OF PROOFS BY INDUCTION
EXAMPLES OF PROOFS BY INDUCTION KEITH CONRAD 1. Introduction In this handout we illustrate proofs by induction from several areas of mathematics: linear algebra, polynomial algebra, and calculus. Becoming
More informationRadial Basis Functions I
Radial Basis Functions I Tom Lyche Centre of Mathematics for Applications, Department of Informatics, University of Oslo November 14, 2008 Today Reformulation of natural cubic spline interpolation Scattered
More informationMATH 590: Meshfree Methods
MATH 590: Meshfree Methods Chapter 9: Conditionally Positive Definite Radial Functions Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH
More informationKnowledge Discovery and Data Mining 1 (VO) ( )
Knowledge Discovery and Data Mining 1 (VO) (707.003) Review of Linear Algebra Denis Helic KTI, TU Graz Oct 9, 2014 Denis Helic (KTI, TU Graz) KDDM1 Oct 9, 2014 1 / 74 Big picture: KDDM Probability Theory
More informationBasic Linear Algebra in MATLAB
Basic Linear Algebra in MATLAB 9.29 Optional Lecture 2 In the last optional lecture we learned the the basic type in MATLAB is a matrix of double precision floating point numbers. You learned a number
More informationPower Series Solutions to the Legendre Equation
Department of Mathematics IIT Guwahati The Legendre equation The equation (1 x 2 )y 2xy + α(α + 1)y = 0, (1) where α is any real constant, is called Legendre s equation. When α Z +, the equation has polynomial
More informationInput: A set (x i -yy i ) data. Output: Function value at arbitrary point x. What for x = 1.2?
Applied Numerical Analysis Interpolation Lecturer: Emad Fatemizadeh Interpolation Input: A set (x i -yy i ) data. Output: Function value at arbitrary point x. 0 1 4 1-3 3 9 What for x = 1.? Interpolation
More informationKevin James. MTHSC 3110 Section 2.1 Matrix Operations
MTHSC 3110 Section 2.1 Matrix Operations Notation Let A be an m n matrix, that is, m rows and n columns. We ll refer to the entries of A by their row and column indices. The entry in the i th row and j
More informationMAT Linear Algebra Collection of sample exams
MAT 342 - Linear Algebra Collection of sample exams A-x. (0 pts Give the precise definition of the row echelon form. 2. ( 0 pts After performing row reductions on the augmented matrix for a certain system
More informationHOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION)
HOMEWORK PROBLEMS FROM STRANG S LINEAR ALGEBRA AND ITS APPLICATIONS (4TH EDITION) PROFESSOR STEVEN MILLER: BROWN UNIVERSITY: SPRING 2007 1. CHAPTER 1: MATRICES AND GAUSSIAN ELIMINATION Page 9, # 3: Describe
More informationBasic Math Review for CS4830
Basic Math Review for CS4830 Dr. Mihail August 18, 2016 (Dr. Mihail) Math Review for CS4830 August 18, 2016 1 / 35 Sets Definition of a set A set is a collection of distinct objects, considered as an object
More informationMatrix Theory. A.Holst, V.Ufnarovski
Matrix Theory AHolst, VUfnarovski 55 HINTS AND ANSWERS 9 55 Hints and answers There are two different approaches In the first one write A as a block of rows and note that in B = E ij A all rows different
More informationScientific Computing I
Scientific Computing I Module 8: An Introduction to Finite Element Methods Tobias Neckel Winter 2013/2014 Module 8: An Introduction to Finite Element Methods, Winter 2013/2014 1 Part I: Introduction to
More informationLehrstuhl Informatik V. Lehrstuhl Informatik V. 1. solve weak form of PDE to reduce regularity properties. Lehrstuhl Informatik V
Part I: Introduction to Finite Element Methods Scientific Computing I Module 8: An Introduction to Finite Element Methods Tobias Necel Winter 4/5 The Model Problem FEM Main Ingredients Wea Forms and Wea
More informationInterpolation by Basis Functions of Different Scales and Shapes
Interpolation by Basis Functions of Different Scales and Shapes M. Bozzini, L. Lenarduzzi, M. Rossini and R. Schaback Abstract Under very mild additional assumptions, translates of conditionally positive
More information. (a) Express [ ] as a non-trivial linear combination of u = [ ], v = [ ] and w =[ ], if possible. Otherwise, give your comments. (b) Express +8x+9x a
TE Linear Algebra and Numerical Methods Tutorial Set : Two Hours. (a) Show that the product AA T is a symmetric matrix. (b) Show that any square matrix A can be written as the sum of a symmetric matrix
More informationPartitioned Methods for Multifield Problems
Partitioned Methods for Multifield Problems Joachim Rang, 10.5.2017 10.5.2017 Joachim Rang Partitioned Methods for Multifield Problems Seite 1 Contents Blockform of linear iteration schemes Examples 10.5.2017
More informationQuantum Computing Lecture 2. Review of Linear Algebra
Quantum Computing Lecture 2 Review of Linear Algebra Maris Ozols Linear algebra States of a quantum system form a vector space and their transformations are described by linear operators Vector spaces
More informationWRT in 2D: Poisson Example
WRT in 2D: Poisson Example Consider 2 u f on [, L x [, L y with u. WRT: For all v X N, find u X N a(v, u) such that v u dv v f dv. Follows from strong form plus integration by parts: ( ) 2 u v + 2 u dx
More informationMATH 205 HOMEWORK #3 OFFICIAL SOLUTION. Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. (a) F = R, V = R 3,
MATH 205 HOMEWORK #3 OFFICIAL SOLUTION Problem 1: Find all eigenvalues and eigenvectors of the following linear transformations. a F = R, V = R 3, b F = R or C, V = F 2, T = T = 9 4 4 8 3 4 16 8 7 0 1
More informationMA2501 Numerical Methods Spring 2015
Norwegian University of Science and Technology Department of Mathematics MA5 Numerical Methods Spring 5 Solutions to exercise set 9 Find approximate values of the following integrals using the adaptive
More informationUniversity of Houston, Department of Mathematics Numerical Analysis, Fall 2005
4 Interpolation 4.1 Polynomial interpolation Problem: LetP n (I), n ln, I := [a,b] lr, be the linear space of polynomials of degree n on I, P n (I) := { p n : I lr p n (x) = n i=0 a i x i, a i lr, 0 i
More informationApplied Numerical Analysis Quiz #2
Applied Numerical Analysis Quiz #2 Modules 3 and 4 Name: Student number: DO NOT OPEN UNTIL ASKED Instructions: Make sure you have a machine-readable answer form. Write your name and student number in the
More informationCS 246 Review of Linear Algebra 01/17/19
1 Linear algebra In this section we will discuss vectors and matrices. We denote the (i, j)th entry of a matrix A as A ij, and the ith entry of a vector as v i. 1.1 Vectors and vector operations A vector
More informationLecture 1 INF-MAT3350/ : Some Tridiagonal Matrix Problems
Lecture 1 INF-MAT3350/4350 2007: Some Tridiagonal Matrix Problems Tom Lyche University of Oslo Norway Lecture 1 INF-MAT3350/4350 2007: Some Tridiagonal Matrix Problems p.1/33 Plan for the day 1. Notation
More informationMath 343 Midterm I Fall 2006 sections 002 and 003 Instructor: Scott Glasgow
Math 343 Midterm I Fall 006 sections 00 003 Instructor: Scott Glasgow 1 Assuming A B are invertible matrices of the same size, prove that ( ) 1 1 AB B A 1 = (11) B A 1 1 is the inverse of AB if only if
More informationREPLACE ONE ROW BY ADDING THE SCALAR MULTIPLE OF ANOTHER ROW
20 CHAPTER 1 Systems of Linear Equations REPLACE ONE ROW BY ADDING THE SCALAR MULTIPLE OF ANOTHER ROW The last type of operation is slightly more complicated. Suppose that we want to write down the elementary
More informationMathematical Olympiad Training Polynomials
Mathematical Olympiad Training Polynomials Definition A polynomial over a ring R(Z, Q, R, C) in x is an expression of the form p(x) = a n x n + a n 1 x n 1 + + a 1 x + a 0, a i R, for 0 i n. If a n 0,
More informationis equal to = 3 2 x, if x < 0 f (0) = lim h = 0. Therefore f exists and is continuous at 0.
Madhava Mathematics Competition January 6, 2013 Solutions and scheme of marking Part I N.B. Each question in Part I carries 2 marks. p(k + 1) 1. If p(x) is a non-constant polynomial, then lim k p(k) (a)
More informationUNIT 5 VOCABULARY: POLYNOMIALS
3º ESO Bilingüe Page 1 UNIT 5 VOCABULARY: POLYNOMIALS 1.1. Monomials A monomial is an algebraic expression consisting of only one term. A monomial can be any of the following: A constant: 2 4-5 A variable:
More informationBasic Math Review for CS1340
Basic Math Review for CS1340 Dr. Mihail January 15, 2015 (Dr. Mihail) Math Review for CS1340 January 15, 2015 1 / 34 Sets Definition of a set A set is a collection of distinct objects, considered as an
More informationThis ODE arises in many physical systems that we shall investigate. + ( + 1)u = 0. (λ + s)x λ + s + ( + 1) a λ. (s + 1)(s + 2) a 0
Legendre equation This ODE arises in many physical systems that we shall investigate We choose We then have Substitution gives ( x 2 ) d 2 u du 2x 2 dx dx + ( + )u u x s a λ x λ a du dx λ a λ (λ + s)x
More informationMath 126 Final Exam Solutions
Math 126 Final Exam Solutions 1. (a) Give an example of a linear homogeneous PE, a linear inhomogeneous PE, and a nonlinear PE. [3 points] Solution. Poisson s equation u = f is linear homogeneous when
More informationThe Finite Element Method for the Wave Equation
The Finite Element Method for the Wave Equation 1 The Wave Equation We consider the scalar wave equation modelling acoustic wave propagation in a bounded domain 3, with boundary Γ : 1 2 u c(x) 2 u 0, in
More informationScattered Interpolation Survey
Scattered Interpolation Survey j.p.lewis u. southern california Scattered Interpolation Survey p.1/53 Scattered vs. Regular domain Scattered Interpolation Survey p.2/53 Motivation modeling animated character
More informationComputational Methods. Least Squares Approximation/Optimization
Computational Methods Least Squares Approximation/Optimization Manfred Huber 2011 1 Least Squares Least squares methods are aimed at finding approximate solutions when no precise solution exists Find the
More informationPhysics 202 Laboratory 5. Linear Algebra 1. Laboratory 5. Physics 202 Laboratory
Physics 202 Laboratory 5 Linear Algebra Laboratory 5 Physics 202 Laboratory We close our whirlwind tour of numerical methods by advertising some elements of (numerical) linear algebra. There are three
More informationMultiplication of Polynomials
Summary 391 Chapter 5 SUMMARY Section 5.1 A polynomial in x is defined by a finite sum of terms of the form ax n, where a is a real number and n is a whole number. a is the coefficient of the term. n is
More informationNumerical Methods for Differential Equations Mathematical and Computational Tools
Numerical Methods for Differential Equations Mathematical and Computational Tools Gustaf Söderlind Numerical Analysis, Lund University Contents V4.16 Part 1. Vector norms, matrix norms and logarithmic
More informationA brief introduction to finite element methods
CHAPTER A brief introduction to finite element methods 1. Two-point boundary value problem and the variational formulation 1.1. The model problem. Consider the two-point boundary value problem: Given a
More informationLinear Algebra. Matrices Operations. Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0.
Matrices Operations Linear Algebra Consider, for example, a system of equations such as x + 2y z + 4w = 0, 3x 4y + 2z 6w = 0, x 3y 2z + w = 0 The rectangular array 1 2 1 4 3 4 2 6 1 3 2 1 in which the
More informationSolving Linear Systems of Equations
November 6, 2013 Introduction The type of problems that we have to solve are: Solve the system: A x = B, where a 11 a 1N a 12 a 2N A =.. a 1N a NN x = x 1 x 2. x N B = b 1 b 2. b N To find A 1 (inverse
More informationLinear Algebra, 4th day, Thursday 7/1/04 REU Info:
Linear Algebra, 4th day, Thursday 7/1/04 REU 004. Info http//people.cs.uchicago.edu/laci/reu04. Instructor Laszlo Babai Scribe Nick Gurski 1 Linear maps We shall study the notion of maps between vector
More informationNumerical Analysis Comprehensive Exam Questions
Numerical Analysis Comprehensive Exam Questions 1. Let f(x) = (x α) m g(x) where m is an integer and g(x) C (R), g(α). Write down the Newton s method for finding the root α of f(x), and study the order
More informationLegendre s Equation. PHYS Southern Illinois University. October 18, 2016
Legendre s Equation PHYS 500 - Southern Illinois University October 18, 2016 PHYS 500 - Southern Illinois University Legendre s Equation October 18, 2016 1 / 11 Legendre s Equation Recall We are trying
More informationChapter 3. Linear and Nonlinear Systems
59 An expert is someone who knows some of the worst mistakes that can be made in his subject, and how to avoid them Werner Heisenberg (1901-1976) Chapter 3 Linear and Nonlinear Systems In this chapter
More informationLINEAR SYSTEMS (11) Intensive Computation
LINEAR SYSTEMS () Intensive Computation 27-8 prof. Annalisa Massini Viviana Arrigoni EXACT METHODS:. GAUSSIAN ELIMINATION. 2. CHOLESKY DECOMPOSITION. ITERATIVE METHODS:. JACOBI. 2. GAUSS-SEIDEL 2 CHOLESKY
More informationMATH 412 Fourier Series and PDE- Spring 2010 SOLUTIONS to HOMEWORK 5
MATH 4 Fourier Series PDE- Spring SOLUTIONS to HOMEWORK 5 Problem (a: Solve the following Sturm-Liouville problem { (xu + λ x u = < x < e u( = u (e = (b: Show directly that the eigenfunctions are orthogonal
More informationNumerical Analysis of Differential Equations Numerical Solution of Elliptic Boundary Value
Numerical Analysis of Differential Equations 188 5 Numerical Solution of Elliptic Boundary Value Problems 5 Numerical Solution of Elliptic Boundary Value Problems TU Bergakademie Freiberg, SS 2012 Numerical
More informationPH1105 Lecture Notes on Linear Algebra.
PH05 Lecture Notes on Linear Algebra Joe Ó hógáin E-mail: johog@mathstcdie Main Text: Calculus for the Life Sciences by Bittenger, Brand and Quintanilla Other Text: Linear Algebra by Anton and Rorres Matrices
More information2003 Mathematics. Advanced Higher. Finalised Marking Instructions
2003 Mathematics Advanced Higher Finalised Marking Instructions 2003 Mathematics Advanced Higher Section A Finalised Marking Instructions Advanced Higher 2003: Section A Solutions and marks A. (a) Given
More informationG1110 & 852G1 Numerical Linear Algebra
The University of Sussex Department of Mathematics G & 85G Numerical Linear Algebra Lecture Notes Autumn Term Kerstin Hesse (w aw S w a w w (w aw H(wa = (w aw + w Figure : Geometric explanation of the
More informationJACOBI S ITERATION METHOD
ITERATION METHODS These are methods which compute a sequence of progressively accurate iterates to approximate the solution of Ax = b. We need such methods for solving many large linear systems. Sometimes
More informationAnalysis I (Math 121) First Midterm Correction
Analysis I (Math 11) First Midterm Correction Fall 00 Ali Nesin November 9, 00 1. Which of the following are not vector spaces over R (with the componentwise addition and scalar multiplication) and why?
More information1. A polynomial p(x) in one variable x is an algebraic expression in x of the form
POLYNOMIALS Important Points 1. A polynomial p(x) in one variable x is an algebraic expression in x of the form p(x) = a nx n +a n-1x n-1 + a 2x 2 +a 1x 1 +a 0x 0 where a 0, a 1, a 2 a n are constants
More informationMath 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March 22, 2018
1 Linear Systems Math 5630: Iterative Methods for Systems of Equations Hung Phan, UMass Lowell March, 018 Consider the system 4x y + z = 7 4x 8y + z = 1 x + y + 5z = 15. We then obtain x = 1 4 (7 + y z)
More informationNumerical Solutions to Partial Differential Equations
Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Numerical Methods for Partial Differential Equations Finite Difference Methods
More informationInternational Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994
International Competition in Mathematics for Universtiy Students in Plovdiv, Bulgaria 1994 1 PROBLEMS AND SOLUTIONS First day July 29, 1994 Problem 1. 13 points a Let A be a n n, n 2, symmetric, invertible
More informationMatrices. Chapter Definitions and Notations
Chapter 3 Matrices 3. Definitions and Notations Matrices are yet another mathematical object. Learning about matrices means learning what they are, how they are represented, the types of operations which
More informationAssignment 2 (Sol.) Introduction to Machine Learning Prof. B. Ravindran
Assignment 2 (Sol.) Introduction to Machine Learning Prof. B. Ravindran 1. Let A m n be a matrix of real numbers. The matrix AA T has an eigenvector x with eigenvalue b. Then the eigenvector y of A T A
More informationPhys 201. Matrices and Determinants
Phys 201 Matrices and Determinants 1 1.1 Matrices 1.2 Operations of matrices 1.3 Types of matrices 1.4 Properties of matrices 1.5 Determinants 1.6 Inverse of a 3 3 matrix 2 1.1 Matrices A 2 3 7 =! " 1
More informationNumerical Analysis FMN011
Numerical Analysis FMN011 Carmen Arévalo Lund University carmen@maths.lth.se Lecture 4 Linear Systems Ax = b A is n n matrix, b is given n-vector, x is unknown solution n-vector. A n n is non-singular
More informationMTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018)
MTH5112 Linear Algebra I MTH5212 Applied Linear Algebra (2017/2018) COURSEWORK 3 SOLUTIONS Exercise ( ) 1. (a) Write A = (a ij ) n n and B = (b ij ) n n. Since A and B are diagonal, we have a ij = 0 and
More informationParticle in Cell method
Particle in Cell method Birdsall and Langdon: Plasma Physics via Computer Simulation Dawson: Particle simulation of plasmas Hockney and Eastwood: Computer Simulations using Particles we start with an electrostatic
More informationMatrices A brief introduction
Matrices A brief introduction Basilio Bona DAUIN Politecnico di Torino Semester 1, 2014-15 B. Bona (DAUIN) Matrices Semester 1, 2014-15 1 / 44 Definitions Definition A matrix is a set of N real or complex
More informationSection 4.2 Polynomial Functions of Higher Degree
Section 4.2 Polynomial Functions of Higher Degree Polynomial Function P(x) P(x) = a degree 0 P(x) = ax +b (degree 1) Graph Horizontal line through (0,a) line with y intercept (0,b) and slope a P(x) = ax
More informationOn the positivity of linear weights in WENO approximations. Abstract
On the positivity of linear weights in WENO approximations Yuanyuan Liu, Chi-Wang Shu and Mengping Zhang 3 Abstract High order accurate weighted essentially non-oscillatory (WENO) schemes have been used
More informationMatrices and Linear Algebra
Contents Quantitative methods for Economics and Business University of Ferrara Academic year 2017-2018 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2 3 4 5 Contents 1 Basics 2
More informationAProofoftheStabilityoftheSpectral Difference Method For All Orders of Accuracy
AProofoftheStabilityoftheSpectral Difference Method For All Orders of Accuracy Antony Jameson 1 1 Thomas V. Jones Professor of Engineering Department of Aeronautics and Astronautics Stanford University
More informationCIV-E1060 Engineering Computation and Simulation Examination, December 12, 2017 / Niiranen
CIV-E16 Engineering Computation and Simulation Examination, December 12, 217 / Niiranen This examination consists of 3 problems rated by the standard scale 1...6. Problem 1 Let us consider a long and tall
More informationBefore you begin read these instructions carefully.
MATHEMATICAL TRIPOS Part IB Tuesday, 5 June, 2012 9:00 am to 12:00 pm PAPER 1 Before you begin read these instructions carefully. Each question in Section II carries twice the number of marks of each question
More informationOn interpolation by radial polynomials C. de Boor Happy 60th and beyond, Charlie!
On interpolation by radial polynomials C. de Boor Happy 60th and beyond, Charlie! Abstract A lemma of Micchelli s, concerning radial polynomials and weighted sums of point evaluations, is shown to hold
More informationLinear Algebra (Review) Volker Tresp 2018
Linear Algebra (Review) Volker Tresp 2018 1 Vectors k, M, N are scalars A one-dimensional array c is a column vector. Thus in two dimensions, ( ) c1 c = c 2 c i is the i-th component of c c T = (c 1, c
More informationSmall oscillations and normal modes
Chapter 4 Small oscillations and normal modes 4.1 Linear oscillations Discuss a generalization of the harmonic oscillator problem: oscillations of a system of several degrees of freedom near the position
More informationElementary Row Operations on Matrices
King Saud University September 17, 018 Table of contents 1 Definition A real matrix is a rectangular array whose entries are real numbers. These numbers are organized on rows and columns. An m n matrix
More informationMath Introduction to Numerical Analysis - Class Notes. Fernando Guevara Vasquez. Version Date: January 17, 2012.
Math 5620 - Introduction to Numerical Analysis - Class Notes Fernando Guevara Vasquez Version 1990. Date: January 17, 2012. 3 Contents 1. Disclaimer 4 Chapter 1. Iterative methods for solving linear systems
More informationApplied Numerical Analysis Homework #3
Applied Numerical Analysis Homework #3 Interpolation: Splines, Multiple dimensions, Radial Bases, Least-Squares Splines Question Consider a cubic spline interpolation of a set of data points, and derivatives
More informationswapneel/207
Partial differential equations Swapneel Mahajan www.math.iitb.ac.in/ swapneel/207 1 1 Power series For a real number x 0 and a sequence (a n ) of real numbers, consider the expression a n (x x 0 ) n =
More information14 EE 2402 Engineering Mathematics III Solutions to Tutorial 3 1. For n =0; 1; 2; 3; 4; 5 verify that P n (x) is a solution of Legendre's equation wit
EE 0 Engineering Mathematics III Solutions to Tutorial. For n =0; ; ; ; ; verify that P n (x) is a solution of Legendre's equation with ff = n. Solution: Recall the Legendre's equation from your text or
More informationGG303 Lecture 6 8/27/09 1 SCALARS, VECTORS, AND TENSORS
GG303 Lecture 6 8/27/09 1 SCALARS, VECTORS, AND TENSORS I Main Topics A Why deal with tensors? B Order of scalars, vectors, and tensors C Linear transformation of scalars and vectors (and tensors) II Why
More informationSimple Examples on Rectangular Domains
84 Chapter 5 Simple Examples on Rectangular Domains In this chapter we consider simple elliptic boundary value problems in rectangular domains in R 2 or R 3 ; our prototype example is the Poisson equation
More informationAN ELEMENTARY PROOF OF THE OPTIMAL RECOVERY OF THE THIN PLATE SPLINE RADIAL BASIS FUNCTION
J. KSIAM Vol.19, No.4, 409 416, 2015 http://dx.doi.org/10.12941/jksiam.2015.19.409 AN ELEMENTARY PROOF OF THE OPTIMAL RECOVERY OF THE THIN PLATE SPLINE RADIAL BASIS FUNCTION MORAN KIM 1 AND CHOHONG MIN
More informationLecture 12: Detailed balance and Eigenfunction methods
Lecture 12: Detailed balance and Eigenfunction methods Readings Recommended: Pavliotis [2014] 4.5-4.7 (eigenfunction methods and reversibility), 4.2-4.4 (explicit examples of eigenfunction methods) Gardiner
More informationw T 1 w T 2. w T n 0 if i j 1 if i = j
Lyapunov Operator Let A F n n be given, and define a linear operator L A : C n n C n n as L A (X) := A X + XA Suppose A is diagonalizable (what follows can be generalized even if this is not possible -
More informationJim Lambers MAT 610 Summer Session Lecture 1 Notes
Jim Lambers MAT 60 Summer Session 2009-0 Lecture Notes Introduction This course is about numerical linear algebra, which is the study of the approximate solution of fundamental problems from linear algebra
More informationHomework For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable.
Math 5327 Fall 2018 Homework 7 1. For each of the following matrices, find the minimal polynomial and determine whether the matrix is diagonalizable. 3 1 0 (a) A = 1 2 0 1 1 0 x 3 1 0 Solution: 1 x 2 0
More information3D Stress Tensors. 3D Stress Tensors, Eigenvalues and Rotations
3D Stress Tensors 3D Stress Tensors, Eigenvalues and Rotations Recall that we can think of an n x n matrix Mij as a transformation matrix that transforms a vector xi to give a new vector yj (first index
More informationMathematics for Engineers. Numerical mathematics
Mathematics for Engineers Numerical mathematics Integers Determine the largest representable integer with the intmax command. intmax ans = int32 2147483647 2147483647+1 ans = 2.1475e+09 Remark The set
More informationLECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel
LECTURE NOTES on ELEMENTARY NUMERICAL METHODS Eusebius Doedel TABLE OF CONTENTS Vector and Matrix Norms 1 Banach Lemma 20 The Numerical Solution of Linear Systems 25 Gauss Elimination 25 Operation Count
More informationA matrix over a field F is a rectangular array of elements from F. The symbol
Chapter MATRICES Matrix arithmetic A matrix over a field F is a rectangular array of elements from F The symbol M m n (F ) denotes the collection of all m n matrices over F Matrices will usually be denoted
More informationMATRICES. a m,1 a m,n A =
MATRICES Matrices are rectangular arrays of real or complex numbers With them, we define arithmetic operations that are generalizations of those for real and complex numbers The general form a matrix of
More information