Summary of Latex

Latex Mathematical Symbols

其他

---

• 换行符 ： \\
• 空格符 ：\quad 一个中文字符的宽度
• 空格符 ：\qquad 两个中文字符的宽度
• 空格符 ：\ 1/3个中文字符的宽度
• 中等空格 ：\; 2/7个字符宽度
• 小空格 ： \, 1/6个字符宽度

模板

---

• 伪代码模板(无序号)

  \documentclass{article}
  
  \usepackage{algorithm}  
  \usepackage{algpseudocode}  
  \usepackage{amsmath}  
  \renewcommand{\algorithmicrequire}{\textbf{Input:}}  % Use Input in the format of Algorithm  
  \renewcommand{\algorithmicensure}{\textbf{Output:}} % Use Output in the format of Algorithm  
  
  \begin{document}
  	\begin{algorithm}[htb]  
  		\caption{Title}  
  		\label{alg:Framwork}  
  		\begin{algorithmic}  
  			\Require  
  			xxxxxxxx 
  			\Ensure  
  			xxxxxxxxx
  			\For{xyz}
  			\If {yyyyyyy}  
  			\State asdfghjkl;
  			\Else
  			\State qwertyuiop;
  			\If{zzzzzzz}
  			\State zxcvbnm;
  			\EndIf
  			\EndIf
  			\EndFor  
  			\For {abc }  
  			\State qazwsxedc; 
  			\EndFor
  		\end{algorithmic}  
  	\end{algorithm}
  \end{document}
  

