ACCURATE AND EFFICIENT SOLUTION OF HANKEL MATRIX SYSTEMS BY FFT AND THE CONJUGATE GRADIENT METHODS.

Tapan Kumar Sarkar; Xiapu Yang

ACCURATE AND EFFICIENT SOLUTION OF HANKEL MATRIX SYSTEMS BY FFT AND THE CONJUGATE GRADIENT METHODS.

Tapan Kumar Sarkar, Xiapu Yang

Department of Electrical Engineering & Computer Science

Research output: Chapter in Book/Entry/Poem › Conference contribution

4 Scopus citations

Abstract

An alternate algorithm to solve Hankel matrix equations is proposed. This method is a combination of the FFT and the conjugate gradient method. The advantage of this approach is that it is computationally robust to highly ill-conditioned and even singular matrix equations. Preliminary results indicated that for very large complex Toeplitz matrix equations, the CPU time is proportional to N as the number of unknowns as increased, as opposed to N**2 for conventional methods.

Original language	English (US)
Title of host publication	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
Publisher	IEEE Computer Society
Pages	1835-1838
Number of pages	4
State	Published - 1987

ASJC Scopus subject areas

Signal Processing
Electrical and Electronic Engineering
Acoustics and Ultrasonics

Cite this

@inproceedings{d515d340358d4e0ebd823c2081abc923,

title = "ACCURATE AND EFFICIENT SOLUTION OF HANKEL MATRIX SYSTEMS BY FFT AND THE CONJUGATE GRADIENT METHODS.",

abstract = "An alternate algorithm to solve Hankel matrix equations is proposed. This method is a combination of the FFT and the conjugate gradient method. The advantage of this approach is that it is computationally robust to highly ill-conditioned and even singular matrix equations. Preliminary results indicated that for very large complex Toeplitz matrix equations, the CPU time is proportional to N as the number of unknowns as increased, as opposed to N**2 for conventional methods.",

author = "Sarkar, {Tapan Kumar} and Xiapu Yang",

year = "1987",

language = "English (US)",

pages = "1835--1838",

booktitle = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

publisher = "IEEE Computer Society",

address = "United States",

}

TY - GEN

T1 - ACCURATE AND EFFICIENT SOLUTION OF HANKEL MATRIX SYSTEMS BY FFT AND THE CONJUGATE GRADIENT METHODS.

AU - Sarkar, Tapan Kumar

AU - Yang, Xiapu

PY - 1987

Y1 - 1987

N2 - An alternate algorithm to solve Hankel matrix equations is proposed. This method is a combination of the FFT and the conjugate gradient method. The advantage of this approach is that it is computationally robust to highly ill-conditioned and even singular matrix equations. Preliminary results indicated that for very large complex Toeplitz matrix equations, the CPU time is proportional to N as the number of unknowns as increased, as opposed to N**2 for conventional methods.

AB - An alternate algorithm to solve Hankel matrix equations is proposed. This method is a combination of the FFT and the conjugate gradient method. The advantage of this approach is that it is computationally robust to highly ill-conditioned and even singular matrix equations. Preliminary results indicated that for very large complex Toeplitz matrix equations, the CPU time is proportional to N as the number of unknowns as increased, as opposed to N**2 for conventional methods.

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

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

M3 - Conference contribution

AN - SCOPUS:0023167485

SP - 1835

EP - 1838

BT - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

PB - IEEE Computer Society

ER -

ACCURATE AND EFFICIENT SOLUTION OF HANKEL MATRIX SYSTEMS BY FFT AND THE CONJUGATE GRADIENT METHODS.

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this