首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 31 毫秒
1.
We introduce a new iterative method in order to approximate a locally unique solution of variational inclusions in Banach spaces. The method uses only divided differences operators of order one. An existence–convergence theorem and a radius of convergence are given under some conditions on divided difference operator and Lipschitz-like continuity property of set-valued mappings. Our method extends the recent work related to the resolution of nonlinear equation in Argyros (J Math Anal Appl 332:97–108, 2007) and has the following advantages: faster convergence to the solution than all the previous known ones in Argyros and Hilout (Appl Math Comput, 2008 in press), Hilout (J Math Anal Appl 339:53–761, 2008, Positivity 10:673–700, 2006), and we do not need to evaluate any Fréchet derivative. We provide also an improvement of the ratio of our algorithm under some center-conditions and less computational cost. Numerical examples are also provided.   相似文献   

2.
We provide a semilocal convergence analysis for a certain class of secant-like methods considered also in Argyros (J Math Anal Appl 298:374–397, 2004, 2007), Potra (Libertas Mathematica 5:71–84, 1985), in order to approximate a locally unique solution of an equation in a Banach space. Using a combination of Lipschitz and center-Lipschitz conditions for the computation of the upper bounds on the inverses of the linear operators involved, instead of only Lipschitz conditions (Potra, Libertas Mathematica 5:71–84, 1985), we provide an analysis with the following advantages over the work in Potra (Libertas Mathematica 5:71–84, 1985) which improved the works in Bosarge and Falb (J Optim Theory Appl 4:156–166, 1969, Numer Math 14:264–286, 1970), Dennis (SIAM J Numer Anal 6(3):493–507, 1969, 1971), Kornstaedt (1975), Larsonen (Ann Acad Sci Fenn, A 450:1–10, 1969), Potra (L’Analyse Numérique et la Théorie de l’Approximation 8(2):203–214, 1979, Aplikace Mathematiky 26:111–120, 1981, 1982, Libertas Mathematica 5:71–84, 1985), Potra and Pták (Math Scand 46:236–250, 1980, Numer Func Anal Optim 2(1):107–120, 1980), Schmidt (Period Math Hung 9(3):241–247, 1978), Schmidt and Schwetlick (Computing 3:215–226, 1968), Traub (1964), Wolfe (Numer Math 31:153–174, 1978): larger convergence domain; weaker sufficient convergence conditions, finer error bounds on the distances involved, and a more precise information on the location of the solution. Numerical examples further validating the results are also provided.  相似文献   

3.
4.
We study the local convergence of a proximal point method in a metric space under the presence of computational errors. We show that the proximal point method generates a good approximate solution if the sequence of computational errors is bounded from above by some constant. The principle assumption is a local error bound condition which relates the growth of an objective function to the distance to the set of minimizers introduced by Hager and Zhang (SIAM J Control Optim 46:1683–1704, 2007).  相似文献   

5.
We address two fundamental questions in the representation theory of affine Hecke algebras of classical types. One is an inductive algorithm to compute characters of tempered modules, and the other is the determination of the constants in the formal degrees of discrete series (in the form conjectured by Reeder (J. Reine Angew. Math. 520:37–93, 2000)). The former is completely different from the Lusztig-Shoji algorithm (Shoji in Invent. Math. 74:239–267, 1983; Lusztig in Ann. Math. 131:355–408, 1990), and it is more effective in a number of cases. The main idea in our proof is to introduce a new family of representations which behave like tempered modules, but for which it is easier to analyze the effect of parameter specializations. Our proof also requires a comparison of the C -theoretic results of Opdam, Delorme, Slooten, Solleveld (J. Inst. Math. Jussieu 3:531–648, 2004; ; Int. Math. Res. Not., 2008; Adv. Math. 220:1549–1601, 2009; Acta Math. 205:105–187, 2010), and the geometric construction from Kato (Duke Math. J. 148:305–371, 2009; Am. J. Math. 133:518–553, 2011), Ciubotaru and Kato (Adv. Math. 226:1538–1590, 2011).  相似文献   

