Accurate Computations and Applications of Some Classes of Matrices
From MaRDI portal
Publication:4637193
DOI10.1007/978-3-319-49631-3_3zbMath1444.65017OpenAlexW2743302250MaRDI QIDQ4637193
Publication date: 18 April 2018
Published in: Computational Mathematics, Numerical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-49631-3_3
Numerical mathematical programming methods (65K05) Roundoff error (65G50) Computer-aided design (modeling of curves and surfaces) (65D17) Numerical linear algebra (65F99)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fast and accurate algorithms for Jacobi-Stirling matrices
- B-Nekrasov matrices and error bounds for linear complementarity problems
- Accurate and efficient \(LDU\) decomposition of almost diagonally dominant \(Z\)-matrices
- Total positivity properties of Jacobi-Stirling numbers
- Error bounds for linear complementarity problems involving \(B^S\)-matrices
- Error bounds for linear complementarity problems of Nekrasov matrices
- Growth factors of pivoting strategies associated with Neville elimination
- Running error for the evaluation of rational Bézier surfaces through a robust algorithm
- Perturbation theory for the LDU factorization and accurate computations for diagonally dominant matrices
- Totally positive bases for shape preserving curve design and optimality of B-splines
- Backward error analysis of Neville elimination
- Progressive iterative approximation and bases with the fastest convergence rates
- On totally positive matrices
- Coincidence probabilities
- Coincidence properties of birth and death processes
- Shape preserving properties of the generalised Ball basis
- Error bounds for linear complementarity problems for \(B\)-matrices
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- Error bounds for the linear complementarity problem with a P-matrix
- Error analysis of efficient evaluation algorithms for tensor product surfaces
- Accurate computations with Said-Ball-Vandermonde matrices
- A comparison of error bounds for linear complementarity problems of \(H\)-matrices
- Efficient evaluation of multivariate polynomials
- A probabilistic representation of totally positive matrices
- Generalized Schur-complements and a test for total positivity
- Corner cutting algorithms for the Bézier representation of free form curves
- Descartes systems from corner cutting
- Total positivity and Neville elimination
- Some properties of totally positive matrices
- A matricial description of Neville elimination with applications to total positivity
- Entrywise perturbation theory for diagonally dominant M-matrices with applications
- Generalized convexity preserving transformations
- Optimally stable multivariate bases
- On the optimal stability of bases of univariate functions
- Accurate evaluation of Bézier curves and surfaces and the Bernstein-Fourier algorithm
- The Jacobi-Stirling numbers
- Numerical evaluation of the \(p\)th derivative of Jacobi series
- A new criterion for the H-matrix property
- Accurate SVDs of weakly diagonally dominant M-matrices
- Shape preserving representations and optimality of the Bernstein basis
- Error bounds for the linear complementarity problem with a \(\Sigma \)-SDD matrix
- On the evaluation of rational triangular Bézier surfaces and the optimal stability of the basis
- Error analysis of corner cutting algorithms
- Computing the singular value decomposition with high relative accuracy
- Accurate computations with collocation matrices of rational bases
- Jacobi-Stirling numbers, Jacobi polynomials, and the left-definite analysis of the classical Jacobi differential expression
- LDU decompositions with \(L\) and \(U\) well conditioned
- Tests for the recognition of total positivity
- Conditioning and accurate computations with Pascal matrices
- A note on the optimal stability of bases of univariate functions
- Computation of error bounds for P-matrix linear complementarity problems
- A semigroup of totally nonnegative matrices
- Evaluation of the derivative of a polynomial in Bernstein form
- A reduction theorem for totally positive matrices
- Running error for the evaluation of rational Bézier surfaces
- 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 and fast computations with positive extended Schoenmakers-Coffey matrices
- Eigenvalue bounds for some classes of P -matrices
- Computing singular values of diagonally dominant matrices to high relative accuracy
- Running Relative Error for the Evaluation of Polynomials
- Accurate and efficient LDU decomposition of diagonally dominant M-matrices
- A Corner Cutting Algorithm for Evaluating Rational Bézier Surfaces and the Optimal Stability of the Basis
- Accurate Computations with Totally Nonnegative Matrices
- Optimal Conditioning of Bernstein Collocation Matrices
- Iterative refinement for Neville elimination
- Accurate and efficient expression evaluation and linear algebra
- Total positivity and the embedding problem for Markov chains
- Convexity and generalized Bernstein polynomials
- B-splines and optimal stability
- On the Multivariate Horner Scheme
- Accuracy and Stability of Numerical Algorithms
- On the Iterative Criterion for Generalized Diagonally Dominant Matrices
- Accurate Computations with Collocation Matrices of q-Bernstein Polynomials
- Algorithm 960
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- A New Iterative Criterion for H‐Matrices
- Totally positive matrices
- On the multivariate Horner scheme. II: Running error analysis
