Modular Algorithm for Sparse Multivariate Polynomial Interpolationand its Parallel Implementation

A new algorithm for sparse multivariate polynomial interpolation is presented. It is a multi-modular extension of the Ben-Or and Tiwari algorithm, and is designed to be a practical method to construct symbolic formulas from numeric data produced by vector or massively-parallel processors. The main i...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of Symbolic Computation Ročník 21; číslo 4; s. 377 - 396
Hlavní autoři: MURAO, HIROKAZU, FUJISE, TETSURO
Médium: Journal Article
Jazyk:angličtina
japonština
Vydáno: Elsevier Ltd 01.04.1996
Elsevier BV
Témata:
Algebra and Number Theory
Computational Mathematics
ISSN:0747-7171, 1095-855X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract A new algorithm for sparse multivariate polynomial interpolation is presented. It is a multi-modular extension of the Ben-Or and Tiwari algorithm, and is designed to be a practical method to construct symbolic formulas from numeric data produced by vector or massively-parallel processors. The main idea in our algorithm comes from the well-known technique for primality test based on Fermat's theorem, and is the application of the generalized Chinese remainder theorem to the monomial exponents. We regard the exponent vector of each multivariate monomial as a mixed-radix representation of the corresponding exponent value obtained after the transformation by Kronecker's technique. It is shown by complexity comparison and experimental results that the step for univariate polynomial factorization is most expensive in our algorithm, and its parallelization is considered. Also reported are some empirical results of the parallelization on KLIC, a portable system of a concurrent logic programming language KL1.
AbstractList A new algorithm for sparse multivariate polynomial interpolation is presented. It is a multi-modular extension of the Ben-Or and Tiwari algorithm, and is designed to be a practical method to construct symbolic formulas from numeric data produced by vector or massively-parallel processors. The main idea in our algorithm comes from the well-known technique for primality test based on Fermat's theorem, and is the application of the generalized Chinese remainder theorem to the monomial exponents. We regard the exponent vector of each multivariate monomial as a mixed-radix representation of the corresponding exponent value obtained after the transformation by Kronecker's technique. It is shown by complexity comparison and experimental results that the step for univariate polynomial factorization is most expensive in our algorithm, and its parallelization is considered. Also reported are some empirical results of the parallelization on KLIC, a portable system of a concurrent logic programming language KL1.
Author MURAO, HIROKAZU
FUJISE, TETSURO
Author_xml – sequence: 1
  givenname: HIROKAZU
  surname: MURAO
  fullname: MURAO, HIROKAZU
  organization: Computer Centre, The University of Tokyo, Yayoi 2-11-16, Bunkyo-ku, 113, Tokyo, Japan
– sequence: 2
  givenname: TETSURO
  surname: FUJISE
  fullname: FUJISE, TETSURO
  organization: Institute for New Generation Computer Technology Mita Kokusai Bldg. 21F, Mita 1-chome, Minato-ku, 108, Tokyo, Japan
BackLink https://cir.nii.ac.jp/crid/1872835442549904512$$DView record in CiNii
BookMark eNp1kM1P3DAQxS0EErvQa8859Jpl7NhxfFyt2oIEAokicYsGZ9IaOfbKNivx3zdhe6rEZebw3m8-3pqdhhiIsa8cNhygvXrNNm64Me0GQMAJW3Ewqu6Uej5lK9BS15prfs7WOb8CgJGNWjG8i8Obx1Rt_e-YXPkzVWNM1eMeU6bq7s0Xd8DksFD1EP17iJNDX92EQmkfPRYXA4ahciVXD5jQe5rVae9polA-5Et2NqLP9OVfv2BPP77_2l3Xt_c_b3bb29oK0YkaRWusbtuXVmMjxahQ8RE0INAw4Iu0vJPITSs0cGxGsmCslZq0ImnHDpsLtjnOtSnmnGjs98lNmN57Dv0SUL8E1C8B9UtAMyD_A6w7nlwSOv859u2IBedmYqm806JrlJRCSWNAKi5mW3e00fzzwVHqs3UULA0ukS39EN1nG_4C1AKMsw
CitedBy_id crossref_primary_10_1016_j_jco_2024_101922
crossref_primary_10_1016_j_jsc_2020_06_001
crossref_primary_10_1145_3457341_3457342
crossref_primary_10_1007_s00200_024_00655_5
crossref_primary_10_1016_j_jsc_2003_11_002
ContentType Journal Article
Copyright 1996
Copyright_xml – notice: 1996
DBID 6I.
AAFTH
RYH
AAYXX
CITATION
DOI 10.1006/jsco.1996.0020
DatabaseName ScienceDirect Open Access Titles
Elsevier:ScienceDirect:Open Access
CiNii Complete
CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1095-855X
EndPage 396
ExternalDocumentID 10_1006_jsco_1996_0020
S0747717196900206
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
1B1
1RT
1~.
1~5
29L
4.4
457
4G.
5GY
5VS
6I.
6OB
7-5
71M
8P~
9JN
AACTN
AAEDT
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAQXK
AAXUO
AAYFN
ABAOU
ABBOA
ABEFU
ABFNM
ABJNI
ABMAC
ABVKL
ABXDB
ABYKQ
ACAZW
ACDAQ
ACGFS
ACNNM
ACRLP
ACZNC
ADBBV
ADEZE
ADFGL
ADMUD
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGHFR
AGUBO
AGYEJ
AHHHB
AIALX
AIEXJ
AIGVJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
ASPBG
AVWKF
AXJTR
AZFZN
BKOJK
BLXMC
CAG
COF
CS3
DM4
DU5
EBS
EFBJH
EFLBG
EJD
EO8
EO9
EP2
EP3
FDB
FEDTE
FGOYB
FIRID
FNPLU
FYGXN
G-2
G-Q
GBLVA
GBOLZ
HVGLF
HZ~
IHE
IXB
J1W
KOM
LG5
M25
M41
MHUIS
MO0
N9A
NCXOZ
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
R2-
RIG
RNS
ROL
RPZ
SDF
SDG
SDP
SES
SEW
SPC
SPCBC
SSV
SSW
SSZ
T5K
TN5
UPT
WUQ
XPP
YQT
ZMT
ZU3
~G-
AATTM
AAXKI
AAYWO
ABWVN
ACLOT
ACRPL
ACVFH
ADCNI
ADNMO
ADVLN
AEIPS
AEUPX
AFPUW
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
EFKBS
RYH
~HD
9DU
AAYXX
AFJKZ
APXCP
CITATION
ID FETCH-LOGICAL-c2282-a269c766b67a342f5a51f070a0eddab4c184a1962701a3fec09cc47e75e4cf8a3
ISSN 0747-7171
IngestDate Tue Nov 18 20:53:21 EST 2025
Sat Nov 29 07:16:01 EST 2025
Mon Nov 10 09:18:15 EST 2025
Fri Feb 23 02:31:32 EST 2024
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 4
Language English
Japanese
License http://www.elsevier.com/open-access/userlicense/1.0
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c2282-a269c766b67a342f5a51f070a0eddab4c184a1962701a3fec09cc47e75e4cf8a3
OpenAccessLink https://dx.doi.org/10.1006/jsco.1996.0020
PageCount 20
ParticipantIDs crossref_primary_10_1006_jsco_1996_0020
crossref_citationtrail_10_1006_jsco_1996_0020
nii_cinii_1872835442549904512
elsevier_sciencedirect_doi_10_1006_jsco_1996_0020
PublicationCentury 1900
PublicationDate 1996-04-01
PublicationDateYYYYMMDD 1996-04-01
PublicationDate_xml – month: 04
  year: 1996
  text: 1996-04-01
  day: 01
