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...
Saved in:
Published in | CompEuro 1992 Proceedings Computer Systems and Software Engineering pp. 568 - 573 |
---|---|
Main Authors | , |
Format | Conference Proceeding |
Language | English |
Published |
IEEE Comput. Soc. Press
1992
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
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 |