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 Plus annual

Presents the access of premium content as premium feature

Premium Content

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 annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

The parallel linear equations solver capable of effectively using 1000+processors becomes the bottleneck of large-scale implicit engineeringsimulations. In this paper, we present a new hierarchical parallelmaster-slave-structural iterative algorithm for the solution of superlarge-scale sparse linear equations in distributed memory computer cluster.Through alternatively performing global equilibrium computation and localrelaxation, our proposed algorithm will reach the specific accuracy requirementin a few of iterative steps. Moreover, each set/slave-processor majorlycommunicate with its nearest neighbors, and the transferring data betweensets/slave-processors and master is always far below the set-neighborcommunication. The corresponding algorithm for implicit finite element analysishas been implemented based on MPI library, and a super large 2-dimension squaresystem of triangle-lattice truss structure under random static loads issimulated with over one billion degrees of freedom and up to 2001 processors on"Exploration 100" cluster in Tsinghua University. The numerical experimentsdemonstrate that this algorithm has excellent parallel efficiency and highscalability, and it may have broad application in other implicit simulations.

Scalable hierarchical parallel algorithm for the solution of super large-scale sparse linear equations