PublicationDecade 1990
PublicationTitle Journal of Symbolic Computation
PublicationYear 1996
Publisher Elsevier Ltd
Elsevier BV
Publisher_xml – name: Elsevier Ltd
– name: Elsevier BV
SSID ssj0009435
ssib006540737
ssib006540736
ssib006540738
Score 1.4282192
Snippet A new algorithm for sparse multivariate polynomial interpolation is presented. It is a multi-modular extension of the Ben-Or and Tiwari algorithm, and is...
SourceID crossref
nii
elsevier
SourceType Enrichment Source
Index Database
Publisher
StartPage 377
SubjectTerms Algebra and Number Theory
Computational Mathematics
Title Modular Algorithm for Sparse Multivariate Polynomial Interpolationand its Parallel Implementation
URI https://dx.doi.org/10.1006/jsco.1996.0020
https://cir.nii.ac.jp/crid/1872835442549904512
Volume 21
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1095-855X
  dateEnd: 20180228
  omitProxy: false
  ssIdentifier: ssj0009435
  issn: 0747-7171
  databaseCode: AIEXJ
  dateStart: 19950101
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3da9swEBdpu4e97Hus2zr0MNiTmT9kyXo0JWPp1qbkA8JejCzLXSBxQtKE9r_vneWPZCOwDfYigpEdofvpdCfd_Y6Qj1jB1vOz3AlCHTpMptqRruGOb7zUFTLlOisl_V1cXUWTibzudDZ1Lsx2JooiuruTy_8qangGwsbU2b8Qd_NReAC_QejQgtih_SPBXy6yMrQ0nt0swPP_OS8jCYdL8GBhCWP84Bb8YzAxMfbtHrOSS7qNstyWDYyr7xOu1QorrcwshfC8ylIqDtiz6_t5iiTDZZT6Zv-G_3I8iPvlLtcb9L_FP8YNbMYXvWEZkDnqjobjQb89hbCBy2z3FKJJj2ljkdYlGbZwwF-0_YzVsGDTOVEYTnZVsE2SrqDGdvRpUNV4sVtzYIvf_qb1QXOg1sdbbhwbHpK57f7WRB0OcTw4HMklduFH5MQXoQRleBL3upOLlq2Z2cqs9fhrtk-Xf97_l0PWzFExne7YKaNn5EklEBpbYDwnHVO8IE_r4h200uUviapwQhucUMAJtTihuzihLU7orzihgBNa44Tu4-QVGX_pjs6_OlW9DUf74Hk7yudSC85TLlTA_DxUoZfDlqBck2UqZdqLmPKwWpPrqSA32pVaM2FEaJjOIxW8JsfFojBvCA0yKTymYa3LkGV5ppSfmjx3MzdjggtxSpx63hJdkdFjTZRZYmm0eYLznOA8JzjPp-RT039paVgO9vRqMSSVEWmNwwTQcvCdM5AXDARbLxLIQchYeXSC9Ev-23_45jvyuF0n78nx7Wpjzsgjvb2drlcfKsA9AKDun2s
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Modular+Algorithm+for+Sparse+Multivariate+Polynomial+Interpolationand+its+Parallel+Implementation&rft.jtitle=Journal+of+symbolic+computation&rft.au=MURAO%2C+HIROKAZU&rft.au=FUJISE%2C+TETSURO&rft.date=1996-04-01&rft.pub=Elsevier+Ltd&rft.issn=0747-7171&rft.eissn=1095-855X&rft.volume=21&rft.issue=4&rft.spage=377&rft.epage=396&rft_id=info:doi/10.1006%2Fjsco.1996.0020&rft.externalDocID=S0747717196900206
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0747-7171&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0747-7171&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0747-7171&client=summon