A frontal computation scheme for the Schur algorithm to efficiently solve large boundary-element problems

Author

van Genderen, A.J. ; Van Der Meijs, N.P.

Author_Institution

Dept. of Electr. Eng., Delft Univ. of Technol., Netherlands

fYear

1992

fDate

4-8 May 1992

Firstpage

568

Lastpage

573

Abstract

The Schur algorithm provides an approximate inverse for partially specified staircase band matrices. The authors develop a frontal computation scheme for the Schur algorithm that achieves an O(b/sup 2/) space bound, where b is the width of the staircase band. This property allows certain classes of boundary element problems, such as those that occur with VLSI capacitance modeling, to be solved in linear time and using constant memory. Such an application is described and experimental results are given that illustrate the efficiency and practicality of the new algorithm.<>

Keywords

boundary-elements methods; circuit CAD; O(b/sup 2/) space bound; Schur algorithm; VLSI capacitance modeling; approximate inverse; frontal computation scheme; large boundary-element problems; Capacitance; Conductors; Differential equations; Distributed computing; Distribution functions; Green´s function methods; Integral equations; Matrix decomposition; Space technology; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

CompEuro '92 . 'Computer Systems and Software Engineering',Proceedings.

Conference_Location

The Hague, Netherlands

Print_ISBN

0-8186-2760-3

Type

conf

DOI

10.1109/CMPEUR.1992.218471

Filename

218471