Computing the determinants by reducing the orders by four.
Gjonbalaj, Qefsere, Salihu, Armend (2010)
Applied Mathematics E-Notes [electronic only]
Similarity:
Gjonbalaj, Qefsere, Salihu, Armend (2010)
Applied Mathematics E-Notes [electronic only]
Similarity:
Anna Makarewicz, Piotr Pikuta, Dominik Szałkowski (2014)
Annales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica
Similarity:
In this paper we present new identities for the Radić’s determinant of a rectangular matrix. The results include representations of the determinant of a rectangular matrix as a sum of determinants of square matrices and description how the determinant is affected by operations on columns such as interchanging columns, reversing columns or decomposing a single column.
Janaki, T.M., Rangarajan, Govindan (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Kløve, Torleiv (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Ferdinand Kraffer, Petr Zagalak (2002)
Kybernetika
Similarity:
The polynomial matrix equation is solved for those and that give proper transfer functions characterizing a subclass of compensators, contained in the class whose arbitrary element can be cascaded to a plant with the given strictly proper transfer function such that wrapping the negative unity feedback round the cascade gives a system whose poles are specified by . The subclass is navigated and extracted...
Fallat, Shaun M., Johnson, Charles R., Smith, Ronald L. (2000)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Pavla Holasová (1975)
Aplikace matematiky
Similarity:
Johnson, Charles R., Merris, Russell, Pierce, Stephen (1985-1986)
Portugaliae mathematica
Similarity:
Roland Bacher (2002)
Journal de théorie des nombres de Bordeaux
Similarity:
The aim of this paper is to study determinants of matrices related to the Pascal triangle.
Lee, Gwang-Yeon, Shader, Bryan L. (1998)
ELA. The Electronic Journal of Linear Algebra [electronic only]
Similarity:
Akritas, Alkiviadis, Malaschonok, Gennadi, Vigklas, Panagiotis (2013)
Serdica Journal of Computing
Similarity:
In 1900 E. B. Van Vleck proposed a very efficient method to compute the Sturm sequence of a polynomial p (x) ∈ Z[x] by triangularizing one of Sylvester’s matrices of p (x) and its derivative p′(x). That method works fine only for the case of complete sequences provided no pivots take place. In 1917, A. J. Pell and R. L. Gordon pointed out this “weakness” in Van Vleck’s theorem, rectified it but did not extend his method, so that it also works in the cases of: (a) complete Sturm sequences...