Solving Boundary Value Problems (with Gaussians)

Size: px
Start display at page:

Download "Solving Boundary Value Problems (with Gaussians)"

Transcription

1 What is a boundary value problem? Solving Boundary Value Problems (with Gaussians) Definition A differential equation with constraints on the boundary Michael McCourt Division Argonne National Laboratory IIT Meshfree Seminar May 22, 2012 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Boundary value problems Differential Equation Example u (x) + u(x) = 0 has the solution u(x) = A sin x + B cos x Boundary Value Problem Example u (x) + u(x) = 0, u(0) = u(π) = 0 has the solution Boundary value problems Unlike initial value problems, boundary value problems will not always have a solution u (x) + u(x) = 0, u(0) = a, u (0) = b has a solution for all a, b R The equivalent boundary value problem u (x) + u(x) = 0, u(0) = a, u(π) = b only has a unique solution for some a and b a = 0 and b = 0 has infinitely many solutions a = 0 and b 0 has no solutions u(x) = sin x mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

2 Boundary value problems General boundary value problems How do we solve boundary value problems analytically? Usually, we 1 Find possible solutions without the boundary values, and 2 Eliminate all the solutions that don t satisfy the BC This is useful for some problems, including many involving kernels The real problem is the first step, which requires knowledge of possible solutions to the differential equation General linear problems are of the form Lu = f Bu = g (Differential equation) (Boundary conditions) where L is some differential operator (such as d 2 dx 2 ) and B is some operator of lower degree For some L and f we know the answer, but in general we will not be able to write the solution on a piece of paper mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Intractable boundary value problems Numerical boundary value problems Consider the problem u (x) + u(x) = e x tan(x), u(0) = 1, u(1) = 0 This might have an answer, but I don t know what it is Even if it has an answer, it won t be easy to find Most importantly, I don t want to waste my time looking for an answer if I might not be able to find one What can be done to find a solution? Many methods exist for numerically solving boundary value problems One such method, called finite differences, consists of approximating derivatives using divided differences: u u(x + h) u(x) (x) = + O(h) h u u(x + h) u(x h) (x) = + O(h 2 ) 2h u u(x + h) 2u(x) + u(x h) (x) = h 2 + O(h 2 ) mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

3 Finite Differences Finite differences A finite difference discretization allows us to approximate the solution to a boundary value problem on a uniform grid Suppose u (x) + u(x) = e x tan(x) with u(0) = 1, u(1) = 0 and N = 5: x1 = 0 x2 = 25 x3 = 5 x4 = 75 x5 = 1 u1 u(x1) u2 u(x2) u3 u(x3) u4 u(x4) u5 u(x5) mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Finite differences Finite differences u (x) + u(x) = e x tan(x) with u(0) = 1, u(1) = 0 and h = 25 Discretizing u (x) is required on the interior of the domain [0, 1] u 2 = 1 (u1 2u2 + u3) h2 u 3 = 1 (u2 2u3 + u4) h2 u 4 = 1 (u3 2u4 + u5) h2 For this problem, the boundary operator B does not need discretized u (x) + u(x) = e x tan(x) with u(0) = 1, u(1) = 0 and h = 25 The discretization has resulted in a system of linear equations 1 u1 1 1/h 2 2/h /h 2 u2 1/h 2 2/h /h 2 u3 1/h 2 2/h /h 2 = e x 2 tan(x2) e 3 tan(x3) u4 e x 4 tan(x4) 1 u5 0 Solving this system will give us an approximate solution u on the grid mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

4 Finite Differences Finite Differences If we don t have the true solution, we don t know how much error is present Assuming that we are converging to the true solution as N (not always valid) we will see N ration Recall that u (5) N = Value at 5 for N point FD solution u (5) N 2 ration = log 2 u(5) N 1 u (5) N 1 u(5) N u (x) = 1 h 2 (u(x h) 2u(x) + u(x + h)) + O(h2 ) mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Finite Differences Computational Cost Finite differences are awesome because: They are easy to understand (just Calculus) They are easy to implement ( 10 lines of Matlab) They are computationally cheap (more on this later) Finite differences are weak because: They are best on a uniform lattice (killer in higher dimensions) They poorly handle discontinuities (2 derivatives required) They don t preserve physical properties (positivity, eg) What does it mean for something to be computationally reasonable? In the simplest sense, we expect linear solves of size N N to be solved faster than O(N 3 ) We can always solve systems with O(N 3 ) work, but we need to do less for almost any real application mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

5 Computational Cost Other PDE solvers The most common reason why a discretization scheme is computationally efficient is because the linear system is sparse When working in weird domains, it is pretty much impossible to use finite differences Instead the domain is often cut into a tessellation A sparse matrix can be stored with less than O(N 2 ) elements A sparse matrix can be multiplied to a vector with less than O(N 2 ) work Using this sparsity, an iterative linear solver is probably appropriate That is a discussion for another day mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Other PDE solvers Other PDE solvers After the domain has been cut up into pieces, we still need to somehow discretize the derivatives One common choice is finite elements: After the domain has been cut up into pieces, we still need to somehow discretize the derivatives One common choice is finite volumes: Piecewise polynomials are chosen on each triangle, and their summation is the approximate solution Weak formulation - allow for solutions with less smoothness Sparsity - Polynomials have support on only adjacent elements Higher order polynomials may be chosen An integral involving Green s theorem is approximated over each triangle to describe the differential equation in each cell Smoothing - The computed values are cell averages Conservation laws - Preserved naturally by design Shocks and discontinuities are easily handled mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

