default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReliable Computing, Volume 6
Volume 6, Number 1, February 2000
- Helmut Ratschek, Jon G. Rokne:
Introduction to the Special Issue: What Can One Learn from Box-Plane Intersections? 1-8 - Ole Caprani, Lars Hvidegaard, Mikkel Mortensen, Thomas Schneider:
Robust and Efficient Ray Intersection of Implicit Surfaces. 9-21 - Jeffrey S. Ely, Anthony P. Leclerc:
Correct Delaunay Triangulation in the Presence of Inexact Inputs and Arithmetic. 23-38 - Marina L. Gavrilova, Helmut Ratschek, Jon G. Rokne:
Exact Computation of Delaunay and Power Triangulations. 39-60 - Pierre Alliez, Olivier Devillers
, Jack Snoeyink:
Removing Degeneracies by Perturbing the Problem or Perturbing the World. 61-79 - Timothy J. Hickey, Zhe Qju, Maarten H. van Emden:
Interval Constraint Plotting for Interactive Visual Exploration of Implicitly Defined Relations. 81-92 - Interval Integration. 93-94
Volume 6, Number 2, May 2000
- Eldon R. Hansen:
The Hull of Preconditioned Interval Linear Equations. 95-103 - Kiyotaka Yamamura:
Finding All Solutions of Nonlinear Equations Using Linear Combinations of Functions. 105-113 - Ralf Hungerbühler, Jürgen Garloff:
Computation of the Bernstein Coefficients on Subdivided Triangles. 115-121 - Dusan M. Stipanovic, Dragoslav D. Siljak:
Jacobi and Gauss-Seidel Iterations for Polytopic Systems: Convergence via Convex M-Matrices. 123-137 - Graçaliz Pereira Dimuro, Antônio Carlos da Rocha Costa, Dalcidio Moraes Claudio:
A Coherence Space of Rational Intervals for a Construction of IR. 139-178 - Leocadio G. Casado, Inmaculada García, Yaroslav D. Sergeyev:
Interval Branch and Bound Algorithm for Finding the First-Zero-Crossing-Point in One-Dimensional Functions. 179-191 - Nathalie Revol, Jean-Claude Yakoubsohn:
Accelerated Shift-and-Add Algorithms. 193-205 - Werner Hofschuster, Walter Krämer:
Mathematical Function Software on the Web--Are Such Codes Useful for Verification Algorithms? 207-218 - Misha Koshelev:
Every Superinterval of the Function Range Can Be an Interval-Computations Enclosure. 219-223 - Eldon R. Hansen:
Reminiscence. 225-226
Volume 6, Number 3, August 2000
- Long Wang:
Composite Interval Control Systems: Some Strong Kharitonov-Like Properties. 231-246 - Yuzo Ohta:
Nonconvex Polygon Interval Arithmetic as a Tool for the Analysis and Design of Robust Control Systems. 247-279 - Josep Vehí, José Rodellar, Miguel Ángel Sainz, Joaquim Armengol:
Analysis of the Robustness of Predictive Controllers via Modal Intervals. 281-301 - Jürgen Garloff:
Application of Bernstein Expansion to the Solution of Control Problems. 303-320 - William W. Edmonson, Wen H. Lee, John M. M. Anderson:
Interval Methods for Sinusoidal Parameter Estimation: A Comparative Analysis. 321-336 - Michel Kieffer, Luc Jaulin, Eric Walter, Dominique Meizel:
Robust Autonomous Robot Localization Using Interval Analysis. 337-362
Volume 6, Number 4, November 2000
- Bernhard Beckermann, George Labahn:
Effective Computation of Rational Approximants and Interpolants. 365-390 - Jean-Daniel Fournier, Maciej Pindor:
Rational Interpolation from Stochastic Data: A New Froissart's Phenomenon. 391-409 - Peter R. Graves-Morris:
Reliability of Lanczos-Type Product Methods from Perturbation Theory. 411-428 - Hiroshi Kai, Matu-Tarow Noda:
Hybrid Rational Function Approximation and Its Accuracy Analysis. 429-438 - Nicos Karcanias, Marilena Mitrouli:
Numerical Computation of the Least Common Multiple of a Set of Polynomials. 439-457 - Tetsuya Sakurai, Hiroshi Sugiura:
On Factorization of Analytic Functions and Its Verification. 459-470
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.
last updated on 2025-12-09 00:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
