On generating discrete orthogonal bivariate polynomials

BIT Numerical Mathematics

Volumn 42, Issue 2, 2002, Pages 393-407

  Huhtanen, Marko ^a,b   Larsen, Rasmus Munk ^a  

^a Stanford University   (United States)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Bivariate interpolation; Bivariate polynomial; Curve fitting; Lanczos algorithm; Least squares approximation; Slowly growing length of the recurrence

Indexed keywords

EID: 0042379785     PISSN: 00063835     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021907210628     Document Type: Article

References (24)

1. W. E. Arnoldi, The principle of minimized iterations in the solution of the matrix eigenvalue problem, Quart. Appl. Math., 9 (1951), 17-29.
2. C. de Boor, Polynomial interpolation in several variables, Studies in Computer Science, R. DeMillo and J. R. Rice, eds., Plenum Press, New York, 1994, pp. 87-119.
3. C. de Boor and A. Ron, Computational aspects of polynomial interpolation in several variables, Math. Comp., 58 (1992), 705-727.
4. D. Cox, J. Little, and D. O'Shea, Ideals, Varities, and Algorithms, 2nd ed., Springer-Verlag, New York, 1996.
5. G. Dahlquist, On summation formulas due to Plana, Lindelöf and Abel, and related Gauss-Christoffel rules, I, BIT, 37 (1997), pp. 256-295.
6. J. W. Daniel, W. B. Gragg, L. Kaufman, and G. W. Stewart, Reorthogonalization and Stable Algorithms Updating the Gram-Schmidt QR Factorization, Math. Comp., 30 (1976), no. 136, 772-795.
7. J. Demmel, Applied Numerical Linear Algebra, SIAM, Philadelphia, PA, 1997.
8. G. Forsythe, Generation and use of orthogonal polynomials for data-fitting with digital computer, J. Soc. Indust. Appl. Math., 5, (1957), pp. 74-88.
9. W. Gander, G. Golub, and R. Strebel, least squares fitting of circles and ellipses, BIT, 34 (1994), pp. 558-578.
10. W. Gautschi, Orthogonal Polynomials: Applications and Computations, Acta Numerica 5 (1996), Cambridge University Press, Cambridge, pp. 45-119.
11. G. H. Golub and J. H. Welsh, Calculation of Gauss quadrature rules, Math. Comp., 23 (1969), pp. 221-230.
12. T. N. Goodman and K. Unsworth, Shape preserving interpolation by parametrically defined curves, SIAM J. Numer. Anal., 25 (1988), pp. 1453-1465.
13. R. A. Horn and C. R. Johnson, Matrix Analysis, Cambridge University Press, Cambridge, 1985.
14. M. Huhtanen, Orthogonal polyanalytic polynomials and normal matrices, Math. Comp., to appear.
15. M. Huhtanen and R. M. Larsen, Exclusion and inclusion regions for the eigenvalues of a normal matrix, SIAM J. Matrix Anal. Appl., to appear.
16. J. Kautsky and G. Golub, On the calculation of Jacobi matrices, Linear Algebra Appl., 52/53 (1983), pp. 439-455.
17. M. A. Kowalski, The recursion formulas for orthogonal polynomials in n variables, SIAM J. Math. Anal., 13 (1982), pp. 309-315.
18. B. N. Parlett, The Symmetric Eigenvalue Problem, Prentice-Hall, Englewood Cliffs, NJ, 1980.
19. L. Reichel and W. B. Gragg, Algorithm 686: FORTRAN Subroutines for Updating the QR decomposition, ACM Trans. Math. Software, 16 (1990), pp. 369-377.
20. T. Sauer, Polynomial interpolation of minimal degree, Numer. Math., 78 (1997), pp. 59-85.
21. P. K. Suetin, Orthogonal Polynomials in Two Variables, Gordon & Breach, Abingdon, 1999.
22. G. A. Watson, Least squares fitting of circles and ellipses to measured data, BIT, 39 (1998), pp. 176-191.
23. M. Weisfeld, Orthogonal polynomials in several variables, Numer. Math., 1 (1959), pp. 38-40.
24. Y. Xu, On multivariate orthogonal polynomials, SIAM J. Math. Anal., 24 (1993), pp. 783-794.