Computing nearby non-trivial Smith forms

DOI10.1016/j.jsc.2019.10.019zbMath1452.65084arXiv1812.04590OpenAlexW2980318109WikidataQ126997763 ScholiaQ126997763MaRDI QIDQ2200314

Joseph Haraldson, George Labahn, Mark W. Giesbrecht

Publication date: 19 September 2020

Published in: Journal of Symbolic Computation, Proceedings of the 2018 ACM International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.04590

zbMATH Keywords

optimizationeigenvaluescanonical formsmatrix polynomialsSmith normal formsymbolic-numeric computationsymbolic-numeric computing

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Numerical linear algebra (65F99) Numerical computation of matrix exponential and similar matrix functions (65F60)

Related Items (3)

Relaxed NewtonSLRA for approximate GCD ⋮ Computation of the nearest non-prime polynomial matrix: structured low-rank approximation approach ⋮ Computing nearby non-trivial Smith forms

Uses Software

• Maple
• MultRoot
• mctoolbox

Cites Work

• The computation of Kronecker's canonical form of a singular pencil
• Pseudospectra, critical points and multiple eigenvalues of matrix polynomials
• An improved algorithm for the computation of Kronecker's canonical form of a singular pencil
• When are two numerical polynomials relatively prime?
• Perturbation theory for rectangular matrix pencils
• On the quadratic convergence of the Levenberg-Marquardt method without nonsingularity assumption
• Checking robust nonsingularity is NP-hard
• The eigenstructure of an arbitrary polynomial matrix: Computational aspects
• The dimension of matrices (matrix pencils) with given Jordan (Kronecker) canonical forms
• Computing nearby non-trivial Smith forms
• Global Optimization with Polynomials and the Problem of Moments
• Computing GCRDs of approximate differential polynomials
• Generalized Resultant Theorem
• A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part II: A Stratification-Enhanced Staircase Algorithm
• Computational complexity of μ calculation
• A Geometric Approach to Perturbation Theory of Matrices and Matrix Pencils. Part I: Versal Deformations
• The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part I
• The generalized Schur decomposition of an arbitrary pencil A–λB—robust software with error bounds and applications. Part II
• Resultant properties of gcd of many polynomials and a factorization representation of gcd
• The approximate GCD of inexact polynomials
• Accuracy and Stability of Numerical Algorithms
• Computing the Nearest Rank-Deficient Matrix Polynomial
• An Algorithm for Degenerate Nonlinear Programming with Rapid Local Convergence
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Computing nearby non-trivial Smith forms