An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (Q5270354): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: GPGCD / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Eigtool / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SLRA / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: IDENT / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: PSAPSR / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5433140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch and bound algorithm for computing the minimum stability degree of parameter‐dependent linear systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: When are two numerical polynomials relatively prime? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5301644 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3162294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudospectral Components and the Distance to Uncontrollability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Structured Pseudospectrum of a Toeplitz Matrix and Its Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4232503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separable nonlinear least squares: the variable projection method and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation of the $H_\infty$ Norm via Optimization over Spectral Value Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential Equations for Roaming Pseudospectra: Paths to Extremal Points and Boundary Tracking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low-Rank Dynamics for Computing Extremal Points of Real Pseudospectra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating real stability radii / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Algorithm for Computing the Generalized Null Space Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4730687 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real Controllability/Stabilizability Radius of LTI Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorization Approach to Structured Low-Rank Approximation with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3962848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Challenges of symbolic computation: My favorite open problems. With an additional open problem by Robert M. Corless and David J. Jeffrey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate greatest common divisors of several polynomials with linearly constrained coefficients and singular polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate GCDs of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation theory for linear operators. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4879581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured low-rank approximation and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Low rank approximation. Algorithms, implementation, applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structured Low-Rank Approximation with Missing Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Software for weighted structured low-rank approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Least-Squares Estimation of Nonlinear Parameters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue patterned condition numbers: Toeplitz and Hankel cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for computing certified approximate GCD of \(n\) univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best linear common divisors for approximate degree reduction / rank
 
Normal rank
Property / cites work
 
Property / cites work: GPGCD: an iterative method for calculating approximate GCD of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5694789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Functional Operators (AM-22), Volume 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Resultant Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization on a Grassmann manifold with application to system identification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable projection for affinely structured low-rank approximation in weighted \(2\)-norms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable projection methods for approximate (greatest) common divisor computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The numerical greatest common divisor of univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4105489 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1137/15m1018265 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2683103220 / rank
 
Normal rank

Latest revision as of 09:37, 30 July 2024

scientific article; zbMATH DE number 6734887
Language Label Description Also known as
English
An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility
scientific article; zbMATH DE number 6734887

    Statements

    An ODE-Based Method for Computing the Distance of Coprime Polynomials to Common Divisibility (English)
    0 references
    0 references
    0 references
    23 June 2017
    0 references
    Sylvester matrix
    0 references
    structured pseudospectrum
    0 references
    structured low-rank approximation
    0 references
    ODEs on matrix manifolds
    0 references
    structured distance to singularity
    0 references
    greatest common divisor
    0 references
    Newton-type optimization methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    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
    0 references