Pages that link to "Item:Q5355581"
From MaRDI portal
The following pages link to <tex>$QR$</tex>Factoring to Compute the GCD of Univariate Approximate Polynomials (Q5355581):
Displaying 35 items.
- Polynomial computations for blind image deconvolution (Q281962) (← links)
- A quadratically convergent algorithm for structured low-rank approximation (Q285440) (← links)
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials (Q338517) (← links)
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007) (← links)
- The computation of multiple roots of a polynomial (Q425345) (← links)
- Numerical proper reparametrization of parametric plane curves (Q464649) (← links)
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
- The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
- Approximate polynomial GCD over integers (Q651873) (← links)
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix (Q989131) (← links)
- Survey on the theory and applications of \(\mu\)-bases for rational curves and surfaces (Q1675354) (← links)
- Factorization results for left polynomials in some associative real algebras: state of the art, applications, and open questions (Q1713132) (← links)
- Kempe's universality theorem for rational space curves (Q1750390) (← links)
- Obtaining exact interpolation multivariate polynomial by approximation (Q1937782) (← links)
- A geometrical approach to finding multivariate approximate LCMs and GCDs (Q1947122) (← links)
- Toward the best algorithm for approximate GCD of univariate polynomials (Q1994881) (← links)
- Blind image deconvolution via Hankel based method for computing the GCD of polynomials (Q1996974) (← links)
- Inversion, degree, reparametrization and implicitization of improperly parametrized planar curves using \(\mu \)-basis (Q2020372) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- Computing the polynomial remainder sequence via Bézout matrices (Q2448361) (← links)
- Obtaining exact value by approximate computations (Q2464301) (← links)
- A structured rank-revealing method for Sylvester matrix (Q2469622) (← links)
- Structured total least norm and approximate GCDs of inexact polynomials (Q2480912) (← links)
- Matrix representation of the shifting operation and numerical properties of the ERES method for computing the greatest common divisor of sets of many polynomials (Q2511181) (← links)
- The Sylvester Resultant Matrix and Image Deblurring (Q2945991) (← links)
- Regularization and Matrix Computation in Numerical Polynomial Algebra (Q3576574) (← links)
- GPGCD, an Iterative Method for Calculating Approximate GCD, for Multiple Univariate Polynomials (Q3587712) (← links)
- Filtering and smoothing formulas of AR(<i>p</i>)-modulated Poisson processes (Q5086307) (← links)
- The Computation of Multiple Roots of a Bernstein Basis Polynomial (Q5216781) (← links)
- Mixed and componentwise condition numbers for matrix decompositions (Q5919810) (← links)
- On rank and null space computation of the generalized Sylvester matrix (Q5962121) (← links)
- SLRA Interpolation for Approximate GCD of Several Multivariate Polynomials (Q6081970) (← links)
- Approximate GCD of several multivariate sparse polynomials based on SLRA interpolation (Q6615409) (← links)
- A dataset for suggesting variable orderings for cylindrical algebraic decompositions (Q6660322) (← links)
