J-NTP对偶泛函的升阶算法  

Elevation Algorithm about the J-NTP Dual Functional

作　　者：唐桂林[1] TANG Guilin(Anhui Post and Telecommunication College, Hefei 230031,China)

机构地区：[1]安徽邮电职业技术学院,安徽合肥230031

出　　处：《太原学院学报（自然科学版）》2019年第1期36-42,共7页Journal of TaiYuan University:Natural Science Edition

基　　金：安徽省高校自然科学基金项目(KJ2017A875);安徽省高校自然科学基金项目(KJ2017A876);安徽省高校自然科学基金项目(KJ2016A382);安徽省省级质量工程项目(2015jyxm651)

摘　　要：根据对偶理论,构造出J-NTP基函数的对偶泛函,然后根据对偶泛函的升阶算法得到其高阶对偶泛函。该方法通过解一个线性方程组得到对偶泛函,但与现有的方法相比其解方程组的计算量由O(N3)变为O(N),这在计算机辅助几何设计和图形图像处理中有着潜在的应用价值。According to the dual theory, the dual function of J-NTP basis function is constructed, and then the higher-order dual function is obtained according to the elevation algorithm of the dual function. This method obtains dual functional by solving a system of linear equations. However, compared with the existing methods, The calculation amount of the solution equation is changed from O(N 3) to O(N), which has potential application value in computer aided geometric design and image processing.

关 键 词：J-NTP基函数 计算机辅助几何设计 对偶基 算法 

分 类 号：TP391[自动化与计算机技术—计算机应用技术] TP311[自动化与计算机技术—计算机科学与技术]