Almost strictly sign regular matrices and Neville elimination with two-determinant pivoting

DOI10.1016/j.amc.2016.05.042zbMath1410.65076OpenAlexW2408990248MaRDI QIDQ1733660

Pedro Alonso, María Luisa Serrano, Juan Manuel Peña

Publication date: 21 March 2019

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

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

zbMATH Keywords

Neville eliminationalmost strictly sign regular matricestwo-determinant pivoting

Mathematics Subject Classification ID

Numerical computation of matrix norms, conditioning, scaling (65F35) Direct numerical methods for linear systems and matrix inversion (65F05)

Related Items (3)

Backward stability with almost strictly sign regular matrices ⋮ Comparing pivoting strategies for almost strictly sign regular matrices ⋮ Algorithmic characterization of pentadiagonal ASSR matrices

Uses Software

• mctoolbox

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonsingular almost strictly sign regular matrices
• Almost strictly totally negative matrices: an algorithmic characterization
• On the characterization of almost strictly sign regular matrices
• Sign regular matrices and Neville elimination
• A collection of examples where Neville elimination outperforms Gaussian elimination
• Total positivity and Neville elimination
• Almost strictly totally positive matrices
• On nonsingular sign regular matrices
• Full rank factorization in quasi-\(LDU\) form of totally nonpositive rectangular matrices
• Neville elimination for rank-structured matrices
• A stable test for strict sign regularity
• A Totally Positive Factorization of Rectangular Matrices by the Neville Elimination
• Accuracy and Stability of Numerical Algorithms
• Totally positive matrices

This page was built for publication: Almost strictly sign regular matrices and Neville elimination with two-determinant pivoting