Problem 43642. Euclidean distance from a point to a polynomial

Like (3)

Difficulty:Rate

Solve Later
Add To GroupÃ‚

Solution 1038560

Submitted on 30 Oct 2016 by Alfonso Nieto-Castanon

Size: 32
This is the leading solution.

This solution is locked. To view this solution, you need to solve the problem first.

Solve This Problem View on Solution Map

2 Comments

2 Comments

Zhengyi on 2 Feb 2018

Will not solution like this be sooo much slower than simple loops?! Short yes, efficient no.

Zhengyi on 2 Feb 2018

well, I think I was wrong...This solution is slower if the degree of the polynomial is small but much faster if the degree gets higher...solving polynomials of high degree is really slow with ROOTS.

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 43642. Euclidean distance from a point to a polynomial

Suggested Problems

More from this Author4

Community Treasure Hunt

Problem 43642. Euclidean distance from a point to a polynomial

Suggested Problems

More from this Author4

Community Treasure Hunt

Players