Cycle Detection and Removal in Electricity Markets “Lunch at Lab” Presentation Matt Lyle Department of mathematics&statistics University of Calgary, Alberta.

Slides:



Advertisements
Similar presentations
SADC Course in Statistics Decomposing a time series (Session 03)
Advertisements

DCSP-12 Jianfeng Feng
DCSP-13 Jianfeng Feng Department of Computer Science Warwick Univ., UK
Filtering the data. Detrending Economic time series are a superposition of various phenomena If there exists a « business cycle », we need to insulate.
The Discrete Fourier Transform. The spectrum of a sampled function is given by where –  or 0 .
Transform Techniques Mark Stamp Transform Techniques.
1 Chapter 16 Fourier Analysis with MATLAB Fourier analysis is the process of representing a function in terms of sinusoidal components. It is widely employed.
Fourier series With coefficients:. Complex Fourier series Fourier transform (transforms series from time to frequency domain) Discrete Fourier transform.
CS 551 / CS 645 Antialiasing. What is a pixel? A pixel is not… –A box –A disk –A teeny tiny little light A pixel is a point –It has no dimension –It occupies.
Techniques in Signal and Data Processing CSC 508 Fourier Analysis.
Reporter: You-Cheng Luo 2011/01/04 Spikes of the Electricity.
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F(  ) is the spectrum of the function.
S. Mandayam/ DIP/ECE Dept./Rowan University Digital Image Processing ECE /ECE Fall 2007 Shreekanth Mandayam ECE Department Rowan University.
Beam Propagation Method Devang Parekh 3/2/04 EE290F.
Image Fourier Transform Faisal Farooq Q: How many signal processing engineers does it take to change a light bulb? A: Three. One to Fourier transform the.
Physics 434 Module 4-FFT – Thanks to Prof. Toby Burnett for writeups & lab 1 Physics 434: Continuing Module 4 week 2: the Fourier Transform Explore Fourier.
Fast Fourier Transform (FFT) (Section 4.11) CS474/674 – Prof. Bebis.
Business Cycles Empirical Properties. What do we mean by “The Business Cycle”?
Parallelizing the Fast Fourier Transform David Monismith cs599.
REPLUS BATTERY REGEN Technical sales support: electrical products Lode Baert.
Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain Digital Image Processing Chapter # 4 Image Enhancement in Frequency Domain.
Digital Image Processing Homework II Fast Fourier Transform 2012/03/28 Chih-Hung Lu ( 呂志宏 ) Visual Communications Laboratory Department of Communication.
CS654: Digital Image Analysis Lecture 12: Separable Transforms.
111 Lecture 2 Signals and Systems (II) Principles of Communications Fall 2008 NCTU EE Tzu-Hsien Sang.
Advanced Digital Signal Processing
Seismic Reflection Data Processing and Interpretation A Workshop in Cairo 28 Oct. – 9 Nov Cairo University, Egypt Dr. Sherif Mohamed Hanafy Lecturer.
Frequancy Domain Filtering (FDF) Lab 5. Using FFT (Fast Fourier Transform ) algorithm DFT (Discrete Fourier Transform) & inverse DFT.
Technion, CS department, SIPC Spring 2014 Tutorials 12,13 discrete signals and systems 1/39.
CS654: Digital Image Analysis Lecture 22: Image Restoration - II.
Chapter 6 Spectrum Estimation § 6.1 Time and Frequency Domain Analysis § 6.2 Fourier Transform in Discrete Form § 6.3 Spectrum Estimator § 6.4 Practical.
Fast Fourier Transform & Assignment 2
Wind Speed Stochastic Models: A Case Study for the Mediterranean Area Giovanni Bonanno, Riccardo Burlon, Davide Gurrera, Claudio Leone Dipartimento di.
Vincent DeVito Computer Systems Lab The goal of my project is to take an image input, artificially blur it using a known blur kernel, then.
Astronomical Data Analysis I
Inverse DFT. Frequency to time domain Sometimes calculations are easier in the frequency domain then later convert the results back to the time domain.
Matrices and linear transformations For grade 1, undergraduate students For grade 1, undergraduate students Made by Department of Math.,Anqing Teachers.
CS654: Digital Image Analysis
Fourier and Wavelet Transformations Michael J. Watts
Professor A G Constantinides 1 Discrete Fourier Transforms Consider finite duration signal Its z-tranform is Evaluate at points on z-plane as We can evaluate.
Frequency Domain By Dr. Rajeev Srivastava. Image enhancement in the frequency domain is straightforward. We simply compute the Fourier transform of the.
Vincent DeVito Computer Systems Lab The goal of my project is to take an image input, artificially blur it using a known blur kernel, then.
Components of Time Series Su, Chapter 2, section II.
Signal acquisition A/D conversion Sampling rate  Nyquist-Shannon sampling theorem: If bandlimited signal x(f) holds in [-B;B], then if f s = 1 / T.
Statistics for Business and Economics Module 2: Regression and time series analysis Spring 2010 Lecture 7: Time Series Analysis and Forecasting 1 Priyantha.
Husheng Li, UTK-EECS, Fall The specification of filter is usually given by the tolerance scheme.  Discrete Fourier Transform (DFT) has both discrete.
1.Be able to distinguish linear and non-linear systems. 2.Be able to distinguish space-invariant from space-varying systems. 3.Describe and evaluate convolution.
Fourier series With coefficients:.
Anatoliy Swishchuk Mathematical and Computational Finance Laboratory
Image Enhancement and Restoration
Discrete Fourier Transform (DFT)
CS 591 S1 – Computational Audio
Section II Digital Signal Processing ES & BM.
MECH 373 Instrumentation and Measurements
Image Deblurring and noise reduction in python
Information Extraction, Dept
Advanced Wireless Networks
Fourier Analyses Time series Sampling interval Total period
Fourier and Wavelet Transformations
Image Analysis Image Restoration.
General Functions A non-periodic function can be represented as a sum of sin’s and cos’s of (possibly) all frequencies: F() is the spectrum of the function.
All about convolution.
Fast Fourier Transform (FFT) (Section 4.11)
Discrete Fourier Transform
4.1 DFT In practice the Fourier components of data are obtained by digital computation rather than by analog processing. The analog values have to be.
1-D DISCRETE COSINE TRANSFORM DCT
Applications of Fourier Analysis in Image Recovery
Lec.6:Discrete Fourier Transform and Signal Spectrum
ENEE222 Elements of Discrete Signal Analysis Lab 9 1.
Even Discrete Cosine Transform The Chinese University of Hong Kong
Presentation transcript:

