A Fast Computation of the Characteristic Polynomial -- from Wolfram Library Archive

Title

A Fast Computation of the Characteristic Polynomial

Authors

George Nakos

R. Williams

Journal / Anthology

Mathematica in Education and Research

Year:

2000

Volume:

Issue:

Page range:

6-12

Description

This is a report on the Samuelson-Berkowitz-Abdeljaoued Algorithm (SBA), which is a very efficient computation of the characteristic polynomial in an arbtrary ring. We describe in detail Abdeljaoued'simproved version of the Berkowitz Algorithm, which was based on Samuelson's Formula. We offer step-by-step examples and a Mathematica package that implements SBA.

Subject

Mathematics > Algebra > Field and Ring Theory

Downloads

fastComp.nb (19.8 KB) - Mathematica Notebook

Enable JavaScript to interact with content and submit forms on Wolfram websites. Learn how »