Solving interval constraints by linearization in computer-aided design
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 992811 (Why is no real title available?)
- scientific article; zbMATH DE number 3649911 (Why is no real title available?)
- scientific article; zbMATH DE number 3880009 (Why is no real title available?)
- scientific article; zbMATH DE number 3936378 (Why is no real title available?)
- scientific article; zbMATH DE number 3653430 (Why is no real title available?)
- scientific article; zbMATH DE number 54251 (Why is no real title available?)
- scientific article; zbMATH DE number 193252 (Why is no real title available?)
- scientific article; zbMATH DE number 193463 (Why is no real title available?)
- scientific article; zbMATH DE number 2035082 (Why is no real title available?)
- scientific article; zbMATH DE number 804609 (Why is no real title available?)
- scientific article; zbMATH DE number 804623 (Why is no real title available?)
- A 2-D geometric constraint solver using DOF-based graph reduction.
- A Comparison of some Methods for Solving Linear Interval Equations
- A Modification of Krawczyk’s Algorithm
- A Quadratically Convergent Krawczyk-Like Algorithm
- A Successive Interval Test for Nonlinear Systems
- A new method for global solution of systems of nonlinear equations
- A new technique in systems analysis under interval uncertainty and ambiguity
- A note on epsilon-inflation
- A note on the Bernstein algorithm for bounds for interval polynomials
- A simple derivation of the Hansen-Bliek-Rohn-Ning-Kearfott enclosure for linear interval equations
- A verification method for solutions of nonsmooth equations
- Algebraic approach in the ``outer problem for interval linear equations
- Algebraic method for manipulation of dimensional relationships in geometric models
- An approach to computer-aided parametric design
- An improved interval Newton operator
- An improved method for global solution of nonlinear systems
- An interval Newton method
- Analysis of Uncertain Structural Systems Using Interval Analysis
- Automatic computation of a linear interval enclosure
- Automatic generation of numerical redundancies for nonlinear constraint solving
- Bernstein form is inclusion monotone
- Bounding solutions of systems of equations using interval analysis
- Bounding the Solution of Interval Linear Equations
- Bounding the slope of polynomial operators and some applications
- Bounds for the range of a bivariate polynomial over a triangle
- Cheap and tight bounds on the solution set of perturbed systems of nonlinear equations
- Computation and application of Taylor polynomials with interval remainder bounds
- Computation of singularities and intersections of offsets of planar curves
- Constructive constraint-based model for parametric CAD systems
- Decomposition plans for geometric constraint problems. II: New algorithms
- Decomposition plans for geometric constraint systems. I: Performance measures for CAD
- Degree reduction of interval Bézier curves
- Efficient control of the dependency problem based on Taylor model methods
- Efficient interval linear equality solving in constraint logic programming
- Epsilon-inflation in verification algorithms
- Existence Verification for Higher Degree Singular Zeros of Nonlinear Systems
- Existence Verification for Singular Zeros of Complex Nonlinear Systems
- Geometric constraint satisfaction using optimization methods.
- Geometric constraint solver
- Horner's rule for interval evaluation revisited
- Inclusion of zeros of nowhere differentiable n-dimensional functions
- Interval Arithmetic in Matrix Computations, Part I
- Interval Arithmetic in Matrix Computations, Part II
- Interval Methods for Systems of Equations
- Interval Slopes for Rational Functions and Associated Centered Forms
- Interval analysis: Theory and applications
- Interval forms of Newtons method
- Newton-Algorithmen zur Bestimmung von Nullstellen mit Fehlerschranken
- On Shary's Algebraic Approach for Linear Interval Equations
- On bounding solutions of underdetermined systems
- On existence and uniqueness verification for non-smooth functions
- On interval enclosures using slope arithmetic
- On the Convergence of Some Interval-Arithmetic Modifications of Newton’s Method
- Preconditioners for the Interval Gauss–Seidel Method
- Preconditioning linearized equations
- Rigorous global search: continuous problems
- Robust interval algorithm for surface intersections
- Robust interval solid modelling. II: Boundary evaluation.
- Sharp bounds on interval polynomial roots
- Solving underdetermined systems with interval methods
- Sparse systems in fixed point form
- Symbolic preconditioning with Taylor models: Some examples
- Taylor forms -- use and limits.
- Use of interval slopes for the irrational part of factorable functions
- Variation of geometries based on a geometric-reasoning method
Cited in
(2)
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)
