Skip to main content
Log in

Jacobi matrices for sums of weight functions

  • Part II Numerical Mathematics
  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

Abstract

Orthogonal polynomials are conveniently represented by the tridiagonal Jacobi matrix of coefficients of the recurrence relation which they satisfy. LetJ 1 andJ 2 be finite Jacobi matrices for the weight functionsw 1 andw 2, resp. Is it possible to determine a Jacobi matrix\(\tilde J\), corresponding to the weight functions\(\tilde w\)=w 1+w 2 using onlyJ 1 andJ 2 and if so, what can be said about its dimension? Thus, it is important to clarify the connection between a finite Jacobi matrix and its corresponding weight function(s). This leads to the need for stable numerical processes that evaluate such matrices.

Three newO(n 2) methods are derived that “merge” Jacobi matrices directly without using any information about the corresponding weight functions. The first can be implemented using any of the updating techniques developed earlier by the authors. The second new method, based on rotations, is the most stable. The third new method is closely related to the modified Chebyshev algorithm and, although it is the most economical of the three, suffers from instability for certain kinds of data.

The concepts and the methods are illustrated by small numerical examples, the algorithms are outlined and the results of numerical tests are reported.

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. S. Elhay, G. H. Golub and J. Kautsky.Updating and downdating of orthogonal polynomials with data fitting applications. SIAM J. Matrix Anal. Appl., 12(2): 327–353, 1991.

    Article  Google Scholar 

  2. S. Elhay and J. Kautsky.Generalized Kronrod Patterson type imbedded quadratures. Aplikace Matematiky, 1991, to appear.

  3. B. Fisher and G. H. Golub.On generating polynomials which are orthogonal over several intervals. Technical Report NA 89-09, Computer Science Dept, Stanford University, Stanford, California, 94305, 1989.

    Google Scholar 

  4. W. Gautschi.On generating orthogonal polynomials. SIAM J. Sci. Statist. Comput., 3: 289–317, 1982.

    Article  Google Scholar 

  5. G. H. Golub and J. Kautsky.Calculation of Gauss quadratures with multiple free and fixed knots. Numer. Math., 41: 147–163, 1983.

    Article  Google Scholar 

  6. G. H. Golub and J. H. Welsh.Calculation of Gauss quadrature rules. Math. Comp., 23: 221–230, 1969.

    Google Scholar 

  7. J. Kautsky and S. Elhay.Calculation of the weights of interpolatory quadratures. Numer. Math., 40: 407–422, 1982.

    Article  Google Scholar 

  8. J. Kautsky and S. Elhay.Gauss quadratures and Jacobi matrices for weight functions not of one sign. Math. Comp., 43 (168): 543–550, 1984.

    Google Scholar 

  9. J. Kautsky and G. H. Golub.On the calculation of Jacobi matrices. Linear Algebra Appl., 52/53: 439–455, 1983.

    Google Scholar 

  10. B. N. Parlett.The Symmetric Eigenvalue Problem. Englewood Cliffs, NJ: Prentice Hall, 1980.

    Google Scholar 

  11. H. Rutishauser.On Jacobi rotation patterns. Proc. Symp. in Appl. Maths., 15: 219–239, 1963.

    Google Scholar 

  12. J. R. Wilkinson and C. Reinsch.Linear Algebra.Handbook for automatic computation, volume II, pages 274–283. Springer, 1971. Contribution II/8.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Elhay, S., Golub, G.H. & Kautsky, J. Jacobi matrices for sums of weight functions. BIT 32, 143–166 (1992). https://doi.org/10.1007/BF01995114

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

AMS(MOS) subject classifications

Key words

Navigation