A compound matrix algorithm for the computation of the Smith form of a polynomial matrix (Q1334229): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Matlab / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Hermite and Smith Normal Matrices and Linear Diophantine Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact reduction of a polynomial matrix to the Smith normal form / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4917542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A matrix pencil based numerical method for the computation of the GCD of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5331504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computation of the GCD of polynomials using gaussian transformations and shifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Part I-Smith form and common divisor of polynomial matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of algorithms for calculation of g.c.d. of polynomials / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02140679 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2102558929 / rank
 
Normal rank

Latest revision as of 10:16, 30 July 2024

scientific article
Language Label Description Also known as
English
A compound matrix algorithm for the computation of the Smith form of a polynomial matrix
scientific article

    Statements

    A compound matrix algorithm for the computation of the Smith form of a polynomial matrix (English)
    0 references
    17 October 1994
    0 references
    This paper presents a numerical method for the exact reduction of a single-variable polynomial matrix to its Smith canonical form without finding roots and without applying unimodular transformations. This technique uses the notion of compound matrices and produces a stable and accurate numerical algorithm working satisfactorily for any polynomial matrix of any degree. Numerical results of several examples are given.
    0 references
    0 references
    MATLAB
    0 references
    numerical results
    0 references
    polynomial matrix
    0 references
    Smith canonical form
    0 references
    compound matrices
    0 references
    numerical algorithm
    0 references

    Identifiers