共查询到20条相似文献,搜索用时 421 毫秒
1.
Two modifications of Newton’s method to accelerate the convergence of the nth root computation of a strictly positive real number are revisited. Both modifications lead to methods with prefixed order of convergence p∈N,p≥2. We consider affine combinations of the two modified pth-order methods which lead to a family of methods of order p with arbitrarily small asymptotic constants. Moreover the methods are of order p+1 for some specific values of a parameter. Then we consider affine combinations of the three methods of order p+1 to get methods of order p+1 again with arbitrarily small asymptotic constants. The methods can be of order p+2 with arbitrarily small asymptotic constants, and also of order p+3 for some specific values of the parameters of the affine combination. It is shown that infinitely many pth-order methods exist for the nth root computation of a strictly positive real number for any p≥3. 相似文献
2.
By means of a certain module V and its tensor powers in a finite tensor category, we study a question of whether the depth of a Hopf subalgebra R of a finite-dimensional Hopf algebra H is finite. The module V is the counit representation induced from R to H, which is then a generalized permutation module, as well as a module coalgebra. We show that if in the subalgebra pair either Hopf algebra has finite representation type, or V is either semisimple with R∗ pointed, projective, or its tensor powers satisfy a Burnside ring formula over a finite set of Hopf subalgebras including R, then the depth of R in H is finite. One assigns a nonnegative integer depth to V, or any other H-module, by comparing the truncated tensor algebras of V in a finite tensor category and so obtains upper and lower bounds for depth of a Hopf subalgebra. For example, a relative Hopf restricted module has depth 1, and a permutation module of a corefree subgroup has depth less than the number of values of its character. 相似文献
3.
A semicomplete multipartite or semicomplete c-partite digraph D is a biorientation of a c-partite graph. A semicomplete multipartite digraph D is called strongly quasi-Hamiltonian-connected, if for any two distinct vertices x and y of D, there is a path P from x to y such that P contains at least one vertex from each partite set of D. 相似文献
4.
Let E be a real Banach space, C be a nonempty closed convex subset of E and T:C→C be a continuous generalized Φ-pseudocontractive mapping. It is proved that T has a unique fixed point in C. 相似文献
5.
It is shown that if a sequence of open n-sets Dk increases to an open n-set D then reflected stable processes in Dk converge weakly to the reflected stable process in D for every starting point x in D. The same result holds for censored α-stable processes for every x in D if D and Dk satisfy the uniform Hardy inequality. Using the method in the proof of the above results, we also prove the weak convergence of reflected Brownian motions in unbounded domains. 相似文献
6.
Let G be a group. Any G-module M has an algebraic structure called a G-family of Alexander quandles. Given a 2-cocycle of a cohomology associated with this G-family, topological invariants of (handlebody) knots in the 3-sphere are defined. We develop a simple algorithm to algebraically construct n-cocycles of this G-family from G-invariant group n-cocycles of the abelian group M. We present many examples of 2-cocycles of these G-families using facts from (modular) invariant theory. 相似文献
7.
Recently Proinov [P.D. Proinov, A generalization of the Banach contraction principle with high order of convergence of successive approximations, Nonlinear Analysis (2006), doi:10.1016/j.na.2006.09.008] generalized Banach contraction principle with high order of convergence. We extend some results of Proinov to the case of multi-valued maps from a complete metric space X into the space of all nonempty proximinal closed subsets of X. Our results not only generalize Nadler’s fixed-point theorem (in the case when T is a mapping from a complete metric space X into the space of all nonempty proximinal closed subsets of X) but also gives high order of convergence. As an application, we obtain an existence theorem for first-order initial value problem. 相似文献
8.
The sensitivity set of a Boolean function at a particular input is the set of input positions where changing that one bit changes the output. Analogously we define the sensitivity set of a Boolean formula in a conjunctive normal form at a particular truth assignment, it is the set of positions where changing that one bit of the truth assignment changes the evaluation of at least one of the conjunct in the formula. We consider Boolean formulas in a generalized conjunctive normal form. Given a set ? of Boolean functions, an ?-constraint is an application of a function from ? to a tuple of literals built upon distinct variables, an ?-formula is then a conjunction of ?-constraints. In this framework, given a truth assignment I and a set of positions S, we are able to enumerate all ?-formulas that are satisfied by I and that have S as the sensitivity set at I. We prove that this number depends on the cardinality of S only, and can be expressed according to the sensitivity of the Boolean functions in ?. 相似文献
9.
10.
In this paper, we consider a continuous map f:X→X, where X is a compact metric space, and prove that for any positive integer N, f is Schweizer–Smital chaotic if and only if fN is too. 相似文献
11.
12.
In this paper, we establish an oscillation estimate of nonnegative harmonic functions for a pure-jump subordinate Brownian motion. The infinitesimal generator of such subordinate Brownian motion is an integro-differential operator. As an application, we give a probabilistic proof of the following form of relative Fatou theorem for such subordinate Brownian motion X in a bounded κ-fat open set; if u is a positive harmonic function with respect to X in a bounded κ-fat open set D and h is a positive harmonic function in D vanishing on Dc, then the non-tangential limit of u/h exists almost everywhere with respect to the Martin-representing measure of h. 相似文献
13.
In this paper, new classes of nondifferentiable functions constituting multiobjective programming problems are introduced. Namely, the classes of d-r-type I objective and constraint functions and, moreover, the various classes of generalized d-r-type I objective and constraint functions are defined for directionally differentiable multiobjective programming problems. Sufficient optimality conditions and various Mond–Weir duality results are proved for nondifferentiable multiobjective programming problems involving functions of such type. Finally, it is showed that the introduced d-r-type I notion with r≠0 is not a sufficient condition for Wolfe weak duality to hold. These results are illustrated in the paper by suitable examples. 相似文献
14.
A tournament of order n is usually considered as an orientation of the complete graph Kn. In this note, we consider a more general definition of a tournament that we call aC-tournament, where C is the adjacency matrix of a multigraph G, and a C-tournament is an orientation of G. The score vector of a C-tournament is the vector of outdegrees of its vertices. In 1965 Hakimi obtained necessary and sufficient conditions for the existence of a C-tournament with a prescribed score vector R and gave an algorithm to construct such a C-tournament which required, however, some backtracking. We give a simpler and more transparent proof of Hakimi’s theorem, and then provide a direct construction of such a C-tournament which works even for weighted graphs. 相似文献
15.
We show that, for any compact Alexandrov surface S (without boundary) and any point y in S, there exists a point x in S for which y is a critical point. Moreover, we prove that uniqueness characterizes the surfaces homeomorphic to the sphere among smooth orientable surfaces. 相似文献
16.
17.
We extend some known results on radicals and prime ideals from polynomial rings and Laurent polynomial rings to Z-graded rings, i.e, rings graded by the additive group of integers. The main of them concerns the Brown–McCoy radical G and the radical S, which for a given ring A is defined as the intersection of prime ideals I of A such that A/I is a ring with a large center. The studies are related to some open problems on the radicals G and S of polynomial rings and situated in the context of Koethe’s problem. 相似文献
18.
Let G=(V,E) be a graph. A subset D⊆V is a dominating set if every vertex not in D is adjacent to a vertex in D. A dominating set D is called a total dominating set if every vertex in D is adjacent to a vertex in D. The domination (resp. total domination) number of G is the smallest cardinality of a dominating (resp. total dominating) set of G. The bondage (resp. total bondage) number of a nonempty graph G is the smallest number of edges whose removal from G results in a graph with larger domination (resp. total domination) number of G. The reinforcement (resp. total reinforcement) number of G is the smallest number of edges whose addition to G results in a graph with smaller domination (resp. total domination) number. This paper shows that the decision problems for the bondage, total bondage, reinforcement and total reinforcement numbers are all NP-hard. 相似文献
19.
Li-Tao Zhang Ting-Zhu Huang Tong-Xiang Gu Xin-Lan Guo Jiang-Hua Yue 《Journal of Computational and Applied Mathematics》2009
Recently, Yun [Jae Heon Yun, Convergence of SSOR multisplitting method for an H-matrix, J. Comput. Appl. Math. 217 (2008) 252–258] studied the convergence of the relaxed multisplitting method associated with SSOR multisplitting for solving a linear system whose coefficient matrix is an H-matrix. In this paper, we improve the main results of Yun’s. Moreover, theoretical analysis and numerical examples clearly show that our new convergent domain is wider. 相似文献
20.
Let R be a commutative ring with identity. We will say that an R-module M satisfies the weak Nakayama property, if IM=M, where I is an ideal of R, implies that for any x∈M there exists a∈I such that (a−1)x=0. In this paper, we will study modules satisfying the weak Nakayama property. It is proved that if R is a local ring, then R is a Max ring if and only if J(R), the Jacobson radical of R, is T-nilpotent if and only if every R-module satisfies the weak Nakayama property. 相似文献