Solving interval constraints by linearization in computer-aided design
From MaRDI portal
Publication:868685
DOI10.1007/S11155-006-9023-4zbMATH Open1110.65018OpenAlexW1966392227MaRDI QIDQ868685FDOQ868685
Authors: Yan Wang, Bartholomew O. Nnaji 
Publication date: 6 March 2007
Published in: Reliable Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11155-006-9023-4
Recommendations
Iterative numerical methods for linear systems (65F10) Computer-aided design (modeling of curves and surfaces) (65D17) Interval and finite arithmetic (65G30)
Cites Work
- Rigorous global search: continuous problems
- Title not available (Why is that?)
- Interval analysis: Theory and applications
- Interval Methods for Systems of Equations
- Existence Verification for Singular Zeros of Complex Nonlinear Systems
- Degree reduction of interval Bézier curves
- A note on epsilon-inflation
- Efficient control of the dependency problem based on Taylor model methods
- Robust interval algorithm for surface intersections
- A new technique in systems analysis under interval uncertainty and ambiguity
- Geometric constraint solver
- Title not available (Why is that?)
- Title not available (Why is that?)
- Analysis of Uncertain Structural Systems Using Interval Analysis
- Title not available (Why is that?)
- Title not available (Why is that?)
- On interval enclosures using slope arithmetic
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient interval linear equality solving in constraint logic programming
- Automatic computation of a linear interval enclosure
- On existence and uniqueness verification for non-smooth functions
- Use of interval slopes for the irrational part of factorable functions
- Horner's rule for interval evaluation revisited
- Symbolic preconditioning with Taylor models: Some examples
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- Preconditioners for the Interval Gauss–Seidel Method
- Bounding the Solution of Interval Linear Equations
- Title not available (Why is that?)
- Interval Arithmetic in Matrix Computations, Part I
- Bounding solutions of systems of equations using interval analysis
- Computation and application of Taylor polynomials with interval remainder bounds
- Taylor forms -- use and limits.
- Title not available (Why is that?)
- On bounding solutions of underdetermined systems
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD
- Decomposition plans for geometric constraint problems. II: New algorithms
- A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott enclosure for linear interval equations
- A verification method for solutions of nonsmooth equations
- Computation of singularities and intersections of offsets of planar curves
- A Comparison of some Methods for Solving Linear Interval Equations
- An interval Newton method
- Title not available (Why is that?)
- A new method for global solution of systems of nonlinear equations
- Interval forms of Newtons method
- A Modification of Krawczyk’s Algorithm
- Interval Arithmetic in Matrix Computations, Part II
- Algebraic method for manipulation of dimensional relationships in geometric models
- Sharp bounds on interval polynomial roots
- Geometric constraint satisfaction using optimization methods.
- Epsilon-inflation in verification algorithms
- Preconditioning linearized equations
- Robust interval solid modelling. II: Boundary evaluation.
- Interval Slopes for Rational Functions and Associated Centered Forms
- Title not available (Why is that?)
- A Quadratically Convergent Krawczyk-Like Algorithm
- Algebraic approach in the ``outer problem for interval linear equations
- On the Convergence of Some Interval-Arithmetic Modifications of Newton’s Method
- Cheap and tight bounds on the solution set of perturbed systems of nonlinear equations
- A Successive Interval Test for Nonlinear Systems
- An improved interval Newton operator
- Variation of geometries based on a geometric-reasoning method
- Bounding the slope of polynomial operators and some applications
- An approach to computer-aided parametric design
- A note on the Bernstein algorithm for bounds for interval polynomials
- Solving underdetermined systems with interval methods
- Constructive constraint-based model for parametric CAD systems
- Inclusion of zeros of nowhere differentiable \(n\)-dimensional functions
- Automatic generation of numerical redundancies for nonlinear constraint solving
- Bounds for the range of a bivariate polynomial over a triangle
- A 2-D geometric constraint solver using DOF-based graph reduction.
- Sparse systems in fixed point form
- An improved method for global solution of nonlinear systems
- Bernstein form is inclusion monotone
- Existence Verification for Higher Degree Singular Zeros of Nonlinear Systems
- On Shary's Algebraic Approach for Linear Interval Equations
Cited In (2)
Uses Software
This page was built for publication: Solving interval constraints by linearization in computer-aided design
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q868685)
