English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

To optimize the Block Widemann and Block Lancos algorithm is every important in solving large sparse systems in many engineering computing topic, so the parallel method of these two algorithms is built. This paper designs two different types of data parallel based on the original parallelism level and parallel scalability of two algorithms, and finally achieve a more efficient way for solving the problems. At last, we analysis the computing complexity and time cost, and gave a strategy for choosing the algorithms in different computing environment etc. based on the evaluation. KeywordsLarge sparse linear equations; Block Lanczos; Block Wiedemann; Parallel Computing;

Parallel Algorithms for Solving Large Sparse Linear Equations