Skip to content
Closed
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
2 changes: 1 addition & 1 deletion notes/notes.org
Original file line number Diff line number Diff line change
Expand Up @@ -4990,7 +4990,7 @@ Write down the Lagrange interpolant for nodes $(x_i)_{i=1}^m$ and values $(y_i)_
Find a basis so that \(V\) is triangular.
#+LATEX: \begin{hidden}
Easier to build than Lagrange, but: coefficient finding costs \(O (n^2)\).
\[\varphi _j (x) = \prod _{k = 1}^{j - 1} (x - x_k) . \]
\[\varphi _j (x) = \prod _{k = 1}^{j} (x - x_k) . \]
Copy link
Copy Markdown
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Technically, that depends on the numbering. I would agree with your change if the numbering started at zero:

Suggested change
\[\varphi _j (x) = \prod _{k = 1}^{j} (x - x_k) . \]
\[\varphi _j (x) = \prod _{k = 1}^{j} (x - x_k) . \qquad (j\in\{0,\dots,n-1\})\]

but then that's inconsistent with Lagrange.

Copy link
Copy Markdown
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

My counterproposal to this is in #26. Could you take a look?

(At least) two possibilities for coefficient finding:

- Set up \(V\), run forward substitution.
Expand Down
Loading