Richardson method and totally nonnegative linear systems
DOI10.1016/j.laa.2010.07.007zbMath1208.65041OpenAlexW1999577987MaRDI QIDQ603132
Juan Manuel Peña, J. M. Carnicer, Jorge Delgado
Publication date: 5 November 2010
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2010.07.007
interpolationnumerical examplesconvergence accelerationRichardson methodsplinecomputer-aided designVandermonde matricescubic B-splineBernstein-Vandermonde matricescollocation matricesnonsingular totally nonnegative matricesnonsingular totally nonnegative stochastic matricesshape preserving modeling of curves
Numerical computation using splines (65D07) Positive matrices and their generalizations; cones of matrices (15B48) Iterative numerical methods for linear systems (65F10) Computer-aided design (modeling of curves and surfaces) (65D17) Stochastic matrices (15B51)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Totally positive bases for shape preserving curve design and optimality of B-splines
- Progressive iterative approximation and bases with the fastest convergence rates
- Totally positive bases and progressive iteration approximation
- A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
- Least supported bases and local linear independence
- Shape preserving representations and optimality of the Bernstein basis
- B-splines and optimal stability
- Totally positive matrices