What is this generalization of the Chebyshev polynomials?











up vote
5
down vote

favorite
1












For $varepsilon>0$ consider the tridiagonal matrix



$$L_{varepsilon}=begin{bmatrix}
0 & 1 & & & & & & \
1 & varepsilon & 1 & & & & & \
& 1 & 2 varepsilon & 1 & & & \
& & 1 & 3 varepsilon & 1 & & & \
& & & 1 & 4 varepsilon & 1 & & \
& & & & ddots & ddots & ddots & \
end{bmatrix}$$



with all blank entries equal to zero. A column vector $$Phi = begin{bmatrix} Phi_0 \ Phi_1 \ Phi_2 \ vdots end{bmatrix}$$ is an eigenvector $$L_{varepsilon} Phi = u Phi$$ iff the entries $Phi_h = Phi_{h}(u; varepsilon)$ satisfy a three-term recurrence $$Phi_{h-1} (u; varepsilon) + h varepsilon Phi_h(u; varepsilon) + Phi_{h+1}(u; varepsilon) = uPhi_{h}(u;varepsilon)$$ for $h geq 0$ with convention $Phi_{-1} = 0$, which is equivalent to
$$Phi_{h-1} (u; varepsilon) + (h varepsilon - u) Phi_h(u; varepsilon) + Phi_{h+1}(u; varepsilon) = 0.$$



Question: Can one identify the $Phi_h(u; varepsilon)$ with a known function, possibly a specialization or degeneration of the Gauss hypergeometric function?



As $varepsilon rightarrow 0$, the diagonal in $L_{varepsilon}$ disappears and $Phi_{h}(u; 0)$ are the Chebyshev polynomials. The recurrence above seems close to that of the Gegenbauer polynomials but is not exactly the same. Any help would be greatly appreciated!










