Green threads - Improving cross-product integration

被引：0
|
作者：
Nightingale, Johnathan [1 ]
机构：
[1] IBM Corp, Toronto Software Lab, Toronto, ON, Canada
来源：
DR DOBBS JOURNAL | 2007年 / 32卷 / 01期
关键词：
D O I：
暂无
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：34 / +
页数：7
相关论文
共 50 条
  • [1] Diagonalization of the cross-product matrix
    Baksalary, Oskar Maria
    Trenkler, Goetz
    [J]. EXAMPLES AND COUNTEREXAMPLES, 2023, 4
  • [2] STARLIKENESS OF A CROSS-PRODUCT OF BESSEL FUNCTIONS
    Al-Kharsani, Huda A.
    Baricz, Arpad
    Pogany, Tibor K.
    [J]. JOURNAL OF MATHEMATICAL INEQUALITIES, 2016, 10 (03): : 819 - 827
  • [3] ON ZEROS OF CROSS-PRODUCT BESSEL FUNCTIONS
    MARTINEK, J
    THIELMAN, HP
    HUEBSCHM.EC
    [J]. JOURNAL OF MATHEMATICS AND MECHANICS, 1966, 16 (05): : 447 - &
  • [4] Cross-product extensions of the Gene Ontology
    Mungall, Christopher J.
    Bada, Michael
    Berardini, Tanya Z.
    Deegan, Jennifer
    Ireland, Amelia
    Harris, Midori A.
    Hill, David P.
    Lomax, Jane
    [J]. JOURNAL OF BIOMEDICAL INFORMATICS, 2011, 44 (01) : 80 - 86
  • [5] CROSS-PRODUCT CUBATURE ERROR BOUNDS
    LETHER, FG
    [J]. MATHEMATICS OF COMPUTATION, 1970, 24 (111) : 583 - &
  • [6] DETERMINATION OF ZEROS OF A CROSS-PRODUCT BESSEL FUNCTION
    SALCHEV, LZ
    POPOV, VB
    [J]. PROCEEDINGS OF THE CAMBRIDGE PHILOSOPHICAL SOCIETY, 1973, 74 (NOV): : 477 - 483
  • [7] Radii of Starlikeness and Convexity of a Product and Cross-Product of Bessel Functions
    Árpád Baricz
    Anikó Szakál
    Róbert Szász
    Nihat Yağmur
    [J]. Results in Mathematics, 2018, 73
  • [8] THE CROSS-PRODUCT CONJECTURE FOR WIDTH TWO POSETS
    Chan, Swee Hong
    Pak, Igor
    Panova, Greta
    [J]. TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 2022, : 5923 - 5961
  • [9] CONFIDENCE-LIMITS FOR A CROSS-PRODUCT RATIO
    FISHER, RA
    [J]. AUSTRALIAN JOURNAL OF STATISTICS, 1962, 4 (01): : 41 - 41
  • [10] Using cross-product matrices to compute the SVD
    Zhongxiao Jia
    [J]. Numerical Algorithms, 2006, 42 : 31 - 61
12345