scientific article; zbMATH DE number 4001322
[For the entire collection see Zbl 0614.00003.] We describe an algorithm with an \(O_ A(n(\log n)^ 2)\) time complexity for the multiplication of generalized Hilbert matrices with vectors. These matrices are defined by \((B_ p)_{i,j}=1/(t_ i-s_ j)^ p\), \(i,j=1,...,n\) and \(p=1,2\), where \(t_ i\) and \(s_ i\) are distinct elements and \(t_ i\neq s_ i\), \(i=1,...,n\). An implementation of the algorithm for the Chebyshev points, which arise in the numerical approximation of Cauchy singular integral equations, is presented. The time complexity of the algorithm, for this special set of points, reduces to \(O_ A(n \log n)\).
- A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors
- On computational complexity for the multiplication of generalized Hilbert matrices with vectors and solution of certain generalized linear Hilbert systems
- A Generalized Hilbert Matrix Problem and Confluent Chebyshev--Vandermonde Systems
- Fast Algorithms for Confluent Vandermonde Linear Systems and Generalized Trummer’s Problem
- A Matrix Problem with Application to Rapid Solution of Integral Equations
- scientific article; zbMATH DE number 4169960 (Why is no real title available?)
- A Fast Algorithm for the Multiplication of Generalized Hilbert Matrices with Vectors
- A Generalized Hilbert Matrix Problem and Confluent Chebyshev--Vandermonde Systems
- A Fast Algorithm for Trummer’s Problem
- A Matrix Problem with Application to Rapid Solution of Integral Equations
- On computational complexity for the multiplication of generalized Hilbert matrices with vectors and solution of certain generalized linear Hilbert systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4727286)