<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>TS |</title><link>https://svend-walter.eu/categories/ts/</link><atom:link href="https://svend-walter.eu/categories/ts/index.xml" rel="self" type="application/rss+xml"/><description>TS</description><generator>HugoBlox Kit (https://hugoblox.com)</generator><language>fr-fr</language><lastBuildDate>Tue, 22 Dec 2009 20:18:16 +0000</lastBuildDate><image><url>https://svend-walter.eu/media/icon.svg</url><title>TS</title><link>https://svend-walter.eu/categories/ts/</link></image><item><title>Test du langage LateX en html5</title><link>https://svend-walter.eu/blog/te-tlatexhtml5/</link><pubDate>Tue, 22 Dec 2009 20:18:16 +0000</pubDate><guid>https://svend-walter.eu/blog/te-tlatexhtml5/</guid><description>&lt;h2&gt;Un exemple de ce qu'il est possible de faire avec lateX en html5 :&lt;/h2&gt;
[latexpage]
At first, we sample $f(x)$ in the $N$ ($N$ is odd) equidistant points around $x^*$:
\[
f_k = f(x_k),\: x_k = x^*+kh,\: k=-\frac{N-1}{2},\dots,\frac{N-1}{2}
\]
where $h$ is some step.
Then we interpolate points $\{(x_k,f_k)\}$ by polynomial
\begin{equation} \label{eq:poly}
P_{N-1}(x)=\sum_{j=0}^{N-1}{a_jx^j}
\end{equation}
Its coefficients $\{a_j\}$ are found as a solution of system of linear equations:
\begin{equation} \label{eq:sys}
\left\{ P_{N-1}(x_k) = f_k\right\},\quad k=-\frac{N-1}{2},\dots,\frac{N-1}{2}
\end{equation}
Here are references to existing equations: (\ref{eq:poly}), (\ref{eq:sys}).
Here is reference to non-existing equation (\ref{eq:unknown}).
\[
\quicklatex{color="#00ff00" size=25}
\boxed{f(x)=\int_1^{\infty}\frac{1}{x^2}\,\mathrm{d}x=1}
\]&lt;p&gt;\begin{tikzpicture}
[+preamble]
\usepackage{pgfplots}
\pgfplotsset{compat=newest}
[/preamble]
\begin{axis}
\addplot3[surf,domain=0:360,samples=40] {cos(x)*cos(y)};
\end{axis}
\end{tikzpicture}&lt;/p&gt;</description></item></channel></rss>