a reconstruction method for faraday tomography in ska...

14
A Reconstruction Method for Faraday Tomography in SKA Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators: Tsutomu T. Takeuchi (Nagoya U.), Takuya Akahori (NAOJ), Yoshimitsu Miyashita (Kumamoto University)

Upload: others

Post on 17-Mar-2021

1 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

AReconstructionMethodforFaradayTomographyinSKA

CosmicMagnetism

SKA-JapanSymposium2019atNAOJ

Suchetha Cooray

Collaborators: Tsutomu T. Takeuchi (Nagoya U.), Takuya Akahori (NAOJ),

Yoshimitsu Miyashita (Kumamoto University)

Page 2: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

ReconstructionAlgorithm

Page 3: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

Original Signal Observed Signal (Masked)

The Problem to be Solved

Observe a part of the signal and reconstruct the unobserved region from the observed information with some assumptions

What is here?

We want this answer

Page 4: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

Generalizing the Problem

➤ Let f(x) and g(x) be the complete and incomplete signals respectively

➤ If M is a a masking operator, then

➤ We have g(x) but not f(x) so we need to find the inverse of M

➤ Thus, we call all these types of problems as inverse problems

=> The aim is to estimate M-1 to find f(x) from g(x)

g(x) = M(x) f(x)

f(x) = M−1(x) g(x)

Page 5: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

Papoulis-Gerchberg (PG) Algorithm

➤ A popular algorithm to solve the problem is the Papoulis-Gerchberg (PG) algorithm (Papoulis 1974, Gerchberg 1974)

➤ An extrapolation algorithm that is iterative in nature

➤ Uses transformations to produce a better estimate every iteration

➤ After infinite iterations, the estimate will have infinitesimal error with respect to the true answer

Page 6: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

➤ Again, let f(x), g(x) and M be the complete signal, incomplete signal and masking operator respectively

➤ If we take the Fourier Transform of the above,

Reframing the Inverse Problem

g = M f

ℱ(g) = ℱ(M) * ℱ( f )

=> It is just a deconvolution problem!

Page 7: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

Implications

The PG algorithm can be a method of deconvolution for many applications in

astronomy

Page 8: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

FaradayTomography

Page 9: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

Faraday Tomography

➤ Will be a key tool in understanding the 3D distribution of magnetic fields

➤ Can explore the distribution of polarized emissions and Faraday rotating clouds

➤ SKA will provide the necessary wide-band polarization measurements

➤ However, the problem of limited wavelength observations will always exist

➤ We will employ our reconstruction algorithm to solve it

Page 10: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

Faraday Tomography

f

M

g=Mf

F(f)

F(M)

F(Mf)=M*f

➤ Top left is the Faraday dispersion function - roughly shows the magnetic structure

➤ Top right is the complex polarized surface brightness - inverse Fourier transform of Faraday dispersion

BrentjensanddeBruyn:RMSynthesis(2008)

Page 11: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

Faraday Tomography Reconstruction

➤ Two methods exists:

➤ QU Fitting: Uses model fitting. Requires knowledge of the model (e.g. combination of Gaussians)

➤ RM CLEAN: Uses the CLEAN algorithm to deconvolve. However the Faraday dispersion function is not a combination of delta functions.

➤ The PG algorithm assumes that some part of the Faraday dispersion function is zero (i.e. no emission and rotation in a region along LOS).

Page 12: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

Faraday Tomography Reconstruction (Preliminary)

FaradayDispersionFunction

Page 13: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

Summary

1. Presented a flexible data reconstruction algorithm (PG)

that can potentially be applied to many problems in

astronomy

2. Discussed the power of Faraday tomography

3. Preliminary result of reconstruction of the Faraday

dispersion function

Page 14: A Reconstruction Method for Faraday Tomography in SKA ...ska-jp.org/skajpws2019/Day4/4-8_Suchetha.pdf · Cosmic Magnetism SKA-Japan Symposium 2019 at NAOJ Suchetha Cooray Collaborators:

Thanks!