- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Symposium on Computer Arithmetic (2019-June): 8877451 (2019-06)
- Event
-
Veröffentlichung
- (where)
-
Hamburg
- (who)
-
Universitätsbibliothek der Technischen Universität Hamburg-Harburg
- (when)
-
2019
- Creator
- DOI
-
10.15480/882.2561
- URN
-
urn:nbn:de:gbv:830-882.062561
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:38 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Rump, Siegfried M.
- Universitätsbibliothek der Technischen Universität Hamburg-Harburg
Time of origin
- 2019
Other Objects (12)
Kleine Fehlerschranken bei Matrixproblemen
Solution of linear and nonlinear algebraic problems with sharp, guaranteed bounds
How reliable are results of computers?
Real root isolation for algebraic polynomials
Algorithms for verified inclusions: theory and practice
Guaranteed inclusions for the complex generalized eigenproblem
Verification methods for dense and sparse systems of equations
Rigorous sensitivity analysis for systems of linear and nonlinear equations
A note on Oishi’s lower bound for the smallest singular value of linearized Galerkin equations
A note on Oishi’s lower bound for the smallest singular value of linearized Galerkin equations
Kleine, exakte Fehlerschranken für die Lösung linearer Gleichungssysteme
Algebraic computation, numerical computation and verified inclusions
Kleine Fehlerschranken bei Matrixproblemen
Solution of linear and nonlinear algebraic problems with sharp, guaranteed bounds
How reliable are results of computers?
Real root isolation for algebraic polynomials
Algorithms for verified inclusions: theory and practice
Guaranteed inclusions for the complex generalized eigenproblem
Verification methods for dense and sparse systems of equations
Rigorous sensitivity analysis for systems of linear and nonlinear equations
A note on Oishi’s lower bound for the smallest singular value of linearized Galerkin equations
A note on Oishi’s lower bound for the smallest singular value of linearized Galerkin equations
Kleine, exakte Fehlerschranken für die Lösung linearer Gleichungssysteme
Algebraic computation, numerical computation and verified inclusions
Kleine Fehlerschranken bei Matrixproblemen
Solution of linear and nonlinear algebraic problems with sharp, guaranteed bounds
How reliable are results of computers?
Real root isolation for algebraic polynomials
Algorithms for verified inclusions: theory and practice
Guaranteed inclusions for the complex generalized eigenproblem
Verification methods for dense and sparse systems of equations
Rigorous sensitivity analysis for systems of linear and nonlinear equations
A note on Oishi’s lower bound for the smallest singular value of linearized Galerkin equations
A note on Oishi’s lower bound for the smallest singular value of linearized Galerkin equations
Kleine, exakte Fehlerschranken für die Lösung linearer Gleichungssysteme