-
Notifications
You must be signed in to change notification settings - Fork 3
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Redefine channels such that the number of non-zero subgrids is minimal #199
Comments
Yesterday I realized that this problem is actually one of linear (in)dependence and therefore one can frame this as linear algebra problem. Imagine we have a grid with only one bin and one order, only consisting of A convolution then can be written as where is the important bit. The objects In essense, this just transforms the (usually) flavour basis contained expressed by We can now reformulate the problem in terms of linear algebra: find a decomposition I believe this can be done by using a (rank-revealing?) LU decomposition with partial pivoting. This would decompose where |
Having read about the CR factorization (alternatively read the preprint) I believe that is what we want, instead of an LU factorization. We can swap the positions of the grids with
Since where |
Hawaiian Vrap produces luminosities that
Here's an example for the first bin of
DYE866R_P
, all other bins have the same tuples, but with different factors:One strategy to make the luminosity function more readable and to optimize it is to
l = 0
into four entries)The text was updated successfully, but these errors were encountered: