Участник:Nebaruzdin/Math test: различия между версиями
Перейти к навигации
Перейти к поиску
м (Тест MathJax.) |
м (Тест MathJax.) |
||
| Строка 1: | Строка 1: | ||
| − | + | == Inline math == | |
| + | |||
| + | The matrix <math>A</math> is stored row-wise in a one-dimensional array of length <math>\frac{n (n + 1)}{2}</math>. | ||
| + | |||
| + | == Display math == | ||
| + | |||
:<math>\sum_{p = 1}^{i - 1} l_{ip} l_{jp}</math> | :<math>\sum_{p = 1}^{i - 1} l_{ip} l_{jp}</math> | ||
| + | == LaTeX environments == | ||
| + | |||
| + | <math> | ||
\begin{equation} | \begin{equation} | ||
\label{eq:fourier} | \label{eq:fourier} | ||
| Строка 8: | Строка 16: | ||
\frac{1}{N_z} \sum_{n=0}^{N_z-1} \Phi_{l,m,n}e^{2\pi \overline{i} \left(\frac{kn}{N_z}\right)}\right]\right]. | \frac{1}{N_z} \sum_{n=0}^{N_z-1} \Phi_{l,m,n}e^{2\pi \overline{i} \left(\frac{kn}{N_z}\right)}\right]\right]. | ||
\end{equation} | \end{equation} | ||
| + | </math> | ||
| − | In equation \eqref{eq:fourier}, we find the Fourier transform. | + | In equation <math>\eqref{eq:fourier}</math>, we find the Fourier transform. |
| − | |||
| − | |||
Версия 13:42, 4 июня 2015
1 Inline math
The matrix [math]A[/math] is stored row-wise in a one-dimensional array of length [math]\frac{n (n + 1)}{2}[/math].
2 Display math
- [math]\sum_{p = 1}^{i - 1} l_{ip} l_{jp}[/math]
3 LaTeX environments
[math] \begin{equation} \label{eq:fourier} \phi_{i,j,k}=\frac{1}{N_x} \sum_{l=0}^{N_x-1} \left[ e^{2\pi \overline{i}\left(\frac{il}{N_x}\right)} \frac{1}{N_y} \sum_{m=0}^{N_y-1} \left[ e^{2\pi \overline{i}\left(\frac{jm}{N_y}\right)} \frac{1}{N_z} \sum_{n=0}^{N_z-1} \Phi_{l,m,n}e^{2\pi \overline{i} \left(\frac{kn}{N_z}\right)}\right]\right]. \end{equation} [/math]
In equation [math]\eqref{eq:fourier}[/math], we find the Fourier transform.
