Results 41 to 50 of about 421,634 (286)
An optimal polynomial approximation of Brownian motion [PDF]
In this paper, we will present a strong (or pathwise) approximation of standard Brownian motion by a class of orthogonal polynomials. The coefficients that are obtained from the expansion of Brownian motion in this polynomial basis are independent ...
Foster, James +2 more
core +3 more sources
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
FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension
We show the existence of a fully polynomial-time approximation scheme (FPTAS) for the problem of maximizing a non-negative polynomial over mixed-integer sets in convex polytopes, when the number of variables is fixed.
A.I. Barvinok +17 more
core +2 more sources
The best uniform quadratic approximation of circular arcs with high accuracy
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
Approximating Multilinear Monomial Coefficients and Maximum Multilinear Monomials in Multivariate Polynomials [PDF]
This paper is our third step towards developing a theory of testing monomials in multivariate polynomials and concentrates on two problems: (1) How to compute the coefficients of multilinear monomials; and (2) how to find a maximum multilinear monomial ...
A. Shamir +17 more
core +1 more source
Piecewise Monotone Polynomial Approximation [PDF]
Given a real function f satisfying a Lipschitz condition of order 1 on (a, b), there exists a sequence of approximating polynomials IP I such that the sequence En = |Pn - f| (sup norm) has order of magnitude I/n (D. Jackson). We investigate the possibility of selecting polynomials P having the same local n monotonicity as f without affecting the order ...
Newman, D. J. +2 more
openaire +1 more source
Domain-of-Attraction Estimation for Uncertain Non-polynomial Systems
In this paper, we consider the problem of computing estimates of the domain-of-attraction for non-polynomial systems. A polynomial approximation technique, based on multivariate polynomial interpolation and error analysis for remaining functions, is ...
Lin, Wang, Wu, Min, Yang, Zhengfeng
core +1 more source
Improved Approximation Algorithms for k-Submodular Function Maximization
This paper presents a polynomial-time $1/2$-approximation algorithm for maximizing nonnegative $k$-submodular functions. This improves upon the previous $\max\{1/3, 1/(1+a)\}$-approximation by Ward and \v{Z}ivn\'y~(SODA'14), where $a=\max\{1, \sqrt{(k-1)/
Iwata, Satoru +2 more
core +1 more source
Long‐Term Follow‐Up of Chemotherapy‐Associated Biological Aging in Women With Early Breast Cancer
Women threated with adjuvant chemotherapy for early breast cancer have sustained long‐term increase in p16INK4a,, a robust marker of cell senescence, suggesting a chemotherapy‐associated age acceleration. p16INK4a as well as other biomarkers may identify patients at greatest risk for senescence‐related diseases of aging.
Hyman B. Muss +12 more
wiley +1 more source
Separable Concave Optimization Approximately Equals Piecewise-Linear Optimization [PDF]
We study the problem of minimizing a nonnegative separable concave function over a compact feasible set. We approximate this problem to within a factor of 1+epsilon by a piecewise-linear minimization problem over the same feasible set. Our main result is
Magnanti, Thomas L., Stratila, Dan
core +1 more source

