Gram-Schimdt get the Legendre polynomial












0












$begingroup$


When I apply the Gram-Schmidt algorithm I don't understand why I don't get the Legendre polynomials. When I apply this algorithm I always get monic polynomials whereas the Legendre polynomials aren't all monics.



So we want to get an orthogonal basis for the inner product : $langle f,grangle:=int fg$. To so we are going to apply G-S algorithm on the basis: $(1,X,X^2,...)$



We have : $P_0 = 1$, $P_1 = X$ and



$$P_2 = X^2 - frac{langle X^2, 1rangle}{|1 |}1 - frac{langle X^2, Xrangle}{|X |^2}X$$



Hence $P_2$ is a monic polynomial here while the second Legendre polynomial isn't monic.



And more generally we have :



$$P_n = X^n - sum_{k = 0}^{n-1} frac{langle X^n, P_irangle }{| P_i |^2} P_i$$
So all the polynomials I get thanks to G-S are monic.



So where am I going wrong here?



Thank you !










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    After G-S, you should normalize these $P$.
    $endgroup$
    – xbh
    Jan 23 at 15:54










  • $begingroup$
    @xbh Thank you for your answe, but what do you mean by normalize ? What calculation I need to do in order to normalize theses polynmials ?. Thank you !
    $endgroup$
    – dghkgfzyukz
    Jan 23 at 16:02










  • $begingroup$
    A vector with length/module $1$ is called a normalized vector. So for $boldsymbol x$, its normalization is $boldsymbol x / Vert boldsymbol x Vert$.
    $endgroup$
    – xbh
    Jan 23 at 16:07












  • $begingroup$
    Note that Legendre polynomials are generally normalised such that $P_n(1) = 1$. However, I don't know why such an unusual normalisation is chosen
    $endgroup$
    – Damien
    Jan 23 at 16:38












  • $begingroup$
    @Damien $X^2-1/3$ is a monic polynomial.
    $endgroup$
    – dghkgfzyukz
    Jan 23 at 16:45
















0












$begingroup$


When I apply the Gram-Schmidt algorithm I don't understand why I don't get the Legendre polynomials. When I apply this algorithm I always get monic polynomials whereas the Legendre polynomials aren't all monics.



So we want to get an orthogonal basis for the inner product : $langle f,grangle:=int fg$. To so we are going to apply G-S algorithm on the basis: $(1,X,X^2,...)$



We have : $P_0 = 1$, $P_1 = X$ and



$$P_2 = X^2 - frac{langle X^2, 1rangle}{|1 |}1 - frac{langle X^2, Xrangle}{|X |^2}X$$



Hence $P_2$ is a monic polynomial here while the second Legendre polynomial isn't monic.



And more generally we have :



$$P_n = X^n - sum_{k = 0}^{n-1} frac{langle X^n, P_irangle }{| P_i |^2} P_i$$
So all the polynomials I get thanks to G-S are monic.



So where am I going wrong here?



Thank you !










share|cite|improve this question











$endgroup$








  • 1




    $begingroup$
    After G-S, you should normalize these $P$.
    $endgroup$
    – xbh
    Jan 23 at 15:54










  • $begingroup$
    @xbh Thank you for your answe, but what do you mean by normalize ? What calculation I need to do in order to normalize theses polynmials ?. Thank you !
    $endgroup$
    – dghkgfzyukz
    Jan 23 at 16:02










  • $begingroup$
    A vector with length/module $1$ is called a normalized vector. So for $boldsymbol x$, its normalization is $boldsymbol x / Vert boldsymbol x Vert$.
    $endgroup$
    – xbh
    Jan 23 at 16:07












  • $begingroup$
    Note that Legendre polynomials are generally normalised such that $P_n(1) = 1$. However, I don't know why such an unusual normalisation is chosen
    $endgroup$
    – Damien
    Jan 23 at 16:38












  • $begingroup$
    @Damien $X^2-1/3$ is a monic polynomial.
    $endgroup$
    – dghkgfzyukz
    Jan 23 at 16:45














0












0








0





$begingroup$


When I apply the Gram-Schmidt algorithm I don't understand why I don't get the Legendre polynomials. When I apply this algorithm I always get monic polynomials whereas the Legendre polynomials aren't all monics.



So we want to get an orthogonal basis for the inner product : $langle f,grangle:=int fg$. To so we are going to apply G-S algorithm on the basis: $(1,X,X^2,...)$



We have : $P_0 = 1$, $P_1 = X$ and



$$P_2 = X^2 - frac{langle X^2, 1rangle}{|1 |}1 - frac{langle X^2, Xrangle}{|X |^2}X$$



Hence $P_2$ is a monic polynomial here while the second Legendre polynomial isn't monic.



And more generally we have :



$$P_n = X^n - sum_{k = 0}^{n-1} frac{langle X^n, P_irangle }{| P_i |^2} P_i$$
So all the polynomials I get thanks to G-S are monic.



So where am I going wrong here?



Thank you !










share|cite|improve this question











$endgroup$




When I apply the Gram-Schmidt algorithm I don't understand why I don't get the Legendre polynomials. When I apply this algorithm I always get monic polynomials whereas the Legendre polynomials aren't all monics.



So we want to get an orthogonal basis for the inner product : $langle f,grangle:=int fg$. To so we are going to apply G-S algorithm on the basis: $(1,X,X^2,...)$



We have : $P_0 = 1$, $P_1 = X$ and



