Skip to main content
Log in

Complexity bounds for solving some tridiagonal systems with preconditioning

  • Published:
CALCOLO Aims and scope Submit manuscript

Abstract

Some special classes of tridiagonal matrices A are considered, and the complexity of solving a linear system Ax=f is investigated, when rational preconditioning on A is allowed. Non-trivial lower bounds are found, and in all cases the number of necessary multiplicative operations, apart from preconditioning, is shown to be greater than the number of indeterminates defining A.

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. D. Bini, M. Capovani, Spectral and computational properties of band symmetric Toeplitz matrices.Linear Algebra Appl. 52, (1983) 99–126.

    MathSciNet  Google Scholar 

  2. D. Bini, M. Capovani, Fast parallel and sequential computations and spectral properties concerning band Toeplitz matrices.Calcolo 20, (1983) 177–189.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. Bini, M. Capovani, G. Lotti, F. Romani,Complessità Numerica. 1981, Boringhieri, Torino.

    Google Scholar 

  4. M. Capovani, Sulla determinazione della inversa delle matrici tridiagonali a blocchi.Calcolo 7, (1983) 295–303.

    Article  MathSciNet  Google Scholar 

  5. C. Fiduccia, Fast Matrix Multiplication.Proc. 3rd Annual ACM Symp. on Theory of Computing, (1971) 45–49.

  6. C. F. Fischer, R. A. Usmani, Properties of some tridiagonal matrices and their application to boundary value problems.SIAM J. Numer. Anal. 6, (1969) 127–141.

    Article  MATH  MathSciNet  Google Scholar 

  7. P. J. Davis,Circulant Matrices. 1979, Wiley, New York.

    MATH  Google Scholar 

  8. D. E. Heller, D. K. Stevenson, J. F. Traub, Accelerated iterative methods for the solution of tridiagonal systems on parallel computers.J. Assoc. Comput. Math. 23, (1976) 636–654.

    MATH  MathSciNet  Google Scholar 

  9. F. Romani, P. Rózsa, On periodic block tridiagonal matrices.Linear Algebra Appl. 167, (1992) 35–52.

    Article  MATH  MathSciNet  Google Scholar 

  10. P. Rózsa, On the inverse of band matrices.Integral Equations Operator Theory 10, (1987) 82–95.

    Article  MATH  MathSciNet  Google Scholar 

  11. P. Rózsa, R. Bevilacqua, P. Favati, F. Romani, On the inverse of block tridiagonal matrices with applications to the inverse of band matrices and block band matrices.Oper. Theory: Adv. Appl. 40, (1989) 447–469.

    Google Scholar 

  12. P. Rózsa, R. Bevilacqua, P. Favati, F. Romani, On band matrices and their inverses.Linear Algebra Appl. 150, (1991) 287–296.

    Article  MATH  MathSciNet  Google Scholar 

  13. J. Stoer, R. Bulirsch,Intoduction to Numerical Analysis. 1980, Springer-Verlag, New York.

    Google Scholar 

  14. P. Zellini, Optimal bounds for solving tridiagonal systems with preconditioning.SIAM J. Comput. 17, (1988) 1036–1043.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bevilacqua, R., Bozzo, E., Temperanza, G. et al. Complexity bounds for solving some tridiagonal systems with preconditioning. Calcolo 30, 127–143 (1993). https://doi.org/10.1007/BF02576177

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02576177

Keywords

Navigation