Towards A Recursive Graph Bipartitioning Algorithm for Well Balanced Domain Decomposition

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

【摘要】

：

　　In the context of hybrid sparse linear solvers based on domain decomposition and Schur complement approaches,getting a domain decomposition tool leading to

【作者】

：

CasadeiAstrid[1]PierreRAMET[2]RomanJean[1]

【机构】

：

Inria

【出处】

：

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

【发表日期】

：

2015年期

下载到本地 , 更方便阅读

下载此文赞助VIP

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

论文部分内容阅读

　　In the context of hybrid sparse linear solvers based on domain decomposition and Schur complement approaches,getting a domain decomposition tool leading to a good balancing of both the internal node set size and the interface node set size is a critical point for parallel computation.

其他文献

Principal Component Analysis for Multiple Time Series Data:A Symbolic Data Analysis Approach

　　This study extended the principal component analysis(PCA)to multiple time series data through a symbolic data analysis approach.

会议

Graph Theoretic Models for the Solution of Stochastic Multiscale Problems

　　In this presentation,we will advocate the exploration of synergies between the machine learning and uncertainty quantification research communities towards

会议

Numerical Methods for Stochastic PDE and Uncertainty Quantification

　　Efficient solution strategy for stochastic partial differential equations(SPDE)has been a classical topic,as many physical phenomena are inherently random.

会议

Stochastic Collocation Methods via L1 Minimization Using Randomized Quadratures

　　In this talk,we discuss the stochastic collocation methods via l1 minimization,by randomly sampling from the corresponding tensor grid of Gaussian points.

会议

A Consumption-Investment Problem with A Diminishing Basket of Goods

　　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

会议

Recent Progress on the Minimum Local Fill Ordering Heuristic

　　The minimum local fill(MLF)heuristic computes a fill-reducing permutation for sparse Cholesky factorization.It is generally believed that MLF is very expens

会议

Experiments with A Nested Dissection Code

　　We study the constituent parts of dissection orderings including algorithms based on the Ford-Fulkerson algorithm for network flows.

会议

Hypergraph Models to Reorder Sparse Matrices into Special Forms for Efficient Matrix Computations

　　Efficient processing of many scientific applications that involve repeated sparse matrix computations requires reordering rows/columns of these matrices int

会议

Combinatorial Issues in Sparse Matrix Computation

　　Sparse matrix computation is rich in combinatorial problems.Reordering for sparsity preservation in matrix factorization is one such problem.Partitioning fo

会议

Recent Developments in the Numerical Analysis of DAEs and Constrained PDEs

　　A common and convenient way to model multi-component phenomena is to model the components seperately and to glue them together via coupling the variables at

会议

Towards A Recursive Graph Bipartitioning Algorithm for Well Balanced Domain Decomposition

其他学术论文