Michael Holst  
http://ccom.ucsd.edu/~mholst/ 
Professor of Mathematics and Physics UC San Diego 


Math 270B (Numerical Approximation and Nonlinear Equations)
Course Topics: Numerical Approximation and Nonlinear Equations Instructor: Prof. Michael Holst (5739 AP&M, mholst@math.ucsd.edu; Office Hours: MW 23pm) Term: Winter 2013 Lecture: 11:00a11:50a MWF, APM 2402 TA: Shi (Fox) Cheng (5768 AP&M, scheng@ucsd.edu; Office Hours: TueThu 34pm) Main Class Webpage: http://ccom.ucsd.edu/~mholst/teaching/ucsd/270b_w13/index.html Textbook(s): Theoretical Numerical Analysis: A Functional Analysis Framework, Second Edition, by K. Atkinson and W. Han. SpringerVerlag, New York. CATALOG DESCRIPTION: 270B. Numerical Approximation and Nonlinear Equations (4) Iterative methods for nonlinear systems of equations, Newtonâ€™s method. Unconstrained and constrained optimization. The Weierstrass theorem, best uniform approximation, leastsquares approximation, orthogonal polynomials. Polynomial interpolation, piecewise polynomial interpolation, piecewise uniform approximation. Numerical differentiation: divided differences, degree of precision. Numerical quadrature: interpolature quadrature, Richardson extrapolation, Romberg Integration, Gaussian quadrature, singular integrals, adaptive quadrature. Prerequisites: Math. 270A or consent of instructor. COURSE INFORMATION: Many of the advances of modern science have been made possible only through the sophisticated use of computer modeling. The mathematical foundation of the computer modeling techniques now used in all areas of mathematics, engineering, and science is known as numerical analysis (sometimes referred to as computational mathematics, numerical mathematics, or scientific computing). The Math 270ABC series at UCSD provides a graduate level overview of some of the foundation topics in numerical analysis. Math 270A deals with various aspects of numerical linear algebra, including direct methods for solving systems of equations involving dense and sparse matrices, iterative methods for solving linear systems, and methods for solving eigenvalue problems. Math 270B focuses on numerical methods for solving nonlinear equations and optimization problems, and on classical and modern approximation theory as needed for analyzing numerical methods. Math 270C concentrates on bringing the tools from 270A and 270B together to develop numerical methods for solving initial value problems (IVPs) and boundary value problems (BVPs) in ordinary differential equations (ODEs). The topics in 270A and the first half of 270B may be viewed as preparation for Math 271ABC (numerical optimization), whereas the topics in the entire series, with emphasis on the topics in the second half of 270B and the topics in 270C, may be viewed as preparation for 272ABC (numerical PDE) and 273ABC (advanced techniques in computational and applied mathematics). GRADES, HOMEWORKS, EXAMS, AND IMPORTANT DATES: Course information, such as any homework assignments given out, exam dates, and so forth, will be maintained on this course webpage. Note that I sometimes make changes to the lecture schedule and homework assignments as the quarter progresses, depending on how far I get each week in the lectures. Therefore, check this webpage regularly. I will periodically (about every 23 weeks) give out homeworks to help you prepare for the final exam. The last week I will finish any remaining material, and then focus on reviewing the material from the class for the final exam. The final exam will be based on the material I cover in class (a subset of the textbook), supplemented with some background material I will lecture on at the beginning of the course (most of which is also in the textbook). Important dates:
Turning in the homeworks: Please just do not give all of your homeworks to the TA toward the end of the quarter; he will not have time to give you any feedback before the final. To make best use of his help, try to do the homeworks within a couple of weeks of their posting, and then give the homeworks to the TA; he will then be able to give you some marked versions back within a week. Homework Problems: (Assigned problems are exercises appearing in the textbook)
SCHEDULE OF LECTURES: Our schedule in Math 270B will be roughly as follows. In weeks 12 we will cover just part of the material form Chapters 1 and 2, mainly focusing on obtaining background on normed and innerproduct spaces, and the basics of linear operators on those spaces. In weeks 36 we will cover iterative methods for solving nonlinear systems of equations (primarily Newton's method), methods for unconstrained optimization, and methods for equalityconstrained optimization. Our approach will be to develop the theory abstractly in Banach and Hilbert spaces, and then look at specific examples from application areas such as algebraic systems and partial differential equations. In weeks 710 we will cover classical approximation theory: abstract approximation theory in Banach and Hilbert spaces, interpolation of realvalued functions of a single real variable by polynomials, numerical differentiation, and numerical quadrature. Time permitting, we will discuss modern topics in approximation theory at the very end of the course, including wavelets and applied harmonic analysis. 