Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers

DOI10.1007/BF00127844zbMath0749.65100MaRDI QIDQ1186822

Edward G. Freedman, Charles Nofsinger, Zarka Cvetanovic

Publication date: 28 June 1992

Published in: The Journal of Supercomputing (Search for Journal in Brave)

zbMATH Keywords

algorithmsdecompositionfast Fourier transformMonte Carlo simulationsparallelizationsimplex methodimplicit methodssparse solveralternating directionscache coherencyred-black successive overrelaxationmultiprocessor performanceshared memory parallel processorstriangular sparse linear systeme

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Numerical mathematical programming methods (65K05) Monte Carlo methods (65C05) Iterative numerical methods for linear systems (65F10) Numerical methods for discrete and fast Fourier transforms (65T50) Parallel numerical computation (65Y05) Complexity and performance of numerical algorithms (65Y20) Direct numerical methods for linear systems and matrix inversion (65F05) Numerical algorithms for specific classes of architectures (65Y10)

Related Items (4)

Parallel search paths for the simplex algorithm ⋮ Advances in the Parallelization of the Simplex Method ⋮ Efficient GPU-based implementations of simplex type algorithms ⋮ Towards a practical parallelisation of the simplex method

Cites Work

• Computational models and task scheduling for parallel sparse Cholesky factorization
• Towards developing robust algorithms for solving partial differential equations on MIMD machines
• Implementation of an ADI method on parallel computers
• Alternating Direction Methods on Multiprocessors
• Solution of Partial Differential Equations on Vector and Parallel Computers
• A Parallel Method for Tridiagonal Equations
• An Adaptation of the Fast Fourier Transform for Parallel Processing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers