2004•Unpublished venueRequires access

The Domain Decomposition Parallel Iterative Algorithm for the 3-D Transport Issue

Shulin Yang

Abstract

Discussion is given on the domain decomposition parallel iterative algorithm,which is aimed at the implicit difference equation under 3-D Cartesian coordination and the error estimates for both the serial and the parallel iteration are provided.The analysis and comparison about the numerical results indicate that the parallel iterative algorithm is highly parallelizable and scalable.

About this research paper

What this paper is about

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Key concepts: Parallelizable manifold, Domain decomposition methods, Iterative method, Computer science, Algorithm, Cartesian coordinate system, Decomposition, Domain (mathematical analysis)