<?xml version="1.0" encoding="utf-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Recent changes to Introduction</title><link>https://sourceforge.net/p/wsclean/wiki/Introduction/</link><description>Recent changes to Introduction</description><atom:link href="https://sourceforge.net/p/wsclean/wiki/Introduction/feed" rel="self"/><language>en</language><lastBuildDate>Mon, 04 Jun 2018 14:06:11 -0000</lastBuildDate><atom:link href="https://sourceforge.net/p/wsclean/wiki/Introduction/feed" rel="self" type="application/rss+xml"/><item><title>Introduction modified by André Offringa</title><link>https://sourceforge.net/p/wsclean/wiki/Introduction/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v9
+++ v10
@@ -3,14 +3,14 @@

 WSClean stands for "w-stacking clean". W-stacking is an alternative to the w-projection algorithm, in which the uv-samples are not convolved with a w-term correcting kernel before the FFT, but are instead corrected with a multiplication after the FFT. Multiplying each pixel is generally much faster than convolving an image, but the downside is that samples can not be added together on one grid until the w-term has been corrected. This means that in w-stacking, each w-layer needs to be stored and FFT-ed individually. The result is that w-stacking requires more memory and spends relative more time doing the FFTs, instead of gridding+convolving.

-It turns out that for many telescopes, the WSClean approach is a very good trade-off, and WSClean is typically an order of magnitude faster than Casa's w-projection on MWA data. It can also handle full-sky 10k x 10k images, on which Casa runs out of memory. WSClean with the same number of layers is at least as accurate as w-projection. In tests it seems even to be slightly more accurate, probably because there is no need to trim down a convolution kernel. 
+It turns out that for many telescopes, the WSClean approach is a very good trade-off, and WSClean is typically an order of magnitude faster than Casa's w-projection on MWA data. It can also handle full-sky 10k x 10k images on which Casa runs out of memory. WSClean with the same number of layers is at least as accurate as w-projection. In tests it seems even to be slightly more accurate, probably because there is no need to trim down a convolution kernel. 

 [The "usage" page](Usage) gives an overview of how to call WSClean from the commandline.

 WSClean Article
 ---------------

-The WSClean implementations has been described and tested in the following paper:
+The WSClean implementation has been described and tested in the following paper:

 "[WSClean: an implementation of a fast, generic wide-field imager for radio astronomy](http://arxiv.org/abs/1407.1943)"
 (Offringa et al., 2014, Oct, MNRAS 444 (1): 606-619)
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">André Offringa</dc:creator><pubDate>Mon, 04 Jun 2018 14:06:11 -0000</pubDate><guid>https://sourceforge.nete10e15c30575d711213f3e470f565d4e92b2074b</guid></item><item><title>Introduction modified by André Offringa</title><link>https://sourceforge.net/p/wsclean/wiki/Introduction/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v8
+++ v9
@@ -18,3 +18,5 @@
 Abstract:

 Astronomical widefield imaging of interferometric radio data is computationally expensive, especially for the large data volumes created by modern non-coplanar many-element arrays. We present a new widefield interferometric imager that uses the *w*-stacking algorithm and can make use of the *w*-snapshot algorithm. The performance dependencies of CASA's *w*-projection and our new imager are analysed and analytical functions are derived that describe the required computing cost for both imagers. On data from the Murchison Widefield Array, we find our new method to be an order of magnitude faster than *w*-projection, as well as being capable of full-sky imaging at full resolution and with correct polarisation correction. We predict the computing costs for several other arrays and estimate that our imager is a factor of 2-12 faster, depending on the array configuration. We estimate the computing cost for imaging the low-frequency Square-Kilometre Array observations to be 60 PetaFLOPS with current techniques. We find that combining *w*-stacking with the *w*-snapshot algorithm does not significantly improve computing requirements over pure *w*-stacking. The source code of our new imager is publicly released. 
