Recursive computation of discrete Legendre polynomial coefficients

被引：2
|
作者：
Aburdene, MF
机构：
[1] Department of Electrical Engineering, Bucknell University, Lewisburg
来源：
MULTIDIMENSIONAL SYSTEMS AND SIGNAL PROCESSING | 1996年 / 7卷 / 02期
关键词：
Legendre coefficients; Legendre polynomials; recursive methods;
D O I：
10.1007/BF01827815
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Discrete Legendre polynomials play an important role in image processing, signal processing, and control. This paper presents two new recursive methods to compute Legendre polynomials' coefficients. One method computes the coefficients of the (m + 1)th order term using the coefficient of the mth order term of the same degree plynomial. The other method computes the nth order coefficient of a higher degree polynomial using the mth order coefficient of a lower degree polynomial.
引用
收藏
页码：221 / 224
页数：4
相关论文
共 50 条
  • [41] Computation of the Galois group of a polynomial with rational coefficients. II
    Durov N.V.
    Journal of Mathematical Sciences, 2006, 136 (3) : 3880 - 3907
  • [42] Application of Legendre orthogonal polynomial method in calculating reflection and transmission coefficients of multilayer plates
    Song Guorong
    Liu Mingkun
    Lyu Yan
    Lee Yungchun
    Wu Bin
    He Cunfu
    WAVE MOTION, 2019, 84 : 32 - 45
  • [43] Recursive algorithms for the computation of the potential harmonic coefficients of a constant density polyhedron
    Dimitrios Tsoulis
    Olivier Jamet
    Jérôme Verdun
    Nicolas Gonindard
    Journal of Geodesy, 2009, 83 : 925 - 942
  • [44] Recursive algorithms for the computation of the potential harmonic coefficients of a constant density polyhedron
    Tsoulis, Dimitrios
    Jamet, Olivier
    Verdun, Jerome
    Gonindard, Nicolas
    JOURNAL OF GEODESY, 2009, 83 (10) : 925 - 942
  • [45] An Approach to the Construction of a Recursive Argument of Polynomial Evaluation in the Discrete Log Setting
    Kim, Sungwook
    ELECTRONICS, 2022, 11 (01)
  • [46] Computation of legendre functions
    Babich V.M.
    Dement'ev D.B.
    Samokish B.A.
    Journal of Mathematical Sciences, 2008, 148 (5) : 639 - 649
  • [47] COMPUTATION OF CONVOLUTIONS AND DISCRETE FOURIER-TRANSFORMS BY POLYNOMIAL TRANSFORMS
    NUSSBAUMER, HJ
    QUANDALLE, P
    IBM JOURNAL OF RESEARCH AND DEVELOPMENT, 1978, 22 (02) : 134 - 144
  • [48] Discrete-time symmetric polynomial equations with complex coefficients
    Henrion, D
    Jezek, J
    Sebek, M
    KYBERNETIKA, 2002, 38 (02) : 113 - 139
  • [49] NEW FAST RECURSIVE ALGORITHMS FOR THE COMPUTATION OF DISCRETE COSINE AND SINE TRANSFORMS
    CVETKOVIC, Z
    POPOVIC, MV
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 1992, 40 (08) : 2083 - 2086
  • [50] Recursive fast computation of the two-dimensional discrete cosine transform
    Fang, WH
    Hu, NC
    Shih, SK
    IEE PROCEEDINGS-VISION IMAGE AND SIGNAL PROCESSING, 1999, 146 (01): : 25 - 33
12345