A local construction of the Smith normal form of a matrix polynomial

DOI10.1016/J.JSC.2010.06.025zbMath1206.65146OpenAlexW1989984193MaRDI QIDQ607157

Jon Wilkening, Jia Yu

Publication date: 19 November 2010

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2010.06.025

zbMATH Keywords

algorithmnumerical examplessymbolic computationcanonical formsmatrix polynomialSmith formJordan chain

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Canonical forms, reductions, classification (15A21) Matrix exponential and similar functions of matrices (15A16)

Related Items (11)

\(\lambda\)-matrix formulation applied to the Hertz contact problem with finite friction ⋮ Some results on eigenvalues of finite type, resolvents and Riesz projections ⋮ Modular algorithm for reducing matrices to the Smith normal form ⋮ Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x\)] ⋮ Inversion of regular analytic matrix functions: Local Smith form and subspace duality ⋮ Closed form solution for the equations of motion for constrained linear mechanical systems and generalizations: an algebraic approach ⋮ Smith forms of circulant polynomial matrices ⋮ An approach based on matrix polynomials for linear systems of partial differential equations ⋮ Inverting a Matrix Function around a Singularity via Local Rank Factorization ⋮ On the Sensitivity of Singular and Ill-Conditioned Linear Systems ⋮ Relating \(p\)-adic eigenvalues and the local Smith normal form

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix
• The computation of Kronecker's canonical form of a singular pencil
• Parallel algorithms for matrix normal forms
• An improved Toeplitz algorithm for polynomial matrix null-space computation
• Solving systems of linear equations over polynomials
• Fast projection methods for minimal design problems in linear system theory
• Column reduction of polynomial matrices
• Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
• Fast parallel algorithms for matrix reduction to normal forms
• Computing Hermite and Smith normal forms of triangular integer matrices
• The eigenstructure of an arbitrary polynomial matrix: Computational aspects
• Generalized subresultants for computing the Smith normal form of polynomial matrices
• On the local theory of regular analytic matrix functions
• An algorithm for computing Jordan chains and inverting analytic matrix functions
• Inversion of Analytic Matrix Functions That are Singular at the Origin
• Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
• A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations

This page was built for publication: A local construction of the Smith normal form of a matrix polynomial