PARALLEL AND SUPERFAST ALGORITHMS FOR HANKEL SYSTEMS OF EQUATIONS

被引：18

作者：

HEINIG, G

JANKOWSKI, P

机构：

[1] Sektion Mathematik PSF 964, Technische Universität Karl-Marx-Stadt, Karl-Marx-Stadt, DDR-9010, Germany (Democratic Republic

来源：

NUMERISCHE MATHEMATIK | 1990年 / 58卷 / 01期

关键词：

Subject classifications: AMS(MOS) 65F05; 15A09; 47B35; 93B15; CR:G1.3;

D O I：

10.1007/BF01385613

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Utilizing kernel structure properties a unified construction of Hankel matrix inversion algorithms is presented. Three types of algorithms are obtained: 1)O(n2) complexity Levinson type, 2)O (n) parallel complexity Schur-type, and 3)O(n log2n) complexity "asymptotically fast" ones. All algorithms work without additional assumption (like strong nonsingularity). © 1990 Springer-Verlag.

引用

页码：109 / 127

页数：19

共 24 条

[1] ABUKOV WM, 1986, IZVESTIJA VUZOV MAT, V7, P3
[2] Aho A., 1976, DESIGN ANAL COMPUTER
[3] ON RECURSIVENESS AND RELATED TOPICS IN LINEAR-SYSTEMS
ANTOULAS, AC
[J]. IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1986, 31 (12) : 1121 - 1135
[4] Baker G. A., 1981, PADE APPROXIMANTS 1
[5] NUMERICAL SOLUTION OF LINEAR EQUATIONS WITH TOEPLITZ AND VECTOR TOEPLITZ MATRICES
BAREISS, EH
[J]. NUMERISCHE MATHEMATIK, 1969, 13 (05) : 404 - &
[6] ON INVERSION OF TOEPLITZ AND CLOSE TO TOEPLITZ MATRICES
BENARTZI, A
SHALOM, T
SACKLER, R
SACKLER, B
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1986, 75 : 173 - 192
[7] ASYMPTOTICALLY FAST SOLUTION OF TOEPLITZ AND RELATED SYSTEMS OF LINEAR-EQUATIONS
BITMEAD, RR
ANDERSON, BDO
[J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 1980, 34 (DEC) : 103 - 116
[8] Brent R.P., 1980, J ALGORITHMS, V1, P259
[9] RECURSIVE RELATIONS FOR BLOCK HANKEL AND TOEPLITZ-SYSTEMS .1. DIRECT RECURSIONS
BULTHEEL, A
[J]. JOURNAL OF COMPUTATIONAL AND APPLIED MATHEMATICS, 1984, 10 (03) : 301 - 328
[10] BULTHEEL A, 1987, LAURENT SERIES THEIR, P6302

← 1 2 3 →