<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Maths on Jice Lavocat</title><link>https://jice.lavocat.name/categories/maths/</link><description>Recent content in Maths on Jice Lavocat</description><generator>Hugo</generator><language>en-us</language><copyright>All rights reserved - 2016</copyright><lastBuildDate>Mon, 20 Jul 2009 00:00:00 +0000</lastBuildDate><atom:link href="https://jice.lavocat.name/categories/maths/index.xml" rel="self" type="application/rss+xml"/><item><title>Tout sur Hadamard</title><link>https://jice.lavocat.name/blog/2009/tout-sur-hadamard/</link><pubDate>Mon, 20 Jul 2009 00:00:00 +0000</pubDate><guid>https://jice.lavocat.name/blog/2009/tout-sur-hadamard/</guid><description>&lt;p&gt;Qui est donc ce fameux Hadamard dont tout le monde parle en informatique quantique? &lt;a title="Jacques Hadamard" href="http://fr.wikipedia.org/wiki/Jacques_Hadamard" target="_blank"&gt;Jacques Hadamard&lt;/a&gt; est un mathématicien français (1865-1963) à qui l’on doit les célèbres matrices (encore un normalien).&lt;/p&gt;
&lt;p&gt;Je vous conseille la biographie suivante sur Jacques Hadamard : &lt;a title="Jacques Hadamard" href="http://books.google.fr/books?id=NhK6LIApE8UC&amp;printsec=frontcover" target="_blank"&gt;Jacques Hadamard un mathématicien universel&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;Ainsi que ce site regroupant les propriétés des-dites matrices : &lt;a title="Propriétés des matrices de Hadamard" href="http://chaos.if.uj.edu.pl/~karol/hadamard/index.php" target="_blank"&gt;&lt;a href="http://chaos.if.uj.edu.pl/~karol/hadamard/index.php" target="_blank" rel="noopener noreferrer"&gt;http://chaos.if.uj.edu.pl/~karol/hadamard/index.php&lt;svg class="external-link-icon" aria-hidden="true" focusable="false" width="0.8em" height="0.8em" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2.5" stroke-linecap="round" stroke-linejoin="round" style="display:inline-block;vertical-align:baseline;margin-left:0.15em;"&gt;&lt;path d="M14 4h6v6"/&gt;&lt;path d="M20 4 10 14"/&gt;&lt;path d="M18 13v6a1 1 0 0 1-1 1H5a1 1 0 0 1-1-1V7a1 1 0 0 1 1-1h6"/&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/a&gt;&lt;/p&gt;</description></item><item><title>On Matrix decomposition</title><link>https://jice.lavocat.name/blog/2009/on-matrix-decomposition/</link><pubDate>Wed, 08 Jul 2009 00:00:00 +0000</pubDate><guid>https://jice.lavocat.name/blog/2009/on-matrix-decomposition/</guid><description>&lt;p&gt;In order to complete the previous post on &lt;a href="http://localhost/oldblog/2009/07/decomposition-in-unitary-matrices/" target="_blank"&gt;unitary matrix decomposition&lt;/a&gt; (sum) , I give here two interesting links about other known matrix decomposition :&lt;/p&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a title="Matrix decomposition" href="http://en.wikipedia.org/wiki/Matrix_decomposition" target="_blank"&gt;&lt;a href="http://en.wikipedia.org/wiki/Matrix_decomposition" target="_blank" rel="noopener noreferrer"&gt;http://en.wikipedia.org/wiki/Matrix_decomposition&lt;svg class="external-link-icon" aria-hidden="true" focusable="false" width="0.8em" height="0.8em" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2.5" stroke-linecap="round" stroke-linejoin="round" style="display:inline-block;vertical-align:baseline;margin-left:0.15em;"&gt;&lt;path d="M14 4h6v6"/&gt;&lt;path d="M20 4 10 14"/&gt;&lt;path d="M18 13v6a1 1 0 0 1-1 1H5a1 1 0 0 1-1-1V7a1 1 0 0 1 1-1h6"/&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/a&gt;&lt;/li&gt;
&lt;li&gt;&lt;a title="Matrix Decomposition" href="http://www.ece.northwestern.edu/~mya671/files/Matrix_YM_.pdf" target="_blank"&gt;&lt;a href="http://www.ece.northwestern.edu/~mya671/files/Matrix_YM_.pdf" target="_blank" rel="noopener noreferrer"&gt;http://www.ece.northwestern.edu/~mya671/files/Matrix_YM_.pdf&lt;svg class="external-link-icon" aria-hidden="true" focusable="false" width="0.8em" height="0.8em" viewBox="0 0 24 24" fill="none" stroke="currentColor" stroke-width="2.5" stroke-linecap="round" stroke-linejoin="round" style="display:inline-block;vertical-align:baseline;margin-left:0.15em;"&gt;&lt;path d="M14 4h6v6"/&gt;&lt;path d="M20 4 10 14"/&gt;&lt;path d="M18 13v6a1 1 0 0 1-1 1H5a1 1 0 0 1-1-1V7a1 1 0 0 1 1-1h6"/&gt;&lt;/svg&gt;&lt;/a&gt;&lt;/a&gt;&lt;/li&gt;
&lt;/ul&gt;</description></item><item><title>Decomposition in unitary matrices</title><link>https://jice.lavocat.name/blog/2009/decomposition-in-unitary-matrices/</link><pubDate>Tue, 07 Jul 2009 00:00:00 +0000</pubDate><guid>https://jice.lavocat.name/blog/2009/decomposition-in-unitary-matrices/</guid><description>&lt;p&gt;&lt;strong&gt;Conjecture&lt;/strong&gt; : Any complex or real matrix is the sum of two unitary matrices.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;Proof&lt;/strong&gt; (ideas) :&lt;/p&gt;
&lt;p&gt;We know that every complex matrix A could be diagonalized using two unitary matrices U and V : $$ A = UDV^{*} $$ . The matrix D has positive elements : D=diag(d1,…d2) with  $$d_1\geq d_2 \geq …\geq d_n \geq 0$$.&lt;/p&gt;
&lt;p&gt;&lt;strong&gt;A basic result is the following&lt;/strong&gt; : every diagonal matrix could be diagonalized with n unitary matrix. Indeed,  you just have to choose the good coefficient and use the set of matrix {$$ E_i $$} where $$E_i$$ is a diagonal with -1 everywhere, except at position i  where there is a +1:&lt;/p&gt;</description></item></channel></rss>