نتایج جستجو برای: asymptotically pseudo

تعداد نتایج: 72285  

Journal: :international journal of mathematical modelling and computations 0
godwin amechi okeke department of mathematics, university of lagos, nigeria nigeria lecturer,department of mathematics,university of lagos,nigeria. johnson o olaleru department of mathematics, university of lagos, nigeria. nigeria professor of fixed point theory (mathematics)

we study the convergence of the modified noor iterative scheme for the class of asymptotically pseudocontractive mappings in the intermediate sense which is not necessarily lipschitzian. our results improves, extends and unifies the results of schu [23] and qin {it et al.} [25].

Journal: :international journal of nonlinear analysis and applications 2011
g.s. saluja

the purpose of this paper is to study and give the necessary andsufficient condition of strong convergence of the multi-step iterative algorithmwith errors for a finite family of generalized asymptotically quasi-nonexpansivemappings to converge to common fixed points in banach spaces. our resultsextend and improve some recent results in the literature (see, e.g. [2, 3, 5, 6, 7, 8,11, 14, 19]).

Journal: :iranian journal of science and technology (sciences) 2015
m. shahrouzi

in this paper we consider a petrovsky viscoelastic inverse source problem with memory term in the boundary condition. we obtain sufficient conditions on relaxation function and initial data for which the solutions of problem are asymptotically stable when the integral overdetermination tends to zero as time goes to infinity.

2004
Changbao WU

It is often desirable to combine information collected in compatible multiple surveys in order to improve estimation and meet consistency requirements. Zieschang (1990) and Renssen & Nieuwenbroek (1997) suggested to this end the use of the generalized regression estimator with enlarged number of auxiliary variables. Unfortunately, adjusted weights associated with their approach can be negative....

Journal: :IJHPCA 2000
William Gropp David E. Keyes Lois C. McInnes Moulay D. Tidriri

Implicit solution methods are important in applications modeled by PDEs with disparate temporal and spatial scales. Because such applications require high resolution with reasonable turnaround, parallelization is essential. The pseudo-transient matrix-free Newton-Krylov-Schwarz (ΨNKS) algorithmic framework is presented as a widely applicable answer. This article shows that, for the classical pr...

2007
Marc HALLIN Davy PAINDAVEINE Thomas VERDEBOUT Marc Hallin Davy Paindaveine Thomas Verdebout

The so-called Common Principal Components (CPC) Model, in which the covariance matrices Σi of m populations are assumed to have identical eigenvectors, was introduced by Flury (1984), who develops Gaussian parametric inference methods for this model (Gaussian maximum likelihood estimation and Gaussian likelihood ratio testing). A key result in that context is the joint asymptotic normality of t...

Journal: :Multiscale Modeling & Simulation 2008
Guillaume Bal

We consider the perturbation of elliptic pseudo-differential operators P (x,D) with more than square integrable Green’s functions by random, rapidly varying, sufficiently mixing, potentials of the form q( ε , ω). We analyze the source and spectral problems associated to such operators and show that the rescaled difference between the perturbed and unperturbed solutions may be written asymptotic...

2002
Thomas Gregoire

It has recently been realized that five dimensional theories can be generated dynamically from asymptotically free, QCD-like four dimensional dynamics via “deconstruction.” In this paper we generalize this construction to six dimensional theories using a moose mesh with alternating weak and strong gauge groups. A new ingredient is the appearance of self couplings between the higher dimensional ...

2002
Dietmar Bauer Martin Wagner

In this paper we derive (weak) consistency and the asymptotic distribution of pseudo maximum likelihood estimates for multiple frequency I(1) processes. By multiple frequency I(1) processes we denote processes with unit roots at arbitrary points on the unit circle with the integration orders corresponding to these unit roots all equal to 1. The parameters corresponding to the cointegrating spac...

Journal: :Discrete Applied Mathematics 2000
H. Edwin Romeijn Dolores Romero Morales

The Generalized Assignment Problem (GAP) is the problem of finding the minimal cost assignment of jobs to machines such that each job is assigned to exactly one machine, subject to capacity restrictions on the machines. We propose a class of greedy algorithms for the GAP. A family of weight functions is defined to measure a pseudo-cost of assigning a job to a machine. This weight function in tu...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید