Inversion of extremely ill-conditioned matrices in floating-point
DOI10.1007/BF03186534zbMATH Open1185.65050MaRDI QIDQ849178FDOQ849178
Authors: Siegfried M. Rump 
Publication date: 25 February 2010
Published in: Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://projecteuclid.org/euclid.jjiam/1265033781
Recommendations
- scientific article; zbMATH DE number 4068157
- scientific article; zbMATH DE number 3905731
- A Class of Arbitrarily Ill Conditioned Floating-Point Matrices
- Accurate inverses for computing eigenvalues of extremely ill-conditioned matrices and differential operators
- A new computational approach for inversion of very large matrices
- Inexact inverse iteration for symmetric matrices
- A proximal approach to the inversion of ill-conditioned matrices
- scientific article
- On a Class of High Order Methods for Inverting Matrices
- A rapid numerical algorithm to compute matrix inversion
numerical examplescondition numberapproximate inverserounding errormultiplicative correctionfloating-point computationsaccurate dot productaccurate summationerror-free transformationsextremely ill-conditioned matrix
Direct numerical methods for linear systems and matrix inversion (65F05) Roundoff error (65G50) Numerical computation of matrix norms, conditioning, scaling (65F35) Conditioning of matrices (15A12)
Cites Work
- Accuracy and Stability of Numerical Algorithms
- Accurate Floating-Point Summation Part I: Faithful Rounding
- Title not available (Why is that?)
- Accurate Sum and Dot Product
- A floating-point technique for extending the available precision
- Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices
- Accurate floating-point summation. II: Sign, \(K\)-fold faithful and rounding to nearest
- A Class of Arbitrarily Ill Conditioned Floating-Point Matrices
Cited In (24)
- Unique reconstruction of simple magnetizations from their magnetic potential
- Iterative refinement for ill-conditioned linear systems
- Multiplicative perturbation theory of the Moore-Penrose inverse and the least squares problem
- Five-Precision GMRES-Based Iterative Refinement
- Small singular values can increase in lower precision
- Convergence of Rump's method for inverting arbitrarily ill-conditioned matrices
- The relative formulation of the quadratic programming problem in the aircraft assembly modeling
- Inversion error, condition number, and approximate inverses of uncertain matrices
- Convergence analysis of an algorithm for accurate inverse Cholesky factorization
- A new analysis of iterative refinement and its application to accurate solution of ill-conditioned sparse linear systems
- Fast interval matrix multiplication
- Iterative learning control with discrete‐time nonlinear nonminimum phase models via stable inversion
- Convergence of Rump's method for computing the Moore-Penrose inverse.
- Floating-point arithmetic on the test bench. How are verified numerical solutions calculated?
- An algorithm for automatically selecting a suitable verification method for linear systems
- On the computation of modular forms on noncongruence subgroups
- Convergence analysis of accurate inverse Cholesky factorization
- Newton projection method as applied to assembly simulation
- Accurate Horner methods in real and complex floating-point arithmetic
- A fast parallel high-precision summation algorithm based on AccSumK
- Coupling of BEM with a large displacement and rotation algorithm
- A fast and efficient algorithm for solving ill-conditioned linear systems
- Parametric inverse of severely ill-conditioned Hermitian matrices in signal processing
- On the iterative refinement of the solution of ill-conditioned linear system of equations
Uses Software
This page was built for publication: Inversion of extremely ill-conditioned matrices in floating-point
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q849178)
