Non-polynomial Galerkin projection on deforming meshes

ACM Trans. Graph.(2013)

引用 28|浏览54
暂无评分
摘要
This paper extends Galerkin projection to a large class of non-polynomial functions typically encountered in graphics. We demonstrate the broad applicability of our approach by applying it to two strikingly different problems: fluid simulation and radiosity rendering, both using deforming meshes. Standard Galerkin projection cannot efficiently approximate these phenomena. Our approach, by contrast, enables the compact representation and approximation of these complex non-polynomial systems, including quotients and roots of polynomials. We rely on representing each function to be model-reduced as a composition of tensor products, matrix inversions, and matrix roots. Once a function has been represented in this form, it can be easily model-reduced, and its reduced form can be evaluated with time and memory costs dependent only on the dimension of the reduced space.
更多
查看译文
关键词
non-polynomial galerkin projection,galerkin projection,reduced form,complex non-polynomial system,non-polynomial function,standard galerkin projection,compact representation,broad applicability,matrix root,reduced space,deforming mesh,matrix inversion,radiosity,fluid simulation
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要