Entity usage

From MaRDI portal

This page lists pages that use the given entity (e.g. Q42). The list is sorted by descending page ID, so that newer pages are listed first.

List of pages that use a given entity

Showing below up to 26 results in range #1 to #26.

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)

  1. Challenge to fast and stable computation of approximate univariate GCD, based on displacement structures: Label: en
  2. An effective implementation of a symbolic-numeric cylindrical algebraic decomposition for optimization problems: Label: en
  3. Refining and verifying the solution of a linear system: Label: en
  4. Empirical study of an evaluation-based subdivision algorithm for complex root isolation: Label: en
  5. GCD of multivariate approximate polynomials using beautification with the subtractive algorithm: Label: en
  6. Synthetic division in the context of indefinite summation: Label: en
  7. A construction of injective parameterizations of domains for isogeometric applications: Label: en
  8. Numerical stability of barycentric Hermite root-finding: Label: en
  9. Implicitization of curves and surfaces using predicted support: Label: en
  10. Fast estimates of Hankel matrix condition numbers and numeric sparse interpolation: Label: en
  11. Roots of the derivatives of some random polynomials: Label: en
  12. Univariate polynomial root-finding by arming with constraints: Label: en
  13. Generating invariants of hybrid systems via sums-of-squares of polynomials with rational coefficients: Label: en
  14. An improved method for evaluating Max Noether conditions: Label: en
  15. A subresultant based subspace method for the computation of polynomial GCDs: Label: en
  16. Arrangement computation for planar algebraic curves: Label: en
  17. Using weighted norms to find nearest polynomials satisfying linear constraints: Label: en
  18. Extended companion matrix for approximate GCD: Label: en
  19. Stokes phenomenon: Label: en
  20. An improvement in the lattice construction process of approximate polynomial GCD over integers: Label: en
  21. Schönhage-Strassen algorithm with MapReduce for multiplying terabit integers: Label: en
  22. A regularization method for computing approximate invariants of plane curves singularities: Label: en
  23. A study of Hensel series in general case: Label: en
  24. On calculating the rate of linear convergence of non-linear transformed sequences: Label: en
  25. Interval function and its linear least-squares approximation: Label: en
  26. Numerical calculation of H-bases for positive dimensional varieties: Label: en

View (previous 50 | next 50) (20 | 50 | 100 | 250 | 500)