+
+**Next chapter: [Usage](Usage)**
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">André Offringa</dc:creator><pubDate>Sat, 21 Jan 2017 10:02:34 -0000</pubDate><guid>https://sourceforge.net9b9c3aab91f5d416fcdd06661a6a8edb301a765e</guid></item><item><title>Introduction modified by André Offringa</title><link>https://sourceforge.net/p/wsclean/wiki/Introduction/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v7
+++ v8
@@ -4,6 +4,8 @@
 WSClean stands for "w-stacking clean". W-stacking is an alternative to the w-projection algorithm, in which the uv-samples are not convolved with a w-term correcting kernel before the FFT, but are instead corrected with a multiplication after the FFT. Multiplying each pixel is generally much faster than convolving an image, but the downside is that samples can not be added together on one grid until the w-term has been corrected. This means that in w-stacking, each w-layer needs to be stored and FFT-ed individually. The result is that w-stacking requires more memory and spends relative more time doing the FFTs, instead of gridding+convolving.

 It turns out that for many telescopes, the WSClean approach is a very good trade-off, and WSClean is typically an order of magnitude faster than Casa's w-projection on MWA data. It can also handle full-sky 10k x 10k images, on which Casa runs out of memory. WSClean with the same number of layers is at least as accurate as w-projection. In tests it seems even to be slightly more accurate, probably because there is no need to trim down a convolution kernel. 
+
+[The "usage" page](Usage) gives an overview of how to call WSClean from the commandline.

 WSClean Article
 ---------------
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">André Offringa</dc:creator><pubDate>Sun, 23 Aug 2015 09:40:00 -0000</pubDate><guid>https://sourceforge.net65b19ad8c4a9926f3297edf241f1721e9879fd7a</guid></item><item><title>Introduction modified by André Offringa</title><link>https://sourceforge.net/p/wsclean/wiki/Introduction/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v6
+++ v7
@@ -11,7 +11,7 @@
 The WSClean implementations has been described and tested in the following paper:

 "[WSClean: an implementation of a fast, generic wide-field imager for radio astronomy](http://arxiv.org/abs/1407.1943)"
-(Offringa et al., 2014 - accepted for MNRAS, in press.)
+(Offringa et al., 2014, Oct, MNRAS 444 (1): 606-619)

 Abstract:

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">André Offringa</dc:creator><pubDate>Thu, 18 Dec 2014 15:08:15 -0000</pubDate><guid>https://sourceforge.net883bc157e4dc5401b6e66c11610553989a1bf480</guid></item><item><title>Introduction modified by André Offringa</title><link>https://sourceforge.net/p/wsclean/wiki/Introduction/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v5
+++ v6
@@ -3,7 +3,7 @@

 WSClean stands for "w-stacking clean". W-stacking is an alternative to the w-projection algorithm, in which the uv-samples are not convolved with a w-term correcting kernel before the FFT, but are instead corrected with a multiplication after the FFT. Multiplying each pixel is generally much faster than convolving an image, but the downside is that samples can not be added together on one grid until the w-term has been corrected. This means that in w-stacking, each w-layer needs to be stored and FFT-ed individually. The result is that w-stacking requires more memory and spends relative more time doing the FFTs, instead of gridding+convolving.

-It turns out that the WSClean approach is for many telescopes, including the MWA for which it was developed, a very good trade-off, and WSClean is typically an order of magnitude faster than Casa's w-projection on MWA data. It can also handle full-sky 10k x 10k images, on which Casa runs out of memory. WSClean with the same number of layers is at least as accurate as w-projection. In tests it seems even to be slightly more accurate, probably because there is no need to trim down a convolution kernel. 
+It turns out that for many telescopes, the WSClean approach is a very good trade-off, and WSClean is typically an order of magnitude faster than Casa's w-projection on MWA data. It can also handle full-sky 10k x 10k images, on which Casa runs out of memory. WSClean with the same number of layers is at least as accurate as w-projection. In tests it seems even to be slightly more accurate, probably because there is no need to trim down a convolution kernel. 

 WSClean Article
 ---------------
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">André Offringa</dc:creator><pubDate>Thu, 10 Jul 2014 11:22:42 -0000</pubDate><guid>https://sourceforge.net7f3d7b63911460d0863e82d5437dfac66a860f66</guid></item><item><title>Introduction modified by André Offringa</title><link>https://sourceforge.net/p/wsclean/wiki/Introduction/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v4
+++ v5
@@ -15,4 +15,4 @@

 Abstract:

