Orthogonal rational functions and structured matrices

SIAM Journal on Matrix Analysis and Applications

Volumn 26, Issue 3, 2005, Pages 810-829

  Van Barel, Marc ^a   Fasino, Dario ^b   Gemignani, Luca ^c   Mastronardi, Nicola ^d  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b UNIVERSITY OF UDINE   (Italy)

^c UNIVERSITY OF PISA   (Italy)

^d CNR   (Italy)

Author keywords

Diagonal plus semiseparable matrices; Inverse eigenvalue problems; Orthogonal rational functions; Recurrence relation; Structured matrices

Indexed keywords

COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; INTERPOLATION; INVERSE PROBLEMS; MATRIX ALGEBRA; PROBLEM SOLVING; THEOREM PROVING;

DIAGONAL-PLUS-SEMISEPARABLE MATRICES; INVERSE EIGENVALUE PROBLEMS; ORTHOGONAL RATIONAL FUNCTIONS; RECURRENCE RELATION; STRUCTURED MATRICES;

FUNCTIONS;

EID: 22944448381     PISSN: 08954798     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895479803444454     Document Type: Article

References (39)

1. 2) reduction algorithms for the construction of a band matrix from spectral data, SIAM J. Matrix Anal. Appl., 12 (1991), pp. 426-431.
2. 1 and Parallel Algorithms, G. Golub and P. Van Dooren, eds., NATO Adv. Sci. Inst. Ser. F: Comput. Systems Sci. 70, Springer-Verlag, Berlin, 1991, pp. 385-395.
3. i, j = 0 for j > i + p, Math. Scand., 7 (1959), pp. 57-60.
4. D. A. BINI, L. GEMIGNANI, AND V. Y. PAN, QR-like Algorithms for Generalized Semiseparable Matrices, Technical Report 1470, Dipartimento di Matematica, Università di Pisa, Pisa, Italy, 2003.
5. D. BOLEY AND G. GOLUB, A survey of matrix inverse eigenvalue problems, Inverse Problems, 3 (1987), pp. 595-622.
6. A. BULTHEEL AND M. VAN BAREL, Padé techniques for model reduction in linear system theory: A survey, J. Comput. Appl. Math., 14 (1986), pp. 401-438.
7. A. BULTHEEL AND B. DE MOOR, Rational approximation in linear systems and control, J. Comput. Appl. Math., 121 (2000), pp. 355-378.
8. A. BULTHEEL, P. GONZÁLEZ-VERA, E. HENDRIKSEN, AND O. NJÅSTAD, Orthogonal rational functions with poles on the unit circle, J. Math. Anal. Appl., 182 (1994), pp. 221-243.
9. A. BULTHEEL, P. GONZÁLEZ-VERA, E. HENDRIKSEN, AND O. NJÅSTAD, Orthogonal Rational Functions, Cambridge Monogr. Appl. Comput. Math. 5, Cambridge University Press, Cambridge, UK, 1999.
10. A. BULTHEEL, P. GONZÁLEZ-VERA, E. HENDRIKSEN, AND O. NJÅSTAD, Quadrature and orthogonal rational functions, J. Comput. Appl. Math., 127 (2001), pp. 67-91.
11. A. BULTHEEL AND M. VAN BAREL, Vector orthogonal polynomials and least squares approximation, SIAM J. Matrix Anal. Appl., 16 (1995), pp. 863-885.
12. S. CHANDRASEKARAN AND M. GU, A fast and stable solver for recursively semi-separable systems of linear equations, in Structured Matrices in Mathematics, Computer Science, and Engineering, II (Boulder, CO, 1999), Contemp. Math. 281, AMS, Providence, RI, 2001, pp. 39-53.
13. P. DELSARTE, Y. GENIN, AND Y. KAMP, On the role of the Nevanlinna-Pick problem in circuit and system theory, Internat. J. Circuit Theory Appl., 9 (1981), pp. 177-187.
14. Y. EIDELMAN AND I. GOHBERG, A look-ahead block Schur algorithm for diagonal plus semiseparable matrices, Comput. Math. Appl., 35 (1998), pp. 25-34.
15. S. ELHAY, G. GOLUB, AND J. KAUTSKY, Updating and downdating of orthogonal polynomials with data fitting applications, SIAM J. Matrix Anal. Appl., 12 (1991), pp. 327-353.
16. D. FASINO AND L. GEMIGNANI, A Lanczos-type algorithm for the QR factorization of regular Cauchy matrices, Numer. Linear Algebra Appl., 9 (2002), pp. 305-319.
17. D. FASINO AND L. GEMIGNANI, A Lanczos-type algorithm for the QR factorization of Cauchy-like matrices, in Fast Algorithms for Structured Matrices: Theory and Applications, Contemp. Math. 323, V. Olshevsky, ed., AMS, Providence, RI, 2003, pp. 91-104.
18. D. FASINO AND L. GEMIGNANI, Direct and inverse eigenvalue problems for diagonal-plus-semiseparable matrices, Numer. Algorithms, 34 (2003), pp. 313-324.
19. B. FISCHER AND G. GOLUB, How to generate unknown orthogonal polynomials out of known orthogonal polynomials, J. Comput. Appl. Math., 43 (1992), pp. 99-115.
20. F. R. GANTMACHER AND M. G. KREIN, Sur les matrices complètement non négatives et oscillatoires, Compositio Math., 4 (1937), pp. 445-470.
21. W. GAUTSCHI, The use of rational functions in numerical quadrature, J. Comput. Appl. Math., 133 (2001), pp. 111-126.
22. G. H. GOLUB AND J. H. WELSCH, Calculation of Gauss quadrature rules, Math. Comp., 23 (1969), pp. 221-230.
23. W. GRAGG AND A. LINDQUIST, On the partial realization problem, Linear Algebra Appl., 50 (1983), pp. 277-319.
24. W. B. GRAGG AND W. J. HARROD, The numerically stable reconstruction of Jacobi matrices from spectral data, Numer. Math., 44 (1984), pp. 317-335.
25. P. HENRICI, Applied and Computational Complex Analysis, Vol. 1, John Wiley, New York, 1974.
26. I. KOLTRACHT, Linear complexity algorithm for semiseparable matrices, Integral Equations Operator Theory, 29 (1997), pp. 313-319.
27. B. NINNESS AND F. GUSTAFSSON, A unifying construction of orthonormal bases for system identification, IEEE Trans. Automat. Control, 42 (1997), pp. 515-521.
28. V. OLSHEVSKY AND V. PAN, Polynomial and rational evaluation and interpolation (with structured matrices), in Automata, Languages and Programming, Lecture Notes in Comput. Sci. 1644, Springer-Verag, Berlin, 1999, pp. 585-594.
29. L. REICHEL, Fast QR decomposition of Vandermonde-like matrices and polynomial least squares approximation, SIAM J. Matrix Anal. Appl., 12 (1991), pp. 552-564.
30. L. REICHEL, Construction of polynomials that are orthogonal with respect to a discrete bilinear form, Adv. Comput. Math., 1 (1993), pp. 241-258.
31. L. REICHEL, G. AMMAR, AND W. GRAGG, Discrete least squares approximation by trigonometric polynomials, Math. Comp., 57 (1991), pp. 273-289.
32. P. RÓZSA, On the inverses of band matrices, Integral Equations Operator Theory, 10 (1987), pp. 82-95.
33. H. RUTISHAUSER, On Jacobi rotation patterns, in Experimental Arithmetic, High Speed Computing and Mathematics, Proc. Sympos. Appl. Math. 15, AMS, Providence, RI, 1963, pp. 219-239.
34. M. VAN BAREL AND A. BULTHEEL, A new approach to the rational interpolation problem: The vector case., J. Comput. Appl. Math., 33 (1990), pp. 331-346.
35. M. VAN BAREL AND A. BULTHEEL, A parallel algorithm for discrete least squares rational approximation, Numer. Math., 63 (1992), pp. 99-121.
36. M. VAN BAREL AND A. BULTHEEL, Discrete linearized least-squares rational approximation on the unit circle, J. Comput. Appl. Math., 50 (1994), pp. 545-563.
37. M. VAN BAREL AND A. BULTHEEL, Orthonormal polynomial vectors and least squares approximation for a discrete inner product, Electron. Trans. Numer. Anal., 3 (1995), pp. 1-23.
38. E. VAN CAMP, N. MASTRONARDI, AND M. VAN BAREL, Two fast algorithms for solving diagonal-plus-semiseparable linear systems, 3. Comput. Appl. Math., 164-165 (2004), pp. 731-747.
39. R. VANDEBRIL, M. VAN BAREL, AND N. MASTRONARDI, An implicit QR algorithm for semiseparable matrices to compute the eigendecomposition of symmetric matrices, Numer. Linear Algebra Appl., to appear.