Primitive transcendental functions and symbolic computation

被引:1
|
作者
Navarro Guevara, Douglas [1 ]
机构
[1] Univ Nacl, Heredia, Costa Rica
关键词
Function criteria representation; Primitive transcendental functions; Symbolic computation; Computer algebra system;
D O I
10.1016/j.jsc.2017.05.006
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
This paper presents the theoretical support for a novel and efficient approach to represent and deal symbolically with an important ensemble of complex functions. These functions are characterized by a Maclaurin series expansion whose general term may be factoring as: b(j)T(j+k) x(j)/j(!) where b(j) is periodic, k is an element of Z and {T-m} is a complex sequence that characterizes a family of functions. The functions are structured in families of Euclidean vector spaces that facilitate a discrete vector representation. The used representations provide important facilitates for the symbolic computation of divers operators/operations that are executed by the computation of their "dual counterparts" into the representation space. (C) 2017 Elsevier Ltd. All rights reserved.
引用
收藏
页码:28 / 53
页数:26
相关论文
共 50 条
  • [1] Symbolic computation I: transcendental functions, 2nd edition
    Coutinho, S. C.
    [J]. MATHEMATICAL GAZETTE, 2006, 90 (519): : 562 - 563
  • [2] Symbolic expansion of transcendental functions
    Weinzierl, S
    [J]. COMPUTER PHYSICS COMMUNICATIONS, 2002, 145 (03) : 357 - 370
  • [3] ON FAST COMPUTATION OF TRANSCENDENTAL FUNCTIONS
    KARATSUBA, YA
    [J]. DOKLADY AKADEMII NAUK SSSR, 1991, 318 (02): : 278 - 279
  • [4] XSUMMER - Transcendental functions and symbolic summation in FORM
    Moch, S
    Uwer, P
    [J]. COMPUTER PHYSICS COMMUNICATIONS, 2006, 174 (09) : 759 - 770
  • [5] Symbolic functions from neural computation
    Smolensky, Paul
    [J]. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2012, 370 (1971): : 3543 - 3569
  • [6] Computation of Decimal Transcendental Functions Using the CORDIC Algorithm
    Vazquez, Alvaro
    Villalba, Julio
    Antelo, Elisardo
    [J]. ARITH: 2009 19TH IEEE INTERNATIONAL SYMPOSIUM ON COMPUTER ARITHMETIC, 2009, : 179 - +
  • [7] Symbolic test case generation for primitive recursive functions
    Brucker, AD
    Wolff, B
    [J]. FORMAL APPROACHES TO SOFTWARE TESTING, 2005, 3395 : 16 - 32
  • [9] A computation model with automatic functions and relations as primitive operations
    Gao, Ziyuan
    Jain, Sanjay
    Li, Zeyong
    Sabili, Ammar Fathin
    Stephan, Frank
    [J]. THEORETICAL COMPUTER SCIENCE, 2022, 924 : 94 - 116
  • [10] SYMBOLIC COMPUTATION OF FOURIER-TRANSFORMS OF BOOLEAN FUNCTIONS
    DAVIO, M
    THAYSE, A
    BIOUL, G
    [J]. PHILIPS RESEARCH REPORTS, 1972, 27 (04): : 386 - 403