Computation of Minkowski values of polynomials over complex sets
From MaRDI portal
Publication:1826500
DOI10.1023/B:NUMA.0000027725.80448.D8zbMATH Open1073.12006MaRDI QIDQ1826500FDOQ1826500
Rida T. Farouki, Chang Yong Han
Publication date: 6 August 2004
Published in: Numerical Algorithms (Search for Journal in Brave)
Cited In (6)
- Boundary evaluation algorithms for Minkowski combinations of complex sets using topological analysis of implicit curves
- Minkowski products of unit quaternion sets
- Evaluating the boundary and covering degree of planar Minkowski sums and other geometrical convolutions
- Computing the Minkowski Value of the Exponential Function over a Complex Disk
- Title not available (Why is that?)
- Algorithms for Minkowski products and implicitly-defined complex sets
Recommendations
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Title not available (Why is that?) π π
- Algorithms for Minkowski products and implicitly-defined complex sets π π
- COMPUTATION OF DIMENSION POLYNOMIALS π π
- Polynomial approximations in the complex plane π π
- Computational complexity of computing polynomials over the fields of real and complex numbers π π
- On the computation of minimal polynomials π π
- Complexification norms and estimates for polynomials π π
- Computing the Minkowski Value of the Exponential Function over a Complex Disk π π
This page was built for publication: Computation of Minkowski values of polynomials over complex sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1826500)