.png){kind=icon}
返回
Ruminated Tensor Decomposition algorithm for solving inviscid Burgers' equation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jcp.2024.113663.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we propose a Ruminated Tensor Decomposition (RTD) algorithm for solving inviscid Burgers' equation. A discrete loss function is designed from the residual of Godunov's method. While Proper Generalization Decomposition (PGD) suffers from slow convergence in terms of mode number, and Tensor Decomposition (TD) suffers from sensitivity to random initial guesses of minimization iterations, RTD turns out to reproduce Godunov's method with a moderate number of modes. The pretraining of initial guesses for every three additional modes by PGD makes RTD a robust algorithm. Numerical examples justify the effectiveness of RTD. It is readily extended to general nonlinear conservation laws, as illustrated by two examples: the Euler equations for gas dynamics, and an isothermal flow in two space dimensions.
Keyword:
Ruminated Tensor Decomposition
Godunov's method
Loss function
Sensitivity to initial guesses
Inviscid Burgers' equation
期刊
IF:
3.8
论文数:
1.6W
被引数:
7.4W
机构
引用论文
.png){kind=icon}
Interlayer tunneling spectroscopy of graphite at high magnetic field oriented parallel to the layers
OAAI
OAAI分享收藏A hybrid cosmological hydrodynamic/N-body code based on a weighted essentially nonoscillatory scheme
OAAI
OAAI分享收藏
查看更多内容