期刊论文详细信息
| JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS | 卷:237 |
| An algorithm for computing a Pade approximant with minimal degree denominator | |
| Article | |
| Ibryaeva, O. L.1  Adukov, V. M.1  | |
| [1] S Ural State Univ, Chelyabinsk, Russia | |
| 关键词: Pade approximant; Toeplitz matrix; Pade-Laplace method; Froissart doublets; | |
| DOI : 10.1016/j.cam.2012.06.022 | |
| 来源: Elsevier | |
PDF
|
|
【 摘 要 】
In this paper, a new definition of a reduced Pade approximant and an algorithm for its computation are proposed. Our approach is based on the investigation of the kernel structure of the Toeplitz matrix. It is shown that the reduced Pade approximant always has nice properties which the classical Fade approximant possesses only in the normal case. The new algorithm allows us to avoid the appearance of Froissart doublets induced by computer roundoff in the non-normal Bade table. (C) 2012 Elsevier B.V. All rights reserved.
【 授权许可】
Free
【 预 览 】
| Files | Size | Format | View |
|---|---|---|---|
| 10_1016_j_cam_2012_06_022.pdf | 263KB |
PDF