6 Smoothness: Limitations and Opportunities Each of these techniques (FD, FV, FE) are local methods This is great for problems with limited smoothness, but if the solution has a lot of smoothness, we should take advantage of that Recall the finite differences from earlier: u u(x + h) 2u(x) + u(x h) (x) = h 2 + O(h 2 ) This equation is valid if the solution u has 4 smooth derivatives But if u has 20 smooth derivatives, then we could use a better approximation Smoothness: Limitations and Opportunities If our solution has more smoothness than we are leveraging, we are using more data points than necessary Consider a piecewise polynomial fitting of increasing order: N\Order These are the log 10 of the errors Notice, eg, the same accuracy can be reached using N 250 for Order 1 or N 20 for Order 3 It is valuable to consider high order methods, for some problems mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Smoothness: Limitations and Opportunities When you take this idea to its final conclusion: Spectral methods Methods with exponential convergence: error= O(e N ) Contrast this with the Finite Difference approximation of second order: that produced error= O(N 2 ) Different people use the term spectral methods differently, so other definitions exist I imagine this will be sufficient for our purposes Question What spectral methods exist? Spectral Methods Polynomial interpolation is spectrally accurate: Interpolation s(x) = a0 + a1x + a2x 2 + an 1x N 1 N 1 = akx k k=0 Given function values, the polynomial interpolant can be computed to machine precision The point location is significant, but beyond our scope mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

7 Spectral Methods Polynomial Collocation Polynomial interpolation is spectrally accurate: Polynomial interpolation is spectrally accurate how can we use this to solve boundary value problems? Collocation Assume that the solution is a N 1 degree polynomial u(x) = N 1 k=0 akx k, and require the solution to match the boundary value problem at some chosen points In the interpolation setting, we made the same assumption on s(x), but we enforced it slightly differently Here, we need to apply L to our approximate BVP solution u(x) mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Polynomial Collocation Recall that the linear BVP we are considering is Polynomial Collocation Here we see the same incredibly fast convergence Lu = f, Bu = g, x Ω x Ω Under the assumption that u(x) = N 1 k=0 akx k B1 Bx1 B(x1) N 2 B(x1) N 1 a1 L1 Lx2 L(x2) N 2 L(x2) N 1 a2 = L1 LxN 1 L(xN 1) N 2 L(xN 1) N 1 an 1 B1 BxN B(xN 1) N 2 B(xN) N 1 an g(x1) f (x2) f (xn 1) g(xn) mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

