.png){kind=icon}
返回
An algebraic multilevel multigraph algorithm
.png){kind=icon}
PRE
AI
DOI：10.1137/S1064827500381045.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We describe an algebraic multilevel multigraph algorithm. Many of the multilevel components are generalizations of algorithms originally applied to general sparse Gaussian elimination. Indeed, general sparse Gaussian elimination with minimum degree ordering is a limiting case of our algorithm. Our goal is to develop a procedure which has the robustness and simplicity of use of sparse direct methods, yet offers the opportunity to obtain the optimal or near-optimal complexity typical of classical multigrid methods.
Keyword:
algebraic multigrid
incomplete LU factorization
multigraph methods
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
2.6
论文数:
5.1K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Platinum thin film resistors with Cr under- and overlayers for Nb/Al2O3/Nb technology带有Cr下覆层和上覆层的铂薄膜电阻器，用于Nb/Al2O3/Nb技术
PREAI
分享收藏
查看更多内容