<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>chaos_kiyono</author_name>
  <author_url>https://blog.hatena.ne.jp/chaos_kiyono/</author_url>
  <blog_title>Ken-Chaos’s Random Notes on R</blog_title>
  <blog_url>https://chaos-r.hatenadiary.jp/</blog_url>
  <categories>
    <anon>C Program</anon>
    <anon>R</anon>
    <anon>fractal</anon>
    <anon>long-range correlation</anon>
    <anon>time series analysis</anon>
    <anon>stochastic process</anon>
  </categories>
  <description>In this post, we’re going to put our fast DMA (Detrending Moving Average Analysis) algorithm to the test in C to see just how quick it really is. If you code DMA the &quot;obvious&quot; way—by directly calculating the Savitzky–Golay filter convolution—the computation becomes painfully slow for long time serie…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fchaos-r.hatenadiary.jp%2Fentry%2F2026%2F01%2F19%2F000856&quot; title=&quot;Fast DMA in C: Beating the Performance Bottleneck of Convolution-Based DMA for Long Data Sets - Ken-Chaos’s Random Notes on R&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url>https://cdn-ak.f.st-hatena.com/images/fotolife/c/chaos_kiyono/20260118/20260118174323.png</image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2026-01-19 00:08:56</published>
  <title>Fast DMA in C: Beating the Performance Bottleneck of Convolution-Based DMA for Long Data Sets</title>
  <type>rich</type>
  <url>https://chaos-r.hatenadiary.jp/entry/2026/01/19/000856</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
