scientific article; zbMATH DE number 804609
From MaRDI portal
Publication:4851610
zbMath0829.65017MaRDI QIDQ4851610
Publication date: 11 October 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
numerical examplesBernstein polynomialsinterval arithmeticsubdivision algorithmHurwitz stabilityBernstein algorithmenclosure for the range of a multivariate polynomial
Interval and finite arithmetic (65G30) Computation of special functions and constants, construction of tables (65D20)
Related Items
Computing the range of values of real functions using B-spline form ⋮ Hyper-arc consistency of polynomial constraints over finite domains using the modified Bernstein form ⋮ High-order quadrature on multi-component domains implicitly defined by multivariate polynomials ⋮ Experiments with hybrid Bernstein global optimization algorithm for the OPF problem in power systems ⋮ Guaranteed parameter set estimation for exponential sums: the three-terms case ⋮ Algorithms for unconstrained global optimization of nonlinear (polynomial) programming problems: the single and multi-segment polynomial B-spline approach ⋮ Stability and distance to instability for polynomial matrix families. Complex perturbations ⋮ Solving interval constraints by linearization in computer-aided design ⋮ Chebyshev model arithmetic for factorable functions ⋮ On stability of parametrized families of polynomials and matrices ⋮ Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach ⋮ Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm ⋮ A connected component labeling algorithm for implicitly defined domains ⋮ An improved Bernstein global optimization algorithm for MINLP problems with application in process industry ⋮ On nonsingularity of a polytope of matrices ⋮ TMsim: an algorithmic tool for the parametric and worst-case simulation of systems with uncertainties ⋮ Quasiconvex relaxations based on interval arithmetic ⋮ On the complexity of isolating real roots and computing with certainty the topological degree ⋮ Bounds on the number of steps of WDS required for checking the positivity of integral forms ⋮ An efficient algorithm for range computation of polynomials using the Bernstein form ⋮ Formalization of Bernstein polynomials and applications to global optimization ⋮ An integrative approach for analysis of nonlinear electrical circuits using-polynomial B-spline expansion and B-spline Krawczyk operator
