A local construction of the Smith normal form of a matrix polynomial (Q607157): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Inversion of Analytic Matrix Functions That are Singular at the Origin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3254327 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the local theory of regular analytic matrix functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3939931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4044675 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast projection methods for minimal design problems in linear system theory / 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: Parallel algorithms for matrix normal forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving systems of linear equations over polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column reduction of polynomial matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659396 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Hermite and Smith normal forms of triangular integer matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computation of Kronecker's canonical form of a singular pencil / rank
 
Normal rank
Property / cites work
 
Property / cites work: The eigenstructure of an arbitrary polynomial matrix: Computational aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234198 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234329 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized subresultants for computing the Smith normal form of polynomial matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel algorithms for matrix reduction to normal forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing Jordan chains and inverting analytic matrix functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved Toeplitz algorithm for polynomial matrix null-space computation / rank
 
Normal rank

Revision as of 11:33, 3 July 2024

scientific article
Language Label Description Also known as
English
A local construction of the Smith normal form of a matrix polynomial
scientific article

    Statements

    A local construction of the Smith normal form of a matrix polynomial (English)
    0 references
    0 references
    0 references
    19 November 2010
    0 references
    Canonical forms are a useful tool for classifying matrices -- when working with matrix polynomials over a field \(K\), one fundamental canonical form, the Smith form, is defined. It is the diagonalization \(A = E D F\) of the given matrix \(A\) by unimodular matrices \(E\) and \(F\) such that the diagonal entries \(d_i\) of the matrix \(D\) are monic polynomials. The authors present an algorithm for computing a Smith form with multipliers of a regular matrix polynomial over a field, and discuss the performance of the algorithm in exact arithmetic for several test cases.
    0 references
    matrix polynomial
    0 references
    canonical forms
    0 references
    Smith form
    0 references
    Jordan chain
    0 references
    symbolic computation
    0 references
    numerical examples
    0 references
    algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references