Stability of parallel algorithms to evaluate Chebyshev series
نویسندگان
چکیده
منابع مشابه
A Parallel Algorithm to Evaluate Chebyshev Series on a Message Passing Environment
A simple parallel algorithm for the evaluation of polynomials written in the Chebyshev form is introduced. By this method only 2 ⌈log2(p−2)⌉+ ⌈log2 p⌉+4 ⌈N/p⌉−7 steps on p processors are needed to evaluate a Chebyshev series of degree N . Theoretical analysis of the efficiency is performed and some numerical examples on a CRAY T3D are shown.
متن کاملAgeing Orders of Series-Parallel and Parallel-Series Systems with Independent Subsystems Consisting of Dependent Components
In this paper, we consider series-parallel and parallel-series systems with independent subsystems consisting of dependent homogeneous components whose joint lifetimes are modeled by an Archimedean copula. Then, by considering two such systems with different numbers of components within each subsystem, we establish hazard rate and reversed hazard rate orderings between the two system lifetimes,...
متن کاملParallel Algorithms for Series Parallel Graphs
In this paper, a parallel algorithm is given that, given a graph G = (V;E), decides whether G is a series parallel graph, and if so, builds a decomposition tree for G of series and parallel composition rules. The algorithm uses O(log jEj log jEj) time and O(jEj) operations on an EREW PRAM, and O(log jEj) time and O(jEj) operations on a CRCW PRAM (note that ifG is a simple series parallel graph,...
متن کاملStability of Parallel Algorithms for Polynomial Evaluation
In this paper, we analyse the stability of parallel algorithms for the evaluation of polynomials written es a finite series of orthogonal polynomials. The basic part of the computation is the solution of a triangular tridiagonal linear system. This fact allows us to present a more detailed analysis. The theoretical results show that the parallel algorithms are almost as stable as their sequenti...
متن کاملSpace Efficient Algorithms for Series-Parallel Graphs
The subclass of directed series-parallel graphs plays an important role in computer science. To determine whether a graph is series-parallel is a well studied problem in algorithmic graph theory. Fast sequential and parallel algorithms for this problem have been developed in a sequence of papers. For series-parallel graphs methods are also known to solve the reachability and the decomposition p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2001
ISSN: 0898-1221
DOI: 10.1016/s0898-1221(01)00102-x