Displaying similar documents to “A note on the number of derangements.”

Discrete-time symmetric polynomial equations with complex coefficients

Didier Henrion, Jan Ježek, Michael Šebek (2002)

Kybernetika

Similarity:

Discrete-time symmetric polynomial equations with complex coefficients are studied in the scalar and matrix case. New theoretical results are derived and several algorithms are proposed and evaluated. Polynomial reduction algorithms are first described to study theoretical properties of the equations. Sylvester matrix algorithms are then developed to solve numerically the equations. The algorithms are implemented in the Polynomial Toolbox for Matlab.

Remarks on inverse of matrix polynomials

Fischer, Cyril, Náprstek, Jiří

Similarity:

Analysis of a non-classically damped engineering structure, which is subjected to an external excitation, leads to the solution of a system of second order ordinary differential equations. Although there exists a large variety of powerful numerical methods to accomplish this task, in some cases it is convenient to formulate the explicit inversion of the respective quadratic fundamental system. The presented contribution uses and extends concepts in matrix polynomial theory and proposes...

On a Theorem by Van Vleck Regarding Sturm Sequences

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...

On stable polynomials

Miloslav Nekvinda (1989)

Aplikace matematiky

Similarity:

The article is a survey on problem of the theorem of Hurwitz. The starting point of explanations is Schur's decomposition theorem for polynomials. It is showed how to obtain the well-known criteria on the distribution of roots of polynomials. The theorem on uniqueness of constants in Schur's decomposition seems to be new.

On the coefficients of the max-algebraic characteristic polynomial and equation

Peter Butkovič (2003)

Kybernetika

Similarity:

No polynomial algorithms are known for finding the coefficients of the characteristic polynomial and characteristic equation of a matrix in max- algebra. The following are proved: (1) The task of finding the max-algebraic characteristic polynomial for permutation matrices encoded using the lengths of their constituent cycles is NP-complete. (2) The task of finding the lowest order finite term of the max-algebraic characteristic polynomial for a { 0 , - ∞ } matrix can be converted to the assignment...