8 Kernel Collocation Among the limitations to polynomial collocation, it does not transfer well to higher dimensions or weird domains Fortunately, some great mathematicians invented kernel methods (as introduced yesterday) These have the power to beat polynomial methods in the best case, and are not subject to any mesh constraints Kernel Collocation Conducting kernel collocation is much the same as conducting polynomial collocation Polynomial assumption Assume that our solution takes the form Kernel assumption u(x) = ak pk(x) = akx k 1 }{{} =x k 1 Assume that our solution takes the form u(x) = ak pk(x) }{{} =K (x,x k ) = akk (x, xk) mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Kernel Collocation For this talk, we will always assume we are working with the Gaussian: K (x, x k) = e ε2 x x k 2 1D e ε2 (x x k ) 2 Comparing the kernel and polynomial collocation matrix shows similar structure B1 Bx1 B(x1) N 2 B(x1) N 1 L1 Lx2 L(x2) N 2 L(x2) N 1 L1 LxN 1 L(xN 1) N 2 L(xN 1) N 1 B1 BxN B(xN 1) N 2 B(xN) N 1 for u(x) = akx k 1 Kernel Collocation For this talk, we will always assume we are working with the Gaussian: K (x, x k) = e ε2 x x k 2 1D e ε2 (x x k ) 2 Comparing the kernel and polynomial collocation matrix shows similar structure BK (x1, x1) BK (x1, x2) BK (x1, xn 1) BK (x1, xn) LK (x2, x1) LK (x2, x2) LK (x2, xn 1) LK (x2, xn) LK (xn 1, x1) LK (xn 1, x2) LK (xn 1, xn 1) LK (xn 1, xn) BK (xn, x1) BK (xn, x2) BK (xn, xn 1) BK (xn, xn) for u(x) = akk (x, xk) mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

9 Kernel Collocation Ill-Conditioning in Kernel Collocation Small ε values make basis functions nearly indistinguishable For many of these kernel problems we also have a shape parameter ε which must be set in order to solve the problem Choosing an ε is an open problem, but there is often an optimal choice It is often the case, however, that the best value of ε is also a value for which the linear system is very dangerous to solve (a) ε = 3 (b) ε = 1 (c) ε = 3 As ε 0 the basis functions become flatter, which produces a matrix which looks increasingly like a matrix of all ones (a low rank matrix) mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Kernel Collocation What is the difference between RBF-Direct and True RBF? Ill-Conditioning GaussQR How is it that we can circumvent the Gaussian ill-conditioning? We use the (truncated) eigenfunction expansion of the Gaussians: where λn = α 2 α 2 + δ 2 + ε M e ε2 (x z) 2 = λnϕn(x)ϕn(z) ( n=0 ε α 2 + δ 2 + ε ) n, ϕn(x) = γne δ2 x 2 Hn(βαx) For 1D problems (including the previous example), we may use the RBF-QR algorithm and choose M > N For larger problems, it is better to choose M < N and perform eigenfunction regression mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

10 Gaussian BVP Methods in 2D Performing collocation in 2D with Gaussians (using M < N eigenfunction expansion) is actually exactly the same as in 1D The system matrix looks identical BK (x 1, x 1) BK (x 1, x 2) BK (x 1, x N 1) BK (x 1, x N) LK (x 2, x 1) LK (x 2, x 2) LK (x 2, x N 1) LK (x 2, x N) LK (x N 1, x 1) LK (x N 1, x 2) LK (x N 1, xn 1) LK (x N 1, x N) BK (x N, x 1) BK (x N, x 2) BK (x N, x N 1) BK (x N, x N) only now there will be many more boundary rows, because two points will no longer suffice It is useful at this point to write the problem in a block setting mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Using 2 block matrices to represent the interior (L) and boundary (B) portions of the problem Lu = f, Bu = g, x Ω x Ω gives us the overdetermined (least squares) system ( ) ΦL ( ) f a = ΦB g Here we are changing our previous collocation assumption u(x) = akk (x, x k) to the M term eigenfunction expansion M u(x) = akϕk(x) mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Laplacian Example on a Difficult Domain One of the advantages of these kernel-based methods is their indifference to the problem domain Consider the Laplacian 2 u = 0 on the domain Laplacian Example on a Difficult Domain As expected, the eigenfunction expansion successfully solves the problem with spectral convergence This technique is comparable to the Method of Fundamental Solutions, despite the fact that MFS requires a homogeneous problem whereas GaussQR does not mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

11 Tensor-product grids It is generally assumed that as you move to higher dimensions, you will be unable to keep structured grids around This is (part of) the curse of dimensionality If you happen to have a problem on a tensor grid, you can take advantage of it by treating it as the tensor product of two 1D problems Tensor-product grids Suppose you have a matrix D (2) which approximates the second derivative to a vector of uniform 1D points: D (2) v(x1) v (x1) v(xn) v (xn) If you wanted to approximate the Laplacian 2 u(x, y) = uxx(x, y) + uyy(x, y) on a uniform 2D grid, how could you use D (2)? mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Tensor-product grids If you wanted to approximate the Laplacian 2 u = uxx + uyy on a uniform 2D grid, how could you use D (2)? u(x1, x1) 2 u(x1, x1) u(x1, xn) 2 u(x1, xn) u(x2, x1) 2 u(x2, x1) (D (2) IN + IN D (2) ) u(x2, xn) 2 u(x2, xn) u(xn, x1) 2 u(xn, x1) u(xn, xn) 2 u(xn, xn) mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Method of Fundamental Solutions As mentioned earlier, the MFS is a special method for solving homogeneous problems where the Green s function is available This is not practical in general, but, when possible, the MFS is a powerful, meshfree approach Traditional BVP solvers discretize the domain Ω, but the MFS moves the problem to the boundary, and discretizes only Ω This is preferable because Ω is of lower dimension Other boundary methods, which transfer the problem to the boundary, include boundary element and boundary integral methods mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

12 Method of Fundamental Solutions Much as we did when we first considered kernel methods, the MFS assumes that the solution to the problem Lu = 0, Bu = g, x Ω x Ω consists of a linear combination of basis functions M u(x) = akg(x, xk) The difference now is that G is chosen to automatically satisfy Lu = 0, therefore only the equation Bu = g needs to be solved to find a The transfer of the problem to the boundary is part of the appeal of this method mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Method of Fundamental Solutions What hasn t yet been discussed is how to find the functions G which satisfy Lu = 0 For most L we have no idea what G is For a very special set of problems (called elliptic problems), we know the Green s function G which we will use as our kernel basis Some useful Green s functions include (with r = x z ) L G(x, z)inr 2 G(x, z)inr 3 2 log r 1 r ( 2 ) 2 r 2 log r r 2 λ 2 K0(λr) e λr 2 + λ 2 ıh (2) 0 (λr) e ıλr mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Method of Fundamental Solutions What hasn t yet been discussed is how to find the functions G which satisfy Lu = 0 For most L we have no idea what G is For a very special set of problems (called elliptic problems), we know the Green s function G which we will use as our kernel basis Some useful Green s functions include (with r = x z ) Method of Fundamental Solutions Because many of these Green s functions have singularities, it is often necessary to choose points outside the problem domain to serve as sources (centers) for the kernels L G(x, z)inr 2 G(x, z)inr 3 2 log r 1 r ( 2 ) 2 r 2 log r r 2 λ 2 K0(λr) e λr 2 + λ 2 ıh (2) 0 (λr) e ıλr mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

13 Method of Fundamental Solutions When we find the solution via MFS, we see that this method is also spectrally accurate, and in fact superior to GaussQR Method of Particular Solutions The Method of Fundamental Solutions succeeds at approximating homogeneous BVP, ie, those where f = 0 When f 0, MFS is inappropriate and another technique must be considered We have already discussed collocation as one method for solving Lu = f, Bu = g, x Ω x Ω but there is a boundary type method called the Method of Particular Solutions which is also available In this method, we assume that the solution to the BVP has two parts: u = uf + up a homogeneous solution LuF = 0 and a particular solution LuP = f mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51 Method of Particular Solutions The homogeneous solution is chosen via the Green s functions uf = M akg(x, x (s) k ), x (s) {Source points} and the particular solution can be chosen with any basis functions What makes MPS so difficult is effectively approximating f by solving the pseudo-interpolation (or ill-posed) problem Lu = f, x (i) Ω The common approach for general f is to choose basis functions K (, x (i) ) you can work with, and solve the system ) LK (x (i) 1, x (i) 1 ) (i) LK (x 1 x (i) N ) a1 f (x (i) 1, = LK (x (i) N, x (i) 1 ) (i) LK (x N, x (i) N ) an f (x (i) N ) mccomic@mcsanlgov (Argonne) BVP Solvers May 22, / 51

Positive Definite Kernels: Opportunities and Challenges

Positive Definite Kernels: Opportunities and Challenges Positive Definite Kernels: Opportunities and Challenges Michael McCourt Department of Mathematical and Statistical Sciences University of Colorado, Denver CUNY Mathematics Seminar CUNY Graduate College

More information

Using Gaussian eigenfunctions to solve boundary value problems

Using Gaussian eigenfunctions to solve boundary value problems Advances in Applied Mathematics and Mechanics Adv Appl Math Mech, Vol xx, No x, pp xx-xx DOI: xxxx xxx 200x Using Gaussian eigenfunctions to solve boundary value problems Michael McCourt Center for Applied

More information

Kernel-based Approximation. Methods using MATLAB. Gregory Fasshauer. Interdisciplinary Mathematical Sciences. Michael McCourt.

Kernel-based Approximation. Methods using MATLAB. Gregory Fasshauer. Interdisciplinary Mathematical Sciences. Michael McCourt. SINGAPORE SHANGHAI Vol TAIPEI - Interdisciplinary Mathematical Sciences 19 Kernel-based Approximation Methods using MATLAB Gregory Fasshauer Illinois Institute of Technology, USA Michael McCourt University

More information

Chapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs

Chapter Two: Numerical Methods for Elliptic PDEs. 1 Finite Difference Methods for Elliptic PDEs Chapter Two: Numerical Methods for Elliptic PDEs Finite Difference Methods for Elliptic PDEs.. Finite difference scheme. We consider a simple example u := subject to Dirichlet boundary conditions ( ) u

More information

High Performance Nonlinear Solvers

High Performance Nonlinear Solvers What is a nonlinear system? High Performance Nonlinear Solvers Michael McCourt Division Argonne National Laboratory IIT Meshfree Seminar September 19, 2011 Every nonlinear system of equations can be described

More information

Iterative solvers for linear equations

Iterative solvers for linear equations Spectral Graph Theory Lecture 17 Iterative solvers for linear equations Daniel A. Spielman October 31, 2012 17.1 About these notes These notes are not necessarily an accurate representation of what happened

More information

First-order overdetermined systems. for elliptic problems. John Strain Mathematics Department UC Berkeley July 2012

First-order overdetermined systems. for elliptic problems. John Strain Mathematics Department UC Berkeley July 2012 First-order overdetermined systems for elliptic problems John Strain Mathematics Department UC Berkeley July 2012 1 OVERVIEW Convert elliptic problems to first-order overdetermined form Control error via

More information

Finite Difference Methods for Boundary Value Problems

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

More information

Iterative solvers for linear equations

Iterative solvers for linear equations Spectral Graph Theory Lecture 23 Iterative solvers for linear equations Daniel A. Spielman November 26, 2018 23.1 Overview In this and the next lecture, I will discuss iterative algorithms for solving

More information

Numerical Analysis of Differential Equations Numerical Solution of Elliptic Boundary Value

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

More information

MATH 590: Meshfree Methods

MATH 590: Meshfree Methods MATH 590: Meshfree Methods Chapter 34: Improving the Condition Number of the Interpolation Matrix Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu

More information

Fundamental Solutions and Green s functions. Simulation Methods in Acoustics

Fundamental Solutions and Green s functions. Simulation Methods in Acoustics Fundamental Solutions and Green s functions Simulation Methods in Acoustics Definitions Fundamental solution The solution F (x, x 0 ) of the linear PDE L {F (x, x 0 )} = δ(x x 0 ) x R d Is called the fundamental

More information

Fast numerical methods for solving linear PDEs

Fast numerical methods for solving linear PDEs Fast numerical methods for solving linear PDEs P.G. Martinsson, The University of Colorado at Boulder Acknowledgements: Some of the work presented is joint work with Vladimir Rokhlin and Mark Tygert at

More information

Efficient hp-finite elements

Efficient hp-finite elements Efficient hp-finite elements Ammon Washburn July 31, 2015 Abstract Ways to make an hp-finite element method efficient are presented. Standard FEMs and hp-fems with their various strengths and weaknesses

More information

Finite difference method for elliptic problems: I

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

More information

Iterative Methods. Splitting Methods

Iterative Methods. Splitting Methods Iterative Methods Splitting Methods 1 Direct Methods Solving Ax = b using direct methods. Gaussian elimination (using LU decomposition) Variants of LU, including Crout and Doolittle Other decomposition

More information

Final year project. Methods for solving differential equations

Final year project. Methods for solving differential equations Final year project Methods for solving differential equations Author: Tej Shah Supervisor: Dr. Milan Mihajlovic Date: 5 th May 2010 School of Computer Science: BSc. in Computer Science and Mathematics

More information

1 Computing with constraints

1 Computing with constraints Notes for 2017-04-26 1 Computing with constraints Recall that our basic problem is minimize φ(x) s.t. x Ω where the feasible set Ω is defined by equality and inequality conditions Ω = {x R n : c i (x)

More information

Lecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C.

Lecture 9 Approximations of Laplace s Equation, Finite Element Method. Mathématiques appliquées (MATH0504-1) B. Dewals, C. Lecture 9 Approximations of Laplace s Equation, Finite Element Method Mathématiques appliquées (MATH54-1) B. Dewals, C. Geuzaine V1.2 23/11/218 1 Learning objectives of this lecture Apply the finite difference

More information

National Taiwan University

National Taiwan University National Taiwan University Meshless Methods for Scientific Computing (Advisor: C.S. Chen, D.L. oung) Final Project Department: Mechanical Engineering Student: Kai-Nung Cheng SID: D9956 Date: Jan. 8 The

More information

e x = 1 + x + x2 2! + x3 If the function f(x) can be written as a power series on an interval I, then the power series is of the form

e x = 1 + x + x2 2! + x3 If the function f(x) can be written as a power series on an interval I, then the power series is of the form Taylor Series Given a function f(x), we would like to be able to find a power series that represents the function. For example, in the last section we noted that we can represent e x by the power series

More information

Numerical Methods I Non-Square and Sparse Linear Systems

Numerical Methods I Non-Square and Sparse Linear Systems Numerical Methods I Non-Square and Sparse Linear Systems Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 September 25th, 2014 A. Donev (Courant

More information

Numerical Integration (Quadrature) Another application for our interpolation tools!

Numerical Integration (Quadrature) Another application for our interpolation tools! Numerical Integration (Quadrature) Another application for our interpolation tools! Integration: Area under a curve Curve = data or function Integrating data Finite number of data points spacing specified

More information

MATH 590: Meshfree Methods

MATH 590: Meshfree Methods MATH 590: Meshfree Methods The Connection to Green s Kernels Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2014 fasshauer@iit.edu MATH 590 1 Outline 1 Introduction

More information

NONLOCALITY AND STOCHASTICITY TWO EMERGENT DIRECTIONS FOR APPLIED MATHEMATICS. Max Gunzburger

NONLOCALITY AND STOCHASTICITY TWO EMERGENT DIRECTIONS FOR APPLIED MATHEMATICS. Max Gunzburger NONLOCALITY AND STOCHASTICITY TWO EMERGENT DIRECTIONS FOR APPLIED MATHEMATICS Max Gunzburger Department of Scientific Computing Florida State University North Carolina State University, March 10, 2011

More information

Finite Difference Methods (FDMs) 1

Finite Difference Methods (FDMs) 1 Finite Difference Methods (FDMs) 1 1 st - order Approxima9on Recall Taylor series expansion: Forward difference: Backward difference: Central difference: 2 nd - order Approxima9on Forward difference: Backward

More information

MATH 590: Meshfree Methods

MATH 590: Meshfree Methods MATH 590: Meshfree Methods Chapter 43: RBF-PS Methods in MATLAB Greg Fasshauer Department of Applied Mathematics Illinois Institute of Technology Fall 2010 fasshauer@iit.edu MATH 590 Chapter 43 1 Outline

More information

Scientific Computing I

Scientific 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 information

Numerical Analysis and Methods for PDE I

Numerical Analysis and Methods for PDE I Numerical Analysis and Methods for PDE I A. J. Meir Department of Mathematics and Statistics Auburn University US-Africa Advanced Study Institute on Analysis, Dynamical Systems, and Mathematical Modeling

More information

Introduction to Smoothing spline ANOVA models (metamodelling)

Introduction to Smoothing spline ANOVA models (metamodelling) Introduction to Smoothing spline ANOVA models (metamodelling) M. Ratto DYNARE Summer School, Paris, June 215. Joint Research Centre www.jrc.ec.europa.eu Serving society Stimulating innovation Supporting

More information

Outline. 1 Boundary Value Problems. 2 Numerical Methods for BVPs. Boundary Value Problems Numerical Methods for BVPs

Outline. 1 Boundary Value Problems. 2 Numerical Methods for BVPs. Boundary Value Problems Numerical Methods for BVPs Boundary Value Problems Numerical Methods for BVPs Outline Boundary Value Problems 2 Numerical Methods for BVPs Michael T. Heath Scientific Computing 2 / 45 Boundary Value Problems Numerical Methods for

More information

AM 205: lecture 19. Last time: Conditions for optimality Today: Newton s method for optimization, survey of optimization methods

AM 205: lecture 19. Last time: Conditions for optimality Today: Newton s method for optimization, survey of optimization methods AM 205: lecture 19 Last time: Conditions for optimality Today: Newton s method for optimization, survey of optimization methods Optimality Conditions: Equality Constrained Case As another example of equality

More information

2 Two-Point Boundary Value Problems

2 Two-Point Boundary Value Problems 2 Two-Point Boundary Value Problems Another fundamental equation, in addition to the heat eq. and the wave eq., is Poisson s equation: n j=1 2 u x 2 j The unknown is the function u = u(x 1, x 2,..., x

More information

8 A pseudo-spectral solution to the Stokes Problem

8 A pseudo-spectral solution to the Stokes Problem 8 A pseudo-spectral solution to the Stokes Problem 8.1 The Method 8.1.1 Generalities We are interested in setting up a pseudo-spectral method for the following Stokes Problem u σu p = f in Ω u = 0 in Ω,

More information

OR MSc Maths Revision Course

OR MSc Maths Revision Course OR MSc Maths Revision Course Tom Byrne School of Mathematics University of Edinburgh t.m.byrne@sms.ed.ac.uk 15 September 2017 General Information Today JCMB Lecture Theatre A, 09:30-12:30 Mathematics revision

More information

FINITE-DIMENSIONAL LINEAR ALGEBRA

FINITE-DIMENSIONAL LINEAR ALGEBRA DISCRETE MATHEMATICS AND ITS APPLICATIONS Series Editor KENNETH H ROSEN FINITE-DIMENSIONAL LINEAR ALGEBRA Mark S Gockenbach Michigan Technological University Houghton, USA CRC Press Taylor & Francis Croup

More information

9. Numerical linear algebra background

9. Numerical linear algebra background Convex Optimization Boyd & Vandenberghe 9. Numerical linear algebra background matrix structure and algorithm complexity solving linear equations with factored matrices LU, Cholesky, LDL T factorization

More information

CS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation

CS 450 Numerical Analysis. Chapter 8: Numerical Integration and Differentiation Lecture slides based on the textbook Scientific Computing: An Introductory Survey by Michael T. Heath, copyright c 2018 by the Society for Industrial and Applied Mathematics. http://www.siam.org/books/cl80

More information

LECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel

LECTURE 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 information

Radial basis function partition of unity methods for PDEs

Radial basis function partition of unity methods for PDEs Radial basis function partition of unity methods for PDEs Elisabeth Larsson, Scientific Computing, Uppsala University Credit goes to a number of collaborators Alfa Ali Alison Lina Victor Igor Heryudono

More information

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b)

x x2 2 + x3 3 x4 3. Use the divided-difference method to find a polynomial of least degree that fits the values shown: (b) Numerical Methods - PROBLEMS. The Taylor series, about the origin, for log( + x) is x x2 2 + x3 3 x4 4 + Find an upper bound on the magnitude of the truncation error on the interval x.5 when log( + x)

More information

Chapter 2 Interpolation

Chapter 2 Interpolation Chapter 2 Interpolation Experiments usually produce a discrete set of data points (x i, f i ) which represent the value of a function f (x) for a finite set of arguments {x 0...x n }. If additional data

More information

LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES)

LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) LECTURE # 0 BASIC NOTATIONS AND CONCEPTS IN THE THEORY OF PARTIAL DIFFERENTIAL EQUATIONS (PDES) RAYTCHO LAZAROV 1 Notations and Basic Functional Spaces Scalar function in R d, d 1 will be denoted by u,

More information

PDEs, part 1: Introduction and elliptic PDEs

PDEs, part 1: Introduction and elliptic PDEs PDEs, part 1: Introduction and elliptic PDEs Anna-Karin Tornberg Mathematical Models, Analysis and Simulation Fall semester, 2013 Partial di erential equations The solution depends on several variables,

More information

The automatic solution of PDEs using a global spectral method

The automatic solution of PDEs using a global spectral method The automatic solution of PDEs using a global spectral method 2014 CBMS-NSF Conference, 29th June 2014 Alex Townsend PhD student University of Oxford (with Sheehan Olver) Supervised by Nick Trefethen,

More information

[ ], [ ] [ ] [ ] = [ ] [ ] [ ]{ [ 1] [ 2]

[ ], [ ] [ ] [ ] = [ ] [ ] [ ]{ [ 1] [ 2] 4. he discrete Fourier transform (DF). Application goal We study the discrete Fourier transform (DF) and its applications: spectral analysis and linear operations as convolution and correlation. We use

More information

Solving Ill-Posed Cauchy Problems in Three Space Dimensions using Krylov Methods

Solving Ill-Posed Cauchy Problems in Three Space Dimensions using Krylov Methods Solving Ill-Posed Cauchy Problems in Three Space Dimensions using Krylov Methods Lars Eldén Department of Mathematics Linköping University, Sweden Joint work with Valeria Simoncini February 21 Lars Eldén

More information

Lecture 8: Boundary Integral Equations

Lecture 8: Boundary Integral Equations CBMS Conference on Fast Direct Solvers Dartmouth College June 23 June 27, 2014 Lecture 8: Boundary Integral Equations Gunnar Martinsson The University of Colorado at Boulder Research support by: Consider

More information

Lecture 1. Finite difference and finite element methods. Partial differential equations (PDEs) Solving the heat equation numerically

Lecture 1. Finite difference and finite element methods. Partial differential equations (PDEs) Solving the heat equation numerically Finite difference and finite element methods Lecture 1 Scope of the course Analysis and implementation of numerical methods for pricing options. Models: Black-Scholes, stochastic volatility, exponential

More information

Hilbert Space Methods for Reduced-Rank Gaussian Process Regression

Hilbert Space Methods for Reduced-Rank Gaussian Process Regression Hilbert Space Methods for Reduced-Rank Gaussian Process Regression Arno Solin and Simo Särkkä Aalto University, Finland Workshop on Gaussian Process Approximation Copenhagen, Denmark, May 2015 Solin &

More information

Discretization of PDEs and Tools for the Parallel Solution of the Resulting Systems

Discretization of PDEs and Tools for the Parallel Solution of the Resulting Systems Discretization of PDEs and Tools for the Parallel Solution of the Resulting Systems Stan Tomov Innovative Computing Laboratory Computer Science Department The University of Tennessee Wednesday April 4,

More information

n 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes

n 1 f n 1 c 1 n+1 = c 1 n $ c 1 n 1. After taking logs, this becomes Root finding: 1 a The points {x n+1, }, {x n, f n }, {x n 1, f n 1 } should be co-linear Say they lie on the line x + y = This gives the relations x n+1 + = x n +f n = x n 1 +f n 1 = Eliminating α and

More information

Simple Examples on Rectangular Domains

Simple 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 information

Numerical Methods I Solving Nonlinear Equations

Numerical Methods I Solving Nonlinear Equations Numerical Methods I Solving Nonlinear Equations Aleksandar Donev Courant Institute, NYU 1 donev@courant.nyu.edu 1 MATH-GA 2011.003 / CSCI-GA 2945.003, Fall 2014 October 16th, 2014 A. Donev (Courant Institute)

More information

LU Factorization. Marco Chiarandini. DM559 Linear and Integer Programming. Department of Mathematics & Computer Science University of Southern Denmark

LU Factorization. Marco Chiarandini. DM559 Linear and Integer Programming. Department of Mathematics & Computer Science University of Southern Denmark DM559 Linear and Integer Programming LU Factorization Marco Chiarandini Department of Mathematics & Computer Science University of Southern Denmark [Based on slides by Lieven Vandenberghe, UCLA] Outline

More information

Lecture: Local Spectral Methods (1 of 4)

Lecture: Local Spectral Methods (1 of 4) Stat260/CS294: Spectral Graph Methods Lecture 18-03/31/2015 Lecture: Local Spectral Methods (1 of 4) Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough. They provide

More information

Accuracy, Precision and Efficiency in Sparse Grids

Accuracy, Precision and Efficiency in Sparse Grids John, Information Technology Department, Virginia Tech.... http://people.sc.fsu.edu/ jburkardt/presentations/ sandia 2009.pdf... Computer Science Research Institute, Sandia National Laboratory, 23 July

More information

MODEL ANSWERS TO THE FIRST QUIZ. 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function

MODEL ANSWERS TO THE FIRST QUIZ. 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function MODEL ANSWERS TO THE FIRST QUIZ 1. (18pts) (i) Give the definition of a m n matrix. A m n matrix with entries in a field F is a function A: I J F, where I is the set of integers between 1 and m and J is

More information

Numerical Analysis: Solving Systems of Linear Equations

Numerical Analysis: Solving Systems of Linear Equations Numerical Analysis: Solving Systems of Linear Equations Mirko Navara http://cmpfelkcvutcz/ navara/ Center for Machine Perception, Department of Cybernetics, FEE, CTU Karlovo náměstí, building G, office

More information

Qualifying Examination

Qualifying Examination Summer 24 Day. Monday, September 5, 24 You have three hours to complete this exam. Work all problems. Start each problem on a All problems are 2 points. Please email any electronic files in support of

More information

We consider the problem of finding a polynomial that interpolates a given set of values:

We consider the problem of finding a polynomial that interpolates a given set of values: Chapter 5 Interpolation 5. Polynomial Interpolation We consider the problem of finding a polynomial that interpolates a given set of values: x x 0 x... x n y y 0 y... y n where the x i are all distinct.

More information

Interpolation. 1. Judd, K. Numerical Methods in Economics, Cambridge: MIT Press. Chapter

Interpolation. 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 information

Existence Theory: Green s Functions

Existence Theory: Green s Functions Chapter 5 Existence Theory: Green s Functions In this chapter we describe a method for constructing a Green s Function The method outlined is formal (not rigorous) When we find a solution to a PDE by constructing

More information

(x + 1)(x 2) = 4. x

(x + 1)(x 2) = 4. x dvanced Integration Techniques: Partial Fractions The method of partial fractions can occasionally make it possible to find the integral of a quotient of rational functions. Partial fractions gives us

More information

5. Direct Methods for Solving Systems of Linear Equations. They are all over the place...

5. Direct Methods for Solving Systems of Linear Equations. They are all over the place... 5 Direct Methods for Solving Systems of Linear Equations They are all over the place Miriam Mehl: 5 Direct Methods for Solving Systems of Linear Equations They are all over the place, December 13, 2012

More information

Applied Linear Algebra in Geoscience Using MATLAB

Applied Linear Algebra in Geoscience Using MATLAB Applied Linear Algebra in Geoscience Using MATLAB Contents Getting Started Creating Arrays Mathematical Operations with Arrays Using Script Files and Managing Data Two-Dimensional Plots Programming in

More information

Theoretical and computational aspects of multivariate interpolation with increasingly flat radial basis functions

Theoretical and computational aspects of multivariate interpolation with increasingly flat radial basis functions Theoretical and computational aspects of multivariate interpolation with increasingly flat radial basis functions Elisabeth Larsson Bengt Fornberg June 0, 003 Abstract Multivariate interpolation of smooth

More information

Question 9: PDEs Given the function f(x, y), consider the problem: = f(x, y) 2 y2 for 0 < x < 1 and 0 < x < 1. x 2 u. u(x, 0) = u(x, 1) = 0 for 0 x 1

Question 9: PDEs Given the function f(x, y), consider the problem: = f(x, y) 2 y2 for 0 < x < 1 and 0 < x < 1. x 2 u. u(x, 0) = u(x, 1) = 0 for 0 x 1 Question 9: PDEs Given the function f(x, y), consider the problem: 2 u x 2 u = f(x, y) 2 y2 for 0 < x < 1 and 0 < x < 1 u(x, 0) = u(x, 1) = 0 for 0 x 1 u(0, y) = u(1, y) = 0 for 0 y 1. a. Discuss how you

More information

The Fourier spectral method (Amath Bretherton)

The Fourier spectral method (Amath Bretherton) The Fourier spectral method (Amath 585 - Bretherton) 1 Introduction The Fourier spectral method (or more precisely, pseudospectral method) is a very accurate way to solve BVPs with smooth solutions on

More information

Review I: Interpolation

Review I: Interpolation Review I: Interpolation Varun Shankar January, 206 Introduction In this document, we review interpolation by polynomials. Unlike many reviews, we will not stop there: we will discuss how to differentiate

More information

256 Summary. D n f(x j ) = f j+n f j n 2n x. j n=1. α m n = 2( 1) n (m!) 2 (m n)!(m + n)!. PPW = 2π k x 2 N + 1. i=0?d i,j. N/2} N + 1-dim.

256 Summary. D n f(x j ) = f j+n f j n 2n x. j n=1. α m n = 2( 1) n (m!) 2 (m n)!(m + n)!. PPW = 2π k x 2 N + 1. i=0?d i,j. N/2} N + 1-dim. 56 Summary High order FD Finite-order finite differences: Points per Wavelength: Number of passes: D n f(x j ) = f j+n f j n n x df xj = m α m dx n D n f j j n= α m n = ( ) n (m!) (m n)!(m + n)!. PPW =

More information

Iterative solvers for linear equations

Iterative solvers for linear equations Spectral Graph Theory Lecture 15 Iterative solvers for linear equations Daniel A. Spielman October 1, 009 15.1 Overview In this and the next lecture, I will discuss iterative algorithms for solving linear

More information

1 GSW Sets of Systems

1 GSW Sets of Systems 1 Often, we have to solve a whole series of sets of simultaneous equations of the form y Ax, all of which have the same matrix A, but each of which has a different known vector y, and a different unknown

More information

Geometric Modeling Summer Semester 2010 Mathematical Tools (1)

Geometric Modeling Summer Semester 2010 Mathematical Tools (1) Geometric Modeling Summer Semester 2010 Mathematical Tools (1) Recap: Linear Algebra Today... Topics: Mathematical Background Linear algebra Analysis & differential geometry Numerical techniques Geometric

More information

Numerical Solutions to Partial Differential Equations

Numerical Solutions to Partial Differential Equations Numerical Solutions to Partial Differential Equations Zhiping Li LMAM and School of Mathematical Sciences Peking University Discretization of Boundary Conditions Discretization of Boundary Conditions On

More information

Introduction to Boundary Value Problems

Introduction to Boundary Value Problems Chapter 5 Introduction to Boundary Value Problems When we studied IVPs we saw that we were given the initial value of a function and a differential equation which governed its behavior for subsequent times.

More information

Background. Background. C. T. Kelley NC State University tim C. T. Kelley Background NCSU, Spring / 58

Background. Background. C. T. Kelley NC State University tim C. T. Kelley Background NCSU, Spring / 58 Background C. T. Kelley NC State University tim kelley@ncsu.edu C. T. Kelley Background NCSU, Spring 2012 1 / 58 Notation vectors, matrices, norms l 1 : max col sum... spectral radius scaled integral norms

More information

Lehrstuhl Informatik V. Lehrstuhl Informatik V. 1. solve weak form of PDE to reduce regularity properties. Lehrstuhl Informatik V

Lehrstuhl 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 information

Introduction to PDEs and Numerical Methods Tutorial 5. Finite difference methods equilibrium equation and iterative solvers

Introduction to PDEs and Numerical Methods Tutorial 5. Finite difference methods equilibrium equation and iterative solvers Platzhalter für Bild, Bild auf Titelfolie hinter das Logo einsetzen Introduction to PDEs and Numerical Methods Tutorial 5. Finite difference methods equilibrium equation and iterative solvers Dr. Noemi

More information

MATH 333: Partial Differential Equations

MATH 333: Partial Differential Equations MATH 333: Partial Differential Equations Problem Set 9, Final version Due Date: Tues., Nov. 29, 2011 Relevant sources: Farlow s book: Lessons 9, 37 39 MacCluer s book: Chapter 3 44 Show that the Poisson

More information

From Completing the Squares and Orthogonal Projection to Finite Element Methods

From Completing the Squares and Orthogonal Projection to Finite Element Methods From Completing the Squares and Orthogonal Projection to Finite Element Methods Mo MU Background In scientific computing, it is important to start with an appropriate model in order to design effective

More information

CS6964: Notes On Linear Systems

CS6964: Notes On Linear Systems CS6964: Notes On Linear Systems 1 Linear Systems Systems of equations that are linear in the unknowns are said to be linear systems For instance ax 1 + bx 2 dx 1 + ex 2 = c = f gives 2 equations and 2

More information

Boundary Value Problems - Solving 3-D Finite-Difference problems Jacob White

Boundary Value Problems - Solving 3-D Finite-Difference problems Jacob White Introduction to Simulation - Lecture 2 Boundary Value Problems - Solving 3-D Finite-Difference problems Jacob White Thanks to Deepak Ramaswamy, Michal Rewienski, and Karen Veroy Outline Reminder about

More information

AMS 147 Computational Methods and Applications Lecture 17 Copyright by Hongyun Wang, UCSC

AMS 147 Computational Methods and Applications Lecture 17 Copyright by Hongyun Wang, UCSC Lecture 17 Copyright by Hongyun Wang, UCSC Recap: Solving linear system A x = b Suppose we are given the decomposition, A = L U. We solve (LU) x = b in 2 steps: *) Solve L y = b using the forward substitution

