Cited in
(65)- Componentwise backward error analysis of Neville elimination
- Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression
- Componentwise error analysis for the block LU factorization of totally nonnegative matrices
- Accurate eigenvalues and exact zero Jordan blocks of totally nonnegative matrices
- Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications
- Fast and accurate algorithms for Jacobi-Stirling matrices
- Accurate polynomial interpolation by using the Bernstein basis
- Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations
- On computing Schur functions and series thereof
- Accurate bidiagonal decomposition of totally positive h-Bernstein-Vandermonde matrices and applications
- Accurate solutions of structured generalized Kronecker product linear systems
- Numerical problems with the Pascal triangle in moment computation
- On semiring complexity of Schur polynomials
- Polynomial least squares fitting in the Bernstein basis
- Fast simplicial quadrature-based finite element operators using Bernstein polynomials
- Accurate computations with Said-Ball-Vandermonde matrices
- Characterizations and accurate computations for tridiagonal Toeplitz matrices
- An optimal test for almost strict total positivity
- Accurate computations with Wronskian matrices of Bessel and Laguerre polynomials
- Accurate computations with Gram and Wronskian matrices of geometric and Poisson bases
- Computing eigenvalues of quasi-generalized Vandermonde matrices to high relative accuracy
- Accurate computations with collocation and Wronskian matrices of Jacobi polynomials
- Accurate computations with Wronskian matrices
- On Tridiagonal Sign Regular Matrices and Generalizations
- Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices
- Accurate solutions of weighted least squares problems associated with rank-structured matrices
- Almost strictly totally negative matrices: an algorithmic characterization
- Accurate algorithms for Bessel matrices
- Bidiagonal factorizations with some parameters equal to zero
- BPOLY
- Padua2DM
- Padua2D
- CLARFG
- Intrepid
- MR3-SMP
- POLYNOMIAL
- Algorithm 957
- CONSURF
- Tests for the recognition of total positivity
- Accurate and fast computations with positive extended Schoenmakers-Coffey matrices
- Accurate singular values of a class of parameterized negative matrices
- Relative perturbation analysis for eigenvalues and singular values of totally nonpositive matrices
- A Matrix Approach to the Newton Formula and Divided Differences
- Rank structure properties of rectangular matrices admitting bidiagonal-type factorizations
- Error analysis, perturbation theory and applications of the bidiagonal decomposition of rectangular totally positive h-Bernstein-Vandermonde matrices
- Accurate computations with collocation matrices of \(q\)-Bernstein polynomials
- Accurate eigenvalues of certain sign regular matrices
- Algorithm 960
- Total positivity and accurate computations with Gram matrices of Bernstein bases
- Accurate bidiagonal decomposition and computations with generalized Pascal matrices
- Total Positivity: A New Inequality and Related Classes of Matrices
- On the characterization of totally nonpositive matrices
- Bidiagonal decompositions of oscillating systems of vectors
- Conditioning and accurate computations with Pascal matrices
- Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.
- Fast inversion of the simplicial Bernstein mass matrix
- Subtraction-free complexity, cluster transformations, and spanning trees
- Accurate Computations with Totally Nonnegative Matrices
- Accurate computations with Lupaş matrices
- Similarity to totally positive matrices and accurate computations
- Bidiagonal decomposition of rectangular totally positive Said-Ball-Vandermonde matrices: error analysis, perturbation theory and applications
- Compact cubic splines
- Accurate computation of generalized eigenvalues of regular SR-BP pairs
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
- Extremal and optimal properties of B-bases collocation matrices
This page was built for software: TNTool
