Abstract
Low-rank structured matrices have attracted much attention in the last decades, since they arise in many applications and all share the fundamental property that can be represented by \(\mathcal {O}(n)\) parameters, where n×n is the size of the matrix. This property has allowed the development of fast algorithms for solving numerically many problems involving low-rank structured matrices by performing operations on the parameters describing the matrices, instead of directly on the matrix entries. Among these problems, the solution of linear systems of equations is probably the most basic and relevant one. Therefore, it is important to measure, via structured computable condition numbers, the relative sensitivity of the solutions of linear systems with low-rank structured coefficient matrices with respect to relative perturbations of the parameters representing such matrices, since this sensitivity determines the maximum accuracy attainable by fast algorithms and allows us to decide which set of parameters is the most convenient from the point of view of accuracy. To develop and analyze such condition numbers is the main goal of this paper. To this purpose, a general expression is obtained for the condition number of the solution of a linear system of equations whose coefficient matrix is any differentiable function of a vector of parameters with respect to perturbations of such parameters. Since there are many different classes of low-rank structured matrices and many different types of parameters describing them, it is not possible to cover all of them in a single work. Therefore, the general expression of the condition number is particularized to the important case of {1,1}-quasiseparable matrices and to the quasiseparable and the Givens-vector representations, in order to obtain explicit expressions of the corresponding two condition numbers that can be estimated in O(n) operations. In addition, detailed theoretical and numerical comparisons of these two condition numbers between themselves, and with respect to unstructured condition numbers, are provided, which show that there are situations in which the unstructured condition number is much larger than the structured ones, but that the opposite never happens. The approach presented in this manuscript can be generalized to other classes of low-rank structured matrices and parameterizations.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
Aurentz, J.L., Mach, T., Vandebril, R., Watkins, D.S.: Fast and backward stable computation of roots of polynomials. SIAM J. Matrix Anal. Appl 36(3), 942–973 (2015)
Bella, T., Olshevsky, V., Stewart, M.: Nested product decomposition of quasiseparable matrices. SIAM J. Matrix Anal. Appl 34(4), 1520–1555 (2013)
Börm, S., Grasedyck, L., Hackbusch, W.: Introduction to hierarchical matrices with applications. Eng. Anal. Bound. Elemen 27, 405–422 (2003)
Dopico, F.M., Olshevsky, V., Zhlobich, P.: Stability of QR-based fast system solvers for a subclass of quasiseparable rank one matrices. Math. Comp. 82, 2007–2034 (2013)
Dopico, F.M., Pomés, K.: Structured eigenvalue condition numbers for parameterized quasiseparable matrices, published electronically in Numer. Math. doi:10.1007/s00211-015-0779-5 (2015)
Eidelman, Y., Gohberg, I: On a new class of structured matrices. Integral Equ. Oper. Theory 34(3), 293–324 (1999)
Eidelman, Y., Gohberg, I.: Linear complexity inversion algorithms for a class of structured matrices. Integral Equ. Oper. Theory 35, 28–52 (1999)
Eidelman, Y., Gohberg, I: On generators of quasiseparable finite block matrices. Calcolo 42, 187–214 (2005)
Eidelman, Y., Gohberg, I., Haimovici, I.: Separable type representations of matrices and fast algorithms. Volume 1. Basics. Completion problems. Multiplication and inversion algorithms operator theory: Advances and Applications, 234. Birkhäuser/Springer, Basel (2014)
Eidelman, Y., Gohberg, I., Haimovici, I.: Separable type representations of matrices and fast algorithms. Volume 2. Eigenvalue method operator theory: Advances and applications, 235. Birkhäuser/Springer, Basel (2014)
Ferreira, C., Parlett, B., Dopico, F.M.: Sensitivity of eigenvalues of an unsymmetric tridiagonal matrix. Numer. Math 122(3), 527–555 (2012)
Higham, N.J.: Accuracy and stability of numerical algorithms, 2nd. Society for Industrial and Applied Mathematics, Philadelphia (2002)
Rice, J.R.: A theory of condition. SIAM J. Numer. Anal 3, 287–310 (1966)
Stewart, M.: On orthogonal transformation of rank structured matrices, submitted (available at http://saaz.mathstat.gsu.edu/pub/pub.html)
Vandebril, R., Van Barel, M., Mastronardi, N.: A note on the representation and definition of semiseparable matrices. Numer Linear Algebra Appl 12, 839–858 (2005)
Vandebril, R., Van Barel, M., Mastronardi, N.: Matrix computations and semiseparable matrices, vol. 1. Linear Systems, The Johns Hopkins University Press, Baltimore (2008)
Vandebril, R., Van Barel, M., Mastronardi, N.: Matrix computations and semiseparable matrices, vol. 2. Eigenvalue and Singular value methods, The Johns Hopkins University Press, Baltimore (2008)
Xi, Y., Xia, J.: On the stability of some hierarchical rank structured matrix algorithms, submitted
Xi, Y., Xia, J., Cauley, S., Balakrishnan, V.: Superfast and stable structured solvers for Toeplitz least squares via randomized sampling. SIAM J. Matrix Anal. Appl 35(1), 44–72 (2014)
Author information
Authors and Affiliations
Corresponding author
Additional information
Partially supported by Ministerio de Economía y Competitividad of Spain through grants MTM-2012-32542, MTM-2015-68805-REDT, MTM-2015-65798-P.
Rights and permissions
About this article
Cite this article
Dopico, F.M., Pomés, K. Structured condition numbers for linear systems with parameterized quasiseparable coefficient matrices. Numer Algor 73, 1131–1158 (2016). https://doi.org/10.1007/s11075-016-0133-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11075-016-0133-8
Keywords
- Condition numbers
- Linear systems
- Low-rank structured matrices
- Quasiseparable matrices
- Quasiseparable representation
- Givens-vector representation