The incomplete gamma function

Fechada
#2,075 3 comentários 0 reações 0 responsáveis Ver no GitHub

Mantenedores costumam responder em até 1 dia

Ninguém assumiu esta issue ainda.

Avaliação

Dificuldade
5/5
Tempo estimado
Mais de uma semana
Facilidade para iniciantes
35/100
Tipo de issue
Funcionalidade
Clareza
Claramente especificada
Status de atividade
Ativa
Stack de tecnologia
csharp
Domínio
backend

Direção de pesquisa

Start by reading the referenced issue #1501 and Rubi file 8.6 to understand the proposed order and test harness; the payload names no repository paths or test files. The work includes complex upper incomplete gamma evaluation, branch conventions, derivatives, LaTeX and SymPy forms, and integration rules, with further Psi and lnGamma work noted. Done means implementing and validating these pieces against the stated identities and working precision.

Escrita pelo modelo de indexação a partir do texto da issue.

Descrição

The upper incomplete gamma function, Gamma(a, x) = int_x^oo t^(a - 1) e^(-t) dt, is what the last open item of #180 needs: int t^(-1/2) e^(-t^(-2)) dt is 2 sqrt(t) e^(-1/t^2) - 2 Gamma(3/4, 1/t^2). It is also most of Rubi's file 8.6, which #1469 counts at 233 problems. The file uses the two-argument GAMMA 628 times, against 34 for the one-argument one. @Happypig375's note there was to implement family 8's functions before v3.

What it takes, in #1501's order:

  1. The harness. Read 8.6, mapping GAMMA(a, x) to gamma(a, x), Psi(n, x) to polygamma(n, x) (#2068), and lnGAMMA. Then the count is visible before anything lands.
  2. The node. gamma(a, x), upper, as Mathematica's Gamma[a, x] and mpmath's gammainc(a, x) are. It needs:
    • its branch convention written down;
    • evaluation to the working precision for complex a and x: the series for small |x|, the continued fraction for large |x|, and Gamma(0, x) = E_1(x) and the other non-positive whole a handled on their own;
    • the derivative in x, -x^(a - 1) e^(-x);
    • its LaTeX and SymPy forms (uppergamma).
  3. Integration rules, each naming its identity: int x^(a - 1) e^(-x) dx = -Gamma(a, x) for a non-whole a, and int Gamma(a, x) dx = x Gamma(a, x) - Gamma(a + 1, x).

8.6's lnGAMMA problems need Psi(n, x) at negative n, the repeated integrals of ln Gamma, which are a further step.

🤖 Generated with Claude Code

https://claude.ai/code/session_012sonx8iAspMiwRwokT1Ura

Linguagem predominante
C#
Estrelas
832
Forks
79
Merge médio
1h 12min
PRs com merge (30d)
518

Preparar o ambiente

Primeiros passos

  1. Leia a issue inteira e depois o guia de contribuição do projeto.
  2. Comente na issue dizendo que vai assumir — evita que duas pessoas façam o mesmo trabalho.
  3. Faça um fork do repositório e trabalhe em uma branch.
  4. Abra um pull request que referencie o número da issue.

Mais de ASC-Community/AngouriMath

Todas as issues de ASC-Community/AngouriMath

Issues semelhantes

Mais issues de C#

Receba novas issues na sua caixa de entrada

Um resumo curto de issues do GitHub para quem está começando.