$$P_2 = X^2 - frac{langle X^2, 1rangle}{|1 |}1 - frac{langle X^2, Xrangle}{|X |^2}X$$



Hence $P_2$ is a monic polynomial here while the second Legendre polynomial isn't monic.



And more generally we have :



$$P_n = X^n - sum_{k = 0}^{n-1} frac{langle X^n, P_irangle }{| P_i |^2} P_i$$
So all the polynomials I get thanks to G-S are monic.



So where am I going wrong here?



Thank you !







linear-algebra polynomials vector-spaces orthogonality






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Jan 23 at 15:55









Adrian Keister

5,27371933




5,27371933










asked Jan 23 at 15:47









dghkgfzyukzdghkgfzyukz

16112




16112








  • 1




    $begingroup$
    After G-S, you should normalize these $P$.
    $endgroup$
    – xbh
    Jan 23 at 15:54










  • $begingroup$
    @xbh Thank you for your answe, but what do you mean by normalize ? What calculation I need to do in order to normalize theses polynmials ?. Thank you !
    $endgroup$
    – dghkgfzyukz
    Jan 23 at 16:02










  • $begingroup$
    A vector with length/module $1$ is called a normalized vector. So for $boldsymbol x$, its normalization is $boldsymbol x / Vert boldsymbol x Vert$.
    $endgroup$
    – xbh
    Jan 23 at 16:07












  • $begingroup$
    Note that Legendre polynomials are generally normalised such that $P_n(1) = 1$. However, I don't know why such an unusual normalisation is chosen
    $endgroup$
    – Damien
    Jan 23 at 16:38












  • $begingroup$
    @Damien $X^2-1/3$ is a monic polynomial.
    $endgroup$
    – dghkgfzyukz
    Jan 23 at 16:45














  • 1




    $begingroup$
    After G-S, you should normalize these $P$.
    $endgroup$
    – xbh
    Jan 23 at 15:54










  • $begingroup$
    @xbh Thank you for your answe, but what do you mean by normalize ? What calculation I need to do in order to normalize theses polynmials ?. Thank you !
    $endgroup$
    – dghkgfzyukz
    Jan 23 at 16:02










  • $begingroup$
    A vector with length/module $1$ is called a normalized vector. So for $boldsymbol x$, its normalization is $boldsymbol x / Vert boldsymbol x Vert$.
    $endgroup$
    – xbh
    Jan 23 at 16:07












  • $begingroup$
    Note that Legendre polynomials are generally normalised such that $P_n(1) = 1$. However, I don't know why such an unusual normalisation is chosen
    $endgroup$
    – Damien
    Jan 23 at 16:38












  • $begingroup$
    @Damien $X^2-1/3$ is a monic polynomial.
    $endgroup$
    – dghkgfzyukz
    Jan 23 at 16:45








1




1




$begingroup$
After G-S, you should normalize these $P$.
$endgroup$
– xbh
Jan 23 at 15:54




$begingroup$
After G-S, you should normalize these $P$.
$endgroup$
– xbh
Jan 23 at 15:54












$begingroup$
@xbh Thank you for your answe, but what do you mean by normalize ? What calculation I need to do in order to normalize theses polynmials ?. Thank you !
$endgroup$
– dghkgfzyukz
Jan 23 at 16:02




$begingroup$
@xbh Thank you for your answe, but what do you mean by normalize ? What calculation I need to do in order to normalize theses polynmials ?. Thank you !
$endgroup$
– dghkgfzyukz
Jan 23 at 16:02












$begingroup$
A vector with length/module $1$ is called a normalized vector. So for $boldsymbol x$, its normalization is $boldsymbol x / Vert boldsymbol x Vert$.
$endgroup$
– xbh
Jan 23 at 16:07






$begingroup$
A vector with length/module $1$ is called a normalized vector. So for $boldsymbol x$, its normalization is $boldsymbol x / Vert boldsymbol x Vert$.
$endgroup$
– xbh
Jan 23 at 16:07














$begingroup$
Note that Legendre polynomials are generally normalised such that $P_n(1) = 1$. However, I don't know why such an unusual normalisation is chosen
$endgroup$
– Damien
Jan 23 at 16:38






$begingroup$
Note that Legendre polynomials are generally normalised such that $P_n(1) = 1$. However, I don't know why such an unusual normalisation is chosen
$endgroup$
– Damien
Jan 23 at 16:38














$begingroup$
@Damien $X^2-1/3$ is a monic polynomial.
$endgroup$
– dghkgfzyukz
Jan 23 at 16:45




$begingroup$
@Damien $X^2-1/3$ is a monic polynomial.
$endgroup$
– dghkgfzyukz
Jan 23 at 16:45










0






active

oldest

votes











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "69"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














draft saved

draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3084650%2fgram-schimdt-get-the-legendre-polynomial%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























0






active

oldest

votes








0






active

oldest

votes









active

oldest

votes






active

oldest

votes
















draft saved

draft discarded




















































Thanks for contributing an answer to Mathematics Stack Exchange!


  • Please be sure to answer the question. Provide details and share your research!

But avoid



  • Asking for help, clarification, or responding to other answers.

  • Making statements based on opinion; back them up with references or personal experience.


Use MathJax to format equations. MathJax reference.


To learn more, see our tips on writing great answers.




draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3084650%2fgram-schimdt-get-the-legendre-polynomial%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

MongoDB - Not Authorized To Execute Command

How to fix TextFormField cause rebuild widget in Flutter

in spring boot 2.1 many test slices are not allowed anymore due to multiple @BootstrapWith