AbstractParallel versions of the block Chebyshev algorithm to generate the recursion coefficients of orthonormal matrix polynomials and the Gaussian quadrature algorithm to approximate matrix integrals on the real line are implemented on an SP1
20 pages, 5 figuresThis paper presents an algorithm to simulate Gaussian random vectors whose precis...
This paper synthesizes formally orthogonal polynomials, Gaussian quadrature in the complex plane and...
AbstractThe Chebyshev and Stieltjes procedures are algorithms for computing recursion coefficients f...
AbstractParallel versions of the block Chebyshev algorithm to generate the recursion coefficients of...
AbstractThe techniques for polynomial interpolation and Gaussian quadrature are generalized to matri...
AbstractThe techniques for polynomial interpolation and Gaussian quadrature are generalized to matri...
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly indep...
We are presenting here a class of integrals that has shown its importance in quantum mechanics. It's...
We are presenting here a class of integrals that has shown its importance in quantum mechanics. It's...
AbstractWe study Gaussian quadrature formulae for a matrix weight. We firstly show how to generate G...
Golub and Meurant have shown how to use the symmetric block Lanczos algorithm to compute block Gauss...
Golub and Meurant have shown how to use the symmetric block Lanczos algorithm to compute block Gauss...
AbstractWe investigate the behaviour of the maximum error in applying Gaussian quadrature to the Che...
Abstract. Approximations of matrix-valued functions of the form WT f(A)W, where A ∈ Rm×m is symmetri...
20 pages, 5 figuresThis paper presents an algorithm to simulate Gaussian random vectors whose precis...
20 pages, 5 figuresThis paper presents an algorithm to simulate Gaussian random vectors whose precis...
This paper synthesizes formally orthogonal polynomials, Gaussian quadrature in the complex plane and...
AbstractThe Chebyshev and Stieltjes procedures are algorithms for computing recursion coefficients f...
AbstractParallel versions of the block Chebyshev algorithm to generate the recursion coefficients of...
AbstractThe techniques for polynomial interpolation and Gaussian quadrature are generalized to matri...
AbstractThe techniques for polynomial interpolation and Gaussian quadrature are generalized to matri...
We consider the computation of quadrature rules that are exact for a Chebyshev set of linearly indep...
We are presenting here a class of integrals that has shown its importance in quantum mechanics. It's...
We are presenting here a class of integrals that has shown its importance in quantum mechanics. It's...
AbstractWe study Gaussian quadrature formulae for a matrix weight. We firstly show how to generate G...
Golub and Meurant have shown how to use the symmetric block Lanczos algorithm to compute block Gauss...
Golub and Meurant have shown how to use the symmetric block Lanczos algorithm to compute block Gauss...
AbstractWe investigate the behaviour of the maximum error in applying Gaussian quadrature to the Che...
Abstract. Approximations of matrix-valued functions of the form WT f(A)W, where A ∈ Rm×m is symmetri...
20 pages, 5 figuresThis paper presents an algorithm to simulate Gaussian random vectors whose precis...
20 pages, 5 figuresThis paper presents an algorithm to simulate Gaussian random vectors whose precis...
This paper synthesizes formally orthogonal polynomials, Gaussian quadrature in the complex plane and...
AbstractThe Chebyshev and Stieltjes procedures are algorithms for computing recursion coefficients f...
DOI
Add to ORKG