Results 261 to 270 of about 880,492 (299)

Discrete Nonlinear Mean Approximation

ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik, 1977
AbstractBest approximation on a finite set by a non‐linear family of functions with respect to a general sum “norm”, which includes as a special case the Lp norms (1 < p < ∞), is considered. Properties of best approximations are given. It is shown that a local minimum of the error may not be a global minimum. Computation of best approximations is
openaire   +2 more sources

Approximation by discrete spline interpolation

2010 11th International Conference on Control Automation Robotics & Vision, 2010
For a function f(t) defined on the discrete interval N[a, b + 2] = {a, a + 1, …, b + 2}, we develop a class of quintic discrete spline interpolate S ρ f(t) that involves only differences. Further, explicit error bounds are offered in the form of the inequality ||f-H ρ f||≤d j max/t∊N[a, b+2-j] |Δj f(t)|, 2≤j≤6 where the constants d j , 2 ≤ j ≤ 6 are
Fengmin Chen, Patricia J. Y. Wong
openaire   +1 more source

Approximation of Discrete Sequential Boundaries

Biometrika, 1986
Conservative critical limits for discrete sequential boundaries are derived, when the number of decision times and group sizes are not fixed in advance. The method at any stage of the sequential experiment requires only the joint distribution of the test statistics at the last two inspection times.
openaire   +2 more sources

Discrete approximation of the Koch curve

Computers & Graphics, 1993
Abstract Existing algorithms for Koch curve generation do not consider the discrete environment of the computer. They do not define the termination condition explicitly. Therefore, generation of the curve must be terminated in ad-hoc manners. This paper describes a new algorithm for discretely approximated Koch curve generation which produces only ...
Sam Chung Hwang, Hyun Seung Yang
openaire   +2 more sources

An Approximate Algorithm for Discrete Linear Programming

IEEE Transactions on Systems Science and Cybernetics, 1969
An algorithm is presented for determining an approximate solution of a large class of discrete linear programming problems, and an upper bound on the profit loss due to the approximation is computed. A subregion of the original polyhedron of feasible solutions is also defined; such a subregion certainly contains the optimal solution of the discrete ...
Emanuele Biondi, Roberto Schmid
openaire   +2 more sources

Discrete approximations to continuous curves

Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006., 2006
We consider the problem of approximating a continuous curve by a piecewise linear one whose segments are assumed to be connected by universal joints. Rather than taking a least-squares approach, we require that the endpoints of the line segments lie on the continuous curve.
openaire   +2 more sources

Reexamining Discrete Approximations to Continuous Distributions

Decision Analysis, 2013
Discretization is a common decision analysis technique for which many methods are described in the literature and employed in practice. The accuracy of these methods is typically judged by how well they match the mean, variance, and possibly higher moments of the underlying continuous probability distribution.
Robert K. Hammond, J. Eric Bickel
openaire   +3 more sources

Note on Discrete Approximations

Journal of the American Statistical Association, 1973
Abstract Suppose it is required to replace a continuous variate Z by an integer-valued approximation X in such a way that X retains as much information as possible. This problem is encountered, for example, in the field of educational measurement, where performance scores are often replaced by letter grades, which are then converted to grade points ...
W. Stefansky, Henry F. Kaiser
openaire   +1 more source

Discretized Normal Approximation

2011
Returning to the independent case, and inspired by use of the continuity correction for the normal approximation of the binomial, Chap. 7 considers the approximation of independent sums of integer valued random variables by the discretized normal distribution, in the total variation metric.
Louis H. Y. Chen, Larry Goldstein, Qi-Man Shao   +2 more
openaire   +1 more source

Continuous and Discrete Approximations

2014
In Chap. 10, we studied approximations using 2-norms that are defined from a dot product, and orthogonality was heavily used. In the first section of this chapter, we study polynomial approximation of continuous functions on an interval [a, b] using the uniform norm \(\|\cdot \|_{\infty }\).
Tom Lyche, Jean-Louis Merrien
openaire   +1 more source