Cycle Detection and Removal in Electricity Markets “Lunch at Lab” Presentation Matt Lyle Department of mathematics&statistics University of Calgary, Alberta

Outline ● Characteristics of electricity spot prices ● Electricity price function ● The Seasonal Function ● The FFT ● The sweeping method ● Noise characteristics ● Some ending remarks

Electricity spot price characteristics ● Very high volatility ● Numerous price spikes ● High rate of mean reversion ● Seasonal (cyclical) behaviour ● Cannot be economically be stored

Hrly prices for AB and PJM markets

Electricity Price Function ● Suppose that the spot price is as follows Where is the deterministic component is the Stochastic component is the spot price

Electricity Price Function ● We would like to be able to model directly, but it is complicated… ● Instead we try to model its components separately and then combine them afterwards

Seasonal Function Since in this presentation we are concerned with the deterministic component of the price, we begin by assuming Where can be estimated using a linear fit on the data set And is the seasonal or cyclical term that needs to be determined

Seasonal Function Going back to we have

The Fast Fourier Transform ● The continuous time Fourier Transform is defined as ● Discretizing ● We get the discrete Fourier Transform

The Fast Fourier Transform With now de-trended we can now perform the FFT on the data

The sweeping method ● With the cyclical components identified we now need to separate them from the noise ● We can do this by first noting the location of the spikes in the frequency domain. We use the first eight most dominant spikes. ● And then remove those spikes from the set

The Sweeping Method After removing the eight spikes from the set we can see that spikes still remain

The Sweeping Method We again identify the eight most dominant spikes and remove them

The Sweeping Method

After the third sweep we stop. But more or less sweeps can be applied for different data sets

The Sweeping Method

● We know have our cyclical and stochastic components separated ● By taking the inverse FFT or IFFT we can restore the seasonal and stochastic components to the time domain ● And we now have the stochastic component by itself

Noise Characteristics The time domain of the noise

Noise Characteristics Density of the Alberta spot prices

Noise Characteristics Density of PJM spot prices

Ending Remarks ● Some advantages with this method: 1) Robust 2) Allows for a visual interpretation of the cycles 3) FFT algorithm is common in many computational packages 4) Calibration time is reduced

Ending Remarks ● Some disadvantages with this method: 1) Hard to identify low frequency components 2) More work at the front end of model construction 3) Deciding how many sweeps to do is hard to identify

Thank you ●