Richardson method and totally nonnegative linear systems
Bernstein-Vandermonde matricescollocation matricescomputer-aided designconvergence accelerationcubic B-splineinterpolationnonsingular totally nonnegative matricesnonsingular totally nonnegative stochastic matricesnumerical examplesRichardson methodshape preserving modeling of curvessplineVandermonde matrices
Totally nonnegative stochastic matrices arise as collocation matrices in computer-aided design interpolating curves in a shape preserving manner [see e. g. \textit{J. M. Peña}. Shape preserving representations in computer aided geometric design. Huntington, NY: Nova Science. (1999; Zbl 1005.68163)] by polynomial and spline functions. The corresponding linear systems \(A x = b\) for the computation of the control points can be solved by the Richardson iterative method which converges if and only if the spectral radius of \(\rho(I-A)\), \(I\) identity matrix, is less than \(1\). In order to accelerate the convergence the authors use a relaxation of the method. They prove the convergence of this modified Richardson method for nonsingular totally nonnegative stochastic matrices and derive the parameter for the optimal convergence speed. Additionally, a modified Richardson method is presented, that converges for any nonsingular totally nonnegative matrix, including a procedure for the estimation of the optimal convergence parameter. The results are verified by numerical examples arising in the interpolation by spline and polynomial functions. Discussed are Vandermonde matrices, Bernstein-Vandermonde matrices, and quadratic and cubic B-spline collocation matrices. The choice of the optimal parameter reduces the number of iterations to a factor greater than a half. The convergence is low in the case of bad conditioning using higher degrees in the polynomial interpolation but, the convergence is ensured for any dimension.
- On a Monotony-preserving Accelerator Process for the Successive Approximations Method
- Adaptive Richardson iteration based on Leja points
- scientific article; zbMATH DE number 749845
- Diagonal Matrix Scaling and Linear Programming
- scientific article; zbMATH DE number 1161226
- Relaxation strategy for Richardson iterative method
- Solving nonlinear matrix equations arising in tree-like stochastic processes.
- An efficient Chebyshev semi-iterative version for the solution of large systems
- A stable Richardson iteration method for complex linear systems
- NUMERICAL STABILITY OF THE RICHARDSON SECOND ORDER METHOD
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- B-splines and optimal stability
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 3348831 (Why is no real title available?)
- Least supported bases and local linear independence
- Progressive iterative approximation and bases with the fastest convergence rates
- Shape preserving representations and optimality of the Bernstein basis
- Shape preserving representations in computer aided geometric design
- Totally positive bases and progressive iteration approximation
- Totally positive bases for shape preserving curve design and optimality of B-splines
- Totally positive matrices
- Progressive iterative approximation for extended cubic uniform B-splines with shape parameters
- Stationary splitting iterative methods for the matrix equation AXB=C
- Preconditioned progressive iterative approximation for triangular Bézier patches and its application
- Richardson's iterative method for surface interpolation
- Preconditioned progressive iterative approximation for tensor product Bézier patches
- On the progressive iteration approximation property and alternative iterations
- The weighted GS-PIA algorithm for cubic B-spline curve interpolations and convergence analysis
This page was built for publication: Richardson method and totally nonnegative linear systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q603132)
