Fast Stable Solver for Sequentially Semi-separable Linear Systems of Equations

  • S. Chandrasekaran
  • P. Dewilde
  • M. Gu
  • T. Pals
  • A. J. van der Veen
Conference paper
First Online:
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2552)

Abstract

In this paper we will present a fast backward stable algorithm for the solution of certain structured matrices which can be either sparse or dense. It essentially combines the fast solution techniques for banded plus semi-separable linear systems of equations of Chandrasekaran and Gu [4] with similar techniques of Dewilde and van der Veen for time-varying systems [12].

This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    J. J. Dongarra, J. Du Croz, S. Hammarling, and I. Du., Algorithm 679: A Set of Level 3 Basic Linear Algebra Subprograms: Model Implementation and Test Programs, ACM Transactions on Mathematical Software, 16 (1990), pp. 18–28.MATHCrossRefGoogle Scholar
  2. [2]
    F.X. Canning and K. Rogovin, Fast direct solution of moment-method matrices, IEEE Antennas and Propagation Magazine, 40 (1998).Google Scholar
  3. [3]
    J. Carrier, L. Greengard, and V. Rokhlin, A fast adaptive multipole algorithm for particle simulations, SIAM J. Sci. Stat. Comput., 9 (1988), pp. 669–686.MATHCrossRefMathSciNetGoogle Scholar
  4. [4]
    S. Chandrasekaran and M. Gu, Fast and stable algorithms for banded plus semiseparable matrices, submitted to SIAM J. Matrix Anal. Appl., 2000. 545, 546, 549, 552Google Scholar
  5. [5]
    S. Chandrasekaran and M. Gu, A fast and stable solver for recursively semiseparable systems of equations, in Structured matrices in mathematics, computer science and engineering, II, edited by Vadim Olshevsky, in the Contemporary Mathematics series, AMS publications, 2001.Google Scholar
  6. [6]
    S. Chandrasekaran and M. Gu, Fast and Stable Eigendecomposition of Symmetric Banded plus Semi-separable Matrices, 1999, Linear Algebra and its Applications, Volume 313, Issues 1-3, 1 July 2000, pages 107–114.MATHCrossRefMathSciNetGoogle Scholar
  7. [7]
    S. Chandrasekaran and M. Gu, A Divide-and-Conquer Algorithm for the Eigendecomposition of Symmetric Block-Diagonal Plus Semiseparable Matrices, 1999, accepted for publication in Numerische Mathematik.Google Scholar
  8. [8]
    S. Chandrasekaran, M. Gu, and T. Pals, A fast and stable solver for smooth recursively semi-separable systems. Paper presented at the SIAM Annual Conference, San Diego, CA, 2001, and SIAM Conference of Linear Algebra in Controls, Signals and Systems, Boston, MA, 2001.Google Scholar
  9. [9]
    S. Chandrasekaran, P. Dewilde, M. Gu, T. Pals, and A.-J. van der Veen, Fast and stable solvers for sequentially recursively semi-separable linear systems of equations. Submitted to SIAM Journal on Matrix Analysis and its Applications, 2002. 549, 552Google Scholar
  10. [10]
    D. Colton and R. Kress, Integral Equation Methods in Scattering Theory, Wiley, 1983.Google Scholar
  11. [11]
    D. Colton and R. Kress, Inverse acoustic and electromagnetic scattering theory, Applied Mathematical Sciences, vol. 93, Springer-Verlag, 1992. 545, 552Google Scholar
  12. [12]
    P. Dewilde and A. van der Veen, Time-varying systems and computations. Kluwer Academic Publishers, 1998. 545, 546, 550Google Scholar
  13. [13]
    Y. Eidelman and I. Gohberg, Inversion formulas and linear complexity algorithm for diagonal plus semiseparable matrices, Computers and Mathematics with Applications, 33 (1997), Elsevier, pp. 69–79.MATHCrossRefMathSciNetGoogle Scholar
  14. [14]
    Y. Eidelman and I. Gohberg, A look-ahead block Schur algorithm for diagonal plus semiseparable matrices, Computers and Mathematics with Applications, 35 1998), pp. 25–34.MATHCrossRefMathSciNetGoogle Scholar
  15. [15]
    Y. Eidelman and I. Gohberg, A modification of the Dewilde van der Veen method for inversion of finite structured matrices, Linear Algebra and its Applications, volumes 343-344, 1 march 2001, pages 419–450.Google Scholar
  16. [16]
    L. Greengard and V. Rokhlin, A fast algorithm for particle simulations, J. Comp. Phys., 73 (1987), pp. 325–348.MATHCrossRefMathSciNetGoogle Scholar
  17. [17]
    L. Gurel and W. C. Chew, Fast direct (non-iterative) solvers for integral-equation formulations of scattering problems, IEEE Antennas and Propagation Society International Symposium, 1998 Digest, Antennas: Gateways to the Global Network, pp. 298–301, vol. 1.Google Scholar
  18. [18]
    W. Hackbusch, A sparse arithmetic based on H-matrices. Part-I: Introduction to H-matrices, Computing 62, pp. 89–108, 1999.MATHCrossRefMathSciNetGoogle Scholar
  19. [19]
    W. Hackbusch and B.N. Khoromskij, A sparse H-matrix arithmetic. Part-II: application to multi-dimensional problems, Computing 64, pp. 21–47, 2000.MATHMathSciNetGoogle Scholar
  20. [20]
    W. Hackbusch and B.N. Khoromskij, A sparse H-matrix arithmetic: general complexity estimates, Journal of Computational and Applied Mathematics, volume 125, pp. 79–501, 2000.CrossRefMathSciNetGoogle Scholar
  21. [21]
    D. Gope and V. Jandhyala, An iteration-free fast multilevel solver for dense method of moment systems, Electrical Performance of Electronic Packaging, 2001, pp. 177–180.Google Scholar
  22. [22]
    R. Kussmaul, DeEin numerisches Verfahren zur Lösung des Neumannschen Aussenraumproblems für die Helmholtzsche Schwingungsgleichung, Computing 4, 246–273, 1969.MATHCrossRefMathSciNetGoogle Scholar
  23. [23]
    June-Yub Lee and L. Greengard, A fast adaptive numerical method for stiff twopoint boundary value problems, SIAM Journal on Scientific Computing, vol.18, (no.2), SIAM, March 1997, pp. 403–29. 552MATHCrossRefMathSciNetGoogle Scholar
  24. [24]
    E. Martensen, DeÜber eine Methode zum räumlichen Neumannschen Problem mit einer Anwendung für torusartige Berandungen, Acta Math. 109, 75–135, 1963.MATHCrossRefMathSciNetGoogle Scholar
  25. [25]
    N. Mastronardi, S. Chandrasekaran and S. van Huffel, Fast and stable two-way chasing algorithm for diagonal plus semi-separable systems of linear equations, Numerical Linear Algebra with Applications, Volume 38, Issue 1, January 2000, pages 7–12.Google Scholar
  26. [26]
    N. Mastronardi, S. Chandrasekaran and S. van Huffel, Fast and stable algorithms for reducing diagonal plus semi-separable matrices to tridiagonal and bidiagonal form, BIT, volume 41, number 1, March 2001, pages 149–157.MATHCrossRefMathSciNetGoogle Scholar
  27. [27]
    T. Pals. Ph. D. Thesis, Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA, 2002.Google Scholar
  28. [28]
    V. Rokhlin, Applications of volume integrals to the solution of PDEs, J. Comp. Phys., 86 (1990), pp. 414–439.MATHCrossRefMathSciNetGoogle Scholar
  29. [29]
    P. Starr, On the numerical solution of one-dimensional integral and differential equations, Thesis advisor: V. Rokhlin, Research Report YALEU/DCS/RR-888, Department of Computer Science, Yale University, New Haven, CT, December 1991. 552Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • S. Chandrasekaran
    • 1
  • P. Dewilde
    • 3
  • M. Gu
    • 2
  • T. Pals
    • 1
  • A. J. van der Veen
    • 3
  1. 1.University of CaliforniaSanta Barbara
  2. 2.University of CaliforniaBerkeley
  3. 3.DIMESDelft

Personalised recommendations