Code Monkey home page Code Monkey logo

Comments (3)

kburns avatar kburns commented on June 27, 2024 1

Great! This looks like a great package and it would be fantastic to have it support spin-weighted transforms.

Yes the Legendre polynomials are just a special/particular case of Jacobi polynomials, and all the identities are formulas that people use for them generally apply to Jacobi polynomials more broadly, just with modified coefficients. In general the "spin weight" $s$ in the spin weighted spherical harmonics tells you how different the Jacobi $(a,b)$ parameters are from those for the regular associated Legendre functions. In theory the spin weight can be arbitrarily large, in which case the polynomials behave quite differently. But in practice, $s$ is typically just 0 or 1 or 2 (corresponding to the rank of the tensor field you're interested in), so the recursions and envelopes, etc., behave pretty similarly to the regular associated Legendre functions.

There are many different recurrence formulas that can be used, but the easiest place to start is probably to just generalize the current recurrences to work for general spin weights. I'll need to take a closer look to understand how over/underflow in the recursions is being handled here, but the typical strategies should also work for moderate spin weights.

from associatedlegendrepolynomials.jl.

milankl avatar milankl commented on June 27, 2024

@jmert do you have an opinion on this ☝🏼 ? It shouldn't be much work on your side, but at the moment it sounds easier to make this part of AssociatedLegendrePolynomials than to branch this idea off somehow.

from associatedlegendrepolynomials.jl.

jmert avatar jmert commented on June 27, 2024

Yes, I'm generically interested in supporting enough computation that one could calculate the spin-weighted spherical harmonics. I've never actually done that, though, because the reference I've seen before always resort to calculate the spin-weighted spherical harmonic in terms of the Wigner d-matrices, which end up being a completely different calculation.

I'll put reviewing the paper you referenced on my TODO list to review more closely. On a quick glance, it looks like the function P used in the equations you referenced are for the Jacobi polynomials rather than the Legendre polynomials, but wikipedia says they're related.

If there's a way to "boost" by ±1 spin with some kind of simple relation, I think that could be accommodated with relative ease. The Jacobi recurrence relations have a mixture of coefficients, so maybe there's a not-too-complicated way to mix the results of the spin-0 terms to iteratively generate different spins. (Unless we're very lucky, I'd expect that route will be neither the most performant nor the most numerically accurate, but the proof-of-concept would be a big step on its own worth doing.)

from associatedlegendrepolynomials.jl.

Related Issues (11)

Recommend Projects

  • React photo React

    A declarative, efficient, and flexible JavaScript library for building user interfaces.

  • Vue.js photo Vue.js

    🖖 Vue.js is a progressive, incrementally-adoptable JavaScript framework for building UI on the web.

  • Typescript photo Typescript

    TypeScript is a superset of JavaScript that compiles to clean JavaScript output.

  • TensorFlow photo TensorFlow

    An Open Source Machine Learning Framework for Everyone

  • Django photo Django

    The Web framework for perfectionists with deadlines.

  • D3 photo D3

    Bring data to life with SVG, Canvas and HTML. 📊📈🎉

Recommend Topics

  • javascript

    JavaScript (JS) is a lightweight interpreted programming language with first-class functions.

  • web

    Some thing interesting about web. New door for the world.

  • server

    A server is a program made to process requests and deliver data to clients.

  • Machine learning

    Machine learning is a way of modeling and interpreting data that allows a piece of software to respond intelligently.

  • Game

    Some thing interesting about game, make everyone happy.

Recommend Org

  • Facebook photo Facebook

    We are working to build community through open source technology. NB: members must have two-factor auth.

  • Microsoft photo Microsoft

    Open source projects and samples from Microsoft.

  • Google photo Google

    Google ❤️ Open Source for everyone.

  • D3 photo D3

    Data-Driven Documents codes.