Pages that link to "Item:Q2541097"

The following pages link to The evaluation of the zeros of ill-conditioned polynomials. I, II (Q2541097):

Displaying 44 items.

• The Bernstein polynomial basis: a centennial retrospective (Q448993) (← links)
• Bound the number of limit cycles bifurcating from center of polynomial Hamiltonian system via interval analysis (Q508217) (← links)
• Incorporating the Havriliak-Negami dielectric model in the FD-TD method (Q544561) (← links)
• Accurate evaluation of a polynomial in Chebyshev form (Q555368) (← links)
• Numerical solution of two-point boundary value problems (Q583854) (← links)
• Iteration functions re-visited (Q730575) (← links)
• Error analysis of floating-point computation (Q771975) (← links)
• Some extensions of Bairstow's method (Q775002) (← links)
• Running error analysis of evaluation algorithms for bivariate polynomials in barycentric Bernstein form (Q818856) (← links)
• Evaluation algorithms for multivariate polynomials in Bernstein-Bézier form (Q860688) (← links)
• Error analysis of efficient evaluation algorithms for tensor product surfaces (Q935777) (← links)
• Componentwise inclusion and exclusion sets for solutions of quadratic equations in finite dimensional spaces (Q1079338) (← links)
• Practical problems arising for finding roots of nonlinear equations (Q1089744) (← links)
• On the numerical condition of polynomials in Bernstein form (Q1098225) (← links)
• Computing with barycentric polynomials (Q1181866) (← links)
• A note on upper bounds for ideal-theoretic problems (Q1185454) (← links)
• Hermite's method of separation of solutions of systems of algebraic equations and its applications (Q1208262) (← links)
• Algebraic pruning: a fast technique for curve and surface intersection (Q1389457) (← links)
• A statistical analysis of the numerical condition of multiple roots of polynomials. (Q1416369) (← links)
• Revisiting the problem of zeros of univariate scalar Béziers (Q1632405) (← links)
• Comparison of probabilistic algorithms for analyzing the components of an affine algebraic variety (Q1644578) (← links)
• Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm (Q1732167) (← links)
• On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis (Q1955532) (← links)
• On the trade-off between number of examples and precision of supervision in machine learning problems (Q2037897) (← links)
• A general method of finding new symplectic schemes for Hamiltonian mechanics (Q2109995) (← links)
• Computing the roots of sparse high-degree polynomials that arise from the study of random simplicial complexes (Q2173347) (← links)
• Polynomial factorization and the Q-D algorithm (Q2265258) (← links)
• On time-optimal trajectories in non-uniform mediums (Q2347576) (← links)
• A posteriori error bounds for the zeros of polynomials (Q2395673) (← links)
• On the roots of all-terminal reliability polynomials (Q2400560) (← links)
• Stability of rootfinding for barycentric Lagrange interpolants (Q2454385) (← links)
• A two-steps algorithm for approximating real roots of a polynomial in Bernstein basis (Q2479468) (← links)
• On the generalized Ball bases (Q2491236) (← links)
• Direkte Verfahren zur Berechnung der Nullstellen von Polynomen (Q2535812) (← links)
• A class of iterative methods for holomorphic functions (Q2545043) (← links)
• A posteriori error bounds for the zeros of a polynomial (Q2552011) (← links)
• Evaluation of the derivative of a polynomial in Bernstein form (Q2570696) (← links)
• The Durand-Kerner polynomials roots-finding method in case of multiple roots (Q2640316) (← links)
• Running error for the evaluation of rational Bézier surfaces (Q2654177) (← links)
• A comparison of the average case numerical condition of the power and bernstein polynomial bases (Q2752257) (← links)
• Generalized Heine–Stieltjes and Van Vleck polynomials associated with two-level, integrable BCS models (Q3301375) (← links)
• Numerical methods for spectral theory (Q5236814) (← links)
• Eine zur Programmierung geeignete Modifikation des Graeffe‐Verfahrens (Q5627590) (← links)
• An efficient method of finding new symplectic schemes for Hamiltonian mechanics problems with the aid of parametric Gröbner bases (Q6117702) (← links)