IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-1-4612-0129-8_5.html
   My bibliography  Save this book chapter

Unified Divide-and-Conquer Algorithm

In: Structured Matrices and Polynomials

Author

Listed:
  • Victor Y. Pan

    (Lehman College, CUNY, Department of Mathematics and Computer Science)

Abstract

In this chapter, we describe a superfast divide-and-conquer algorithm for recursive triangular factorization of structured matrices. The algorithm applies over any field of constants. As a by-product, we obtain the rank of an input matrix and a basis for its null space. For a non-singular matrix, we also compute its inverse and determinant. The null space basis and the inverse are represented in compressed form, with their short displacement generators. The presentation is unified over various classes of structured matrices. Treatment of singularities is specified separately for numerical and symbolic implementations of the algorithm. The algorithm enables computations for several fundamental and celebrated problems of computer algebra and numerical rational computations.

Suggested Citation

  • Victor Y. Pan, 2001. "Unified Divide-and-Conquer Algorithm," Springer Books, in: Structured Matrices and Polynomials, chapter 0, pages 155-175, Springer.
    • Handle: RePEc:spr:sprchp:978-1-4612-0129-8_5
    DOI: 10.1007/978-1-4612-0129-8_5
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-1-4612-0129-8_5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.