Solving Linear Equations with HSS Structure:Theory and Practice

来源 :第八届工业与应用数学国际大会 | 被引量 : 0次 | 上传用户:songjuan119004
下载到本地 , 更方便阅读
声明 : 本文档内容版权归属内容提供方 , 如果您对本文有版权争议 , 可与客服联系进行内容授权或下架
论文部分内容阅读
  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 practice,the hierarchically semi-separable(HSS)structured factorization is an effective way of exploiting the low-rankness.It provides a powerful tool for solving linear equations,both dense and sparse,with arithmetic and memory complexity asymptotically lower than the standard methods.It can be parallelized well on modern manycore parallel machines.
其他文献
  We investigate the simulation of the acoustic near and far field of a turbulent flow through a thin porous medium.Within the porous medium and the turbulenc
会议
  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
会议
  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
会议
  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
会议
  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
会议
  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
会议
  Numerical linear algebra is at the heart of scientific and industrial discoveries.The forthcoming arrival of the exascale era provides tremendous opportunit
会议
  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
会议
  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
会议
  Optimized Schwarz Methods are domain decomposition methods,where one imposes Robin conditions on the artificial interfaces.The Robin parameter can be optimi
会议