Experiments with A Nested Dissection Code

来源 :第八届工业与应用数学国际大会 | 被引量 : 0次 | 上传用户:himayu
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  We study the constituent parts of dissection orderings including algorithms based on the Ford-Fulkerson algorithm for network flows.
其他文献
  In recent years,there is increasing interest in the development and application of advanced computational techniques for interface problems,problem with fre
会议
  We model a surfactant-mediated tipstreaming in a microfluidic flow focusing device.That microfluidic method for production of submicrometer and potentially
会议
  A new variational difference method for elastic and plastic deformation is developed.Our objective is to develop a very efficient and effective method for d
会议
  We study the problem of hedging a claim of Bermudan style with a given probability p within a Markovian complete financial market.
会议
  This study extended the principal component analysis(PCA)to multiple time series data through a symbolic data analysis approach.
会议
  In this presentation,we will advocate the exploration of synergies between the machine learning and uncertainty quantification research communities towards
会议
  Efficient solution strategy for stochastic partial differential equations(SPDE)has been a classical topic,as many physical phenomena are inherently random.
会议
  In this talk,we discuss the stochastic collocation methods via l1 minimization,by randomly sampling from the corresponding tensor grid of Gaussian points.
会议
  We consider the problem faced by an economic agent trying to find the optimal strategies for the joint management of her consumption from a basket of K good
会议
  The minimum local fill(MLF)heuristic computes a fill-reducing permutation for sparse Cholesky factorization.It is generally believed that MLF is very expens
会议