The following pages link to (Q4227296):
Displaying 50 items.
- Polynomial computations for blind image deconvolution (Q281962) (← links)
- The computation of the degree of an approximate greatest common divisor of two Bernstein polynomials (Q338517) (← links)
- Approximate Gröbner bases, overdetermined polynomial systems, and approximate GCDs (Q355525) (← links)
- Pseudospectra of exponential matrix polynomials (Q384997) (← links)
- GPGCD: an iterative method for calculating approximate GCD of univariate polynomials (Q385007) (← links)
- A fast recursive orthogonalization scheme for the Macaulay matrix (Q396030) (← links)
- The computation of multiple roots of a polynomial (Q425345) (← links)
- A heuristic verification of the degree of the approximate GCD of two univariate polynomials (Q466858) (← links)
- Overdetermined Weierstrass iteration and the nearest consistent system (Q476879) (← links)
- New progress in real and complex polynomial root-finding (Q552308) (← links)
- Bernstein-Bézoutian matrices (Q598205) (← links)
- Parametrization of approximate algebraic curves by lines (Q598227) (← links)
- The calculation of the degree of an approximate greatest common divisor of two polynomials (Q611832) (← links)
- Approximate parametrization of plane algebraic curves by linear systems of curves (Q631016) (← links)
- A subdivision method for computing nearest gcd with certification (Q638509) (← links)
- Root-finding by expansion with independent constraints (Q662237) (← links)
- Two methods for the calculation of the degree of an approximate greatest common divisor of two inexact polynomials (Q694553) (← links)
- Using symmetries in the eigenvalue method for polynomial systems (Q731929) (← links)
- Recursive polynomial remainder sequence and its subresultants (Q947487) (← links)
- The ERES method for computing the approximate GCD of several polynomials (Q969304) (← links)
- A non-linear structure preserving matrix method for the low rank approximation of the Sylvester resultant matrix (Q989131) (← links)
- A computational study of ruled surfaces (Q1006652) (← links)
- Nearest multivariate system with given root multiplicities (Q1015156) (← links)
- On real factors of real interval polynomials (Q1025398) (← links)
- An algorithm for computing certified approximate GCD of \(n\) univariate polynomials (Q1295792) (← links)
- Certified approximate univariate GCDs (Q1358910) (← links)
- A robust solution of the generalized polynomial Bézout identity (Q1827508) (← links)
- Computation of approximate polynomial GCDs and an extension (Q1854432) (← links)
- Structured low rank approximation (Q1874666) (← links)
- Obtaining exact interpolation multivariate polynomial by approximation (Q1937782) (← links)
- A geometrical approach to finding multivariate approximate LCMs and GCDs (Q1947122) (← links)
- The computation of the degree of the greatest common divisor of three Bernstein basis polynomials (Q1989191) (← links)
- Approximate polynomial GCD by approximate syzygies (Q2009224) (← links)
- The computation of the greatest common divisor of three bivariate Bernstein polynomials defined in a rectangular domain (Q2029179) (← links)
- Revisiting approximate polynomial common divisor problem and noisy multipolynomial reconstruction (Q2179403) (← links)
- An approximate factorisation of three bivariate Bernstein basis polynomials defined in a triangular domain (Q2226320) (← links)
- Rational Hausdorff divisors: a new approach to the approximate parametrization of curves (Q2252430) (← links)
- Computing approximate greatest common right divisors of differential polynomials (Q2309522) (← links)
- Variable projection methods for approximate (greatest) common divisor computations (Q2357371) (← links)
- The amended DSeSC power method for polynomial root-finding (Q2387379) (← links)
- On rational functions without Froissart doublets (Q2413468) (← links)
- An ODE-based method for computing the approximate greatest common divisor of polynomials (Q2420166) (← links)
- Guessing singular dependencies (Q2437325) (← links)
- Obtaining exact value by approximate computations (Q2464301) (← links)
- Approximate greatest common divisor of many polynomials, generalised resultants, and strength of approximation (Q2475938) (← links)
- Structured total least norm and approximate GCDs of inexact polynomials (Q2480912) (← links)
- Solving over-determined systems by the subresultant method (with an appendix by Marc Chardin) (Q2481474) (← links)
- Distance bounds of \(\varepsilon\)-points on hypersurfaces (Q2503306) (← links)
- Algebraic properties of robust Padé approximants (Q2514844) (← links)
- Parametrization of approximate algebraic surfaces by lines (Q2573848) (← links)
