Fast parallel textured algorithms for parabolic equations

Garng Morton Huang, W. K. Tsai, W. Lu

Research output: Contribution to journalConference article

Abstract

Fast linear equation solvers based on recursive multiplicative, additive textured decompositions and corresponding recursive block Jacobi methods are introduced. The basic difference between this approach and classical iterative algorithms is that different approximations of the system matrix are used in the classical approach. It is shown that, with proper composition of approximation matrices, the spectral radius of error dynamic is greatly reduced, and with proper decomposition size the spectral radius will approach a constant strictly less than one, even if the dimension of the problem tends to inifinity. This enables the authors to devise a parallel algorithm with better time complexity. The associated recursive block Jacobi methods are developed and investigated, and their performance is compared with that of the textured decomposition methods. These algorithms are applied to dynamic simulation of parabolic equations.

Original languageEnglish
Pages (from-to)1472-1477
Number of pages6
JournalProceedings of the IEEE Conference on Decision and Control
Publication statusPublished - 1 Dec 1988
Externally publishedYes

Fingerprint

Parallel algorithms
Parallel Algorithms
Fast Algorithm
Parabolic Equation
Jacobi Method
Block Method
Spectral Radius
Decomposition
Matrix Approximation
Decompose
Decomposition Method
Linear equations
Dynamic Simulation
Iterative Algorithm
Time Complexity
Linear equation
Multiplicative
Strictly
Tend
Computer simulation

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Modelling and Simulation
  • Control and Optimization

Cite this

Fast parallel textured algorithms for parabolic equations. / Huang, Garng Morton; Tsai, W. K.; Lu, W.

In: Proceedings of the IEEE Conference on Decision and Control, 01.12.1988, p. 1472-1477.

Research output: Contribution to journalConference article

@article{8d2c5267fcfd4812a0953face3e8d9f3,
title = "Fast parallel textured algorithms for parabolic equations",
abstract = "Fast linear equation solvers based on recursive multiplicative, additive textured decompositions and corresponding recursive block Jacobi methods are introduced. The basic difference between this approach and classical iterative algorithms is that different approximations of the system matrix are used in the classical approach. It is shown that, with proper composition of approximation matrices, the spectral radius of error dynamic is greatly reduced, and with proper decomposition size the spectral radius will approach a constant strictly less than one, even if the dimension of the problem tends to inifinity. This enables the authors to devise a parallel algorithm with better time complexity. The associated recursive block Jacobi methods are developed and investigated, and their performance is compared with that of the textured decomposition methods. These algorithms are applied to dynamic simulation of parabolic equations.",
author = "Huang, {Garng Morton} and Tsai, {W. K.} and W. Lu",
year = "1988",
month = "12",
day = "1",
language = "English",
pages = "1472--1477",
journal = "Proceedings of the IEEE Conference on Decision and Control",
issn = "0191-2216",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Fast parallel textured algorithms for parabolic equations

AU - Huang, Garng Morton

AU - Tsai, W. K.

AU - Lu, W.

PY - 1988/12/1

Y1 - 1988/12/1

N2 - Fast linear equation solvers based on recursive multiplicative, additive textured decompositions and corresponding recursive block Jacobi methods are introduced. The basic difference between this approach and classical iterative algorithms is that different approximations of the system matrix are used in the classical approach. It is shown that, with proper composition of approximation matrices, the spectral radius of error dynamic is greatly reduced, and with proper decomposition size the spectral radius will approach a constant strictly less than one, even if the dimension of the problem tends to inifinity. This enables the authors to devise a parallel algorithm with better time complexity. The associated recursive block Jacobi methods are developed and investigated, and their performance is compared with that of the textured decomposition methods. These algorithms are applied to dynamic simulation of parabolic equations.

AB - Fast linear equation solvers based on recursive multiplicative, additive textured decompositions and corresponding recursive block Jacobi methods are introduced. The basic difference between this approach and classical iterative algorithms is that different approximations of the system matrix are used in the classical approach. It is shown that, with proper composition of approximation matrices, the spectral radius of error dynamic is greatly reduced, and with proper decomposition size the spectral radius will approach a constant strictly less than one, even if the dimension of the problem tends to inifinity. This enables the authors to devise a parallel algorithm with better time complexity. The associated recursive block Jacobi methods are developed and investigated, and their performance is compared with that of the textured decomposition methods. These algorithms are applied to dynamic simulation of parabolic equations.

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

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

M3 - Conference article

SP - 1472

EP - 1477

JO - Proceedings of the IEEE Conference on Decision and Control

JF - Proceedings of the IEEE Conference on Decision and Control

SN - 0191-2216

ER -