![](https://dblp.uni-trier.de./img/logo.320x120.png)
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
default search action
Reliable Computing, Volume 18
Volume 18, 2013
- Marcin Michalak, Vladik Kreinovich:
Is it Possible to Have a Feasible Enclosure-Computing Method Which Is Independent of the Equivalent Form? 1-8 - Shinya Miyajima:
Fast Enclosure of Matrix Polynomials. 9-14 - Raazesh Sainudiin, Thomas L. York:
An Auto-Validating, Trans-Dimensional, Universal Rejection Sampler for Locally Lipschitz Arithmetical Expressions. 15-54 - Hao Jiang, Housen Li, Lizhi Cheng, Roberto Barrio, Canbin Hu, Xiangke Liao:
Accurate, Validated and Fast Evaluation of Bézier Tensor Product Surfaces. 55-72 - Madalina Erascu, Hoon Hong:
The Secant-Newton Map is Optimal Among Contracting Quadratic Maps for Square Root Computation. 73-81 - Maryam Shams Solary:
Finding the Smallest Eigenvalue by Properties of Semidefinite Matrices. 82-89 - Andrzej Pownuk, Luc Longpré, Vladik Kreinovich:
Checking Monotonicity is NP-Hard Even for Cubic Polynomials. 90-96 - Raazesh Sainudiin, Thomas Steinke:
A Rigorous Extension of the Schönhage-Strassen Integer Multiplication Algorithm Using Complex Interval Arithmetic. 97-116 - Olivier Mullier, Eric Goubault, Michel Kieffer, Sylvie Putot:
General Inner Approximation of Vector-valued Functions. 117-143 - Behnam Hashemi, Hanieh Tavakolipour:
A Non-Induced Interval Matrix Norm. 144-146 - Pavel V. Saraev:
Interval Pseudo-Inverse Matrices and Interval Greville Algorithm. 147-156
![](https://dblp.uni-trier.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.