Results 121 to 130 of about 69,419 (165)

Geometrically nonlinear high-fidelity aerostructural optimization for highly flexible wings. [PDF]

Struct Multidiscipl Optim
Gray AC, Kennedy GJ, Martins JRRA.
europepmc   +1 more source

Trade-Off Between Entropy and Gini Index in Income Distribution. [PDF]

Entropy (Basel)
Koutsoyiannis D, Sargentis GF.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Best Approximation with Coefficient Constraints

IMA Journal of Numerical Analysis, 1988
Let B denote a compact Hausdorff space containing at least \(n+1\) points and let C(B) be the normed linear space of real-valued continuous functions on B endowed with the uniform norm \(\| f\| =\max_{x\in B}| f(x)|.\) Denote by \(U_ n\) an n-dimensional subspace of C(B).
Pinkus, A., Strauss, H.
openaire   +1 more source

L 1 -Approximation With Constraints

Transactions of the American Mathematical Society, 1990
The authors consider problems of characterization and uniqueness for best \(L^ 1\)-approximation to continuous functions, where the approximating sets are specified convex subsets of finite-dimensional subspaces. After a very interesting introduction in this area, they consider the problem of bounded coefficient approximation and best approximation ...
Pinkus, Allan, Strauss, Hans
openaire   +1 more source

Approximation with Convex Constraints

SIAM Review, 1973
Summary: This paper is a study of several problems of best approximation to a given function in a normed linear space from a convex subset of a finite-dimensional subspace. Specific problems treated are one-sided approximation and approximation with a positivity constraint, such as approximation by positive polynomials, monotonic polynomials or convex ...
openaire   +2 more sources

Best Polynomial Approximation with Linear Constraints

Canadian Journal of Mathematics, 1992
AbstractLet A be a (k + 1) × (k + 1) nonzero matrix. For polynomials p ∈ Pn, set and . Let E ⊂ C be a compact set that does not separate the plane and f be a function continuous on E and analytic in the interior of E. Set and . Our goal is to study approximation to f on E by polynomials from Bn(A). We obtain necessary and sufficient conditions on the
Pan, K., Saff, E. B.
openaire   +1 more source

Discrete Chebyshev Approximation with Linear Constraints

SIAM Journal on Numerical Analysis, 1985
For overdetermined systems of linear equations subject to linear constraints, the minimum norm solution with respect to the Chebyshev norm is considered. Using the concept of H-sets, characterizations for the solutions are obtained. A Remez-type ascent exchange algorithm is described and analyzed. Numerical examples are given.
openaire   +2 more sources

Constraint database query evaluation with approximation

Proceedings International Conference on Information Technology: Coding and Computing, 2002
Considers the problem of solving a large number of simple systems of linear constraints. This problem occurs in the context of constraint databases. The developed methodology is based on a hierarchical evaluation of the constraints, which are first simplified and replaced by approximations.
openaire   +2 more sources