Approximate parametrization of plane algebraic curves by linear systems of curves (Q631016): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computation of the topology of real algebraic space curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5386174 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterization in finite precision / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4227296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards factoring bivariate approximate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2754282 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Certified approximate univariate GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the numerical condition of algebraic curves and surfaces. I: Implicit equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Irreducible decomposition of curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Numerical parameterization of curves and surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate factorization of multivariate polynomials using singular value decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of parametrizing curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrization of approximate algebraic curves by lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrization of approximate algebraic surfaces by lines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distance bounds of \(\varepsilon\)-points on hypersurfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate parametrization of plane algebraic curves by linear systems of curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree formulae for offset curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate multivariate polynomial factorization based on zero-sum relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formula for separating small roots of a polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: Normal parametrizations of algebraic plane curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite piecewise polynomial parametrization of plane rational algebraic curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial algorithms in computer algebra / rank
 
Normal rank

Latest revision as of 22:13, 3 July 2024

scientific article
Language Label Description Also known as
English
Approximate parametrization of plane algebraic curves by linear systems of curves
scientific article

    Statements

    Approximate parametrization of plane algebraic curves by linear systems of curves (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 March 2011
    0 references
    The authors consider the problem of computing parameterizations of algebraic plane curves which might come from a perturbed rational algebraic curve. In general a slight perturbation of a rational algebraic curve need not to be rational any more. Therefore, the notion of \(\epsilon\)-rationality for a certain class of affine algebraic curves is introduced, where \(\epsilon>0\) is a given tolerance. In what follows, an algorithm is described which computes a parameterization of a rational curve which approximates a given \(\epsilon\)-rational curve. Moreover, it is shown that the output and input curves of the algorithm are of the same degree and have the same points at infinity and hence the same real asymptotes. Afterwards, some illustrative examples point out the suitability of the algorithm. At the end the authors discuss an approach for measuring and estimating the distance between the input and output curves of the presented algorithm.
    0 references
    0 references
    parametrization
    0 references
    plane algebraic curves
    0 references
    linear systems of curves
    0 references
    rational algebraic curve
    0 references
    affine algebraic curves
    0 references
    algorithm
    0 references
    0 references
    0 references