Robust plotting of generalized lemniscates
From MaRDI portal
Constructing the tensor product Bernstein form over a bounding rectangle, the authors develop here a robust adaptive algorithm to plot lemniscates employing quadtree subdivision to efficiently achieve any desired resolution. Moreover, singular points of the lemniscate, if any may be explicitly identified and incorporated into the subdivision.
Recommendations
Cites work
- A fast technique for the generation of the spectral set of a polytope of polynomials
- A Generalization of a Theorem of Bôcher
- A simple general proof of Kharitonov's generalized stability criterion
- Algorithm 812: BPOLY
- Algorithms for Minkowski products and implicitly-defined complex sets
- Algorithms for polynomials in Bernstein form
- An elementary proof of Kharitonov's stability theorem with extensions
- Complete characterization of the spherical spectral set
- Frequency domain criteria for l/sup p/-robust stability of continuous linear systems
- scientific article; zbMATH DE number 1571495 (Why is no real title available?)
- scientific article; zbMATH DE number 3160700 (Why is no real title available?)
- scientific article; zbMATH DE number 3936379 (Why is no real title available?)
- scientific article; zbMATH DE number 3179593 (Why is no real title available?)
- scientific article; zbMATH DE number 3603582 (Why is no real title available?)
- scientific article; zbMATH DE number 3636452 (Why is no real title available?)
- scientific article; zbMATH DE number 1235882 (Why is no real title available?)
- scientific article; zbMATH DE number 486467 (Why is no real title available?)
- scientific article; zbMATH DE number 2152060 (Why is no real title available?)
- scientific article; zbMATH DE number 5050658 (Why is no real title available?)
- scientific article; zbMATH DE number 3406720 (Why is no real title available?)
- Minkowski geometric algebra of complex sets
- Neighbor finding techniques for images represented by quadtrees
- Numerical condition of polynomials in different forms
- On the condition of algebraic equations
- On the Numerical Condition of Bernstein-Bezier Subdivision Processes
- On the numerical condition of polynomials in Bernstein form
- On the optimal stability of the Bernstein basis
- On the spectral set for a family of polynomials
- On the stability properties of polynomials with perturbed coefficients
- Pseudozeros of multivariate polynomials
- Pseudozeros of polynomials and pseudospectra of companion matrices
- Robust arithmetic for multivariate Bernstein-form polynomials
- Robust Hurwitz l/sup p/ stability of polynomials with complex coefficients
- Robust stability of a family of disc polynomials
- Robust stability under complex perturbations of parameters
- Root Neighborhoods of a Polynomial
- Stability analysis of polynomials with coefficients in disks
Cited in
(5)- Lemniscates 3D: A CAGD primitive?
- Computing the Minkowski Value of the Exponential Function over a Complex Disk
- scientific article; zbMATH DE number 1263363 (Why is no real title available?)
- Shape control of 3D lemniscates
- Root neighborhoods, generalized lemniscates, and robust stability of dynamic systems
This page was built for publication: Robust plotting of generalized lemniscates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1886267)
