Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Samuelson–Berkowitz algorithm
open-in-new
<p>In mathematics, the Samuelson–Berkowitz algorithm efficiently computes the <a href="/facts/Characteristic_polynomial/7m8roDqo">characteristic polynomial</a> of an n × n {\displaystyle n\times n} matrix whose entries may be elements of any unital <a href="/facts/Commutative_ring/QS1r2ovR">commutative ring</a>. Unlike the <a href="/facts/Faddeev%E2%80%93LeVerrier_algorithm/uuKcU5tn">Faddeev–LeVerrier algorithm</a>, it performs no divisions, so may be applied to a wider range of algebraic structures. </p>