scientific article; zbMATH DE number 3355217

zbMath0224.15018MaRDI QIDQ5629775

No author found.

Publication date: 1971

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Basic linear algebra (15A99)

Related Items (28)

Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Structured matrix methods computing the greatest common divisor of polynomials ⋮ On the complexity of computing the greatest common divisor of several univariate polynomials ⋮ Perturbation theory of selfadjoint matrices and sign characteristics under generic structured rank one perturbations ⋮ Applications of the generalized Sylvester matrix ⋮ Polynomials with respect to a general basis. II: Applications ⋮ Complex Roots of Quaternion Polynomials ⋮ Congenial matrices ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ System theoretic based characterisation and computation of the least common multiple of a set of polynomials. ⋮ Eigenvalue perturbation theory of symplectic, orthogonal, and unitary matrices under generic structured rank one perturbations ⋮ A structured rank-revealing method for Sylvester matrix ⋮ The computation of the degree of the greatest common divisor of three Bernstein basis polynomials ⋮ Eigenvalue perturbation theory of classes of structured matrices under generic structured rank one perturbations ⋮ The ERES method for computing the approximate GCD of several polynomials ⋮ Squarefree decomposition of univariate polynomials depending on a parameter. Application to the integration of parametric rational functions ⋮ Two Variants of Bézout Subresultants for Several Univariate Polynomials ⋮ Numerical performance of the matrix pencil algorithm computing the greatest common divisor of polynomials and comparison with other matrix-based methodologies ⋮ Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials ⋮ Inners and Schur complement ⋮ Greatest common divisor of generalized polynomials and polynomial matrices ⋮ An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials ⋮ Nearest common root of a set of polynomials: a structured singular value approach ⋮ Unnamed Item ⋮ Computing greatest common divisors and squarefree decompositions through matrix methods: the parametric and approximate cases ⋮ Division of generalized polynomials using the comrade matrix ⋮ The feedback invariant measures of distance to uncontrollability and unobservability ⋮ Barnett's theorems about the greatest common divisor of several univariate polynomials through Bezout-like matrices

This page was built for publication: