Accurate computations with Lupaş matrices

DOI10.1016/j.amc.2017.01.031zbMath1411.65032OpenAlexW2581875623MaRDI QIDQ1735388

Jorge Delgado, Juan Manuel Peña

Publication date: 28 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: http://zaguan.unizar.es/record/64490

zbMATH Keywords

totally positive matricesaccurate computationsbidiagonal decompositionsLupaş operator

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Theory of matrix inversion and generalized inverses (15A09) Basic orthogonal polynomials and functions (Askey-Wilson polynomials, etc.) (33D45) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (12)

Characterizations and accurate computations for tridiagonal Toeplitz matrices ⋮ Accurate computations with collocation matrices of the Lupaş-type \((p,q)\)-analogue of the Bernstein basis ⋮ The continuity in \(q\) of the Lupaş \(q\)-analogues of the Bernstein operators ⋮ Bidiagonal decompositions of Vandermonde-type matrices of arbitrary rank ⋮ On the block functions generating the limit q-Lupaş operator ⋮ On the image of the Lupaş \(q\)-analogue of the Bernstein operators ⋮ On the Lupaş \(q\)-transform of unbounded functions ⋮ Accurate computation of the Moore-Penrose inverse of strictly totally positive 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 ⋮ All Jordan canonical forms of irreducible totally non-negative matrices

Uses Software

• TNTool

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast and accurate algorithms for Jacobi-Stirling matrices
• Generalized Bézier curves and surfaces based on Lupaş \(q\)-analogue of Bernstein operator
• On the Lupaş \(q\)-transform
• A fast and accurate algorithm for solving Bernstein-Vandermonde linear systems
• Accurate computations with Said-Ball-Vandermonde matrices
• Total positivity and Neville elimination
• A matricial description of Neville elimination with applications to total positivity
• Shape preserving representations and optimality of the Bernstein basis
• Computing the singular value decomposition with high relative accuracy
• Accurate computations with collocation matrices of rational bases
• On the Lupaş \(q\)-analogue of the Bernstein operator
• Accurate Computations with Totally Nonnegative Matrices
• The Accurate and Efficient Solution of a Totally Positive Generalized Vandermonde Linear System
• Totally positive matrices
• Quantum calculus

This page was built for publication: Accurate computations with Lupaş matrices