Polynomial total positivity and high relative accuracy through Schur polynomials
From MaRDI portal
Publication:6053015
DOI10.1007/s10915-023-02323-1MaRDI QIDQ6053015
No author found.
Publication date: 25 September 2023
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Schur functionsorthogonal polynomialstotally positive matriceshigh relative accuracybidiagonal decompositions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On collocation matrices for interpolation and approximation
- Total positivity and Neville elimination
- A matricial description of Neville elimination with applications to total positivity
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
- Computing the singular value decomposition with high relative accuracy
- Accurate computations with collocation and Wronskian matrices of Jacobi polynomials
- Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices
- Accurate algorithms for Bessel matrices
- Rectangular Kronecker coefficients and plethysms in geometric complexity theory
- Accurate SVDs of polynomial Vandermonde matrices involving orthonormal polynomials
- Accurate computations with Laguerre matrices
- Normal subgroup reconstruction and quantum computation using group representations
- Accurate Computations with Totally Nonnegative Matrices
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Solution of Vandermonde systems of equations
- Accurate and efficient evaluation of Schur and Jack functions
This page was built for publication: Polynomial total positivity and high relative accuracy through Schur polynomials