More information

Poisson Solvers. William McLean. April 21, Return to Math3301/Math5315 Common Material.

Poisson Solvers. William McLean. April 21, Return to Math3301/Math5315 Common Material. Poisson Solvers William McLean April 21, 2004 Return to Math3301/Math5315 Common Material 1 Introduction Many problems in applied mathematics lead to a partial differential equation of the form a 2 u +

More information

Boundary Value Problems and Iterative Methods for Linear Systems

Boundary Value Problems and Iterative Methods for Linear Systems Boundary Value Problems and Iterative Methods for Linear Systems 1. Equilibrium Problems 1.1. Abstract setting We want to find a displacement u V. Here V is a complete vector space with a norm v V. In

More information

Iterative Methods for Linear Systems

Iterative Methods for Linear Systems Iterative Methods for Linear Systems 1. Introduction: Direct solvers versus iterative solvers In many applications we have to solve a linear system Ax = b with A R n n and b R n given. If n is large the

More information

AM 205: lecture 19. Last time: Conditions for optimality, Newton s method for optimization Today: survey of optimization methods

AM 205: lecture 19. Last time: Conditions for optimality, Newton s method for optimization Today: survey of optimization methods AM 205: lecture 19 Last time: Conditions for optimality, Newton s method for optimization Today: survey of optimization methods Quasi-Newton Methods General form of quasi-newton methods: x k+1 = x k α