-Astronomical widefield imaging of interferometric radio data is computationally expensive, especially for the large data volumes created by modern non-coplanar many-element arrays. We present a new widefield interferometric imager that uses the *w*-stacking algorithm and can make use of the *w*-snapshot algorithm. The performance dependencies of CASA's w-projection and our new imager are analysed and analytical functions are derived that describe the required computing cost for both imagers. On data from the Murchison Widefield Array, we find our new method to be an order of magnitude faster than w-projection, as well as being capable of full-sky imaging at full resolution and with correct polarisation correction. We predict the computing costs for several other arrays and estimate that our imager is a factor of 2-12 faster, depending on the array configuration. We estimate the computing cost for imaging the low-frequency Square-Kilometre Array observations to be 60 PetaFLOPS with current techniques. We find that combining *w*-stacking with the *w*-snapshot algorithm does not significantly improve computing requirements over pure w-stacking. The source code of our new imager is publicly released. 
+Astronomical widefield imaging of interferometric radio data is computationally expensive, especially for the large data volumes created by modern non-coplanar many-element arrays. We present a new widefield interferometric imager that uses the *w*-stacking algorithm and can make use of the *w*-snapshot algorithm. The performance dependencies of CASA's *w*-projection and our new imager are analysed and analytical functions are derived that describe the required computing cost for both imagers. On data from the Murchison Widefield Array, we find our new method to be an order of magnitude faster than *w*-projection, as well as being capable of full-sky imaging at full resolution and with correct polarisation correction. We predict the computing costs for several other arrays and estimate that our imager is a factor of 2-12 faster, depending on the array configuration. We estimate the computing cost for imaging the low-frequency Square-Kilometre Array observations to be 60 PetaFLOPS with current techniques. We find that combining *w*-stacking with the *w*-snapshot algorithm does not significantly improve computing requirements over pure *w*-stacking. The source code of our new imager is publicly released. 
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">André Offringa</dc:creator><pubDate>Thu, 10 Jul 2014 11:20:45 -0000</pubDate><guid>https://sourceforge.net329616024dfbe4d5b59b7f6913a3ffb27f014416</guid></item><item><title>Introduction modified by André Offringa</title><link>https://sourceforge.net/p/wsclean/wiki/Introduction/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v3
+++ v4
@@ -10,7 +10,8 @@

 The WSClean implementations has been described and tested in the following paper:

-"[WSClean: an implementation of a fast, generic wide-field imager for radio astronomy](http://arxiv.org/abs/1407.1943)" (Offringa et al., 2014 -- accepted for MNRAS, currently in press.)
+"[WSClean: an implementation of a fast, generic wide-field imager for radio astronomy](http://arxiv.org/abs/1407.1943)"
+(Offringa et al., 2014 - accepted for MNRAS, in press.)

 Abstract:

&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">André Offringa</dc:creator><pubDate>Thu, 10 Jul 2014 11:19:24 -0000</pubDate><guid>https://sourceforge.netd1bb7ab1ab357d8c66539282dbca64db4b3dbc1d</guid></item><item><title>Introduction modified by André Offringa</title><link>https://sourceforge.net/p/wsclean/wiki/Introduction/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v2
+++ v3
@@ -1,5 +1,17 @@
-WSClean stands for "w-stacking clean". W-stacking is an alternative to the w-projection algorithm, in which the uv-samples are not convolved with a w-term correcting kernel before the FFT, but are instead corrected with a multiplication after the FFT. Multiplying each pixel is generally much faster than convolving an image, but the downside is that samples can not be added together on one grid until the w-term has been corrected. This means that in w-stacking, each w-layer needs to be stored and FFT-ed individually. The result is that w-stacking requires more memory and spends relative more time doing the FFTs, instead of gridding+convolving. It turns out that for the MWA this is a very good trade-off though, and WSClean is typically at least an order of magnitude faster than Casa's w-projection. It can also handle full-sky 10k x 10k images, on which Casa seems to crash. WSClean with the same number of layers is at least as accurate as w-projection, because there is no need to trim down a convolution kernel. 
+Introduction
+------------
+
+WSClean stands for "w-stacking clean". W-stacking is an alternative to the w-projection algorithm, in which the uv-samples are not convolved with a w-term correcting kernel before the FFT, but are instead corrected with a multiplication after the FFT. Multiplying each pixel is generally much faster than convolving an image, but the downside is that samples can not be added together on one grid until the w-term has been corrected. This means that in w-stacking, each w-layer needs to be stored and FFT-ed individually. The result is that w-stacking requires more memory and spends relative more time doing the FFTs, instead of gridding+convolving.
+
+It turns out that the WSClean approach is for many telescopes, including the MWA for which it was developed, a very good trade-off, and WSClean is typically an order of magnitude faster than Casa's w-projection on MWA data. It can also handle full-sky 10k x 10k images, on which Casa runs out of memory. WSClean with the same number of layers is at least as accurate as w-projection. In tests it seems even to be slightly more accurate, probably because there is no need to trim down a convolution kernel. 
+
+WSClean Article
+---------------

 The WSClean implementations has been described and tested in the following paper:

 "[WSClean: an implementation of a fast, generic wide-field imager for radio astronomy](http://arxiv.org/abs/1407.1943)" (Offringa et al., 2014 -- accepted for MNRAS, currently in press.)
