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/

Zendy Open

Presents the pdf analysis as premium feature

PDF Analysis

Insights

Presents the summarisation as premium feature

Summarisation

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

A parallel algorithm for solving a series of matrix equations with a constanttridiagonal matrix and different right-hand sides is proposed and studied. Theprocess of solving the problem is represented in two steps. The firstpreliminary step is fixing some rows of the inverse matrix of SLAEs. The secondstep consists in calculating solutions for all right-hand sides. For reducingthe communication interactions, based on the formulated and proved mainparallel sweep theorem, we propose an original algorithm for calculating sharecomponents of the solution vector. Theoretical estimates validating theefficiency of the approach for both the common- and distributed-memorysupercomputers are obtained. Direct and iterative methods of solving a 2DPoisson equation, which include procedures of tridiagonal matrix inversion, arerealized using the mpi technology. Results of computational experiments on amulticomputer demonstrate a high efficiency and scalability of the parallelsweep algorithm.

Parallel dichotomy algorithm for solving tridiagonal SLAEs