More information

AMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends

AMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends AMS 529: Finite Element Methods: Fundamentals, Applications, and New Trends Lecture 3: Finite Elements in 2-D Xiangmin Jiao SUNY Stony Brook Xiangmin Jiao Finite Element Methods 1 / 18 Outline 1 Boundary

More information

Numerical Analysis: Solutions of System of. Linear Equation. Natasha S. Sharma, PhD

Numerical Analysis: Solutions of System of. Linear Equation. Natasha S. Sharma, PhD Mathematical Question we are interested in answering numerically How to solve the following linear system for x Ax = b? where A is an n n invertible matrix and b is vector of length n. Notation: x denote

More information

Instructions Please answer the five problems on your own paper. These are essay questions: you should write in complete sentences.

Instructions Please answer the five problems on your own paper. These are essay questions: you should write in complete sentences. Instructions Please answer the five problems on your own paper. These are essay questions: you should write in complete sentences.. Recall that P 3 denotes the vector space of polynomials of degree less

More information

Numerical Methods for PDEs

Numerical Methods for PDEs Numerical Methods for PDEs Partial Differential Equations (Lecture 1, Week 1) Markus Schmuck Department of Mathematics and Maxwell Institute for Mathematical Sciences Heriot-Watt University, Edinburgh

More information

