Dr. Min Tian Profile

Dr. Min Tian

SPIE Involvement:

Author

Publications (1)

This will count as one of your downloads.

You will have access to both the presentation and article (if available).

DOWNLOAD NOW

This content is available for download via your institution's subscription. To access this item, please sign in to your personal account.

Email or Username Forgot your username?

Password Forgot your password?

Show

Keep me signed in

No SPIE account? Create an account

Proceedings Article | 22 December 2021 Paper

A load balancing parallel algorithm for solving large-scale tridiagonal linear systems

Min Tian, Shan Qiao, Junjie Wang, Wei Du

Proceedings Volume 12156, 1215602 (2021) https://doi.org/10.1117/12.2626438

KEYWORDS: Partial differential equations, Computing systems, Telecommunications, Matrices, Data processing, Computer simulations, Chromium, Algorithm development, Weather forecasting, Systems modeling

Read Abstract +

Solving large-scale sparse linear systems is a critical problem in scientific and engineering computing. Partial differential equations can solve problems in many fields. They can be transformed into large-scale linear systems with a series of methods, and the parallel solution of tridiagonal linear systems is one of them. The solution of linear systems is very time-consuming in most of the problems, accounting for more than half of the total time. Load balancing can reduce process time for waiting and improves computational efficiency, and it is the focus of many algorithms. The article is based on Stone's proposed recursive doubling algorithm, an improved algorithm for solving tridiagonal linear systems using the full-recursive-doubling communication model and the Möbiu transform. The improved algorithm can calculate the million-dimensional linear systems. Numerical experiments show that compared with ordinary parallel algorithms, the improved algorithm shows up to 2x improvement than the original version, and some results even show up to 3x. In addition, the load-balancing performance has been greatly improved, and the time difference of the processes is 1/7 of the original version. The improved algorithm has a good load balancing, and the running time of each process is not much different, avoiding process waiting and resource wastage.

My Library

You currently do not have any folders to save your paper to! Create a new folder below.

Folder Name

Folder Description

View contact details

UPDATE YOUR PROFILE

Is this your profile? Update it now.

Sign into your SPIE.org account

Don’t have a profile and want one?

Create an account on SPIE.org

Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks. You are receiving this notice because your organization may not have SPIE eBooks access.*

*Shibboleth/Open Athens users─please sign in to access your institution's subscriptions.

To obtain this item, you may purchase the complete book in print or electronic format on SPIE.org.

ORGANIZATIONAL
Sign in with credentials provided by your organization.

Organizational Username

Organizational Password

Show/Hide Password

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members:

Non-members: ADD TO CART

Keywords/Phrases

Search In:

Publication Years