Computing rational Gauss–Chebyshev quadrature formulas with complex poles: The algorithm
- 1 August 2009
- journal article
- Published by Elsevier BV in Advances in Engineering Software
- Vol. 40 (8), 707-717
- https://doi.org/10.1016/j.advengsoft.2008.11.011
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Recurrence and asymptotics for orthonormal rational functions on an intervalIMA Journal of Numerical Analysis, 2008
- An extended relation between orthogonal rational functions on the unit circle and the intervalJournal of Mathematical Analysis and Applications, 2007
- Orthogonal rational matrix‐valued functions on the unit circle: Recurrence relations and a Favard‐type theoremMathematische Nachrichten, 2006
- On computing rational Gauss-Chebyshev quadrature formulasMathematics of Computation, 2005
- A weak-star convergence result for orthogonal rational functionsJournal of Computational and Applied Mathematics, 2005
- Orthogonal rational matrix‐valued functions on the unit circleMathematische Nachrichten, 2005
- Ratio asymptotics for orthogonal rational functions on an intervalJournal of Approximation Theory, 2003
- Orthogonal rational functions for system identification: numerical aspectsIEEE Transactions on Automatic Control, 2003
- Orthogonal rational functions and quadrature on an intervalJournal of Computational and Applied Mathematics, 2003
- Quadrature and orthogonal rational functionsJournal of Computational and Applied Mathematics, 2001