A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
From MaRDI portal
Publication:875013
DOI10.1016/J.LAA.2006.11.020zbMATH Open1116.65038arXivmath/0605577OpenAlexW2054956151MaRDI QIDQ875013FDOQ875013
Authors: Ana Marco, José-Javier Martínez 
Publication date: 10 April 2007
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/math/0605577
Recommendations
- Fast algorithms of Björck-Pereyra type for solving Cauchy-Vandermonde linear systems
- Fast Solution of Confluent Vandermonde Linear Systems
- scientific article
- 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
algorithmVandermonde matrixBernstein basisbidiagonal factorizationInterpolationTotal positivityBidiagonal decompositionHigh relative accuracy
Cites Work
- Shape preserving representations and optimality of the Bernstein basis
- Title not available (Why is that?)
- Title not available (Why is that?)
- Accuracy and Stability of Numerical Algorithms
- Error analysis of the Björck-Pereyra algorithms for solving Vandermonde systems
- Algorithms for polynomials in Bernstein form
- Total positivity and Neville elimination
- A matricial description of Neville elimination with applications to total positivity
- On the stability of transformations between power and Bernstein polynomial forms
- Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
- The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
- Solution of Vandermonde systems of equations
- Effectively Well-Conditioned Linear Systems
- Title not available (Why is that?)
- Bernstein-Bézoutian matrices
- Backward error analysis of Neville elimination
- Factorizations of Cauchy-Vandermonde matrices
- A fast parallel Björck-Pereyra-type algorithm for solving Cauchy linear equations
- Title not available (Why is that?)
Cited In (56)
- Least squares problems involving generalized Kronecker products and application to bivariate polynomial regression
- Accurate computations of matrices with bidiagonal decomposition using methods for totally positive matrices
- Computing the Bézier control points of the Lagrangian interpolant in arbitrary dimension
- Flip procedure in geometric approximation of multiple-component shapes – Application to multiple-inclusion detection
- Optimal interval length for the collocation of the Newton interpolation basis
- Accurate polynomial interpolation by using the Bernstein basis
- Structured Inversion of the Bernstein--Vandermonde Matrix
- Linearizations of matrix polynomials in Bernstein bases
- Fast and accurate algorithms for Jacobi-Stirling matrices
- Accurate computation of eigenvalues of generalized sign regular quasi-Said-Ball-Vandermonde matrices
- Deformation of spatial septic Pythagorean hodograph curves using Gauss-Legendre polygon
- Accurate and fast computations with Green matrices
- Accurate bidiagonal decomposition of totally positive h-Bernstein-Vandermonde matrices and applications
- Accurate solutions of structured generalized Kronecker product linear systems
- Gauss-Lobatto polygon of Pythagorean hodograph curves
- Polynomial least squares fitting in the Bernstein basis
- Accurate Computations with Collocation Matrices of q-Bernstein Polynomials
- Richardson method and totally nonnegative linear systems
- GPU-Accelerated Bernstein--Bézier Discontinuous Galerkin Methods for Wave Problems
- Accurate computations with Said-Ball-Vandermonde matrices
- A note on Bernstein-Vandermonde matrices
- New shape control tools for rational Bézier curve design
- Accurate computations with Gram and Wronskian matrices of geometric and Poisson bases
- Accurate Computations and Applications of Some Classes of Matrices
- Accurate computations with collocation matrices of the Lupaş-type \((p,q)\)-analogue of the Bernstein basis
- Accurate computations with Wronskian matrices
- Rectifying control polygon for planar Pythagorean hodograph curves
- Matrices with Bidiagonal Decomposition, Accurate Computations and Corner Cutting Algorithms
- A fast Björck-Pereyra-type algorithm for solving Hessenberg-quasiseparable-Vandermonde systems
- Accurate solutions of weighted least squares problems associated with rank-structured 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 algorithms for Bessel matrices
- Accurate Computation of Generalized Eigenvalues of Regular SR-BP Pairs
- Bernstein-Bezoutian matrices and curve implicitization
- Accurate and fast computations with positive extended Schoenmakers-Coffey matrices
- Accurate computations with matrices related to bases \(\{t^ie^{\lambda t}\}\)
- Tests for the recognition of total positivity
- Accurate singular values of a class of parameterized negative matrices
- Progressive iterative approximation for extended cubic uniform B-splines with shape parameters
- Algorithm 960
- Preconditioned progressive iterative approximation for triangular Bézier patches and its application
- Preconditioned progressive iterative approximation for tensor product Bézier patches
- Total Positivity: A New Inequality and Related Classes of Matrices
- The Bernstein polynomial basis: a centennial retrospective
- A qd-type method for computing generalized singular values of BF matrix pairs with sign regularity to high relative accuracy
- Similarity to totally positive matrices and accurate computations
- Accurate computations with Lupaş matrices
- Title not available (Why is that?)
- On the formulation of a BEM in the Bézier-Bernstein space for the solution of Helmholtz equation
- Accurate computation of the Moore-Penrose inverse of strictly totally positive matrices
- Efficient Solution of Algebraic Bernoulli Equations Using ℋ-Matrix Arithmetic
- Extremal and optimal properties of B-bases collocation matrices
- Computing eigenvalues of quasi-rational Said-Ball-Vandermonde matrices
- Accurate computations with some Catalan-Stieltjes matrices
- High relative accuracy for rational q-Bernstein–Vandermonde matrices
- Bidiagonal decompositions of Vandermonde-type matrices of arbitrary rank
Uses Software
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)
