<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>Posts on Yuchen&#39;s Technical Blog</title>
    <link>https://ycgu.github.io/posts/</link>
    <description>Recent content in Posts on Yuchen&#39;s Technical Blog</description>
    <generator>Hugo -- 0.139.3</generator>
    <language>en-us</language>
    <lastBuildDate>Mon, 10 Feb 2025 17:22:13 +0900</lastBuildDate>
    <atom:link href="https://ycgu.github.io/posts/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>Derivative of a matrix inverse</title>
      <link>https://ycgu.github.io/posts/derivative-of-a-matrix-inverse/</link>
      <pubDate>Mon, 10 Feb 2025 17:22:13 +0900</pubDate>
      <guid>https://ycgu.github.io/posts/derivative-of-a-matrix-inverse/</guid>
      <description>&lt;h1 id=&#34;derivative-of-a-matrix-inverse&#34;&gt;Derivative of a matrix inverse&lt;/h1&gt;
&lt;p&gt;The derivative of a matrix inverse $\boldsymbol{A}^{-1}$ with respect to $\boldsymbol{A}$ is a 4th order tensor. Since $\dfrac{\partial}{\partial \boldsymbol{A}} \left( \boldsymbol{A}^{-1} \boldsymbol{A} \right) = 0$, $\dfrac{\partial \boldsymbol{A}^{-1}}{\partial \boldsymbol{A}} = - \boldsymbol{A}^{-2}$, but deriving its counterpart based on Einstein notation is not so obvious. Owing to,&lt;/p&gt;
$$
0 = \frac{\partial \delta_{km}}{\partial A_{ij}} = \frac{\partial A_{kl}^{-1}}{\partial A_{ij}} A_{lm}+A_{kl}^{-1} \frac{\partial A_{lm}}{\partial A_{ij}}
$$&lt;p&gt;and&lt;/p&gt;
$$
\frac{\partial A_{kn}^{-1}}{\partial A_{ij}} = \frac{\partial A_{kl}^{-1}}{\partial A_{ij}} A_{lm} A_{mn}^{-1} = - A_{kl}^{-1} \frac{\partial A_{lm}}{\partial A_{ij}} A_{mn}^{-1},
$$&lt;p&gt;where&lt;/p&gt;</description>
    </item>
    <item>
      <title>Research Note on Linear Functional Analysis</title>
      <link>https://ycgu.github.io/posts/notes-on-linear-functional-analysis/</link>
      <pubDate>Sat, 07 Dec 2024 01:46:39 +0900</pubDate>
      <guid>https://ycgu.github.io/posts/notes-on-linear-functional-analysis/</guid>
      <description>&lt;h1 id=&#34;the-orthogonal-decomposition-theorem&#34;&gt;The Orthogonal Decomposition Theorem&lt;/h1&gt;
&lt;hr&gt;
&lt;p&gt;Let $V$ be a Hilbert space and $M\subset V$ a closed subspace of $V$. Then
(i) $M^\bot$ is a closed subspace of $V$.
(ii) $V$ can be represented as the direct sum of $M$ and its orthogonal complement $M^\bot$&lt;/p&gt;
$$
V=M\oplus M^\bot
$$&lt;p&gt;i.e., every vector $v\in V$ can be uniquely decomposed into two orthogonal vectors $\boldsymbol m$, $\boldsymbol n$, s.t.&lt;/p&gt;
$$
\boldsymbol v=\boldsymbol m+\boldsymbol n, \boldsymbol m\in M,\boldsymbol n\in M^\bot
$$&lt;p&gt;&lt;strong&gt;COROLLARY&lt;/strong&gt;
Let $V$ be a Hilbert space and $M$ a vector subspace of $V$ . The following conditions are equivalent to each other
(i) $M$ is closed.
(ii) $(M^\bot)^\bot = M$.&lt;/p&gt;</description>
    </item>
    <item>
      <title>My First Post</title>
      <link>https://ycgu.github.io/posts/my-first-post/</link>
      <pubDate>Fri, 06 Dec 2024 21:38:28 +0900</pubDate>
      <guid>https://ycgu.github.io/posts/my-first-post/</guid>
      <description>&lt;h2 id=&#34;introduction&#34;&gt;Introduction&lt;/h2&gt;
&lt;p&gt;This is &lt;strong&gt;bold&lt;/strong&gt; text, and this is &lt;em&gt;emphasized&lt;/em&gt; text.&lt;/p&gt;
&lt;p&gt;Visit the &lt;a href=&#34;https://gohugo.io&#34;&gt;Hugo&lt;/a&gt; website!&lt;/p&gt;</description>
    </item>
  </channel>
</rss>
