Add to ORKGAMS subject classifications. 65D32, 65F15, 65F18. Abstract. Recently Laurie presented a fast algorithm for the computation of (2n +1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. We describe modifications of this algorithm that allow the computation of Gauss-Kronrod quadrature rules with complex conjugate nodes and weights or with real nodes and positive and negative weights. Key words. orthogonal polynomials, indefinite measure, fast algorithm, inverse eigenvalue problem. 1. Introduction. Le
A quadrature rule μ of a measure on the real line represents a conic combination of finitely many e...
We describe a strategy for rigorous arbitrary-precision evaluation of Legendre polynomials on the un...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
Recently Laurie presented a fast algorithm for the computation of (2n + 1)-point Gauss-Kronrod quadr...
Gauss quadrature points are not nested so search for quadrature rules with nested points and similar...
Methods for the computation of classical Gaussian quadrature rules are described which are effective...
A new algorithm for constructing quadrature formulas with multiple Gaussian nodes in the presence o...
AbstractWe study the Kronrod extensions of Gaussian quadrature rules whose weight functions on [−1, ...
An efficient algorithm for the accurate computation of Gauss–Legendre and Gauss–Jacobi quadrature no...
Modified Stieltjes polynomials are defined and used to construct suboptimal extensions of Gaussian r...
AbstractUsing the theory of s-orthogonality and reinterpreting it in terms of the standard orthogona...
summary:We present algorithms for the determination of polynomials orthogonal with respect to a posi...
the theory of orthogonal polynomials, there are a lot of similarities between measures on the real l...
We are presenting here a class of integrals that has shown its importance in quantum mechanics. It's...
© 2014 Elsevier B.V. All rights reserved. In this paper we give a survey of some results concerning ...
A quadrature rule μ of a measure on the real line represents a conic combination of finitely many e...
We describe a strategy for rigorous arbitrary-precision evaluation of Legendre polynomials on the un...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...
Recently Laurie presented a fast algorithm for the computation of (2n + 1)-point Gauss-Kronrod quadr...
Gauss quadrature points are not nested so search for quadrature rules with nested points and similar...
Methods for the computation of classical Gaussian quadrature rules are described which are effective...
A new algorithm for constructing quadrature formulas with multiple Gaussian nodes in the presence o...
AbstractWe study the Kronrod extensions of Gaussian quadrature rules whose weight functions on [−1, ...
An efficient algorithm for the accurate computation of Gauss–Legendre and Gauss–Jacobi quadrature no...
Modified Stieltjes polynomials are defined and used to construct suboptimal extensions of Gaussian r...
AbstractUsing the theory of s-orthogonality and reinterpreting it in terms of the standard orthogona...
summary:We present algorithms for the determination of polynomials orthogonal with respect to a posi...
the theory of orthogonal polynomials, there are a lot of similarities between measures on the real l...
We are presenting here a class of integrals that has shown its importance in quantum mechanics. It's...
© 2014 Elsevier B.V. All rights reserved. In this paper we give a survey of some results concerning ...
A quadrature rule μ of a measure on the real line represents a conic combination of finitely many e...
We describe a strategy for rigorous arbitrary-precision evaluation of Legendre polynomials on the un...
We provide a fast algorithm to compute arbitrarily many nodes and weights for rational Gauss-Chebysh...