Construction of fast symmetrical transforms on finite intervals based on extension and delay theorems

T. A. Tereshchenko; Ye V. Moskalenko; Yu S. Petergeria

Construction of fast symmetrical transforms on finite intervals based on extension and delay theorems

T. A. Tereshchenko, Ye V. Moskalenko, Yu S. Petergeria

National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

A kind of fast spectral analysis algorithm is considered for symmetrical transform on finite intervals (SFI-transform). This method provides the economy of computations which is important in using computers for spectral analysis.

Original language	English
Pages (from-to)	763-771
Number of pages	9
Journal	Engineering Simulation
Volume	17
Issue number	6
State	Published - 2000
Externally published	Yes

Cite this

@article{d5d17c387aa7481994d44bdf7cb9e851,

title = "Construction of fast symmetrical transforms on finite intervals based on extension and delay theorems",

abstract = "A kind of fast spectral analysis algorithm is considered for symmetrical transform on finite intervals (SFI-transform). This method provides the economy of computations which is important in using computers for spectral analysis.",

author = "Tereshchenko, {T. A.} and Moskalenko, {Ye V.} and Petergeria, {Yu S.}",

year = "2000",

language = "English",

volume = "17",

pages = "763--771",

journal = "Engineering Simulation",

issn = "1063-1100",

publisher = "Gordon & Breach",

number = "6",

}

TY - JOUR

T1 - Construction of fast symmetrical transforms on finite intervals based on extension and delay theorems

AU - Tereshchenko, T. A.

AU - Moskalenko, Ye V.

AU - Petergeria, Yu S.

PY - 2000

Y1 - 2000

N2 - A kind of fast spectral analysis algorithm is considered for symmetrical transform on finite intervals (SFI-transform). This method provides the economy of computations which is important in using computers for spectral analysis.

AB - A kind of fast spectral analysis algorithm is considered for symmetrical transform on finite intervals (SFI-transform). This method provides the economy of computations which is important in using computers for spectral analysis.

UR - http://www.scopus.com/inward/record.url?scp=0034460376&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0034460376

SN - 1063-1100

VL - 17

SP - 763

EP - 771

JO - Engineering Simulation

JF - Engineering Simulation

IS - 6

ER -

Construction of fast symmetrical transforms on finite intervals based on extension and delay theorems

Abstract

Other files and links

Fingerprint

Cite this