**Sauter, S (2000). Variable order panel clustering. Computing, 64(3):223-261.**

Full text not available from this repository.

## Abstract

We present a new version of the panel clustering method for a sparse representation of boundary integral equations. Instead of applying the algorithm separately for each matrix row (as in the classical version of the algorithm) we employ more general block partitionings. Furthermore, a variable order of approximation is used depending on the size of blocks.

We apply this algorithm to a second kind Fredholm integral equation and show that the complexity of the method only depends linearly on the number, say n, of unknowns. The complexity of the classical matrix oriented approach is O(n 2) while, for the classical panel clustering algorithm, it is O(nlog7 n).

Item Type: | Journal Article, refereed, original work |
---|---|

Communities & Collections: | 07 Faculty of Science > Institute of Mathematics |

DDC: | 510 Mathematics |

Uncontrolled Keywords: | Panel clustering method, variable order approximation, boundary integral equations. |

Language: | English |

Date: | 2000 |

Deposited On: | 29 Nov 2010 17:27 |

Last Modified: | 27 Nov 2013 18:17 |

Publisher: | Springer |

ISSN: | 0010-485X |

Publisher DOI: | 10.1007/s006070050045 |

Related URLs: | http://www.ams.org/mathscinet-getitem?mr=1767055 http://www.zentralblatt-math.org/zbmath/search/?q=an%3A0959.65135 |

Citations: | Web of Science®. Times Cited: 38 Google Scholar™ |

Users (please log in): suggest update or correction for this item

Repository Staff Only: item control page