Numerical Inversion of Two-Dimensional Laplace Transforms Based on FFT and Quotient-Difference Algorithm.

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F02%3APU30199" target="_blank" >RIV/00216305:26220/02:PU30199 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Numerical Inversion of Two-Dimensional Laplace Transforms Based on FFT and Quotient-Difference Algorithm.

Popis výsledku v původním jazyce

Laplace transforms in two variables can very be useful in the solution of partial differential equations describing transient behaviour of linear dynamical systems. However, it is often either too difficult or even impossible to obtain their originals analytically. The paper presents a new way of the numerical inversion of two-dimensional Laplace transforms (2D-NILT) based on the FFT and the quotient-difference algorithm of Rutishauser. In principle, infinite two-dimensional complex Fourier series arisiing in the approximate formula are partially evaluated using the FFT to ensure the high speed of computation. Then the quotient-difference algorithm is applied to accelerate the convergence of these series enabling to gain the required accuracy of results. The method has been programmed and verified using the universal language Matlab.

Název v anglickém jazyce

Numerical Inversion of Two-Dimensional Laplace Transforms Based on FFT and Quotient-Difference Algorithm.

Popis výsledku anglicky

Laplace transforms in two variables can very be useful in the solution of partial differential equations describing transient behaviour of linear dynamical systems. However, it is often either too difficult or even impossible to obtain their originals analytically. The paper presents a new way of the numerical inversion of two-dimensional Laplace transforms (2D-NILT) based on the FFT and the quotient-difference algorithm of Rutishauser. In principle, infinite two-dimensional complex Fourier series arisiing in the approximate formula are partially evaluated using the FFT to ensure the high speed of computation. Then the quotient-difference algorithm is applied to accelerate the convergence of these series enabling to gain the required accuracy of results. The method has been programmed and verified using the universal language Matlab.

Druh

D - Stať ve sborníku

CEP obor

JA - Elektronika a optoelektronika, elektrotechnika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2002

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

Proceedings of The International Conference on Fundamentals of Electronics, Communications and Computer Sciences ICFS?2002

ISBN

—

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

15-20

Název nakladatele

The Institute of Electronics, Information and Communication Engineers, Tokyo, Japan

Místo vydání

Waseda University, Tokyo, Japan

Místo konání akce

Tokyo

Datum konání akce

27. 3. 2002

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—