Efficient decomposition and performance of parallel PDE, FFT, Monte Carlo simulations, simplex, and sparse solvers
DOI10.1007/BF00127844zbMath0749.65100MaRDI QIDQ1186822
Zarka Cvetanovic, Edward G. Freedman, Charles Nofsinger
Publication date: 28 June 1992
Published in: The Journal of Supercomputing (Search for Journal in Brave)
algorithms; decomposition; fast Fourier transform; Monte Carlo simulations; parallelization; simplex method; implicit methods; sparse solver; alternating directions; cache coherency; red-black successive overrelaxation; multiprocessor performance; shared memory parallel processors; triangular sparse linear systeme
65F50: Computational methods for sparse matrices
65K05: Numerical mathematical programming methods
65C05: Monte Carlo methods
65F10: Iterative numerical methods for linear systems
65T50: Numerical methods for discrete and fast Fourier transforms
65Y05: Parallel numerical computation
65Y20: Complexity and performance of numerical algorithms
65F05: Direct numerical methods for linear systems and matrix inversion
65Y10: Numerical algorithms for specific classes of architectures
Related Items
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
