In this paper, we introduce a new W-mapping and present an iterative algorithm for an infinite family of strict pseudo-contractions. Strong convergence theorems are proved in Banach spaces. Our results improve and ext...
详细信息
In this paper, we introduce a new W-mapping and present an iterative algorithm for an infinite family of strict pseudo-contractions. Strong convergence theorems are proved in Banach spaces. Our results improve and extend the corresponding result announced by Cai and Hu [G. Cai, C. Hu, Strong convergence theorems of modified Ishikawa iterative process with errors for an infinite family of strict pseudo-contractions, Nonlinear Anal. 71( 12) ( 2009) 6044-6053]. (C) 2010 Elsevier Inc. All rights reserved.
Mean first passage times are an essential ingredient in both the theory and the applications of Markov chains. In the literature, they have been expressed in elegant closed-form formulas. These formulas involve explic...
详细信息
Mean first passage times are an essential ingredient in both the theory and the applications of Markov chains. In the literature, they have been expressed in elegant closed-form formulas. These formulas involve explicit full matrix inversions and, if computed directly, may incur numerical instability. In this paper, we present a new iterative algorithm for computing mean first passage times in a manner that does not rely on explicit full matrix inversions. Results regarding the convergence behavior of this algorithm are also developed. (C) 2014 Elsevier Inc. All rights reserved.
The critical issue in extending the iterative algorithm widely used for single-channel restoration to the multichannel case is the formidable computational requirements due to the huge matrix operations in the restora...
详细信息
The critical issue in extending the iterative algorithm widely used for single-channel restoration to the multichannel case is the formidable computational requirements due to the huge matrix operations in the restoration algorithm. This paper explores the possibility of combining the multichannel constrained-least-square (CLS) algorithm with the iterative algorithm for restoring multichannel images. A detailed analysis of the properties of the matrices in the formula and an effective method implemented in space domain are presented. This makes the iterative CLS algorithm feasible for multichannel restoration problems. Experiments are performed to evaluate the proposed iterative multichannel CLS algorithm. The results of the related independent single-channel algorithm are also presented for comparison.
In this paper, we give the notion of M-proximal mapping, an extension of P-proximal mapping given in [X.P. Ding, F.Q. Xia, A new class of completely generalized quasi-variational inclusions in Banach spaces, J. Comput...
详细信息
In this paper, we give the notion of M-proximal mapping, an extension of P-proximal mapping given in [X.P. Ding, F.Q. Xia, A new class of completely generalized quasi-variational inclusions in Banach spaces, J. Comput. Appl. Math. 147 (2002) 369-383], for a nonconvex, proper, lower semicontinuous and subdifferentiable functional on Banach space and prove its existence and Lipschitz continuity. Further, we consider a system of generalized implicit variational inclusions in Banach spaces and show its equivalence with a system of implicit Wiener-Hopf equations using the concept of M-proximal mappings. Using this equivalence, we propose a new iterative algorithm for the system of generalized implicit variational inclusions. Furthermore, we prove the existence of solution of the system of generalized implicit variational inclusions and discuss the convergence and stability analysis of the iterative algorithm. (C) 2009 Elsevier B.V. All rights reserved.
In a previous work, rite generalized forward-backward (GFB) method was proposed to compute the scattering from targets on rough ocean-like surfaces. In this paper, we develop an acceleration of the GFB method bused on...
详细信息
In a previous work, rite generalized forward-backward (GFB) method was proposed to compute the scattering from targets on rough ocean-like surfaces. In this paper, we develop an acceleration of the GFB method bused on the fast multipole method (FMM). The FMM is adapted ro reduce the operational cost associated with the iterative computations in the target regions. The proposed method is shown to converge in a low number of iterations and allows a significant reduction in the computational and storage costs with respect to the conventional GFB formulation. (C) 2000 John Wiley & Sons, Inc.
To increase market transparency, independent system operators (ISOs) have been working on minimizing uplift payments based on convex hull pricing theorems. Along this direction, in this paper, based on the analysis of...
详细信息
To increase market transparency, independent system operators (ISOs) have been working on minimizing uplift payments based on convex hull pricing theorems. Along this direction, in this paper, based on the analysis of specific generator features in the Midcontinent ISO (MISO) system, besides reviewing integral formulations for several special cases, we develop two integral formulations of a single generator that can capture these features. We then build a compact convex hull pricing formulation based on these integral formulations, which guarantees to obtain an exact convex hull price by solving a large-scale linear program. Meanwhile, to address the computational challenges caused by the large-scale MISO system, we propose innovative iterative algorithms with convergence properties, plus a complementary algorithm, to obtain an approximated convex hull price. The case studies on MISO instances with and without transmission constraints indicate that our algorithms lead to an exact convex hull price for all numerical studies and, the solutions can be obtained within 20 minutes.
This paper presents a new iterative algorithm for a quasivariational inequality system related to HJB equation. A domain decomposition method based on this algorithm is proposed. The convergence theorems have been est...
详细信息
This paper presents a new iterative algorithm for a quasivariational inequality system related to HJB equation. A domain decomposition method based on this algorithm is proposed. The convergence theorems have been established. (C) 2007 Elsevier B.V. All rights reserved.
The present paper develops two iterative algorithms to determine the periods and then the periodic solutions of nonlinear jerk equations. We consider two possible cases: initial values unknown and initial values given...
详细信息
The present paper develops two iterative algorithms to determine the periods and then the periodic solutions of nonlinear jerk equations. We consider two possible cases: initial values unknown and initial values given. A shape function method is introduced, by which we can transform the periodic problem to an initial value problem for the new variable, while the period and the terminal values of the new variable at the end of a period are determined iteratively. The initial value problem method (IVPM) can satisfy the periodic conditions exactly. Three examples reveal the advantages of the new iterative algorithms based on the IVPM, which converge fastly and also provide very accurate periodic solutions and periods of the nonlinear jerk equations. (C) 2019 Elsevier Ltd. All rights reserved.
We consider a linear steady-state eddy-current problem for a magnetic field in a bounded domain. The boundary consists of two parts: reachable with prescribed Cauchy data and unreachable with no data on it. We design ...
详细信息
We consider a linear steady-state eddy-current problem for a magnetic field in a bounded domain. The boundary consists of two parts: reachable with prescribed Cauchy data and unreachable with no data on it. We design an iterative (Landweber type) algorithm for solution of this problem. At each iteration step two auxiliary mixed well-posed boundary value problems are solved. The analysis of temporary problems is performed in suitable function spaces. This creates the basis for the convergence argument. The theoretical results are supported with numerical experiments. (C) 2010 Elsevier Inc. All rights reserved.
Considering coordinate errors of both control points and non-control points, and different weights between control points and non-control points, this contribution proposes an extended weighted total least squares (WT...
详细信息
Considering coordinate errors of both control points and non-control points, and different weights between control points and non-control points, this contribution proposes an extended weighted total least squares (WTLS) iterative algorithm of 3D similarity transformation based on Gibbs vector. It treats the transformation parameters and the target coordinate of non-control points as unknowns. Thus it is able to recover the transformation parameters and compute the target coordinate of non-control points simultaneously. It is also able to assess the accuracy of the transformation parameters and the target coordinates of non-control points. Obviously it is different from the traditional algorithms that first recover the transformation parameters and then compute the target coordinate of non-control points by the estimated transformation parameters. Besides it utilizes a Gibbs vector to represent the rotation matrix. This representation does not introduce additional unknowns;neither introduces transcendental function like sine or cosine functions. As a result, the presented algorithm is not dependent to the initial value of transformation parameters. This excellent performance ensures the presented algorithm is suitable for the big rotation angles. Two numerical cases with big rotation angles including a real world case (LIDAR point cloud registration) and a simulative case are tested to validate the presented algorithm.
暂无评论