Computing orthogonal rational functions with poles near the boundary
From MaRDI portal
Publication:2373830
Recommendations
Cites work
- A generalized orthonormal basis for linear dynamical systems
- A unifying construction of orthonormal bases for system identification
- An interpolation algorithm for orthogonal rational functions.
- Another quadrature rule of highest algebraic degree of precision
- Modified Moments and Orthogonal Rational Functions
- On computing rational Gauss-Chebyshev quadrature formulas
- On Computing the Points and Weights for Gauss--Legendre Quadrature
- On Generating Orthogonal Polynomials
- On the Construction of Gaussian Quadrature Rules from Modified Moments
- Orthogonal Laurent polynomials corresponding to certain strong Stieltjes distributions with applications to numerical quadratures
- Orthogonal rational functions for system identification: numerical aspects
- Rational basis functions for robust identification from frequency and time-domain measurements
- State space representation for arbitrary orthogonal rational functions
- System identification using Kautz models
- System identification using Laguerre models
- System identification with generalized orthonormal basis functions
- The computation of orthogonal rational functions on an interval
Cited in
(7)- The computation of orthogonal rational functions on an interval
- Foreword to the proceedings of the OrthoQuad 2014 conference
- An extension of the associated rational functions on the unit circle
- Computing orthogonal rational functions on a halfline
- Computation of integrals over the unit circle with nearby poles
- Computing near-best fixed pole rational interpolants
- A generalized eigenvalue problem for quasi-orthogonal rational functions
This page was built for publication: Computing orthogonal rational functions with poles near the boundary
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2373830)