scientific article; zbMATH DE number 1254271
From MaRDI portal
Publication:4227320
zbMath0928.13017MaRDI QIDQ4227320
Y. N. Lakshman, Narendra K. Karmarkar
Publication date: 18 November 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Symbolic computation and algebraic computation (68W30) Polynomials, factorization in commutative rings (13P05) Polynomials and rational functions of one complex variable (30C10)
Related Items (34)
A quadratically convergent algorithm for structured low-rank approximation ⋮ Relaxed NewtonSLRA for approximate GCD ⋮ Approximate gcds of polynomials and sparse SOS relaxations ⋮ Numerical and Symbolical Methods for the GCD of Several Polynomials ⋮ Certified approximate univariate GCDs ⋮ Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs ⋮ Computing the nearest singular univariate polynomials with given root multiplicities ⋮ Structured matrix methods computing the greatest common divisor of polynomials ⋮ SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials ⋮ Obtaining exact interpolation multivariate polynomial by approximation ⋮ A symbolic-numeric approach for parametrizing ruled surfaces ⋮ Computing nearby non-trivial Smith forms ⋮ Guessing singular dependencies ⋮ The nearest complex polynomial with a zero in a given complex domain ⋮ Numerical proper reparametrization of parametric plane curves ⋮ Computing the polynomial remainder sequence via Bézout matrices ⋮ A heuristic verification of the degree of the approximate GCD of two univariate polynomials ⋮ Overdetermined Weierstrass iteration and the nearest consistent system ⋮ Approximate square-free part and decomposition ⋮ Estimation of the Greatest Common Divisor of many polynomials using hybrid computations performed by the ERES method ⋮ Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation ⋮ Blind image deconvolution via Hankel based method for computing the GCD of polynomials ⋮ Regularization and Matrix Computation in Numerical Polynomial Algebra ⋮ Structured total least norm and approximate GCDs of inexact polynomials ⋮ Global minimization of rational functions and the nearest GCDs ⋮ Hybrid method for computing the nearest singular polynomials ⋮ A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix ⋮ The Computation of Multiple Roots of a Bernstein Basis Polynomial ⋮ Nearest multivariate system with given root multiplicities ⋮ Computing approximate greatest common right divisors of differential polynomials ⋮ An algorithm for computing certified approximate GCD of \(n\) univariate polynomials ⋮ Nearest common root of a set of polynomials: a structured singular value approach ⋮ Computation of approximate polynomial GCDs and an extension ⋮ A unified approach to computing the nearest complex polynomial with a given zero
This page was built for publication:
