Faddeev–LeVerrier algorithm

Summary

Faddeev–LeVerrier algorithm is a recursion^[1].

Key Facts

• Faddeev–LeVerrier algorithm's instance of is recorded as recursion^[2].
• Dmitry Faddeev is named after Faddeev–LeVerrier algorithm^[3].
• Urbain Le Verrier is named after Faddeev–LeVerrier algorithm^[4].
• Faddeev–LeVerrier algorithm's Google Knowledge Graph ID is recorded as /g/122brkv4^[5].
• Faddeev–LeVerrier algorithm's Microsoft Academic ID is recorded as 2775873338^[6].
• Faddeev–LeVerrier algorithm's computational complexity is recorded as NC^[7].

Body

Designation and Status

Faddeev–LeVerrier algorithm's instance of is recorded as recursion^[2].

History and Context

Things named after include Dmitry Faddeev^[3], a mathematician^[8], 1907–1989^[9], of Russian Empire^[10], awarded the USSR State Prize^[11], specialised in number theory^[12] and Urbain Le Verrier^[4], an astronomer^[13], 1811–1877^[14], of France^[15], awarded the Copley Medal^[16], specialised in celestial mechanics^[17].