Algorithm 681: INTBIS, a portable interval Newton/bisection package

From MaRDI portal
Revision as of 23:56, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4371651

DOI10.1145/78928.78931zbMath0900.65152OpenAlexW2030170144WikidataQ128028559 ScholiaQ128028559MaRDI QIDQ4371651

Manuel Novoa III, Ralph Baker Kearfott

Publication date: 23 March 1998

Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/toms/1990-16/




Related Items (32)

Interval arithmetic for nonlinear problem solvingThe cluster problem in multivariate global optimizationPROFIL/BIAS - A fast interval libraryInterval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospectsMinimal-energy clusters of hard spheresApplication of interval Newton's method to chemical engineering problemsA general iterative sparse linear solver and its parallelization for interval Newton methodsOptimizing INTBIS on the CRAY Y-MPFinding all solutions of nonlinearly constrained systems of equationsOn the selection of subdivision directions in interval branch-and-bound methods for global optimizationTopographical global initialization for finding all solutions of nonlinear systems with constraintsMcLaren's improved snub cube and other new spherical designs in three dimensionsInterval Analysis for Certified Numerical Solution of Problems in RoboticsDense packings of congruent circles in a circleNonsmooth exclusion test for finding all solutions of nonlinear equationsSubdivision strategies for boxes in branch-and-bound nonlinear solvers and verificationInterval methods for model qualification: methodology and advanced applicationDecompostition of arithmetic expressions to improve the behavior of interval iteration for nonlinear systemsFinding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithmInterval-based projection method for under-constrained numerical systemsEfficient interval partitioning-local search collaboration for constraint satisfactionNeutrino Mixing and the Minimal 3-3-1 ModelEfficient interval partitioning for constrained global optimizationA parser for the interval evaluation of analytical functions and its application to engineering problemsOn the complexity of isolating real roots and computing with certainty the topological degreeOPTIMAL INVESTMENT STRATEGY VIA INTERVAL ARITHMETIC\texttt{lsmear}: a variable selection strategy for interval branch and bound solversNode selection strategies in interval branch and bound algorithmsINTERVAL METHODS FOR RIGOROUS INVESTIGATIONS OF PERIODIC ORBITSThe use of interval arithmetic in solving a non-linear rational expectation based multiperiod output-inflation process model: the case of the IN/GB methodExperiments using interval analysis for solving a circuit design problemGlobal optimization using interval arithmetic







This page was built for publication: Algorithm 681: INTBIS, a portable interval Newton/bisection package