You are using the new UI (Beta).Return to the original UI

This page has been automatically translated by machine translation. Please note that translations may not be entirely accurate.

keisanHigh-precision calculations for everyday life and work

Lagrange Interpolation (up to 11 points)

Author: tonagaiExecutions: 20425

※ This library was created by a member. This site is not responsible for its content.

Manage Bookmarks
Find an nth-degree polynomial that passes through n+1 points, all with distinct x-coordinates, using Lagrange interpolation.
Even if n is less than 11 and some points are unnecessary, please enter 0 for those points.
Number of data points
(x0, y0) = (
,)
(x1, y1) = (
,)
(x2, y2) = (
,)
(x3, y3) = (
,)
(x4, y4) = (
,)
(x5, y5) = (
,)
(x6,y6)=(
,)
(x7, y7) = (
,)
(x8, y8) = (
,)
(x9, y9) = (
,)
(x10,y10)=(
,)
Minimum x-coordinate to display
Maximum x-coordinate to display
Number of divisions

No customer feedback for this calculation yet.