ɐɡˈɛn, ðɪ ɐlbɹˈɛkht ˈælɡɚɹˌɪθəm kæn biː ɐplˈaɪd tə ɹᵻdˈuːs ðɪs pɹˈɑːbləm tʊ ɐ lˈɑːɹdʒ lˈɪnɪɹ wˈʌn wˌɪtʃ kæn biː sˈɑːlvd wɪð ɐ dʒˌɛnɚɹəlᵻzˈeɪʃən ʌvðə bˈɑːɹɾəlzstˈuːɚt ˈælɡɚɹˌɪθəm; ðɪs ɪz fˈiːzᵻbəl pɹəvˈaɪdᵻd ðætðə dᵻɡɹˈiː ʌvðə pˌɑːlɪnˈoʊmɪəl ɪz nˌɑːt tˈuː hˈaɪ.
Again, the Al'Brekht algorithm can be applied to reduce this problem to a large linear one which can be solved with a generalization of the Bartels-Stewart algorithm; this is feasible provided that the degree of the polynomial is not too high.