6.
Lance Nielsen 《Acta Appl Math》2010,110(1):409-429
In this paper we develop a method of forming functions of noncommuting operators (or disentangling) using functions that are not necessarily analytic at the origin in ℂ n . The method of disentangling follows Feynman’s heuristic rules from in (Feynman in Phys. Rev. 84:18–128, 1951) a mathematically rigorous fashion, generalizing the work of Jefferies and Johnson and the present author in (Jefferies and Johnson in Russ. J. Math. 8:153–181, 2001) and (Jefferies et al. in J. Korean Math. Soc. 38:193–226, 2001). In fact, the work in (Jefferies and Johnson in Russ. J. Math. 8:153–181, 2001) and (Jefferies et al. in J. Korean Math. Soc. 38:193–226, 2001) allow only functions analytic in a polydisk centered at the origin in ℂ n while the method introduced in this paper enable functions that are not analytic at the origin to be used. It is shown that the disentangling formalism introduced here reduces to that of (Jefferies and Johnson in Russ. J. Math. 8:153–181, 2001) and (Jefferies et al. in J. Korean Math. Soc. 38:193–226, 2001) under the appropriate assumptions. A basic commutativity theorem is also established.  相似文献   

7.
This paper presents a relaxation Lax-Friedrichs sweeping scheme to approximate viscosity solutions of static Hamilton Jacobi equations in any number of spatial dimensions. It is a generalization of the scheme proposed in Kao et al. (J Comput Phys 196:367–391, 2004). Numerical examples suggest that the relaxation Lax-Friedrichs sweeping scheme has smaller number of iterations than the original Lax-Friedrichs sweeping scheme when the relaxation factor ω is slightly larger than one. And first order convergence is also demonstrated by numerical results. A theoretical analysis for our scheme in a special case is given.  相似文献   

8.
Order-compactifications of totally ordered spaces were described by Blatter (J Approx Theory 13:56–65, 1975) and by Kent and Richmond (J Math Math Sci 11(4):683–694, 1988). Their results generalize a similar characterization of order-compactifications of linearly ordered spaces, obtained independently by Fedorčuk (Soviet Math Dokl 7:1011–1014, 1966; Sib Math J 10:124–132, 1969) and Kaufman (Colloq Math 17:35–39, 1967). In this note we give a simple characterization of the topology of a totally ordered space, as well as give a new simplified proof of the main results of Blatter (J Approx Theory 13:56–65, 1975) and Kent and Richmond (J Math Math Sci 11(4):683–694, 1988). Our main tool will be an order-topological modification of the Dedekind-MacNeille completion. In addition, for a zero-dimensional totally ordered space X, we determine which order-compactifications of X are Priestley order-compactifications.  相似文献   

9.
Nonparametric conditional efficiency measures: asymptotic properties   总被引:2,自引:0,他引:2  
Cazals et al. (J. Econom. 106: 1–25, 2002), Daraio and Simar (J. Prod. Anal. 24: 93–121, 2005; Advanced Robust and Nonparametric Methods in Efficiency Analysis, 2007a; J. Prod. Anal. 28: 13–32, 2007b) developed a conditional frontier model which incorporates the environmental factors into measuring the efficiency of a production process in a fully nonparametric setup. They also provided the corresponding nonparametric efficiency measures: conditional FDH estimator, conditional DEA estimator. The two estimators have been applied in the literature without any theoretical background about their statistical properties. The aim of this paper is to provide an asymptotic analysis (i.e. asymptotic consistency and limit sampling distribution) of the conditional FDH and conditional DEA estimators.  相似文献   

10.
This paper presents a synthesis of an optimal control solution for cooperative collision avoidance strategies for aircraft (ships) with unequal turn capabilities in a close proximity coplanar encounter. The analytic expressions for the extremals are presented and their properties are analyzed. Simple algorithms for the synthesis of optimal control are developed. The structure of the synthesis is analyzed and its behavior with a change in the nondimensional turn rate ratio is studied. It is shown that Merz’s solution for identical aircraft (see Merz in Proc. Joint Automatic Control Conf., Paper 15-3, pp. 449–454, 1973; Navigation 20(2):144–152, 1973; Tarnopolskaya and Fulton in J. Optim. Theory Appl. 140(2):355–375, 2009) is a degenerate case of this more general solution. The results of this paper are useful for benchmarking and validating automated proximity management and collision avoidance systems.  相似文献   

