A local construction of the Smith normal form of a matrix polynomial
DOI10.1016/J.JSC.2010.06.025zbMATH Open1206.65146OpenAlexW1989984193MaRDI QIDQ607157FDOQ607157
Authors: 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
Recommendations
- scientific article; zbMATH DE number 1263322
- Generalized subresultants for computing the Smith normal form of polynomial matrices
- scientific article; zbMATH DE number 708841
- On the Smith Normal Form of Structured Polynomial Matrices
- A compound matrix algorithm for the computation of the Smith form of a polynomial matrix
numerical examplesalgorithmcanonical formsJordan chainmatrix polynomialsymbolic computationSmith form
Symbolic computation and algebraic computation (68W30) Matrix exponential and similar functions of matrices (15A16) Canonical forms, reductions, classification (15A21)
Cites Work
- Title not available (Why is that?)
- Introduction to algorithms
- Title not available (Why is that?)
- Fast projection methods for minimal design problems in linear system theory
- The computation of Kronecker's canonical form of a singular pencil
- Title not available (Why is that?)
- Title not available (Why is that?)
- Computing algorithms for the reduction of a Hermite algorithm with polynomial coefficients
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations
- An algorithm for computing Jordan chains and inverting analytic matrix functions
- The eigenstructure of an arbitrary polynomial matrix: Computational aspects
- Column reduction of polynomial matrices
- Generalized subresultants for computing the Smith normal form of polynomial matrices
- Parallel algorithms for matrix normal forms
- A fast Las Vegas algorithm for computing the Smith normal form of a polynomial matrix
- Fast Parallel Computation of Hermite and Smith Forms of Polynomial Matrices
- On the local theory of regular analytic matrix functions
- Inversion of analytic matrix functions that are singular at the origin
- An improved Toeplitz algorithm for polynomial matrix null-space computation
- Solving systems of linear equations over polynomials
- Fast parallel algorithms for matrix reduction to normal forms
- Computing Hermite and Smith normal forms of triangular integer matrices
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (17)
- Title not available (Why is that?)
- Triangular \(x\)-basis decompositions and derandomization of linear algebra algorithms over \(K[x]\)
- Computing nearby non-trivial Smith forms
- Smith forms of circulant polynomial matrices
- Relating \(p\)-adic eigenvalues and the local Smith normal form
- Modular algorithm for reducing matrices to the Smith normal form
- Inversion of regular analytic matrix functions: Local Smith form and subspace duality
- Computation of a canonical form for neutral delay-differential systems
- On the Smith Normal Form of Structured Polynomial Matrices
- \(\lambda\)-matrix formulation applied to the Hertz contact problem with finite friction
- Smith normal form of a matrix of generalized polynomials with rational exponents
- Some results on eigenvalues of finite type, resolvents and Riesz projections
- Inverting a matrix function around a singularity via local rank factorization
- Computing a compact local Smith–McMillan form
- Closed form solution for the equations of motion for constrained linear mechanical systems and generalizations: an algebraic approach
- An approach based on matrix polynomials for linear systems of partial differential equations
- On the Sensitivity of Singular and Ill-Conditioned Linear Systems
This page was built for publication: A local construction of the Smith normal form of a matrix polynomial
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q607157)
