Qualifying Examination

Similar documents
1 + z 1 x (2x y)e x2 xy. xe x2 xy. x x3 e x, lim x log(x). (3 + i) 2 17i + 1. = 1 2e + e 2 = cosh(1) 1 + i, 2 + 3i, 13 exp i arctan

Part 1. The diffusion equation

Math 7824 Spring 2010 Numerical solution of partial differential equations Classroom notes and homework

Iterative Methods for Linear Systems

Linear Algebra Massoud Malek

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)

MATH2071: LAB #5: Norms, Errors and Condition Numbers

Boundary Value Problems and Iterative Methods for Linear Systems

Second Midterm Exam Name: Practice Problems March 10, 2015

Leplace s Equations. Analyzing the Analyticity of Analytic Analysis DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING. Engineering Math EECE

(i) [7 points] Compute the determinant of the following matrix using cofactor expansion.

Math 180, Final Exam, Fall 2012 Problem 1 Solution

Errata for the book A First Course in Numerical Methods, by Uri Ascher and Chen Greif

Numerical Analysis Preliminary Exam 10 am to 1 pm, August 20, 2018

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

Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012

Applied Math Qualifying Exam 11 October Instructions: Work 2 out of 3 problems in each of the 3 parts for a total of 6 problems.

THE NATIONAL UNIVERSITY OF IRELAND, CORK COLÁISTE NA hollscoile, CORCAIGH UNIVERSITY COLLEGE, CORK. Summer Examination 2009.

Chapter 10 Exercises

Name: Instructor: 1. a b c d e. 15. a b c d e. 2. a b c d e a b c d e. 16. a b c d e a b c d e. 4. a b c d e... 5.

Scientific Computing: An Introductory Survey

Math 185 Fall 2015, Sample Final Exam Solutions

18.06 Problem Set 1 - Solutions Due Wednesday, 12 September 2007 at 4 pm in

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

Finite Difference Methods for Boundary Value Problems

Ma 530 Power Series II

WRT in 2D: Poisson Example

Numerical Analysis Preliminary Exam 10.00am 1.00pm, January 19, 2018

Final Exam Practice 3, May 8, 2018 Math 21b, Spring Name:

Homework and Computer Problems for Math*2130 (W17).

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

Preliminary Examination, Numerical Analysis, August 2016

LECTURE NOTES ELEMENTARY NUMERICAL METHODS. Eusebius Doedel

Mathematics Qualifying Exam Study Material

Applied Linear Algebra in Geoscience Using MATLAB

18.06 Problem Set 10 - Solutions Due Thursday, 29 November 2007 at 4 pm in

Study Guide/Practice Exam 3

ON ORTHOGONAL REDUCTION TO HESSENBERG FORM WITH SMALL BANDWIDTH

Solving First Order PDEs

MATH-UA 263 Partial Differential Equations Recitation Summary

5.) For each of the given sets of vectors, determine whether or not the set spans R 3. Give reasons for your answers.

Spring 2015 Sample Final Exam

Bessel s Equation. MATH 365 Ordinary Differential Equations. J. Robert Buchanan. Fall Department of Mathematics

REVIEW OF DIFFERENTIAL CALCULUS

Solving First Order PDEs

MATH 32A: MIDTERM 2 REVIEW. sin 2 u du z(t) = sin 2 t + cos 2 2

Math 265H: Calculus III Practice Midterm II: Fall 2014

PDEs, part 3: Hyperbolic PDEs

Linear Algebra. Session 12

Leplace s Equations. Analyzing the Analyticity of Analytic Analysis DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING. Engineering Math 16.

you expect to encounter difficulties when trying to solve A x = b? 4. A composite quadrature rule has error associated with it in the following form

First order wave equations. Transport equation is conservation law with J = cu, u t + cu x = 0, < x <.

The amount of work to construct each new guess from the previous one should be a small multiple of the number of nonzeros in A.

Numerical Linear Algebra Homework Assignment - Week 2

Math 504 (Fall 2011) 1. (*) Consider the matrices

MA 262, Fall 2017, Final Version 01(Green)

Cheat Sheet for MATH461

4.8 Arnoldi Iteration, Krylov Subspaces and GMRES

c) xy 3 = cos(7x +5y), y 0 = y3 + 7 sin(7x +5y) 3xy sin(7x +5y) d) xe y = sin(xy), y 0 = ey + y cos(xy) x(e y cos(xy)) e) y = x ln(3x + 5), y 0

Complex Homework Summer 2014

(a) If A is a 3 by 4 matrix, what does this tell us about its nullspace? Solution: dim N(A) 1, since rank(a) 3. Ax =

Finite difference methods for the diffusion equation

Class notes: Approximation

7 Hyperbolic Differential Equations