+
+Abstract:
+
+Astronomical widefield imaging of interferometric radio data is computationally expensive, especially for the large data volumes created by modern non-coplanar many-element arrays. We present a new widefield interferometric imager that uses the *w*-stacking algorithm and can make use of the *w*-snapshot algorithm. The performance dependencies of CASA's w-projection and our new imager are analysed and analytical functions are derived that describe the required computing cost for both imagers. On data from the Murchison Widefield Array, we find our new method to be an order of magnitude faster than w-projection, as well as being capable of full-sky imaging at full resolution and with correct polarisation correction. We predict the computing costs for several other arrays and estimate that our imager is a factor of 2-12 faster, depending on the array configuration. We estimate the computing cost for imaging the low-frequency Square-Kilometre Array observations to be 60 PetaFLOPS with current techniques. We find that combining *w*-stacking with the *w*-snapshot algorithm does not significantly improve computing requirements over pure w-stacking. The source code of our new imager is publicly released. 
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">André Offringa</dc:creator><pubDate>Thu, 10 Jul 2014 11:18:53 -0000</pubDate><guid>https://sourceforge.net13f5c06642e45bca1db44a9980fcf345b66e5fd7</guid></item><item><title>Introduction modified by André Offringa</title><link>https://sourceforge.net/p/wsclean/wiki/Introduction/</link><description>&lt;div class="markdown_content"&gt;&lt;pre&gt;--- v1
+++ v2
@@ -1 +1,5 @@
 WSClean stands for "w-stacking clean". W-stacking is an alternative to the w-projection algorithm, in which the uv-samples are not convolved with a w-term correcting kernel before the FFT, but are instead corrected with a multiplication after the FFT. Multiplying each pixel is generally much faster than convolving an image, but the downside is that samples can not be added together on one grid until the w-term has been corrected. This means that in w-stacking, each w-layer needs to be stored and FFT-ed individually. The result is that w-stacking requires more memory and spends relative more time doing the FFTs, instead of gridding+convolving. It turns out that for the MWA this is a very good trade-off though, and WSClean is typically at least an order of magnitude faster than Casa's w-projection. It can also handle full-sky 10k x 10k images, on which Casa seems to crash. WSClean with the same number of layers is at least as accurate as w-projection, because there is no need to trim down a convolution kernel. 
+
+The WSClean implementations has been described and tested in the following paper:
+
+"[WSClean: an implementation of a fast, generic wide-field imager for radio astronomy](http://arxiv.org/abs/1407.1943)" (Offringa et al., 2014 -- accepted for MNRAS, currently in press.)
&lt;/pre&gt;
&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">André Offringa</dc:creator><pubDate>Thu, 10 Jul 2014 11:11:36 -0000</pubDate><guid>https://sourceforge.net14a25ad3f823f931b9828f23f562aaf5633aafd6</guid></item><item><title>Introduction modified by André Offringa</title><link>https://sourceforge.net/p/wsclean/wiki/Introduction/</link><description>&lt;div class="markdown_content"&gt;&lt;p&gt;WSClean stands for "w-stacking clean". W-stacking is an alternative to the w-projection algorithm, in which the uv-samples are not convolved with a w-term correcting kernel before the FFT, but are instead corrected with a multiplication after the FFT. Multiplying each pixel is generally much faster than convolving an image, but the downside is that samples can not be added together on one grid until the w-term has been corrected. This means that in w-stacking, each w-layer needs to be stored and FFT-ed individually. The result is that w-stacking requires more memory and spends relative more time doing the FFTs, instead of gridding+convolving. It turns out that for the MWA this is a very good trade-off though, and WSClean is typically at least an order of magnitude faster than Casa's w-projection. It can also handle full-sky 10k x 10k images, on which Casa seems to crash. WSClean with the same number of layers is at least as accurate as w-projection, because there is no need to trim down a convolution kernel. &lt;/p&gt;&lt;/div&gt;</description><dc:creator xmlns:dc="http://purl.org/dc/elements/1.1/">André Offringa</dc:creator><pubDate>Wed, 05 Mar 2014 06:45:56 -0000</pubDate><guid>https://sourceforge.neta0c2c34e2ed4d490518fe2673ea94b9704091891</guid></item></channel></rss>