A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
From MaRDI portal
Publication:875013
Abstract: A fast and accurate algorithm for solving a Bernstein-Vandermonde linear system is presented. The algorithm is derived by using results related to the bidiagonal decomposition of the inverse of a totally positive matrix by means of Neville elimination. The use of explicit expressions for the determinants involved in the process serves to make the algorithm both fast and accurate.
Recommendations
- Fast algorithms of Björck-Pereyra type for solving Cauchy-Vandermonde linear systems
- Fast Solution of Confluent Vandermonde Linear Systems
- scientific article; zbMATH DE number 5670956
- An efficient and fast algorithm for solving generalized Vandermonde systems
- A fast and efficient algorithm for solving ill-conditioned linear systems
- Fast multidimensional Bernstein-Lagrange algorithms
- Fast Algorithms for Confluent Vandermonde Linear Systems and Generalized Trummer’s Problem
- Publication:4938056
- A fast Björck-Pereyra-type algorithm for solving Hessenberg-quasiseparable-Vandermonde systems
- Fast verified solutions of linear systems
Cites work
- scientific article; zbMATH DE number 3179593 (Why is no real title available?)
- scientific article; zbMATH DE number 491264 (Why is no real title available?)
- scientific article; zbMATH DE number 2134896 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations
- A matricial description of Neville elimination with applications to total positivity
- Accuracy and Stability of Numerical Algorithms
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- Algorithms for polynomials in Bernstein form
- Backward error analysis of Neville elimination
- Bernstein-Bézoutian matrices
- Effectively Well-Conditioned Linear Systems
- Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
- Factorizations of Cauchy-Vandermonde matrices
- On the stability of transformations between power and Bernstein polynomial forms
- Shape preserving representations and optimality of the Bernstein basis
- Solution of Vandermonde systems of equations
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Total positivity and Neville elimination
Cited in
(57)- Accurate computations with some Catalan-Stieltjes matrices
- High relative accuracy for rational q-Bernstein–Vandermonde matrices
- Computing eigenvalues of quasi-rational Said-Ball-Vandermonde matrices
- A fast and accurate algorithm for solving linear systems associated with a class of negative matrix
- Bidiagonal decompositions of Vandermonde-type matrices of arbitrary rank
- Computing the Bézier control points of the Lagrangian interpolant in arbitrary dimension
- Rectifying control polygon for planar Pythagorean hodograph curves
- The Bernstein polynomial basis: a centennial retrospective
- Linearizations of matrix polynomials in Bernstein bases
- Fast and accurate algorithms for Jacobi-Stirling matrices
- Accurate computations and applications of some classes of matrices
- Accurate polynomial interpolation by using the Bernstein basis
- Accurate singular values of a class of parameterized negative matrices
- Structured inversion of the Bernstein-Vandermonde matrix
- A fast Björck-Pereyra-type algorithm for solving Hessenberg-quasiseparable-Vandermonde systems
- Preconditioned progressive iterative approximation for triangular Bézier patches and its application
- Progressive iterative approximation for extended cubic uniform B-splines with shape parameters
- Bernstein-Bezoutian matrices and curve implicitization
- Preconditioned progressive iterative approximation for tensor product Bézier patches
- Accurate computations with Said-Ball-Vandermonde matrices
- Algorithm 960
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- Efficient Solution of Algebraic Bernoulli Equations Using ℋ-Matrix Arithmetic
- Flip procedure in geometric approximation of multiple-component shapes -- application to multiple-inclusion detection
- Deformation of spatial septic Pythagorean hodograph curves using Gauss-Legendre polygon
- GPU-accelerated Bernstein-Bézier discontinuous Galerkin methods for wave problems
- Accurate and fast computations with Green matrices
- Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression
- Extremal and optimal properties of B-bases collocation matrices
- Accurate and fast computations with positive extended Schoenmakers-Coffey matrices
- On the formulation of a BEM in the Bézier-Bernstein space for the solution of Helmholtz equation
- Matrices with bidiagonal decomposition, accurate computations and corner cutting algorithms
- Accurate computations with Wronskian matrices
- Accurate computations with matrices related to bases \(\{t^ie^{\lambda t}\}\)
- Accurate solutions of weighted least squares problems associated with rank-structured matrices
- Accurate computations with Gram and Wronskian matrices of geometric and Poisson bases
- Richardson method and totally nonnegative linear systems
- Tests for the recognition of total positivity
- Similarity to totally positive matrices and accurate computations
- Optimal interval length for the collocation of the Newton interpolation basis
- A note on Bernstein-Vandermonde matrices
- Accurate computation of eigenvalues of generalized sign regular quasi-Said-Ball-Vandermonde matrices
- Accurate computations with collocation matrices of \(q\)-Bernstein polynomials
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
- Bézier projection: a unified approach for local projection and quadrature-free refinement and coarsening of NURBS and T-splines with particular application to isogeometric design and analysis
- Accurate bidiagonal decomposition of totally positive h-Bernstein-Vandermonde matrices and applications
- Accurate computation of generalized eigenvalues of regular SR-BP pairs
- Accurate computations with collocation matrices of the Lupaş-type \((p,q)\)-analogue of the Bernstein basis
- Accurate algorithms for Bessel matrices
- Accurate computations with Lupaş matrices
- Gauss-Lobatto polygon of Pythagorean hodograph curves
- scientific article; zbMATH DE number 5670956 (Why is no real title available?)
- Accurate solutions of structured generalized Kronecker product linear systems
- Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices.
- Total Positivity: A New Inequality and Related Classes of Matrices
- Polynomial least squares fitting in the Bernstein basis
- New shape control tools for rational Bézier curve design
This page was built for publication: A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875013)
