![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
SCAN 1998: Szeged, Hungary
- Tibor Csendes:
Developments in Reliable Computing, International Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics, SCAN 1998, Szeged, Hungary, September 22-25, 1998. Springer 1999, ISBN 978-90-481-5350-3 - George F. Corliss, R. Baker Kearfott:
Rigorous Global Search: Industrial Applications. 1-16 - Axel Facius:
Influences of Rounding Errors in Solving Large Sparse Linear Systems. 17-30 - Javier Hormigo, Julio Villalba, Emilio L. Zapata:
A Hardware Approach to Interval Arithmetic for Sine and Cosine Functions. 31-41 - Wolfgang Kühn:
Towards an optimal control of the wrapping effect. 43-51 - Anatoly V. Lakeyev:
On Existence and Uniqueness of Solutions of Linear Algebraic Equations in Kaucher's Interval Arithmetic. 53-65 - Bruno Lang:
A Comparison of Subdivision Strategies for Verified Multi-Dimensional Gaussian Quadrature. 67-75 - Siegfried M. Rump:
INTLAB - INTerval LABoratory. 77-104 - Wolfram Luther, Werner Otten:
Verified calculation of the solution of algebraic Riccati equation. 105-118 - Michael Lerch:
Expression Concepts in Scientific Computing. 119-130 - Rafael Sagula, Tiarajú Asmuz Diverio, João Netto:
Performance Evaluation Technique STU and libavi Library. 131-140 - Michael J. Schulte, Vitaly Zelov, G. William Walster, Dmitri Chiriaev:
Single-Number Interval I/O. 141-148 - Klaus Musch, Günter Schumacher:
Interval Analysis for Embedded Systems. 149-158 - Yahia Lebbah, Olivier Lhomme:
Prediction by extrapolation for interval tightening methods. 159-166 - Svetoslav Markov, Kohshi Okumura:
The Contribution of T. Sunaga to Interval Analysis and Reliable Computing. 167-188 - Ernst Huber, Wilhelm Barth:
Surface-to-surface intersection with complete and guaranteed results. 189-202 - Vincent Lefèvre:
An Algorithm that Computes a Lower Bound on the Distance Between a Segment and ℤ2. 203-212 - Hélène Collavizza, François Delobel, Michel Rueher:
Comparing Partial Consistencies. 213-228 - Neli S. Dimitrova, Svetoslav M. Markov:
Verified Computation of Fast Decreasing Polynomials. 229-240 - Eva Dyllong, Wolfram Luther, Werner Otten:
An Accurate Distance-Calculation Algorithm for Convex Polyhedra. 241-253 - Andreas Frommer, Andre Weinberg:
Verified Error Bounds for Linear Systems Through the Lanczos Process. 255-267 - Gerhard Heindl:
A Representation of the Interval Hull of a Tolerance Polyhedron Describing Inclusions of Function Values and Slopes. 269-278 - Jean-Michel Muller:
A Few Results on Table-Based Methods. 279-288 - Nedialko S. Nedialkov, Kenneth R. Jackson:
An Interval Hermite-Obreschkoff Method for Computing Rigorous Bounds on the Solution of an Initial Value Problem for an Ordinary Differential Equation. 289-310 - Michael J. Schulte, Vitaly Zelov, Ahmet Akkas, James Craig Burley:
The Interval-Enhanced GNU Fortran Compiler. 311-322 - Sergey P. Shary:
Outer Estimation of Generalized Solution Sets to Interval Linear Systems. 323-335 - Adam W. Strzebonski:
A Real Polynomial Decision Algorithm Using Arbitrary-Precision Floating Point Arithmetic. 337-346 - Yoshitaka Watanabe, Nobito Yamamoto, Mitsuhiro T. Nakao:
A Numerical Verification Method of Solutions for the Navier-Stokes Equations. 347-357 - Barbara Kolodziejczak, Tomasz Szulc:
Convex Sets of Full Rank Matrices. 359-364 - Michael Lerch, Jürgen Wolff von Gudenberg:
Multiaspect Interval Types. 365-372 - Rezso Dunay, István Kollár:
MATLAB-Based Analysis of Roundoff Noise. 373-382 - George F. Corliss:
SCAN-98 Collected Bibliography. 383-402
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.