Results 281 to 290 of about 57,258 (313)
Some of the next articles are maybe not open access.
THE JACOBI-PERRON ALGORITHM AND SIMULTANEOUS APPROXIMATION OF FUNCTIONS
Mathematics of the USSR-Sbornik, 1982A generalization of the Jacobi-Perron algorithm to the case of functions is considered. The rate is determined for the convergence (with respect to the coefficients of the Laurent series) of the generating rational functions to the functions that are being expanded in a continued fraction by means of this algorithm. A necessary and sufficient condition
openaire +1 more source
Approximating the zeros of analytic functions by the exclusion algorithm
Numerical Algorithms, 1994The author establishes an iterative algorithm for approximating those zeros of a given function \(f\) holomorphic on \(\mathbb{C}\) lying within a prescribed compact set \(E_ 0\subset \mathbb{C}\). The main tool is an exclusion function \(m\) satisfying \(m(z_ 0) = 0\) iff \(f(z_ 0) = 0\) and s.t.
openaire +1 more source
A Randomized Algorithm for Weighted Approximation of Points by a Step Function
Discrete Mathematics, Algorithms and Applications, 2010The problem considered in this paper is: Given an integer k > 0 and a set P of n points in the plane each with a corresponding nonnegative weight, find a step function f with k steps that minimize the maximum weighted vertical distance between f and all the points in P.
openaire +2 more sources
Evolutionary Algorithm in Approximation of Defuzzification Functional
AIP Conference Proceedings, 2010The space of ordered fuzzy numbers (OFN) forms a normed space on which defuzzification functionals can be defined. They play the main role when dealing with fuzzy controllers and fuzzy inference systems. An approximation formula for a general nonlinear functional is given.
Katarzyna Wȩgrzyn-Wolska +5 more
openaire +1 more source
ABOUT AN ALGORITHM OF FUNCTION APPROXIMATION BY THE LINEAR SPLINES
2016The actual application for the problem of best approximation of grid functionby linear splines was formulated. A mathematical model and a method for its solution were developed. Complexity of the problem was that it was multi - extremal and could not be solved analytically.
BAYRAKTAR, B., KUDAEV, V.
openaire +3 more sources
The convergence rate of the sandwich algorithm for approximating convex functions
Computing, 1992Interval bisection, slope bisection, maximum error rule and chord rule are considered as four natural rules leading to different versions of the sandwich algorithm for approximating a convex function of one variable over an interval by evaluating the function and its derivative at a sequence of points.
openaire +1 more source
Anytime Algorithms for Approximate Functional Dependencies
Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining V.2Sanjivni Rana +4 more
openaire +1 more source
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
Electronic Notes in Discrete Mathematics, 2017Viresh Patel, Guus Regts
exaly +2 more sources
Optimal algorithms for doubly weighted approximation of univariate functions
Journal of Approximation Theory, 2016Leszek Plaskota, G W Wasilkowski
exaly