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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer Science+Business Media New York
About this chapter
Cite this chapter
Pan, V.Y. (2001). Unified Divide-and-Conquer Algorithm. In: Structured Matrices and Polynomials. Birkhäuser, Boston, MA. https://doi.org/10.1007/978-1-4612-0129-8_5
Download citation
DOI: https://doi.org/10.1007/978-1-4612-0129-8_5
Publisher Name: Birkhäuser, Boston, MA
Print ISBN: 978-1-4612-6625-9
Online ISBN: 978-1-4612-0129-8
eBook Packages: Springer Book Archive