<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Characteristic-Polynomial on gdpark.blog</title><link>https://gdpark.blog/tags/characteristic-polynomial/</link><description>Recent content in Characteristic-Polynomial on gdpark.blog</description><generator>Hugo</generator><language>en</language><lastBuildDate>Tue, 02 Feb 2016 00:00:00 +0000</lastBuildDate><atom:link href="https://gdpark.blog/tags/characteristic-polynomial/index.xml" rel="self" type="application/rss+xml"/><item><title>Characteristic Polynomials and the Cayley–Hamilton Theorem [Linear Algebra I Studied #18]</title><link>https://gdpark.blog/posts/linear-algebra-18-characteristic-polynomials-and-the-cayley-hamilton-theorem/</link><pubDate>Fri, 29 Jan 2016 00:00:00 +0000</pubDate><guid>https://gdpark.blog/posts/linear-algebra-18-characteristic-polynomials-and-the-cayley-hamilton-theorem/</guid><description>We chase down which matrices can actually be diagonalized — starting with characteristic polynomials, hitting complex eigenvalues, and landing on the Cayley–Hamilton theorem.</description></item><item><title>The First Decomposition Theorem [Linear Algebra I Studied #20]</title><link>https://gdpark.blog/posts/linear-algebra-20-the-first-decomposition-theorem/</link><pubDate>Sun, 31 Jan 2016 00:00:00 +0000</pubDate><guid>https://gdpark.blog/posts/linear-algebra-20-the-first-decomposition-theorem/</guid><description>We revisit diagonalization up close — eigenvalues, kernels, and how a 2D space splits into two 1D invariant subspaces — as a warm-up for the full Decomposition Theorem.</description></item><item><title>Minimal Polynomials, Companion Matrices, and More [Linear Algebra I Studied #21]</title><link>https://gdpark.blog/posts/linear-algebra-21-minimal-polynomials-companion-matrices-and-more/</link><pubDate>Mon, 01 Feb 2016 00:00:00 +0000</pubDate><guid>https://gdpark.blog/posts/linear-algebra-21-minimal-polynomials-companion-matrices-and-more/</guid><description>Diving into minimal polynomials and their sneaky relationship with characteristic polynomials — turns out it&amp;rsquo;s the same divisor-hunting logic we used back in number theory!!!!</description></item><item><title>Is Further Block Decomposition Always Possible? [Linear Algebra I Studied #22]</title><link>https://gdpark.blog/posts/linear-algebra-22-is-further-block-decomposition-always-possible/</link><pubDate>Tue, 02 Feb 2016 00:00:00 +0000</pubDate><guid>https://gdpark.blog/posts/linear-algebra-22-is-further-block-decomposition-always-possible/</guid><description>Poking at a special case where the minimal and characteristic polynomials match as a power of an irreducible polynomial, and what that tells us about block decomposition.</description></item></channel></rss>