11.
We introduce the new idea of recurrent functions to provide a new semilocal convergence analysis for Newton-type methods, under mild differentiability conditions. It turns out that our sufficient convergence conditions are weaker, and the error bounds are tighter than in earlier studies in some interesting cases (Chen, Ann Inst Stat Math 42:387–401, 1990; Chen, Numer Funct Anal Optim 10:37–48, 1989; Cianciaruso, Numer Funct Anal Optim 24:713–723, 2003; Cianciaruso, Nonlinear Funct Anal Appl 2009; Dennis 1971; Deuflhard 2004; Deuflhard, SIAM J Numer Anal 16:1–10, 1979; Gutiérrez, J Comput Appl Math 79:131–145, 1997; Hernández, J Optim Theory Appl 109:631–648, 2001; Hernández, J Comput Appl Math 115:245–254, 2000; Huang, J Comput Appl Math 47:211–217, 1993; Kantorovich 1982; Miel, Numer Math 33:391–396, 1979; Miel, Math Comput 34:185–202, 1980; Moret, Computing 33:65–73, 1984; Potra, Libertas Mathematica 5:71–84, 1985; Rheinboldt, SIAM J Numer Anal 5:42–63, 1968; Yamamoto, Numer Math 51: 545–557, 1987; Zabrejko, Numer Funct Anal Optim 9:671–684, 1987; Zinc̆ko 1963). Applications and numerical examples, involving a nonlinear integral equation of Chandrasekhar-type, and a differential equation are also provided in this study.  相似文献   

12.
We extend the applicability of the Gauss–Newton method for solving singular systems of equations under the notions of average Lipschitz–type conditions introduced recently in Li et al. (J Complex 26(3):268–295, 2010). Using our idea of recurrent functions, we provide a tighter local as well as semilocal convergence analysis for the Gauss–Newton method than in Li et al. (J Complex 26(3):268–295, 2010) who recently extended and improved earlier results (Hu et al. J Comput Appl Math 219:110–122, 2008; Li et al. Comput Math Appl 47:1057–1067, 2004; Wang Math Comput 68(255):169–186, 1999). We also note that our results are obtained under weaker or the same hypotheses as in Li et al. (J Complex 26(3):268–295, 2010). Applications to some special cases of Kantorovich–type conditions are also provided in this study.  相似文献   

13.
Some new common fixed point theorems for Gregus type contraction mappings have been obtained in convex metric spaces. As applications, invariant approximation results for these types of mappings are obtained. The proved results generalize, unify and extend some of the known results of M.A. Al-Thagafi (Int. J. Math. Sci. 18:613–616, 1995; J. Approx. Theory 85:318–323, 1996), M.A. Al-Thagafi and N. Shahzad (Nonlinear Anal. 64:2778–2786, 2006), L. ?iri? (Publ. Inst. Math. 49:174–178, 1991; Arch. Math. (BRNO) 29:145–152, 1993), M.L. Diviccaro, B. Fisher, S. Sessa (Publ. Math. (Debr.) 34:83–89, 1987), B. Fisher and S. Sessa (Int. J. Math. Math. 9:23–28, 1986), M. Gregus (Boll. Un. Mat. Ital. (5) 7-A:193–198, 1980), L. Habiniak (J. Approx. Theory 56:241–244, 1989), N. Hussain, B.E. Rhoades and G. Jungck (Numer. Func. Anal. Optim. 28:1139–1151, 2007), G. Jungck (Int. J. Math. Math. Sci. 13:497–500, 1990), G. Jungck and S. Sessa (Math. Jpn. 42:249–252, 1995), R.N. Mukherjee and V. Verma (Math. Jpn. 33:745–749, 1988), T.D. Narang and S. Chandok (Ukr. Math. J. 62:1367–1376, 2010), S.A. Sahab, M.S. Khan and S. Sessa (J. Approx. Theory 55:349–351, 1988), N. Shahzad (J. Math. Anal. Appl. 257:39–45, 2001; Rad. Math. 10:77–83, 2001; Int. J. Math. Game Theory Algebra 13:157–159, 2003), S.P. Singh (J. Approx. Theory 25:89–90, 1979), A. Smoluk (Mat. Stosow. 17:17–22, 1981), P.V. Subrahmanyam (J. Approx. Theory 20:165–172, 1977) and of few others.  相似文献   

14.
The purpose of this paper is to establish strong lower energy estimates for strong solutions of nonlinearly damped Timoshenko beams, Petrowsky equations in two and three dimensions and wave-like equations for bounded one-dimensional domains or annulus domains in two or three dimensions. We also establish weak lower velocity estimates for strong solutions of the nonlinearly damped Petrowsky equation in two and three dimensions. The feedbacks in consideration have arbitrary growth close to the origin. These results improve the strong lower energy decay rates obtained in our previous papers (Alabau-Boussouira in J Differ Equ 249:1145–1178, 2010; J Differ Equ 248:1473–1517, 2010) for strong solutions of the nonlinearly locally damped wave equation and extend to systems and to Petrowsky equation the method of Alabau-Boussouira (J Differ Equ 249:1145–1178, 2010; J Differ Equ 248:1473–1517, 2010). These results are the first ones for Timoshenko beams and Petrowsky equations.  相似文献   

