Accurate computations and applications of some classes of matrices
From MaRDI portal
Recommendations
- Similarity to totally positive matrices and accurate computations
- Accurate determinants of some classes of matrices
- Accurate Computations with Totally Nonnegative Matrices
- Computing singular value decompositions of parameterized matrices with total nonpositivity to high relative accuracy
- Accurate Computations for Some Classes of Matrices
Cites work
- A comparison of error bounds for linear complementarity problems of \(H\)-matrices
- A Corner Cutting Algorithm for Evaluating Rational Bézier Surfaces and the Optimal Stability of the Basis
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- A matricial description of Neville elimination with applications to total positivity
- A new criterion for the H-matrix property
- A New Iterative Criterion for H‐Matrices
- A note on the optimal stability of bases of univariate functions
- A probabilistic representation of totally positive matrices
- A reduction theorem for totally positive matrices
- A semigroup of totally nonnegative matrices
- Accuracy and Stability of Numerical Algorithms
- Accurate and efficient \(LDU\) decomposition of almost diagonally dominant \(Z\)-matrices
- Accurate and efficient expression evaluation and linear algebra
- Accurate and efficient LDU decomposition of diagonally dominant M-matrices
- Accurate and fast computations with positive extended Schoenmakers-Coffey matrices
- Accurate computation of the smallest eigenvalue of a diagonally dominant M-matrix
- Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.
- Accurate computations with collocation matrices of q-Bernstein polynomials
- Accurate computations with collocation matrices of rational bases
- Accurate computations with Said-Ball-Vandermonde matrices
- Accurate Computations with Totally Nonnegative Matrices
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm
- Accurate SVDs of weakly diagonally dominant M-matrices
- Algorithm 960
- B-Nekrasov matrices and error bounds for linear complementarity problems
- B-splines and optimal stability
- Backward error analysis of Neville elimination
- Coincidence probabilities
- Coincidence properties of birth and death processes
- Computation of error bounds for P-matrix linear complementarity problems
- Computing singular values of diagonally dominant matrices to high relative accuracy
- Computing the singular value decomposition with high relative accuracy
- Conditioning and accurate computations with Pascal matrices
- Convexity and generalized Bernstein polynomials
- Corner cutting algorithms for the Bézier representation of free form curves
- Descartes systems from corner cutting
- Efficient evaluation of multivariate polynomials
- Eigenvalue bounds for some classes of P-matrices
- Entrywise perturbation theory for diagonally dominant M-matrices with applications
- Error analysis of corner cutting algorithms
- Error analysis of efficient evaluation algorithms for tensor product surfaces
- Error bounds for linear complementarity problems for \(B\)-matrices
- Error bounds for linear complementarity problems involving \(B^S\)-matrices
- Error bounds for linear complementarity problems of Nekrasov matrices
- Error bounds for the linear complementarity problem with a \(\Sigma \)-SDD matrix
- Error bounds for the linear complementarity problem with a P-matrix
- Evaluation of the derivative of a polynomial in Bernstein form
- Fast and accurate algorithms for Jacobi-Stirling matrices
- Generalized convexity preserving transformations
- Generalized Schur-complements and a test for total positivity
- Growth factors of pivoting strategies associated with Neville elimination
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 194260 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 1083131 (Why is no real title available?)
- scientific article; zbMATH DE number 1113632 (Why is no real title available?)
- scientific article; zbMATH DE number 1136347 (Why is no real title available?)
- scientific article; zbMATH DE number 1136348 (Why is no real title available?)
- scientific article; zbMATH DE number 1793704 (Why is no real title available?)
- scientific article; zbMATH DE number 3348831 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Iterative refinement for Neville elimination
- Jacobi-Stirling numbers, Jacobi polynomials, and the left-definite analysis of the classical Jacobi differential expression
- LDU decompositions with \(L\) and \(U\) well conditioned
- Numerical evaluation of the \(p\)th derivative of Jacobi series
- On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis
- On the Iterative Criterion for Generalized Diagonally Dominant Matrices
- On the Multivariate Horner Scheme
- On the multivariate Horner scheme. II: Running error analysis
- On the optimal stability of bases of univariate functions
- On totally positive matrices
- Optimal conditioning of Bernstein collocation matrices
- Optimally stable multivariate bases
- Perturbation theory for the LDU factorization and accurate computations for diagonally dominant matrices
- Progressive iterative approximation and bases with the fastest convergence rates
- Running error for the evaluation of rational Bézier surfaces
- Running error for the evaluation of rational Bézier surfaces through a robust algorithm
- Running relative error for the evaluation of polynomials
- Shape preserving properties of the generalised Ball basis
- Shape preserving representations and optimality of the Bernstein basis
- Shape preserving representations in computer aided geometric design
- Some properties of totally positive matrices
- Tests for the recognition of total positivity
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- The Jacobi-Stirling numbers
- Total positivity and Neville elimination
- Total positivity and the embedding problem for Markov chains
- Total positivity properties of Jacobi-Stirling numbers
- Totally nonnegative matrices
- Totally positive bases for shape preserving curve design and optimality of B-splines
- Totally positive matrices
- Totally positive matrices
Cited in
(12)- Accurate algorithms for Bessel matrices
- Accurate computations with collocation matrices of rational bases
- Accurate and fast computations with positive extended Schoenmakers-Coffey matrices
- Accurate Computations with Totally Nonnegative Matrices
- scientific article; zbMATH DE number 4069088 (Why is no real title available?)
- Accurate computations with collocation matrices of a general class of bases
- Accurate Computations for Some Classes of Matrices
- Similarity to totally positive matrices and accurate computations
- Accurate computation of all eigenvalues of a totally nonnegative matrix by the Cauchon algorithm
- Accurate inverses and determinants of doubly strictly diagonally dominant Z-matrices
- Accurate computations for the inverse of \(\{P_1, P_2\}\)-Nekrasov \(Z\)-matrices
- Accurate determinants of some classes of matrices
This page was built for publication: Accurate computations and applications of some classes of matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4637193)
