Various proofs of Sylvester's (determinant) identity

Alkiviadis G. Akritas, Evgenia K. Akritas and Genadii I. Malaschonok

Mathematics and Computers in Simulation (MATCOM), 1996, vol. 42, issue 4, 585-593

Abstract: Despite the fact that the importance of Sylvester's determinant identity has been recognized in the past, we were able to find only one proof of it in English (Bareiss, 1968), with reference to some others. (Recall that Sylvester (1857) stated this theorem without proof.) Having used this identity, recently, in the validity proof of our new, improved, matrix-triangularization subresultant polynomial remainder sequence method (Akritas et al., 1995), we decided to collect all the proofs we found of this identity-one in English, four in German and two in Russian, in that order-in a single paper (Akritas et al., 1992). It turns out that the proof in English is identical to an earlier one in German. Due to space limitations two proofs are omitted.

Keywords: Sylvester's identity; Polynomial remainder sequence (prs); Matrix-triangularization subresultant prs (search for similar items in EconPapers)
Date: 1996
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475496000353
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:42:y:1996:i:4:p:585-593

DOI: 10.1016/S0378-4754(96)00035-3

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().