Reliable Computing, Volume 11

Volume 11, Number 1, February 2005

• Luc Jaulin, Didier Henrion:
  Contracting Optimally an Interval Matrix without Loosing Any Positive Semi-Definite Matrix Is a Tractable Problem. 1-17
  Electronic Edition (link) BibTeX
• Lev V. Utkin, Igor Kozine:
  Computing System Reliability Given Interval-Valued Characteristics of the Components. 19-34
  Electronic Edition (link) BibTeX
• Jiri Rohn:
  A Normal Form Supplement to the Oettli-Prager Theorem. 35-39
  Electronic Edition (link) BibTeX
• Abdelhay A. Salama, Emad Hamdy:
  Interval Schemes for Singularly Perturbed Initial Value Problems. 41-58
  Electronic Edition (link) BibTeX
• Vladik Kreinovich, Luc Longpré, Praveen Patangay, Scott Ferson, Lev Ginzburg:
  Outlier Detection under Interval Uncertainty: Algorithmic Solvability and Computational Complexity. 59-76
  Electronic Edition (link) BibTeX
• Marco Schnurr:
  On the Proofs of Some Statements Concerning the Theorems of Kantorovich, Moore, and Miranda. 77-85
  Electronic Edition (link) BibTeX

Volume 11, Number 2, April 2005

• Hans-Robert Arndt, Günter Mayer:
  On the Solutions of the Interval System [x] = [A][x] + [b]. 87-103
  Electronic Edition (link) BibTeX
• Marina Lyashko:
  The Optimal Solution of an Interval System of Linear Algebraic Equations. 105-127
  Electronic Edition (link) BibTeX
• Jiri Rohn:
  Linear Interval Equations: Midpoint Preconditioning May Produce a 100% Overestimation for Arbitrarily Narrow Data Even in Case n = 4. 129-135
  Electronic Edition (link) BibTeX
• Steffen Schön, Hansjörg Kutterer:
  Using Zonotopes for Overestimation-Free Interval Least-Squares-Some Geodetic Applications. 137-155
  Electronic Edition (link) BibTeX
• Mitsuhiro T. Nakao, Kaori Nagatou:
  SCAN'2004 11th GAMM-IMACS International Symposium on Scientific Computing, Computer Arithmetic, and Validated NumericsFukuoka, Japan, October 4-8, 2004. 157-159
  Electronic Edition (link) BibTeX
• Second R. E. Moore Prize Awarded at SCAN'2004. 161-162
  Electronic Edition (link) BibTeX
• R. Baker Kearfott:
  Errata and Opinion to: "An Interval Entropy Penalty Method for Nonlinear Global Optimization". 163-164
  Electronic Edition (link) BibTeX

Volume 11, Number 3, June 2005

• Götz Alefeld, Günter Mayer:
  Enclosing Solutions of Singular Interval Systems Iteratively. 165-190
  Electronic Edition (link) BibTeX
• Takeshi Ogita, Shin'ichi Oishi:
  Fast Inclusion of Interval Matrix Multiplication. 191-205
  Electronic Edition (link) BibTeX
• Scott Ferson, Lev Ginzburg, Vladik Kreinovich, Luc Longpré, Monica Aviles:
  Exact Bounds on Finite Populations of Interval Data. 207-233
  Electronic Edition (link) BibTeX
• Johannes Wallner, Hans-Peter Schröcker, Shi-Min Hu:
  Tolerances in Geometric Constraint Problems. 235-251
  Electronic Edition (link) BibTeX

Volume 11, Number 4, August 2005

• Boglárka Tóth, Tibor Csendes:
  Empirical Investigation of the Convergence Speed of Inclusion Functions in a Global Optimization Context. 253-273
  Electronic Edition (link) BibTeX
• Nathalie Revol, Fabrice Rouillier:
  Motivations for an Arbitrary Precision Interval Arithmetic and the MPFI Library. 275-290
  Electronic Edition (link) BibTeX
• Kavitha Tupelly, Vladik Kreinovich, Karen Villaverde:
  Checking If There Exists a Monotonic Function That Is Consistent with the Measurements: An Efficient Algorithm. 291-312
  Electronic Edition (link) BibTeX
• Franky Backeljauw, Annie A. M. Cuyt:
  A Constructive Criticism of the C/C++ Proposal for Complex Arithmetic. 313-319
  Electronic Edition (link) BibTeX

Volume 11, Number 5, October 2005

• Sergey P. Shary:
  Preface. 321-322
  Electronic Edition (link) BibTeX
• Ramil R. Akhmerov:
  Interval-Affine Gaussian Algorithm for Constrained Systems. 323-341
  Electronic Edition (link) BibTeX
• Yuri G. Dolgov:
  Developing Interval Global Optimization Algorithms on the Basis of Branch-and-Bound and Constraint Propagation Methods. 343-358
  Electronic Edition (link) BibTeX
• Alexei G. Ershov, Tamara P. Kashevarova:
  Interval Mathematical Library Based on Chebyshev and Taylor Series Expansion. 359-367
  Electronic Edition (link) BibTeX
• Pau Herrero, Miguel Ángel Sainz, Josep Vehí, Luc Jaulin:
  Quantified Set Inversion Algorithm with Applications to Control. 369-382
  Electronic Edition (link) BibTeX
• R. Baker Kearfott:
  Validated Constraint Solving-Practicalities, Pitfalls, and New Developments. 383-391
  Electronic Edition (link) BibTeX
• Bartlomiej Jacek Kubica, Krzysztof Malinowski:
  An Interval Global Optimization Algorithm Combining Symbolic Rewriting and Componentwise Newton Method Applied to Control a Class of Queueing Systems. 393-411
  Electronic Edition (link) BibTeX
• Sergey G. Pushkov, Svetlana Yu. Kalinkina:
  Boundary Realizations Method for Interval Linear Dynamic Systems. 413-423
  Electronic Edition (link) BibTeX
• Irene A. Sharaya:
  On Unbounded Tolerable Solution Sets. 425-432
  Electronic Edition (link) BibTeX
• Sergei I. Zhilin:
  On Fitting Empirical Data under Interval Error. 433-442
  Electronic Edition (link) BibTeX

Volume 11, Number 6, December 2005

• Alexandre Goldsztejn:
  A Right-Preconditioning Process for the Formal-Algebraic Approach to Inner and Outer Estimation of AE-Solution Sets. 443-478
  Electronic Edition (link) BibTeX
• Vladik Kreinovich:
  Optimal Finite Characterization of Linear Problems with Inexact Data. 479-489
  Electronic Edition (link) BibTeX
• Jiri Rohn:
  How Strong Is Strong Regularity? 491-493
  Electronic Edition (link) BibTeX
• Eldon R. Hansen:
  A Theorem on Regularity of Interval Matrices. 495-497
  Electronic Edition (link) BibTeX
• Martine Ceberio, Vladik Kreinovich, Michel Rueher:
  Reliable Computations and Their Applications (RCA) Track. 499-503
  Electronic Edition (link) BibTeX