Abstract:
We describe a stable algorithm, having linear complexity, for the solution of banded-plus-semiseparable linear systems. The algorithm exploits the structural properties of the inverse of a semiseparable matrix. Stability is achieved by combining these properties with partial pivoting techniques. Several numerical experiments are shown to confirm the effectiveness of the proposed approach.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: April 2002 / Accepted: September 2002
Rights and permissions
About this article
Cite this article
Fasino, D., Gemignani, L. Fast and stable solution¶of banded-plus-semiseparable linear systems. CALCOLO 39, 201–217 (2002). https://doi.org/10.1007/s100920200009
Issue Date:
DOI: https://doi.org/10.1007/s100920200009