Analysis and algorithm for coupling of kinetic and fluid equations

来源 :第八届工业与应用数学国际大会 | 被引量 : 0次 | 上传用户：chenken2725115

【摘要】

：

　　Kinetic equations are widely used to model complex systems occurring in gas dynamics and transport phenomenon,as examples.In these applications,it is common

【作者】

：

LuJianfeng[1]SunWeiran[2]

【机构】

：

Duke Univ.

【出处】

：

第八届工业与应用数学国际大会

【发表日期】

：

2015年期

下载到本地 , 更方便阅读

下载此文赞助VIP

声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架

论文部分内容阅读

　　Kinetic equations are widely used to model complex systems occurring in gas dynamics and transport phenomenon,as examples.In these applications,it is common that dense and dilute parts coexist in the system.This leads to multiple spatio-temporal scales which introduce difficulties in both analysis and numerics.Kinetic-fluid coupling hence has received intensive studies in recent years.This minisymposium aims to bring together experts in analysis and algorithm in kinetic equations to discuss the current status and future developments of the field.It also provides a platform for further interaction and collaboration for researchers in this and related areas.

其他文献

Nonlinear Acoustic Wave Propagation in A Rarefied Gas:Numerical Analysis Based on Kinetic and Fluid

　　Nonlinear acoustic waves caused by an infinitely wide plate oscillating in its normal direction and propagating into a semi-infinite expanse of a rarefied g

会议

A Hierarchy of Hybrid Numerical Methods for the Boltzmann Equation

　　In this work in collaboration with F.Filbet,we construct a hierarchy of hybrid numerical methods for the Boltzmann equation,based on moment realizability.We

会议

Decomposition of Sparse Graphs into Foreststhe Nine Dragon Tree Conjecture for k ≤ 2

　　The fractional arboricity Arb(G)is the maximum of |E(H)|/|V(H)|-1 over all subgraphs H with at least two vertices.Generalizing the Nash-Williams Arboricity

会议

Counting Cliques in Graphs with Forbidden Subdivision

　　We prove that for all positive integers t,every n-vertex graph with no Kt-subdivision has at most 294tn cliques.We also prove that asymptotically,such graph

会议

Maximizing Proper Colorings on Graphs

　　Linial and Wilf asked for the graphs with fixed numbers of vertices and edges which maximize the number of proper q-colorings.We characterize the asymptotic

会议

Recent advances in matrix computations for extreme-scale computers

　　Numerical linear algebra is at the heart of scientific and industrial discoveries.The forthcoming arrival of the exascale era provides tremendous opportunit

会议

Combining Direct and Iterative Methods to Solve Very Large Sparse Equations on Massively Parallel Ar

　　We have developed a hybrid solver for large sparse systems.The basis for our approach is block Cimmino where the rectangular blocks are solved by a direct m

会议

Biclique Decomposition of Random Graphs

　　The biclique partition number bp(G)is the minimum number of complete bipartite graphs needed to partition the edges of a graph G.Erd(o)s conjectured that fo

会议

Asynchronous Optimized Schwarz Methods

　　Optimized Schwarz Methods are domain decomposition methods,where one imposes Robin conditions on the artificial interfaces.The Robin parameter can be optimi

会议

Solving Linear Equations with HSS Structure:Theory and Practice

　　Low-rank block structures arise in matrices from integral equations,boundary element methods,and discretized PDEs.We will show that,both in theory and in pr

会议

Analysis and algorithm for coupling of kinetic and fluid equations

其他学术论文