Efficient iterative algorithms for bounding the inverse of a matrix
From MaRDI portal
Publication:756361
DOI10.1007/BF02262219zbMath0722.65011OpenAlexW178045559MaRDI QIDQ756361
Jürgen Herzberger, Ljiljana D. Petković
Publication date: 1990
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02262219
convergencenumerical exampleinterval analysisiterative methodsinterval arithmeticmatrix inversionbounding the inverse of a matrixinterval Schulz's methods
Interval and finite arithmetic (65G30) Iterative numerical methods for linear systems (65F10) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items (5)
An interval-valued inversion of the non-additive interval-valued F-transform: use for upsampling a signal ⋮ Towards interval-based non-additive deconvolution in signal processing ⋮ Efficient algorithms for the inclusion of the inverse matrix using error- bounds for hyperpower methods ⋮ Towards a Robust Imprecise Linear Deconvolution ⋮ On a family of parallel root-finding methods for generalized polynomials
Cites Work
This page was built for publication: Efficient iterative algorithms for bounding the inverse of a matrix