Bindel, Fall 2011 Intro to Scientific Computing (CS 3220) Week 3: Wednesday, Jan 9

MA 113 Calculus I Fall 2017 Exam 1 Tuesday, 19 September Multiple Choice Answers. Question

3. Identify and find the general solution of each of the following first order differential equations.

Announcements Monday, September 25

Lecture 03. Math 22 Summer 2017 Section 2 June 26, 2017

Math 241 Final Exam, Spring 2013

PH.D. PRELIMINARY EXAMINATION MATHEMATICS

Math 2930 Worksheet Final Exam Review

In this chapter we study several functions that are useful in calculus and other areas of mathematics.

MATH 220 CALCULUS I SPRING 2018, MIDTERM I FEB 16, 2018

AMS526: Numerical Analysis I (Numerical Linear Algebra) Lecture 23: GMRES and Other Krylov Subspace Methods; Preconditioning

AM 205: lecture 14. Last time: Boundary value problems Today: Numerical solution of PDEs

Computational Methods CMSC/AMSC/MAPL 460. Eigenvalues and Eigenvectors. Ramani Duraiswami, Dept. of Computer Science

Name: ID.NO: Fall 97. PLEASE, BE NEAT AND SHOW ALL YOUR WORK; CIRCLE YOUR ANSWER. NO NOTES, BOOKS, CALCULATORS, TAPE PLAYERS, or COMPUTERS.

Section 3.9. Matrix Norm

MATH 131P: PRACTICE FINAL SOLUTIONS DECEMBER 12, 2012

CLASSIFICATION AND PRINCIPLE OF SUPERPOSITION FOR SECOND ORDER LINEAR PDE

SAMPLE FINAL EXAM SOLUTIONS

Solving linear systems (6 lectures)

PDE: The Method of Characteristics Page 1

Transformations from R m to R n.

MATH 452. SAMPLE 3 SOLUTIONS May 3, (10 pts) Let f(x + iy) = u(x, y) + iv(x, y) be an analytic function. Show that u(x, y) is harmonic.

Math Homework 2

6 Linear Systems of Equations

The automatic solution of PDEs using a global spectral method

Math 291-2: Final Exam Solutions Northwestern University, Winter 2016

5. Hand in the entire exam booklet and your computer score sheet.

[2] (a) Develop and describe the piecewise linear Galerkin finite element approximation of,

Rambo s Math GRE Practice Test. Charles Rambo

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

M.A. Botchev. September 5, 2014

Notes 14 The Steepest-Descent Method

1 Introduction to MATLAB

Examples of the Fourier Theorem (Sect. 10.3). The Fourier Theorem: Continuous case.

Completion Date: Monday February 11, 2008

Reduction to the associated homogeneous system via a particular solution

Transcription:

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 your exam to lma3@uw.edu, at the conclusion of the exam.. Consider the complex-valued expression f(z) = z /2, where z = x + iy, with x, y R. Derive explicit expressions for the real and imaginary part(s) of f(z) in terms of x and y. If you make any choices (e.g., for branch cuts), show how they impact your answer. Your answer should not contain any trig functions. 2. Let A and B be n n Hermitian matrices. Further, assume that A is non-negative definite, while B is positive definite. Define v Av λ = sup v v Bv. Show that λ is the largest generalized eigenvalue of the pair (A, B): λ is the largest scalar satisfying Ax = λbx, for some nonzero vector x. 3. Write down the solution of the following initial-value problem: iu t = u xx, x R, t >, u(x, ) = f(x), x R, lim u(x, t) = α, t >, x lim u(x, t) = β, t >. x You may assume that the boundary and initial conditions are compatible. 4. Consider the equation y + x 2 y y =. Find the first four terms of an expansion of the appropriate type (asymptotic or convergent), for the solution satisfying y(2) =, y (2) =. 5. The Matlab code poisson.m provided to you solves the problem u xx + u yy = 5π 2 sin(πx) sin(2πy) with u(x, y) = on the boundary of the unit square x, y.

The mesh spacing h is taken the same in both coordinate directions and h = /(m + ) where there are m interior unknowns in each row and each column. This code uses sparse storage to create a matrix problem A h u h = F h where the interior unknowns are by rows, bottom to top, and within each row, from left to right using the natural rowwise ordering. The code is set up to solve this problem using m = 2. It uses Matlab s backslash command to solve the linear system. The true solution to this PDE is known and used in the code to set the correct boundary conditions. The norm u h u pde measuring the max error in the discrete solution relative to the PDE at the nodal points is printed at the end. Recall, the eigenvalues λ pq of A h are (2/h 2 )(cos(pπh)+cos(qπh) 2) where p =, 2,..., m, q =, 2,..., m. (a) Modify the poisson.m code to solve the Helmholtz problem u xx + u yy + k 2 u = (k 2 5π 2 ) sin(πx) sin(2πy) with u(x, y) = on the boundary of the unit square x, y. You will need to know the exact solution to this new PDE to set the boundary conditions using the code s approach. (b) Solve the new problem using your modified code which still uses backslash as the linear system solver. Verify it works for k = 3, k =, and k = 6. Do you think the backslash command did any pivoting for any of these problems? 2

