Results 31 to 40 of about 44,196 (310)
Approximation results for flow shop scheduling problems with machine availability constraints [PDF]
, 2009 This paper considers two-machine flow shop scheduling problems with machine availability constraints. When the processing of a job is interrupted by an unavailability period of a machine, we consider both the resumable scenario in which the processing ...
Strusevich, Vitaly A. +2 more
core +1 more source
On a polynomial approximation problem
Journal of Approximation Theory, 2010 AbstractLet F be a closed subset of the unit circle T and let f∈C(F). We investigate the problem of uniform approximation of f on F by polynomials Pn which are uniformly bounded on the unit disk Δ. In a particular case when F is a closed arc of T, the problem was solved by L. Zalcman in 1982, who has also pointed out the possibility of considering more
Department of Mathematics and Statistics, University of South Florida, Tampa, FL 33620, USA ( host institution ) +1 more
openaire +2 more sources
Vestnik Samarskogo Gosudarstvennogo Tehničeskogo Universiteta. Seriâ: Fiziko-Matematičeskie Nauki, 2020 The paper includes the well-known matrix method of numerical integration of boundary value problems for inhomogeneous linear ordinary differential equations with variable coefficients, which provides retaining an arbitrary number of Taylor series ...
Vladimir Nikolaevich Maklakov
doaj +1 more source
The best uniform quadratic approximation of circular arcs with high accuracy
Open Mathematics, 2016 In this article, the issue of the best uniform approximation of circular arcs with parametrically defined polynomial curves is considered. The best uniform approximation of degree 2 to a circular arc is given in explicit form.
Rababah Abedallah
doaj +1 more source
Approximation by homogeneous polynomials [PDF]
Journal of Approximation Theory, 2013 Uniform approximations by even degree homogeneous polynomials are considered. For a centrally symmetric convex set with nonempty interior, all even continuous functions on its boundary (in two space dimensions; the problem is open for higher dimensions) can be uniformly approximated by them. This is a new, more elementary proof of this fact.
openaire +3 more sources
Algorithms and error bounds for multivariate piecewise constant approximation
, 2010 We review the surprisingly rich theory of approximation of functions of many vari- ables by piecewise constants. This covers for example the Sobolev-Poincar´e inequalities, parts of the theory of nonlinear approximation, Haar wavelets and tree ...
Oleg Davydov, Davydov, Oleg
core +1 more source
Clustering Affine Subspaces: Algorithms and Hardness [PDF]
, 2012 We study a generalization of the famous k-center problem where each object is an affine subspace of dimension Δ, and give either the first or significantly improved algorithms and hardness results for many combinations of parameters.
Lee, Euiwoong
core +1 more source
On the Approximation of the Jacobi Polynomials
Rocky Mountain Journal of Mathematics, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Elias, Uri, Gingold, Harry
openaire +3 more sources
Algorithms For Positive Polynomial Approximation [PDF]
SIAM Journal on Numerical Analysis, 2019 Summary: We propose several algorithms for positive polynomial approximation. The main tool is a novel iterative method to compute nonnegative interpolation polynomials at any order, which is shown to converge under conditions that make it suitable for the numerical approximation of positive functions. Our method is based on the special representations
Charles, Frédérique +2 more
openaire +2 more sources
Efficient approximation of random fields for numerical applications [PDF]
, 2014 This article is dedicated to the rapid computation of separable expansions for the approximation of random fields. We consider approaches based on techniques from the approximation of non-local operators on the one hand and based on the pivoted Cholesky ...
Michael Peters +5 more
core +1 more source