On the Compatibility of a Given Solution With the Data of a Linear System

Authors:
J. L. Rigal;J. Gaches
Affiliations:
Laboratoire de Calcul Numérique, Faculté des Sciences de Besançon, Besançon, France;Laboratoire de Calcul Numérique, Faculté des Sciences de Besançon, Besançon, France
Venue:
Journal of the ACM (JACM)
Year:
1967

Citing 0
Cited 7

A new stopping criterion for linear perturbed asynchronous iterations

Journal of Computational and Applied Mathematics
Extra-Precise Iterative Refinement for Overdetermined Least Squares Problems

ACM Transactions on Mathematical Software (TOMS)
On perturbation bounds of Kronecker product linear systems and their level-2 condition numbers

Journal of Computational and Applied Mathematics
Monitoring the block conjugate gradient convergence within the inexact inverse subspace iteration

PPAM'05 Proceedings of the 6th international conference on Parallel Processing and Applied Mathematics
Partial spectral information from linear systems to speed-up numerical simulations in computational fluid dynamics

VECPAR'04 Proceedings of the 6th international conference on High Performance Computing for Computational Science
A proposed numerical accuracy control system

Symposium on Interactive Systems for Experimental Applied Mathematics: Proceedings of the Association for Computing Machinery Inc. Symposium
Iterative refinement techniques for solving block linear systems of equations

Applied Numerical Mathematics

Quantified Score

Hi-index	0.01

Visualization

Abstract

Some new theorems generalizing a result of Oettli and Prager are applied to the a posteriori analysis of the compatibility of a computed solution to the uncertain data of a linear system (or of a polynomial equation).