15.
The existence of solution for the 2D-Keller-Segel system in the subcritical case, i.e. when the initial mass is less than 8π, is reproved. Instead of using the entropy in the free energy and free energy dissipation, which was used in the proofs (Blanchet et al. in SIAM J. Numer. Anal. 46:691–721, 2008; Electron. J. Differ. Equ. Conf. 44:32, 2006 (electronic)), the potential energy term is fully utilized by adapting Delort’s theory on 2D incompressible Euler equation (Delort in J. Am. Math. Soc. 4:553–386, 1991).  相似文献   

16.
The purpose of this paper is to prove some new common fixed point theorems in (GV)-fuzzy metric spaces. While proving our results, we utilize the idea of compatibility due to Jungck (Int J Math Math Sci 9:771–779, 1986) together with subsequentially continuity due to Bouhadjera and Godet-Thobie (arXiv: 0906.3159v1 [math.FA] 17 Jun 2009) respectively (also alternately reciprocal continuity due to Pant (Bull Calcutta Math Soc 90:281–286, 1998) together with subcompatibility due to Bouhadjera and Godet-Thobie (arXiv:0906.3159v1 [math.FA] 17 Jun 2009) as patterned in Imdad et al. (doi:) wherein conditions on completeness (or closedness) of the underlying space (or subspaces) together with conditions on continuity in respect of any one of the involved maps are relaxed. Our results substantially generalize and improve a multitude of relevant common fixed point theorems of the existing literature in metric as well as fuzzy metric spaces which include some relevant results due to Imdad et al. (J Appl Math Inform 26:591–603, 2008), Mihet (doi:), Mishra (Tamkang J Math 39(4):309–316, 2008), Singh (Fuzzy Sets Syst 115:471–475, 2000) and several others.  相似文献   

17.
The general summation theorem for well-poised 5 F 4-series discovered by Dougall (Proc. Edinb. Math. Soc. 25:114–132, 1907) is shown to imply several infinite series of Ramanujan-type for 1/π and 1/π 2, including those due to Bauer (J. Reine Angew. Math. 56:101–121, 1859) and Glaisher (Q. J. Math. 37:173–198, 1905) as well as some recent ones by Levrie (Ramanujan J. 22:221–230, 2010).  相似文献   

18.
In this paper, optimal derivative design when multiple firms compete for heterogenous customers is studied. Ties in the agents’ best responses generate discontinuous payoffs. Efficient tie-breaking rules are considered: In a first step, the model presented by Carlier et al. (Math Financ Econ 1:57–80, 2007) is extended, and results of Page and Monteiro (J Math Econ 39:63–109, 2003, J Econ Theory 134:566–575, 2007, Econ Theory 34:503–524, 2008) are used to prove the existence of (mixed-strategies) Nash equilibria. In a second step, the case of risk minimizing firms is studied. Socially efficient allocations are introduced, and their existence is proved. In particular, the entropic risk measure is considered.  相似文献   

19.
Earlier theoretical accounts of collective learning relied on rules and operating procedures as the organizational memory (March in Organ. Sci. 2(1):71–87, 1991; Rodan in Scand. J. Manag. 21:407–428, 2005). This paper builds on this tradition drawing on ideas from social network theory. Learning is modeled as a social-psychological process (Darr and Kurtzberg in Organ. Behav. Hum. Decis. Process. 82(1):28–44, 2000; Rulke et al. in Organ. Behav. Hum. Decis. Process. 82(1):134–149, 2000), in which organizations learn by exchanging information internally between their members (Argote et al. in Organ. Behav. Hum. Decis. Process. 82(1):1–8, 2000; Carley in Am. Soc. Rev. 56(3):331–354, 1991; Carley in Soc. Perspect. 48(4):547–571, 1995). Learning is also characterized as stochastic and creative (Gruenfeld et al. in Organ. Behav. Hum. Decis. Process. 82(1):45–59, 2000). This model is used to explore predictions about the effect social networks have on idea generation and learning and alternative strategies for choosing from whom to seek information.
Simon RodanEmail:
  相似文献   

20.
In this note we adopt the approach in Bonnit et al. (Czechoslov. Math. J. 60(2):527–539, 2010) to give a direct proof of some recent results in Haak and Le Merdy (Houst. J. Math., 2005) and Haak and Kunstmann (SIAM J. Control Optim. 45:2094–2118, 2007) which characterizes the L p -admissibility of type α depending on p of unbounded observation operators for bounded analytic semigroups.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号