Announcements Announcements will be made here and on the CS newsgroup. The answer is that they were dropped, just ignore the glookup total, it's not what we used.
TBA 3 Points, Tuesdays, 1: Each of our six meetings will be independent. At each meeting, the first hour will be a lecture aimed at anyone interested in numerical analysis at a high level, organized around a well-known topic and mixing historical perspectives, recent developments, and always some new mathematics.
In the final two weeks each student will complete a small project. Tentative schedule of topics: Polynomials and multivariate polynomials [Possible alternative topic: Computational Fluid Dynamics 3 Points, Tuesdays, 3: This course will cover advanced numerical techniques for solving PDEs, with a particular focus on fluid dynamics.
This includes advection-diffusion-reaction equations, compressible and incompressible Navier-Stokes equations, and fluid-structure coupling. Basic familiarity with temporal integrators for ODEs multistep, Runge-Kuttamethods for solving PDEs finite difference, finite volume, finite elements for parabolic and elliptic problemsiterative solvers for linear systems, and the Navier-Stokes equations will be assumed.
Topics covered will include: Students will use the Java programming language to develop object-oriented software, and will focus on the most broadly important elements of programming - superior design, effective problem solving, and the proper use of data structures and algorithms.
Students will work with market and historical data to run simulations and test strategies. The course is designed to give students a feel for the practical considerations of software development and deployment.
Several key technologies and recent innovations in financial computing will be presented and discussed. Undergraduate multivariate calculus and linear algebra.
Programming experience strongly recommended but not required. This course is intended to provide a practical introduction to computational problem solving. Continuous Time Finance or permission of instructor. The aim of this course is to provide the students with the mathematical tools and computational methods required to tackle these issues, and illustrate the methods with practical case studies such as American option pricing, uncertain volatility, uncertain mortality, different rates for borrowing and lending, calibration of models to market smiles, credit valuation adjustment CVAportfolio optimization, transaction costs, illiquid markets, super-replication under delta and gamma constraints, etc.
We will strive to make this course reasonably comprehensive, and to find the right balance between ideas, mathematical theory, and numerical implementations.
We will spend some time on the theory: But the main focus will deliberately be on ideas and numerical examples, which we believe help a lot in understanding the tools and building intuition.
A rigorous background in Bayesian statistics geared towards applications in finance, including decision theory and the Bayesian approach to modeling, inference, point estimation, and forecasting, sufficient statistics, exponential families and conjugate priors, and the posterior predictive density.
Inference for classical time-series models, state estimation and parameter learning in Hidden Markov Models HMMs including the Kalman filter, the Baum-Welch algorithm and more generally, Bayesian networks and belief propagation.
Real world examples drawn from finance to include stochastic volatility models, portfolio optimization with transaction costs, risk models, and multivariate forecasting. This is a full semester course focusing on practical aspects of alternative data, machine learning and data science in quantitative finance.
Homework and hands-on projects form an integral part of the course, where students get to explore real-world datasets and software. The course begins with an overview of the field, its technological and mathematical foundations, paying special attention to differences between data science in finance and other industries.
We review the software that will be used throughout the course. We examine the basic problems of supervised and unsupervised machine learning, and learn the link between regression and conditioning.
Then we deepen our understanding of the main challenge in data science — the curse of dimensionality — as well as the basic trade-off of variance model parsimony vs. Demonstrations are given for real world data sets and basic data acquisition techniques such as web scraping and the merging of data sets.
As homework each student is assigned to take part in downloading, cleaning, and testing data in a common repository, to be used at later stages in the class.
We examine linear and quadratic methods in regression, classification and unsupervised learning.You are allowed to used course notes (online pdfs and your own handwritten notes), online ME lecture videos, and your own homework solutions on the exam.
All other resources are prohibited, including: the internet, other books, discussing the exam with other people. PHYS Junior Physics Laboratory II Notes on Fourier Transforms The Fourier transform is a generalization of the Fourier series representation of functions.
The Fourier series is limited to periodic functions, while the Fourier transform can the Fast Fourier Transform or FFT, exists to compute the sum in Eq. 13, provided that N is. D F T (Discrete Fourier Transform) F F T (Fast Fourier Transform) Written by Paul Bourke June Introduction.
This document describes the Discrete Fourier Transform (DFT), that is, a Fourier Transform as applied to a discrete complex valued series. –Fast Fourier Transform (FFT) is a divide-and-conquer Fourier Transform •Fourier Transforms originate from signal processing Time t Frequency Fast Multiplication of Polynomials •Using complex roots of unity –Evaluation by taking the Discrete Fourier Transform (DFT).
F. James, A Student’s Guide to Fourier Transforms 2nd ed., Cambridge, This is a good, short book ( pages), similar to Bracewell to some extent, with about 70% devoted to various applications.
Fourier Transforms in Matlab ment the Fast Fourier Transform for computing the 1-D, 2-D and N-dimensional transforms respectively.
The Recall from the lecture notes that a 1-D gate function transforms into a sinc function of sin(px)/(px). Let’s look at a .