检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:Wei Guo Jannatul Ferdous Ema Jing-Mei Qiu
机构地区:[1]Department of Mathematics and Statistics,Texas Tech University,Lubbock,TX,70409,USA [2]Department of Mathematical Sciences,University of Delaware,Newark,DE,19716,USA
出 处:《Communications on Applied Mathematics and Computation》2024年第1期550-575,共26页应用数学与计算数学学报(英文)
基 金:supported by the NSF(Grant Nos.the NSF-DMS-1818924 and 2111253);the Air Force Office of Scientific Research FA9550-22-1-0390 and Department of Energy DE-SC0023164;supported by the NSF(Grant Nos.NSF-DMS-1830838 and NSF-DMS-2111383);the Air Force Office of Scientific Research FA9550-22-1-0390.
摘 要:In this paper,we propose a novel Local Macroscopic Conservative(LoMaC)low rank tensor method with discontinuous Galerkin(DG)discretization for the physical and phase spaces for simulating the Vlasov-Poisson(VP)system.The LoMaC property refers to the exact local conservation of macroscopic mass,momentum,and energy at the discrete level.The recently developed LoMaC low rank tensor algorithm(arXiv:2207.00518)simultaneously evolves the macroscopic conservation laws of mass,momentum,and energy using the kinetic flux vector splitting;then the LoMaC property is realized by projecting the low rank kinetic solution onto a subspace that shares the same macroscopic observables.This paper is a generalization of our previous work,but with DG discretization to take advantage of its compactness and flexibility in handling boundary conditions and its superior accuracy in the long term.The algorithm is developed in a similar fashion as that for a finite difference scheme,by observing that the DG method can be viewed equivalently in a nodal fashion.With the nodal DG method,assuming a tensorized computational grid,one will be able to(i)derive differentiation matrices for different nodal points based on a DG upwind discretization of transport terms,and(ii)define a weighted inner product space based on the nodal DG grid points.The algorithm can be extended to the high dimensional problems by hierarchical Tucker(HT)decomposition of solution tensors and a corresponding conservative projection algorithm.In a similar spirit,the algorithm can be extended to DG methods on nodal points of an unstructured mesh,or to other types of discretization,e.g.,the spectral method in velocity direction.Extensive numerical results are performed to showcase the efficacy of the method.
关 键 词:Hierarchical Tucker(HT)decomposition Conservative SVD Energy conservation Discontinuous Galerkin(DG)method
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.249