Summer 24 Day 2. Tuesday, September 6, 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 your exam to lma3@uw.edu, at the conclusion of the exam.. Consider the advection equation u t + au x = with periodic boundary conditions. (a) Derive the Lax-Wendroff method below where Uj n x = h: U n+ j (b) What is the order of the method? (c) Derive the stability condition. u(x j, t n ) with t = k, and = U n j ak 2h (U n j+ U n j ) + a2 k 2 2h 2 (U n j 2U n j + U n j+). (d) If you program this method, would you expect to see dissipative behavior? Dispersive behavior? Justify your answer by finding a modified PDE on which the method is 3rd order accurate. 2. Consider the function defined at x = and x = by continuity. (a) What is f()? f(x) = ( sin 2 [πx/2]) ) / ln x, x <, (b) How many local minima and maxima does f(x) have? (c) What is max x [, ) f(x)? 3. Suppose we want to compute π sin /4 (x) dx. A standard formula like the trapezoidal rule will break down since f(x) = (sin(x)) /4 blows up at x = and x = π. A method that avoids evaluating f at its singularities will often still need to evaluate f at many points to capture the singularity and compute a good approximation. Notice that the singularities x = and x = π are integrable, which is why the question makes sense in the first place. Break up the integral in a sum of integrals, π sin /4 (x) dx = α sin /4 (x) dx + 3 π α sin /4 (x) dx

each one containing only one singularity of the integrand (as an endpoint). Here α (, π) is a number you get to pick for your convenience. Near the singularity x = we can write f(x) = x /4 g(x) where g(x) is a smooth function. We use the fact that the singular part x /4 can be integrated exactly to find accurate formulas that require evaluating g at only a few points, e.g., α x /4 g(x) dx n w j g(x j ), where the x j are, for example, equally spaced points in the interval. To find such a formula we must determine the weights w j to use, which depends on the set of points x j chosen. One way to do this is to require that the above integration formula is exact for the n functions g(x) =, x, x 2,..., x n. Note that for these choices of g the integral on the left-hand side can be computed exactly. Thus this results in a linear system of n equations to solve for the weights. (a) With your choice of α, determine the weights w, w 2, w 3 using this approach for the case n = 3, using equally spaced points x =, x 2 = α/2, x 3 = α. Requiring that the above equality holds for g(x) =, x, x 2 gives a linear system of 3 equations for the w s that can easily be solved however you want (by hand or by computer). (b) Use these weights to estimate the integral α (sin(x)) /4 dx. (c) Deal with π α (sin(x)) /4 dx however you want. (d) Use their combination to estimate the original integral. It should agree to several digits with the exact value, which you can get very accurately using your favorite software. 4. Let A and B be n n Hermitian nonnegative definite matrices. Define λ = j= v Av sup v / N (B) v Bv, where N (B) denotes the null space of B. What are the necessary and sufficient conditions so that λ is finite? Note. This problem setting differs from Problem 2 on Day, by the fact that B is not positive definite here. As a consequence, the sup above is taken over a different space. 5. Evaluate I(α, β) = sin(αx) sinh(βx) dx. You may assume that α and β are positive and nonzero. Note. We are willing to give you a good contour to use, at the cost of points. 4

Summer 24 Day 3. Wednesday, September 7, 24 You have two hours to complete this exam. Work all problems. Start each problem on a. Find the leading behavior as x of I(x) = ln( + t)e x sinh2 t dt. Next, find the first correction to this leading behavior. 2. Consider the so-called minimal surface equation ( + u 2 y)u xx 2u x u y u xy + ( + u 2 x)u yy =. What can you say about this equation and any of its solutions? 3. A heavily used method for solving Ax = b where A is sparse, nonsingular, and nonsymmetric is the Krylov-space method called GMRES. Starting with any initial guess x, the method at step k chooses x k+ = x k + Qy where Q is an n k matrix with orthonormal columns and y is a k vector. (a) Derive the method by showing how Q and y are chosen. (b) Show how the Arnoldi process is used in the method. (c) Discuss the arithmetic complexity and convergence properties. How does the truncated GMRES compare to the untruncated algorithm in both complexity and convergence properties? (d) Program as much of the algorithm as you can by either using pseudo code or actual Matlab code. Email your code (or pseudo code, if done electronically) to lma3@uw.edu after you finish the written part of the exam. 5