Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
A parallel least-squares spectral element solver for incompressible flow problems on unstructured grids
Nool M., Proot M. Parallel Computing31 (5):414-438,2005.Type:Article
Date Reviewed: Jan 24 2006

The spectral element method is essentially a high-order finite element technique. This method is suited to problems for which the solutions can be expressed as a series of polynomial basis functions. The method may yield an equation system with a very large condition number. Using preconditioners to improve the computational efficiency is a standard practice. Parallelization is a must for industry-level use.

This paper focuses on the implementation issues of parallelizing a preconditioned conjugate gradient (PCG) solver for the spectral element method. The preconditioners discussed here include the additive Schwarz method and the Jacobi method. The authors found that the additive Schwarz method is more attractive, especially when the mesh is fine. The efficiency of the parallel solver, including the memory usage and scalability, is also discussed. The most valuable part of this paper is the detailed performance evaluation of the solver based on the numerical experiments.

This paper can be quite useful for researchers interested in applications. It is not recommended for those who are looking for breakthroughs in the field. The paper could have been made clearer and more concise if some of the implementation details, which have been extensively discussed by other researchers, had been included in an appendix, rather than in the body of the text. The authors should also have included some hp method papers in the reference list. The procedure of implementing a parallel solver for the spectral method is very similar to that in the hp method.

Reviewer:  Jingping Long Review #: CR132350 (0608-0851)
Bookmark and Share
  Reviewer Selected
 
 
Parallel Algorithms (G.1.0 ... )
 
 
Convergence And Stability (G.1.7 ... )
 
 
Least Squares Approximation (G.1.2 ... )
 
 
Approximation (G.1.2 )
 
 
Ordinary Differential Equations (G.1.7 )
 
Would you recommend this review?
yes
no
Other reviews under "Parallel Algorithms": Date
Parallel algorithms in computational science
Heermann D., Burkitt A., Springer-Verlag New York, Inc., New York, NY, 1991. Type: Book (9780387534183)
Apr 1 1992
A parallel shortest augmenting path algorithm for the assignment problem
Balas E., Miller D., Pekny J., Toth P. (ed) Journal of the ACM 38(4): 985-1004, 1991. Type: Article
Sep 1 1992
An o(n log n) minimal spanning tree algorithmn for n points in the plane
Changm R., Lee R. BIT 26(1): 7-16, 1986. Type: Article
Nov 1 1987
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy