Parallel solution of linear recurrence systems

The paper describes some recently proposed divide-and-conquer parallel algorithms for solving linear recurrence systems. Such systems arise in many computational problems. A special case --solving linear systems with constant coefficients - is also discussed. As an example of an application of such linear systems, parallel algorithms for finding trigonometric sums are presented.