• 感谢许老师友情赞助的论文模板🥰🥰🥰

  \documentclass[UTF8]{ctexart}%中文排版
  \usepackage{xeCJK}
  \usepackage{bm}%公式中加粗
  \usepackage{geometry}%设置页边距
  \geometry{left=2cm,right=2cm,top=3cm,bottom=3cm}
  \usepackage{setspace}
  \usepackage{array}
  \usepackage{amsmath}
  \usepackage{booktabs}
  \usepackage{color}
  \usepackage{amssymb}\usepackage{algorithmic} 
  \usepackage{algorithm,float}
  \makeatletter\makeatletter
  \newenvironment{breakablealgorithm}
  {% \begin{breakablealgorithm}
  		\begin{center}
  			\refstepcounter{algorithm}% New algorithm
  			\hrule height.8pt depth0pt \kern2pt% \@fs@pre for \@fs@ruled 画线
  			\renewcommand{\caption}[2][\relax]{% Make a new \caption
  				{\raggedright\textbf{\ALG@name~\thealgorithm} ##2\par}%
  				\ifx\relax##1\relax % #1 is \relax
  				\addcontentsline{loa}{algorithm}{\protect\numberline{\thealgorithm}##2}%
  				\else % #1 is not \relax
  				\addcontentsline{loa}{algorithm}{\protect\numberline{\thealgorithm}##1}%
  				\fi
  				\kern2pt\hrule\kern2pt
  			}
  		}{% \end{breakablealgorithm}
  		\kern8pt\hrule\relax% \@fs@post for \@fs@ruled 画线
  	\end{center}
  }
  \title{}%需要题目就在括号里打上题目
  \date{}%如果不需要时间，就这样摆着；需要时间的话就把\date{}注释掉。
  \author{}%如果不需要作者，就这样摆着；需要作者的话就把\author{}注释掉。
  \begin{document}
  %	\maketitle %如果需要题目就取消这一行的注释
  
  
  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%这种伪代码可以自动分页，但是比较费劲
  \begin{breakablealgorithm} 
  	\begin{spacing}{1.1}  
  		\caption{Levenberg-Marquardt方法的求解} 
  		\label{alg3} 
  		\begin{algorithmic}[1]
  			\REQUIRE 
  			$k:=0;\,\,\nu:=2;\,\,\bf{x}:=\bf{x}_0;\,\,\bf{A}:=\bf{J(x)^{T}J(x)};\,\,\bf{g}:=\bf{J(x)^{T}f(x)}$
  			\ENSURE \begin{itshape}found\end{itshape}:=$(
  			\left\| \bf{g} \right\|_{\infty }\leqslant \varepsilon_1); \,\,\mu:=\tau \cdot\text{max} \left\lbrace a_{ii}\right\rbrace $
  			\WHILE {($\bf{not}$ \begin{itshape}found\end{itshape}) \textbf{and} $(k<k_{max})$:}
  			\STATE $k:=k+1;\quad$Solve $(\bf{A}+\mu\bf{I})\bf{h}_{lm}=-\bf{g}$	
  			\IF{$\left\| \bf{h}_{lm} \right\| \leqslant \varepsilon _2\left( \left\| \left. \bf{x} \right\| \right. +\varepsilon _2 \right) $}
  			\STATE \begin{itshape}found\end{itshape}$:=$\textbf{true}
  			\ELSE
  			\STATE $\bf{x}_{new}:=\bf{x}+\bf{h}_{lm}$
  			\STATE $
  			\varrho :=\left( F\left( \bf{x} \right) -F\left( \bf{x}_{new} \right) \right) /\left( L\left( \bf{0} \right) -L\left( \bf{h}_{lm} \right) \right) $
  			\IF{$\varrho>0$}
  			\STATE $\bf{x}:=\bf{x}_{new}$
  			\STATE$ \bf{A}:=\bf{J(x)^{T}J(x)};\,\,\bf{g}:=\bf{J(x)^{T}f(x)}$
  			\STATE \begin{itshape}found\end{itshape}:=$	(\left\| \bf{g} \right\|_{\infty }\leqslant \varepsilon_1)$
  			\STATE $\mu:=\mu\cdot \text{max}\,\left\lbrace \frac{1}{3},1-(2\varrho-1)^{3} \right\rbrace;\,\,\nu:=2 $
  			\ELSE
  			\STATE $\mu:=\mu\cdot \nu;\quad\nu:=2\cdot \nu$
  			\ENDIF
  			\ENDIF
  			\ENDWHILE
  	\end{algorithmic}  \end{spacing}
  \end{breakablealgorithm}
  
  
  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%这种不能自动分页，但是没有行号
  \begin{algorithm} 
  	\caption{Calculate $y = x^n$} 
  	\begin{algorithmic}
  		\REQUIRE $n \geq 0 \vee x \neq 0$ 
  		\ENSURE $y = x^n$ 
  		\STATE $y \gets 1$ 
  		\IF{$n < 0$} 
  		\STATE $X \gets 1 / x$ 
  		\STATE $N \gets -n$ 
  		\ELSE 
  		\STATE $X \gets x$ 
  		\STATE $N \gets n$ 
  		\ENDIF 
  		\WHILE{$N \neq 0$} 
  		\IF{$N$ is even} 
  		\STATE $X \gets X \times X$ 
  		\STATE $N \gets N / 2$ 
  		\ELSE[$N$ is odd] \STATE $y \gets y \times X$ 
  		\STATE $N \gets N - 1$ 
  		\ENDIF 
  		\ENDWHILE 
  	\end{algorithmic} 
  \end{algorithm}
  
  
  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%这种不能自动分页，但是有行号
  \begin{algorithm}
  	%\textsl{}\setstretch{1.8}
  	\renewcommand{\algorithmicrequire}{\textbf{Input:}}
  	\renewcommand{\algorithmicensure}{\textbf{Output:}}
  	\caption{STVMD based on STFT}
  	\label{alg1}
  	\begin{algorithmic}[1]
  		\STATE Initialization:$\left\{ {s_{k,t}^1} \right\},\left\{ {\omega _{k,t}^1} \right\},\lambda _t^1,n \leftarrow 0$
  		\STATE  ${s_{r,t}}\left( \omega  \right) = \int_0^{ + \infty } {{s_r}\left( \tau  \right){w_h}\left( {t - \tau } \right)} \exp \left( {j\omega \tau } \right)d\tau $   (via STFT)
  		\REPEAT
  		\STATE $n \leftarrow n + 1$
  		\STATE Update $ s_{k,t}^{n + 1} $ based on Equation~(\ref{eqn_8})
  		\STATE Update $\omega _{k,t}^{n + 1}$ based on Equation~(\ref{eqn_9})
  		\STATE Update $\lambda _t^{n + 1} $ based on Equation~(\ref{eqn_10})
  		\UNTIL $\sum\limits_{k=1}^P  {{{\left\| {s_{k,t}^{n + 1}\left( \omega  \right) - s_{k,t}^n\left( \omega  \right)} \right\|_2^2} \mathord{\left/
  					{\vphantom {{\left\| {s_{k,t}^{n + 1}\left( \omega  \right) - s_{k,t}^n\left( \omega  \right)} \right\|_2^2} {\left\| {s_{k,t}^n\left( \omega  \right)} \right\|_2^2}}} \right.
  					\kern-\nulldelimiterspace} {\left\| {s_{k,t}^n\left( \omega  \right)} \right\|_2^2}}}  < \varepsilon $  
  		\STATE   Update ${s_k}\left( t \right)$ based on Equation~(\ref{eqn_11_12})  (via ISTFT)
  		\ENSURE  decomposed modes $ \left\{ {{s_k}\left( t \right)} \right\}$, $\left\{ {{\omega _k}\left( t \right)} \right\}$
  	\end{algorithmic}  
  \end{algorithm}
  
  \end{document}
  

• 伪代码模板1（不能自动分页但有行号）

  \documentclass[UTF8]{ctexart}%中文排版
  \usepackage{xeCJK}
  \usepackage{bm}%公式中加粗
  \usepackage{geometry}%设置页边距
  \geometry{left=2cm,right=2cm,top=3cm,bottom=3cm}
  \usepackage{setspace}
  \usepackage{array}
  \usepackage{amsmath}
  \usepackage{booktabs}
  \usepackage{color}
  \usepackage{amssymb}\usepackage{algorithmic} 
  \usepackage{algorithm,float}
  \makeatletter\makeatletter
  \newenvironment{breakablealgorithm}
  {% \begin{breakablealgorithm}
  		\begin{center}
  			\refstepcounter{algorithm}% New algorithm
  			\hrule height.8pt depth0pt \kern2pt% \@fs@pre for \@fs@ruled 画线
  			\renewcommand{\caption}[2][\relax]{% Make a new \caption
  				{\raggedright\textbf{\ALG@name~\thealgorithm} ##2\par}%
  				\ifx\relax##1\relax % #1 is \relax
  				\addcontentsline{loa}{algorithm}{\protect\numberline{\thealgorithm}##2}%
  				\else % #1 is not \relax
  				\addcontentsline{loa}{algorithm}{\protect\numberline{\thealgorithm}##1}%
  				\fi
  				\kern2pt\hrule\kern2pt
  			}
  		}
  	{% \end{breakablealgorithm}
  		\kern8pt\hrule\relax% \@fs@post for \@fs@ruled 画线
  	\end{center}
  }
  
  \title{}%需要题目就在括号里打上题目
  \date{}%如果不需要时间，就这样摆着；需要时间的话就把\date{}注释掉。
  \author{}%如果不需要作者，就这样摆着；需要作者的话就把\author{}注释掉。
  
  \begin{document}
  	
  %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%这种不能自动分页，但是有行号
  \begin{algorithm}
  	%\textsl{}\setstretch{1.8}
  	\renewcommand{\algorithmicrequire}{\textbf{Input:}}
  	\renewcommand{\algorithmicensure}{\textbf{Output:}}
  	\caption{STVMD based on STFT}
  	\label{alg1}
  	\begin{algorithmic}[1]
  		\STATE Initialization:$\left\{ {s_{k,t}^1} \right\},\left\{ {\omega _{k,t}^1} \right\},\lambda _t^1,n \leftarrow 0$
  		\STATE  ${s_{r,t}}\left( \omega  \right) = \int_0^{ + \infty } {{s_r}\left( \tau  \right){w_h}\left( {t - \tau } \right)} \exp \left( {j\omega \tau } \right)d\tau $   (via STFT)
  		\REPEAT
  		\STATE $n \leftarrow n + 1$
  		\STATE Update $ s_{k,t}^{n + 1} $ based on Equation
  		\STATE Update $\omega _{k,t}^{n + 1}$ based on Equation
  		\STATE Update $\lambda _t^{n + 1} $ based on Equation
  		\UNTIL $\sum\limits_{k=1}^P  {{{\left\| {s_{k,t}^{n + 1}\left( \omega  \right) - s_{k,t}^n\left( \omega  \right)} \right\|_2^2} \mathord{\left/
  					{\vphantom {{\left\| {s_{k,t}^{n + 1}\left( \omega  \right) - s_{k,t}^n\left( \omega  \right)} \right\|_2^2} {\left\| {s_{k,t}^n\left( \omega  \right)} \right\|_2^2}}} \right.
  					\kern-\nulldelimiterspace} {\left\| {s_{k,t}^n\left( \omega  \right)} \right\|_2^2}}}  < \varepsilon $  
  		\STATE   Update ${s_k}\left( t \right)$ based on Equation  (via ISTFT)
  		\ENSURE  decomposed modes $ \left\{ {{s_k}\left( t \right)} \right\}$, $\left\{ {{\omega _k}\left( t \right)} \right\}$
  	\end{algorithmic}  
  \end{algorithm}
  \end{document}