share|cite|improve this question


























    up vote
    5
    down vote

    favorite
    1












    For $varepsilon>0$ consider the tridiagonal matrix



    $$L_{varepsilon}=begin{bmatrix}
    0 & 1 & & & & & & \
    1 & varepsilon & 1 & & & & & \
    & 1 & 2 varepsilon & 1 & & & \
    & & 1 & 3 varepsilon & 1 & & & \
    & & & 1 & 4 varepsilon & 1 & & \
    & & & & ddots & ddots & ddots & \
    end{bmatrix}$$



    with all blank entries equal to zero. A column vector $$Phi = begin{bmatrix} Phi_0 \ Phi_1 \ Phi_2 \ vdots end{bmatrix}$$ is an eigenvector $$L_{varepsilon} Phi = u Phi$$ iff the entries $Phi_h = Phi_{h}(u; varepsilon)$ satisfy a three-term recurrence $$Phi_{h-1} (u; varepsilon) + h varepsilon Phi_h(u; varepsilon) + Phi_{h+1}(u; varepsilon) = uPhi_{h}(u;varepsilon)$$ for $h geq 0$ with convention $Phi_{-1} = 0$, which is equivalent to
    $$Phi_{h-1} (u; varepsilon) + (h varepsilon - u) Phi_h(u; varepsilon) + Phi_{h+1}(u; varepsilon) = 0.$$



    Question: Can one identify the $Phi_h(u; varepsilon)$ with a known function, possibly a specialization or degeneration of the Gauss hypergeometric function?



    As $varepsilon rightarrow 0$, the diagonal in $L_{varepsilon}$ disappears and $Phi_{h}(u; 0)$ are the Chebyshev polynomials. The recurrence above seems close to that of the Gegenbauer polynomials but is not exactly the same. Any help would be greatly appreciated!










    share|cite|improve this question
























      up vote
      5
      down vote

      favorite
      1









      up vote
      5
      down vote

      favorite
      1






      1





      For $varepsilon>0$ consider the tridiagonal matrix



      $$L_{varepsilon}=begin{bmatrix}
      0 & 1 & & & & & & \
      1 & varepsilon & 1 & & & & & \
      & 1 & 2 varepsilon & 1 & & & \
      & & 1 & 3 varepsilon & 1 & & & \
      & & & 1 & 4 varepsilon & 1 & & \
      & & & & ddots & ddots & ddots & \
      end{bmatrix}$$



      with all blank entries equal to zero. A column vector $$Phi = begin{bmatrix} Phi_0 \ Phi_1 \ Phi_2 \ vdots end{bmatrix}$$ is an eigenvector $$L_{varepsilon} Phi = u Phi$$ iff the entries $Phi_h = Phi_{h}(u; varepsilon)$ satisfy a three-term recurrence $$Phi_{h-1} (u; varepsilon) + h varepsilon Phi_h(u; varepsilon) + Phi_{h+1}(u; varepsilon) = uPhi_{h}(u;varepsilon)$$ for $h geq 0$ with convention $Phi_{-1} = 0$, which is equivalent to
      $$Phi_{h-1} (u; varepsilon) + (h varepsilon - u) Phi_h(u; varepsilon) + Phi_{h+1}(u; varepsilon) = 0.$$



      Question: Can one identify the $Phi_h(u; varepsilon)$ with a known function, possibly a specialization or degeneration of the Gauss hypergeometric function?



      As $varepsilon rightarrow 0$, the diagonal in $L_{varepsilon}$ disappears and $Phi_{h}(u; 0)$ are the Chebyshev polynomials. The recurrence above seems close to that of the Gegenbauer polynomials but is not exactly the same. Any help would be greatly appreciated!










      share|cite|improve this question













      For $varepsilon>0$ consider the tridiagonal matrix



      $$L_{varepsilon}=begin{bmatrix}
      0 & 1 & & & & & & \
      1 & varepsilon & 1 & & & & & \
      & 1 & 2 varepsilon & 1 & & & \
      & & 1 & 3 varepsilon & 1 & & & \
      & & & 1 & 4 varepsilon & 1 & & \
      & & & & ddots & ddots & ddots & \
      end{bmatrix}$$



      with all blank entries equal to zero. A column vector $$Phi = begin{bmatrix} Phi_0 \ Phi_1 \ Phi_2 \ vdots end{bmatrix}$$ is an eigenvector $$L_{varepsilon} Phi = u Phi$$ iff the entries $Phi_h = Phi_{h}(u; varepsilon)$ satisfy a three-term recurrence $$Phi_{h-1} (u; varepsilon) + h varepsilon Phi_h(u; varepsilon) + Phi_{h+1}(u; varepsilon) = uPhi_{h}(u;varepsilon)$$ for $h geq 0$ with convention $Phi_{-1} = 0$, which is equivalent to
      $$Phi_{h-1} (u; varepsilon) + (h varepsilon - u) Phi_h(u; varepsilon) + Phi_{h+1}(u; varepsilon) = 0.$$



      Question: Can one identify the $Phi_h(u; varepsilon)$ with a known function, possibly a specialization or degeneration of the Gauss hypergeometric function?



      As $varepsilon rightarrow 0$, the diagonal in $L_{varepsilon}$ disappears and $Phi_{h}(u; 0)$ are the Chebyshev polynomials. The recurrence above seems close to that of the Gegenbauer polynomials but is not exactly the same. Any help would be greatly appreciated!







      special-functions hypergeometric-function orthogonal-polynomials chebyshev-polynomials






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Nov 18 at 0:03









      Swallow Tail

      411




      411



























          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',
          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%2f3002987%2fwhat-is-this-generalization-of-the-chebyshev-polynomials%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown






























          active

          oldest

          votes













          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes
















           

          draft saved


          draft discarded



















































           


          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3002987%2fwhat-is-this-generalization-of-the-chebyshev-polynomials%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

          Le Mesnil-Réaume

          Ida-Boy-Ed-Garten

          web3.py web3.isConnected() returns false always