Open Access
Parallel algorithms for recurrence and tridiagonal equations
J. S. Kowalik,S. P. Kumar +1 more
- 01 Jun 1985
- pp 295-307
6
About: The article was published on 01 Jun 1985. and is currently open access. The article focuses on the topics: Tridiagonal matrix algorithm & Tridiagonal matrix.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
A hierarchical decomposition for large-scale optimal control problems with parallel processing structure
TL;DR: A parallel, two-level optimization algorithm is presented, where the the high level problem is solved by Newton's method, and low level subproblems are solved by the Differential Dynamic Programming technique.
38
Solving Tridiagonal Linear Systems On the Butterfly Parallel Computer
Swarn P. Kumar
- 01 Mar 1989
TL;DR: A parallel block partitioning method to solve a tri diagonal system of linear equations is adapted to the BBN Butterfly multiprocessor and the achieved results are shown to be within 82% to 90% of the predicted performance.
12
Parallel polynomial evaluation by decoupling algorithm
TL;DR: Decoupling algorithm proposed by Kowalik and Kumar for solving bidiagonal systems is simplified and modified by showing that only two stages of three stage algorithm is satisfactory to be used to evaluate polynomials.
2
An implementation of a parallel iterative algorithm for the solution of large banded system on a cluster of workstations
TL;DR: The obtained performance results show that the proposed algorithm exhibits higher efficiency for coarse grain computations corresponding to large matrix sizes and reduced number of processors.
1