首页 | 本学科首页   官方微博 | 高级检索  
     检索      

Tower节点集上的极小次数牛顿基
引用本文:陈涛,董天,张树功.Tower节点集上的极小次数牛顿基[J].吉林大学学报(理学版),2007,45(6):932-934.
作者姓名:陈涛  董天  张树功
作者单位:吉林大学 数学学院, 长春 130012
基金项目:国家自然科学基金 , 国家自然科学基金
摘    要:将关于张量积格点的lower子集上Lagrange插值问题的极小次数牛顿基推广到tower节点子集上. 解决了二元Lagrange插值牛顿基问题, 把tower节点集的概念推广到任意多维情形, 以三维为例给出了相应的Lagrange插值极小次数牛顿基,并给出了计算三维tower节点集合消逝理想的约化Grobner基的快速算法.

关 键 词:tower节点集  多元多项式插值  极小次数牛顿基  
文章编号:1671-5489(2007)06-0932-03
收稿时间:2007-10-08
修稿时间:2007-10-08

Minimal Degree Newton Basis for Interpolation on Tower Sets
CHEN Tao,DONG Tian,ZHANG Shu-gong.Minimal Degree Newton Basis for Interpolation on Tower Sets[J].Journal of Jilin University: Sci Ed,2007,45(6):932-934.
Authors:CHEN Tao  DONG Tian  ZHANG Shu-gong
Institution:College of Mathematics, Jilin University, Changchun 130012, China
Abstract:The minimal degree Newton basis for Lagrange interpolation on a lower subset of a tensor product grid that is proposed by Gasca and Sauer was extended to a tower subset of the grid. At first, we solved the bivariate cases. Furthermore, we extended the notion of a 2-dimensional tower set to arbitrary high dimensions and then gave the minimal degree Newton basis for trivariate Lagrange interpolation on a tower set as an example. Finally, we introduced a fast algorithm for constructing the reduced Grobner basis for the vanishing ideal of a 3-dimensional tower set.
Keywords:tower set  multivariate polynomial interpolation  minimal degree Newton basis
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《吉林大学学报(理学版)》浏览原始摘要信息
点击此处可从《吉林大学学报(理学版)》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号