10. Rank-nullity Definition Let A M m,n (F ). The row space of A is the span of the rows. The column space of A is the span of the columns.

10. Rank-nullity Definition Let A M m,n (F ). The row space of A is the span of the rows. The column space of A is the span of the columns. 10. Rank-nullity Definition 10.1. Let A M m,n (F ). The row space of A is the span of the rows. The column space of A is the span of the columns. The nullity ν(a) of A is the dimension of the kernel. The

More information

RBF-FD Approximation to Solve Poisson Equation in 3D

RBF-FD Approximation to Solve Poisson Equation in 3D RBF-FD Approximation to Solve Poisson Equation in 3D Jagadeeswaran.R March 14, 2014 1 / 28 Overview Problem Setup Generalized finite difference method. Uses numerical differentiations generated by Gaussian

More information

17 Source Problems for Heat and Wave IB- VPs

17 Source Problems for Heat and Wave IB- VPs 17 Source Problems for Heat and Wave IB- VPs We have mostly dealt with homogeneous equations, homogeneous b.c.s in this course so far. Recall that if we have non-homogeneous b.c.s, then we want to first

More information

f(g(x)) g (x) dx = f(u) du.

f(g(x)) g (x) dx = f(u) du. 1. Techniques of Integration Section 8-IT 1.1. Basic integration formulas. Integration is more difficult than derivation. The derivative of every rational function or trigonometric function is another

