Quadratures with remainders of minimum norm. I
نویسندگان
چکیده
منابع مشابه
On the Minimum Norm
This paper describes a new technique to nd the minimum norm solution of a linear program. The main idea is to reformulate this problem as an unconstrained minimization problem with a convex and smooth objective function. The minimization of this objective function can be carried out by a Newton-type method which is shown to be globally convergent. Furthermore, under certain assumptions, this Ne...
متن کاملSignal representations with minimum ℓ∞-norm
Maximum (or `∞) norm minimization subject to an underdetermined system of linear equations finds use in a large number of practical applications, such as vector quantization, peak-to-average power ratio (PAPR) (or “crest factor”) reduction in wireless communication systems, approximate neighbor search, robotics, and control. In this paper, we analyze the fundamental properties of signal represe...
متن کاملNonhomogeneity of Remainders, Ii
We present an example of a separable metrizable topological group G having the property that no remainder of it is (topologically) homogeneous. 1. Introduction. All topological spaces under discussion are Tychonoff. A space X is homogeneous if for any two points x, y ∈ X there is a homeomorphism h from X onto itself such that h(x) = y. If bX is a com-pactification of a space X, then bX \ X is c...
متن کاملOrdered Compactifications with Countable Remainders
Countable compactifications of topological spaces have been studied in [1], [5], [7], and [9]. In [7], Magill showed that a locally compact, T2 topological space X has a countable T2 compactification if and only if it has n-point T2 compactifications for every integer n ≥ 1. We generalize this theorem to T2-ordered compactifications of ordered topological spaces. Before starting our generalizat...
متن کاملThe determination of the path with minimum-cost norm value
The multiobjective shortest path problem (MSPP) consists of finding the best nondominated path linking two specified nodes in a network where k > 1 different criteria are considered for the arc costs. Solving the MSPP implies determining all the nondominated paths; there may be many such paths, making the selection process a very hard task to accomplish. A traditional way of dealing with such a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Computation
سال: 1967
ISSN: 0025-5718
DOI: 10.1090/s0025-5718-1967-0223089-0