Crossref Citations
This Book has been
cited by the following publications. This list is generated based on data provided by Crossref.
Zuhe, Shen
and
Wolfe, M.A.
1990.
On interval enclosures using slope arithmetic.
Applied Mathematics and Computation,
Vol. 39,
Issue. 1,
p.
89.
Rump, S.M.
1991.
Estimation of the Sensitivity of linear and nonlinear algebraic problems.
Linear Algebra and its Applications,
Vol. 153,
Issue. ,
p.
1.
Ratschek, H.
and
Voller, R. L.
1991.
What can interval analysis do for global optimization?.
Journal of Global Optimization,
Vol. 1,
Issue. 2,
p.
111.
Hansen, E. R.
1991.
Bounding the set of solutions of a perturbed global optimization problem.
Journal of Global Optimization,
Vol. 1,
Issue. 4,
p.
359.
Jansson, C.
and
Rump, S. M.
1991.
Rigorous solution of linear programming problems with uncertain data.
ZOR - Methods and Models of Operations Research,
Vol. 35,
Issue. 2,
p.
87.
Rump, S. M.
1992.
On the solution of interval linear systems.
Computing,
Vol. 47,
Issue. 3-4,
p.
337.
Köylüoğlu, Hasan Uğur
Ş. Çakmak, Ahmet
and
Nielsen, Søren R. K.
1995.
Interval Algebra to Deal with Pattern Loading and Structural Uncertainties.
Journal of Engineering Mechanics,
Vol. 121,
Issue. 11,
p.
1149.
Kearfott, R. Baker
1995.
A Fortran 90 environment for research and prototyping of enclosure algorithms for nonlinear equations and global optimization.
ACM Transactions on Mathematical Software,
Vol. 21,
Issue. 1,
p.
63.
Wang, Morgan C.
and
Kennedy, William J.
1995.
A self-validating numerical method for computation of central and non-central F probabilities and percentiles.
Statistics and Computing,
Vol. 5,
Issue. 2,
p.
155.
Schaefer, Mark J.
and
Bubeck, Tilmann
1995.
A parallel complex zero finder.
Reliable Computing,
Vol. 1,
Issue. 3,
p.
317.
Jansson, Christian
and
Kn�ppel, Olaf
1995.
A branch and bound algorithm for bound constrained optimization problems without derivatives.
Journal of Global Optimization,
Vol. 7,
Issue. 3,
p.
297.
Bar-On, Ilan
Codenotti, Bruno
and
Leoncini, Mauro
1996.
Checking robust nonsingularity of tridiagonal matrices in linear time.
BIT Numerical Mathematics,
Vol. 36,
Issue. 2,
p.
206.
Benhamou, Frédéric
and
Granvilliers, Laurent
1996.
Artificial Intelligence and Symbolic Mathematical Computation.
Vol. 1138,
Issue. ,
p.
144.
Vainstein, F. S.
1996.
Low redundancy polynomial checks for numerical computation.
Applicable Algebra in Engineering, Communication and Computing,
Vol. 7,
Issue. 6,
p.
439.
Kearfott, R. Baker
1996.
Algorithm 763: INTERVAL_ARITHMETIC.
ACM Transactions on Mathematical Software,
Vol. 22,
Issue. 4,
p.
385.
Adjiman, Claire S.
and
Floudas, Christodoulos A.
1996.
Rigorous convex underestimators for general twice-differentiable problems.
Journal of Global Optimization,
Vol. 9,
Issue. 1,
p.
23.
Chen, R.
and
Ward, A. C.
1997.
Generalizing Interval Matrix Operations for Design.
Journal of Mechanical Design,
Vol. 119,
Issue. 1,
p.
65.
Koshelev, Misha
and
Starks, Scott
1997.
Energy from space.
ACM SIGNUM Newsletter,
Vol. 32,
Issue. 3,
p.
9.
Dimitrova, Nelli S.
and
Ullrich, Christian P.
1997.
Numerical Analysis and Its Applications.
Vol. 1196,
Issue. ,
p.
142.
Kühn, W.
1998.
Rigorously computed orbits of dynamical systems without the wrapping effect.
Computing,
Vol. 61,
Issue. 1,
p.
47.