More information

Deep Learning for Partial Differential Equations (PDEs)

Deep Learning for Partial Differential Equations (PDEs) Deep Learning for Partial Differential Equations (PDEs) Kailai Xu kailaix@stanford.edu Bella Shi bshi@stanford.edu Shuyi Yin syin3@stanford.edu Abstract Partial differential equations (PDEs) have been

More information

Sparse Linear Systems. Iterative Methods for Sparse Linear Systems. Motivation for Studying Sparse Linear Systems. Partial Differential Equations

Sparse Linear Systems. Iterative Methods for Sparse Linear Systems. Motivation for Studying Sparse Linear Systems. Partial Differential Equations Sparse Linear Systems Iterative Methods for Sparse Linear Systems Matrix Computations and Applications, Lecture C11 Fredrik Bengzon, Robert Söderlund We consider the problem of solving the linear system

More information

Computational Methods. Systems of Linear Equations

Computational Methods. Systems of Linear Equations Computational Methods Systems of Linear Equations Manfred Huber 2010 1 Systems of Equations Often a system model contains multiple variables (parameters) and contains multiple equations Multiple equations

More information

Fast Structured Spectral Methods

Fast Structured Spectral Methods Spectral methods HSS structures Fast algorithms Conclusion Fast Structured Spectral Methods Yingwei Wang Department of Mathematics, Purdue University Joint work with Prof Jie Shen and Prof Jianlin Xia

More information