CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
an efficient parallel blocking algorithm design for reducing a symmetric matrix to tridiagonal form
Authors
程强
赵永华
+3 more
赵涛
迟学斌
陈江
Publication date
1 January 2006
Publisher
Abstract
在矩阵数值计算中,块算法通常比非块算法更有效,但这也增加了并行算法设计和实现的难度.在广义稠密对称矩阵特征问题并行求解器中,并行块算法的构造可应用到正定对称矩阵的Choleski分解、对称矩阵的三对角化和回代转化(back-translation)操作中.本文将并行块算法的讨论集中在具有代表性的对称矩阵三对角化上,给出在非块存储方式下对称矩阵三对角化的并行块算法设计方法.分析块算法大小同矩阵规模和处理器数量的关系.在深腾6800上的试验表明,我们的算法具有很好的性能,并得到了比ScaLAPACK更高的性
Similar works
Full text
Available Versions
Institute Of Software, Chinese Academy Of Sciences
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:ir.iscas.ac.cn:311060/1163...
Last time updated on 30/12/2017