You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
This spans all polynomials in x,y,z mod the constraint p(x/z,y/z) =1, which is in fact a polynomial constraint: if p is degree d just multiply through by z^d.
This basis is orthogonal w.r.t. \int_0^1 \int_{z B} f(x,y,z) g(x,y,z) dx dy dz
To get back to OPs in 2-variables we would then construct the connection matrix. Since Q_{m,k,i} spans all polynomials, it contains 2-variable polynomials as a sub space. We can compute this connection matrix by Lanczos (that is, multiply by x and y).
The text was updated successfully, but these errors were encountered:
I was thinking this basis would contain both all polynomials and some other things. Doing 2-variable Lanczos would then find out how to get out just the OPs.
I think we can do any star like geometry as long as we can do the boundary: consider it as
for
z = 0..1
(disk being classic example). Then we can construct OPs in 3-variablesx,y,z
from boundary OPs in 2 variablesY_{m,k}(x,y)
asClaims to be double checked:
x,y,z
mod the constraintp(x/z,y/z) =1
, which is in fact a polynomial constraint: ifp
is degreed
just multiply through byz^d
.\int_0^1 \int_{z B} f(x,y,z) g(x,y,z) dx dy dz
To get back to OPs in 2-variables we would then construct the connection matrix. Since
Q_{m,k,i}
spans all polynomials, it contains 2-variable polynomials as a sub space. We can compute this connection matrix by Lanczos (that is, multiply byx
andy
).The text was updated successfully, but these errors were encountered: