A generalized criterion for the early termination of R-cyclic reduction and divide and conquer for recurrences
- Universitat Politecnica de Catalnya, Barcelona (Spain)
In this paper we deal with the parallel solution of linear recurrences x{sub i} = b{sub i}+a{sub i} x{sub i-1} for the case {vert_bar}a{sub i}{vert_bar} < 1. Criteria for saving arithmetic operations to the R-Cyclic Reduction and the Divide and Conquer families of parallel algorithms are proposed. Expressions are obtained that indicate the phase in which the algorithms have to be terminated as a function of the maximum absolute value of jail and the maximum absolute error allowed to the solution. Also, an analysis of the most important features of these two algorithms when terminated early is performed. Execution times of both algorithms for general and Teoplitz systems are given on one vector processor of the Convex C-3480.
- OSTI ID:
- 125550
- Report Number(s):
- CONF-950212-; CNN: Project APPARC 6634; TRN: 95:005768-0095
- Resource Relation:
- Conference: 7. Society for Industrial and Applied Mathematics (SIAM) conference on parallel processing for scientific computing, San Francisco, CA (United States), 15-17 Feb 1995; Other Information: PBD: 1995; Related Information: Is Part Of Proceedings of the seventh SIAM conference on parallel processing for scientific computing; Bailey, D.H.; Bjorstad, P.E.; Gilbert, J.R. [eds.] [and others]; PB: 894 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Divide-and-conquer for parallel processing
A divide-conquer-recombine algorithmic paradigm for large spatiotemporal quantum molecular dynamics simulations