Displaying similar documents to “Some observations on Khovanskii's matrix methods for extracting roots of polynomials.”

Explicit formulas for the constituent matrices. Application to the matrix functions

R. Ben Taher, M. Rachidi (2015)

Special Matrices

Similarity:

We present a constructive procedure for establishing explicit formulas of the constituents matrices. Our approach is based on the tools and techniques from the theory of generalized Fibonacci sequences. Some connections with other results are supplied. Furthermore,we manage to provide tractable expressions for the matrix functions, and for illustration purposes we establish compact formulas for both the matrix logarithm and the matrix pth root. Some examples are also provided. ...

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

A one parameter method for the matrix inverse square root

Slobodan Lakić (1997)

Applications of Mathematics

Similarity:

This paper is motivated by the paper [3], where an iterative method for the computation of a matrix inverse square root was considered. We suggest a generalization of the method in [3]. We give some sufficient conditions for the convergence of this method, and its numerical stabillity property is investigated. Numerical examples showing that sometimes our generalization converges faster than the methods in [3] are presented.

On the matrix form of Kronecker lemma

João Lita da Silva, António Manuel Oliveira (2009)

Discussiones Mathematicae Probability and Statistics

Similarity:

A matrix generalization of Kronecker's lemma is presented with assumptions that make it possible not only the unboundedness of the condition number considered by Anderson and Moore (1976) but also other sequences of real matrices, not necessarily monotone increasing, symmetric and nonnegative definite. A useful matrix decomposition and a well-known equivalent result about convergent series are used in this generalization.