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

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...

Full description

Saved in:
Bibliographic Details
Published inCompEuro 1992 Proceedings Computer Systems and Software Engineering pp. 568 - 573
Main Authors van Genderen, A.J., van der Meijs, N.P.
Format Conference Proceeding
LanguageEnglish
Published IEEE Comput. Soc. Press 1992
Subjects
Capacitance
Conductors
Differential equations
Distributed computing
Distribution functions
Green's function methods
Integral equations
Matrix decomposition
Space technology
Very large scale integration
Online AccessGet full text

Cover

More Information
Summary: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.< >
ISBN:9780818627606
0818627603
DOI:10.1109/CMPEUR.1992.218471