A matricial description of Neville elimination with applications to total positivity
From MaRDI portal
(Redirected from Publication:1329923)
The authors show for a class of nonsingular matrices that the cost of Neville elimination process is less than the Gauss elimination. They also give some new characterizations for totally positive matrices.
Recommendations
Cites work
- Almost strictly totally positive matrices
- Backward error analysis for totally positive linear systems
- Corner cutting algorithms for the Bézier representation of free form curves
- scientific article; zbMATH DE number 4134736 (Why is no real title available?)
- scientific article; zbMATH DE number 4058754 (Why is no real title available?)
- scientific article; zbMATH DE number 3486372 (Why is no real title available?)
- scientific article; zbMATH DE number 3348831 (Why is no real title available?)
- Some properties of totally positive matrices
- Total positivity and Neville elimination
- Totally positive matrices
Cited in
(85)- Factorizations of Cauchy-Vandermonde matrices
- Total positivity and Neville elimination
- Scaled pivoting in Gauss and Neville elimination for totally positive systems
- A test for strict sign-regularity
- Shape preserving representations for trigonometric polynomial curves
- Consecutive-column and -row properties of matrices and the Loewner-Neville factorization
- Explicit factorization of the Vandermonde matrix
- Elimination techniques: From extrapolation to totally positive matrices and CAGD
- Accurate solutions of product linear systems associated with rank-structured matrices
- Computing singular value decompositions of parameterized matrices with total nonpositivity to high relative accuracy
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
- Accurate computations with Lupaş matrices
- A PLU-factorization of rectangular matrices by the Neville elimination
- On nonsingular sign regular matrices
- On the characterization of almost strictly totally positive matrices
- A test and bidiagonal factorization for certain sign regular matrices
- Neville elimination: An efficient algorithm with application to chemistry
- Accurate solutions of structured generalized Kronecker product linear systems
- Accurate computations with collocation and Wronskian matrices of Jacobi polynomials
- Accurate computations with Wronskian matrices
- Accurate computations with Wronskian matrices of Bessel and Laguerre polynomials
- Accurate computations with Gram and Wronskian matrices of geometric and Poisson bases
- Accurate computations with matrices related to bases \(\{t^ie^{\lambda t}\}\)
- Accurate computations with collocation matrices of the Lupaş-type \((p,q)\)-analogue of the Bernstein basis
- Accurate eigenvalues of some generalized sign regular matrices via relatively robust representations
- Accurate computations for eigenvalues of products of Cauchy-polynomial-Vandermonde matrices
- Error analysis, perturbation theory and applications of the bidiagonal decomposition of rectangular totally positive h-Bernstein-Vandermonde matrices
- Accurate bidiagonal decomposition of totally positive h-Bernstein-Vandermonde matrices and applications
- Accurate solutions of weighted least squares problems associated with rank-structured matrices
- On the characterization of totally nonpositive matrices
- Tests for the recognition of total positivity
- Full rank factorization in quasi-\(LDU\) form of totally nonpositive rectangular matrices
- Componentwise backward error analysis of Neville elimination
- Neville elimination for rank-structured matrices
- Total positivity and accurate computations with Gram matrices of Bernstein bases
- Fast and accurate algorithms for Jacobi-Stirling matrices
- scientific article; zbMATH DE number 4215245 (Why is no real title available?)
- Iterative refinement for Neville elimination
- scientific article; zbMATH DE number 4058754 (Why is no real title available?)
- A note on matrices with maximal growth factor for Neville elimination
- Characterizations of M-Banded ASSR Matrices
- Accurate computations and applications of some classes of matrices
- ASSR matrices and some particular cases
- A Totally Positive Factorization of Rectangular Matrices by the Neville Elimination
- Rank structure properties of rectangular matrices admitting bidiagonal-type factorizations
- Algorithmic characterization of pentadiagonal ASSR matrices
- Accurate bidiagonal decomposition of totally positive Cauchy-Vandermonde matrices and applications
- A note on Bernstein-Vandermonde matrices
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- Relative perturbation analysis for eigenvalues and singular values of totally nonpositive matrices
- Accurate computations with collocation matrices of q-Bernstein polynomials
- scientific article; zbMATH DE number 227624 (Why is no real title available?)
- Scalability of Neville elimination using checkerboard partitioning
- A study of the performance of Neville elimination using two kinds of partitioning techniques
- Polynomial least squares fitting in the Bernstein basis
- Bidiagonal decomposition of rectangular totally positive Said-Ball-Vandermonde matrices: error analysis, perturbation theory and applications
- Polynomial total positivity and high relative accuracy through Schur polynomials
- On the accuracy of de Casteljau-type algorithms and Bernstein representations
- High relative accuracy through Newton bases
- Accurate bidiagonal factorization of quantum Hilbert matrices
- Growth factors of pivoting strategies associated with Neville elimination
- On the total positivity of q-Bernstein mass matrices and their accurate computations
- Total positivity and accurate computations related to q-Abel polynomials
- Computing eigenvalues for products of two classes of sign regular matrices to high relative accuracy
- Backward error analysis of Neville elimination
- Accurate algebra and error analysis for geometric r -Frank matrices
- On the accurate basis conversion of univariate polynomials
- High-relative-accuracy computations with Kac-Murdock-Szegö matrices and their generalizations
- Sufficient conditions for total positivity, compounds, and Dodgson condensation
- On the accurate computation of the Newton form of the Lagrange interpolant
- Neville elimination: a study of the efficiency using checkerboard partitioning
- Characterizations and stable tests for the Routh--Hurwitz conditions and for total positivity
- Recent advances on accuracy, stability and optimality of B-bases
- Accurate spectral computations and error analysis for r-geometric Min and Max matrices
- Total positivity of analytic bases through symmetric functions
- Accurate computations for the inverse of \(\{P_1, P_2\}\)-Nekrasov \(Z\)-matrices
- Full rank factorization in echelon form of totally nonpositive (negative) rectangular matrices
- Factorizations of confluent Cauchy-Vandermonde matrices
- Analyzing scalability of Neville elimination
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- The work of Mariano Gasca
- Bernstein-Bezoutian matrices and curve implicitization
- Decompositions of strictly sign regular matrices
- Accurate computations with Said-Ball-Vandermonde matrices
- A collection of examples where Neville elimination outperforms Gaussian elimination
This page was built for publication: A matricial description of Neville elimination with applications to total positivity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1329923)
