An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility

DOI10.1137/15M1018265zbMath1367.65087OpenAlexW2683103220MaRDI QIDQ5270354

Ivan Markovsky, Nicola Guglielmi

Publication date: 23 June 2017

Published in: SIAM Journal on Numerical Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/15m1018265

zbMATH Keywords

greatest common divisorSylvester matrixstructured low-rank approximationstructured pseudospectrumstructured distance to singularityNewton-type optimization methodsODEs on matrix manifolds

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of quasi-Newton type (90C53) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (5)

An ODE-based method for computing the approximate greatest common divisor of polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Distance problems in the behavioral setting ⋮ Structured low-rank approximation for nonlinear matrices ⋮ Generalized algorithms for the approximate matrix polynomial GCD of reducing data uncertainties with application to MIMO system and control

Uses Software

• MultRoot
• GPGCD
• Eigtool
• SLRA
• PSAPSR
• IDENT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• GPGCD: an iterative method for calculating approximate GCD of univariate polynomials
• Optimization on a Grassmann manifold with application to system identification
• Low rank approximation. Algorithms, implementation, applications
• On approximate GCDs of univariate polynomials
• When are two numerical polynomials relatively prime?
• An algorithm for computing certified approximate GCD of \(n\) univariate polynomials
• Certified approximate univariate GCDs
• Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey
• Best linear common divisors for approximate degree reduction
• Perturbation theory for linear operators.
• Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms
• Software for weighted structured low-rank approximation
• Variable projection methods for approximate (greatest) common divisor computations
• Eigenvalue patterned condition numbers: Toeplitz and Hankel cases
• Structured low-rank approximation and its applications
• Fast Approximation of the $H_\infty$ Norm via Optimization over Spectral Value Sets
• Structured Low-Rank Approximation with Missing Data
• Factorization Approach to Structured Low-Rank Approximation with Applications
• Approximating real stability radii
• Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials
• Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking
• The numerical greatest common divisor of univariate polynomials
• Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
• An Efficient Algorithm for Computing the Generalized Null Space Decomposition
• An Algorithm for Least-Squares Estimation of Nonlinear Parameters
• Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems
• Generalized Resultant Theorem
• Numerical Optimization
• Separable nonlinear least squares: the variable projection method and its applications
• Pseudospectral Components and the Distance to Uncontrollability
• Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points
• Real Controllability/Stabilizability Radius of LTI Systems
• Low-Rank Dynamics for Computing Extremal Points of Real Pseudospectra
• Functional Operators (AM-22), Volume 2

This page was built for publication: An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility