共查询到20条相似文献,搜索用时 31 毫秒
1.
The conventional way of constructing boundary functions for wavelets on a finite interval is by forming linear combinations of boundary-crossing scaling functions. Desirable properties such as regularity (i.e. continuity and approximation order) are easy to derive from corresponding properties of the interior scaling functions. In this article we focus instead on boundary functions defined by recursion relations. We show that the number of boundary functions is uniquely determined, and derive conditions for determining regularity from the recursion coefficients. We show that there are regular boundary functions which are not linear combinations of shifts of the underlying scaling functions. 相似文献
2.
In this presentation, a technique for constructing bent functions from plateaued functions is introduced and analyzed. This generalizes earlier techniques for constructing bent from near-bent functions. Using this construction, we obtain a big variety of inequivalent bent functions, some weakly regular and some non-weakly regular. Classes of bent functions having some additional properties that enable the construction of strongly regular graphs are formed, and explicit expressions for bent functions with maximal degree are presented. 相似文献
3.
4.
《Quaestiones Mathematicae》2013,36(6):781-801
AbstractThe ultrametrically injective hull TX of an ultrametric space (X, d) is investigated by viewing it as the space of ultra-extremal functions over X. It turns out that the ultra-extremal functions are also ultra-Ka?etov functions, satisfying two inequalities derived from the strong triangle inequality. We shall compare the ultra-extremal functions with some classes of functions defined with the help of one of the two inequalities from the definition of ultra-Kat?tov functions. We shall consider the question of when separability of the space of ultra-extremal functions is preserved. 相似文献
5.
We deduce from a determinant identity on quantum transfer matrices of generalized quantum integrable spin chain model their generating functions. We construct the isomorphism of Clifford algebra modules of sequences of transfer matrices and the boson space of symmetric functions. As an application, tau-functions of transfer matrices immediately arise from classical tau-functions of symmetric functions. 相似文献
6.
7.
Several extensions of Loewner's theory of monotone operator functions are given. These include a theorem on boundary interpolation for matrix-valued functions in the generalized Nevanlinna class. The theory of monotone operator functions is generalized from scalar-to matrix-valued functions of an operator argument. A notion of κ-monotonicity is introduced and characterized in terms of classical Nevanlinna functions with removable singularities on a real interval. Corresponding results for Stieltjes functions are presented. 相似文献
8.
Sorin-Mihai Grad 《Optimization》2015,64(8):1759-1775
We deliver formulae for the biconjugate functions of some infimal functions that hold provided the fulfilment of weak regularity conditions of both closedness and interiority types. As special cases, we obtain biconjugates of infimal convolutions of finitely many functions, of optimal value functions of both constrained and unconstrained optimization problems as well as of marginal functions associated with multifunctions (that can be, for instance, convex processes) and some given functions. Moreover, we rediscover or extend different results on biconjugate functions from the literature. 相似文献
9.
Andrei Gabrielov 《Inventiones Mathematicae》1996,125(1):1-12
We show that the complement of a subanalytic set defined by real analytic functions from any subalgebra closed under differentiation
is a subanalytic set defined by the functions from the same subalgebra. This result has an equivalent formulation in logic:
Consider an expression built from functions as above using equalities and inequalities as well as existential and universal
quantifiers. Such an expression is equivalent to an existential expression involving functions from the same class, provided
that the variables approach neither infinity nor the boundary of the domain.
Oblatum 17-VIII-1995 相似文献
10.
Ku Min 《Advances in Applied Clifford Algebras》2010,20(1):57-70
In this paper we mainly study the so-called isotonic Dirac system over more general types of unbounded domains in Euclidean
space of even dimension. In such systems different Dirac operators in the half dimension act from the left and from the right
on the functions considered. We obtain the integral representation of isotonic functions satisfying the decay condition over
the unbounded domains, and show that the integral representation formula over the unbounded domains for holomorphic functions
of several complex variables and for Hermitean monogenic functions may be derived from it. 相似文献
11.
Shafique Ahmed 《Journal of Approximation Theory》1982,34(4):335-347
Several infinite systems of nonlinear algebraic equations satisfied by the zeros of confluent hypergeometric functions are derived. Certain sum rules and other related properties for the zeros follow from these equations. A large class of special functions, which are special cases of confluent hypergeometric functions, is included. This is illustrated in the case of the zeros of Bessel functions and Laguerre polynomials. 相似文献
12.
Aurél Galántai 《Computational Optimization and Applications》2012,52(3):805-824
The nonlinear complementarity or NCP functions were introduced by Mangasarian and these functions are proved to be useful in constrained optimization and elsewhere. Interestingly enough there are only two general methods to derive such functions, while the known or used NCP functions are either individual constructions or modifications of the few individual NCP functions such as the Fischer-Burmeister function. In the paper we analyze the elementary properties of NCP functions and the various techniques used to obtain such functions from old ones. We also prove some new nonexistence results on the possible forms of NCP functions. Then we develop and analyze several new methods for the construction of nonlinear complementarity functions that are based on various geometric arguments or monotone transformations. The appendix of the paper contains the list and source of the known NCP functions. 相似文献
13.
Applying minimum-type functions and plus-cogauges, we construct a closed, convex cone in order to separate a boundary point of a radiant set from its interior. Abstract convexity of positively homogeneous functions is studied as well. Since a locally Lipschitz function is degree-one calm, the class of degree-one calm functions is large. We study degree-one calm functions and investigate how these functions can be generated by a class of min-type functions. Then, we derive a method to find an element of the subdifferential of a non-negative, lower semicontinuous and degree-one calm function with respect to the class of min-type functions. 相似文献
14.
Günther Nürnberger 《Numerical Functional Analysis & Optimization》2013,34(4):399-421
The set of functions in C(T) which have a strongly unique best approximation from a given finite-dimensional subspace is denoted by SU(G). Since strong unicity plays an important role in numerical computations and since there the functions are only known up to some error, it is natural to ask what are the functions from the interior of SU(G). A complete characterization of those functions is given and the result is applied to weak Chebyshev and spline subspaces. 相似文献
15.
In this article a technique for constructing p-ary bent functions from near-bent functions is presented. This technique is then used to obtain both weakly regular and non-weakly regular bent functions. In particular we present the first known infinite class of non-weakly regular bent functions. 相似文献
16.
H. Bustince A. Jurio A. Pradera R. Mesiar G. Beliakov 《European Journal of Operational Research》2013
In this paper we present a generalization of the weighted voting method used in the exploitation phase of decision making problems represented by preference relations. For each row of the preference relation we take the aggregation function (from a given set) that provides the value which is the least dissimilar with all the elements in that row. Such a value is obtained by means of the selected penalty function. The relation between the concepts of penalty function and dissimilarity has prompted us to study a construction method for penalty functions from the well-known restricted dissimilarity functions. The development of this method has led us to consider under which conditions restricted dissimilarity functions are faithful. We present a characterization theorem of such functions using automorphisms. Finally, we also consider under which conditions we can build penalty functions from Kolmogoroff and Nagumo aggregation functions. In this setting, we propose a new generalization of the weighted voting method in terms of one single variable functions. We conclude with a real, illustrative medical case, conclusions and future research lines. 相似文献
17.
The existence of generalized mix functions 总被引:1,自引:1,他引:0
To enrich the message space of a cipher and guarantee security, Ristenpart and Rogaway defined mix functions on two sets of
equal size. To mix inputs from two sets of different sizes, Stinson generalized the definition of mix functions (called generalized
mix functions), and established an existence result for generalized mix functions with 10 undetermined pairs of input sizes.
In this paper, we complete the solution to the existence problem for generalized mix functions.
相似文献
18.
有限离散函数的导数和性质 总被引:2,自引:0,他引:2
通过引入有限离散函数的导数概念,分别从几何直观和性质两个角度,比较了有限离散函数的导数概念和常规连续函数导数的相似性.结果表明,在局部情况下,有限离散函数导数近似等于连续情形下的导数.在运算性质上,有限离散函数导数的性质非常相似于连续情形时的导数性质.最后的例子给出了有限离散函数导数的一个应用. 相似文献
19.
互为对偶的离散型分布与连续型分布,可以看作是由同一个函数——源函数产生的。源函数的正线性组合、乘积和负导数,仍然是源函数。源函数揭示了互为对偶的分布的分布函数之间的相互关系,并能用来求随机变量的数字特征、特征函数、概率母函数、分布的最大值和参数的极大似然估计. 相似文献
20.
Approximation by translates of refinable functions 总被引:23,自引:0,他引:23
Summary.
The functions
are
refinable if they are
combinations of the rescaled and translated functions
.
This is very common in scientific computing on a regular mesh.
The space of approximating functions with meshwidth
is a
subspace of with meshwidth
.
These refinable spaces have refinable basis functions.
The accuracy of the computations
depends on , the
order of approximation, which is determined by the degree of
polynomials
that lie in .
Most refinable functions (such as scaling functions in the theory
of wavelets) have no simple formulas.
The functions
are known only through the coefficients
in the refinement equation – scalars in the traditional case,
matrices for multiwavelets.
The scalar "sum rules" that determine
are well known.
We find the conditions on the matrices
that
yield approximation of order
from .
These are equivalent to the Strang–Fix conditions on the Fourier
transforms
, but for refinable
functions they can be explicitly verified from
the .
Received
August 31, 1994 / Revised version received May 2, 1995 相似文献