Lyapunov and Stein matrix equations arise in many important analysis and synthesis applications in control theory. The traditional approach to solving these equations relies on the QR algorithm which is notoriously difficult to parallelize. We investigate iterative solvers based on the matrix sign f
Parallel algorithms for solving retrieval equations
β Scribed by A. N. Terekhin
- Publisher
- Springer
- Year
- 1992
- Tongue
- English
- Weight
- 295 KB
- Volume
- 3
- Category
- Article
- ISSN
- 1046-283X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We present two EREW PRAM algorithms and one CREW PRAM algorithm for solving set recurrence equations of the type commonly used in dynamic programming solutions to many problems in pattern matching, sequence comparison, and language recognition. All three algorithms run in \(O\left(\log ^{2} n\right)
Two classes of algorithms for equation solving are presented and analyzed. These algorithms have been devised in recent years because of the computational facility of the multiprocessor. The first class consists of parallel search methods while the second class consists of asynchronous methods. The