An iterative method for solving the strong vector equilibrium problem with variable domination structure

In this paper, an iterative algorithm for solving the strong vector equilibrium problem with variable domination structure (VSVEP) is considered. First, an auxiliary problem for the VSVEP is introduced and the relationships between the auxiliary problem and VSVEP are discussed. Then, using the auxiliary principle technique, a projection iterative algorithm to compute the approximate solutions of the VSVEP is proposed and analysed. Furthermore, convergence of the iterative sequences generated by this algorithm is investigated under suitable conditions of continuity and convexity. These results extend and improve some recent works in this field.     

An iterative solver for the Oseen problem and numerical solution of incompressible Navier–Stokes equations

Incompressible unsteady Navier–Stokes equations in pressure–velocity variables are considered. By use of the implicit and semi‐implicit schemes presented the resulting system of linear equations can be solved by a robust and efficient iterative method. This iterative solver is constructed for the system of linearized Navier–Stokes equations. The Schur complement technique is used. We present a new approach of building a non‐symmetric preconditioner to solve a non‐symmetric problem of convection–diffusion and saddle‐point type. It is shown that handling the differential equations properly results in constructing efficient solvers for the corresponding finite linear algebra systems. The method has good performance for various ranges of viscosity and can be used both for 2D and 3D problems. The analysis of the method is still partly heuristic, however, the mathematically rigorous results are proved for certain cases. The proof is based on energy estimates and basic properties of the underlying partial differential equations. Numerical results are provided. Additionally, a multigrid method for the auxiliary convection–diffusion problem is briefly discussed. Copyright © 1999 John Wiley & Sons, Ltd.     

An iterative method for the finite-time bilinear-quadratic control problem

For bilinear control systems with quadratic cost, the so-called bilinear-quadratic problems, a feedback controller for the finite-time case is designed. An iteration procedure in close proximity to the Riccati approach is presented, and the proof of convergence is outlined. The potential of the new method is discussed, and the design procedure is illustrated for two examples.     

An iterative variable direction scheme for the solution of the plane problem of elasticity theory on a polar grid

This paper is a direct continuation of [1]: it presents and analyzes the iterative variable direction method for the solution of the difference scheme approximating the first boundary-value problem plane elasticity theory on a polar grid.Translated from Issledovaniya po Prikladnoi Matematike, No. 9, pp. 3–8, 1981.     

An integral-interpolation iterative method for the solution of scalar equations

We study the use of integral information on a functionf in the iterative process for the solution of a nonlinear scalar equationf(x)=0.It is shown that for the information onf given by:

An adaptive stabilized finite element method for the generalized Stokes problem

In this work we present an adaptive strategy (based on an a posteriori error estimator) for a stabilized finite element method for the Stokes problem, with and without a reaction term. The hierarchical type estimator is based on the solution of local problems posed on appropriate finite dimensional spaces of bubble-like functions. An equivalence result between the norm of the finite element error and the estimator is given, where the dependence of the constants on the physics of the problem is explicited. Several numerical results confirming both the theoretical results and the good performance of the estimator are given.     

An iterative method for a Cauchy problem for the heat equation

^** Email: tomjo{at}itn.liu.se An iterative method for reconstruction of the solution to aparabolic initial boundary value problem of second order fromCauchy data is presented. The data are given on a part of theboundary. At each iteration step, a series of well-posed mixedboundary value problems are solved for the parabolic operatorand its adjoint. The convergence proof of this method in a weightedL²-space is included.     

An alternating variable method for the maximal correlation problem

The maximal correlation problem (MCP) aiming at optimizing correlations between sets of variables plays an important role in many areas of statistical applications. Up to date, algorithms for the general MCP stop at solutions of the multivariate eigenvalue problem (MEP), which serves only as a necessary condition for the global maxima of the MCP. For statistical applications, the global maximizer is quite desirable. In searching the global solution of the MCP, in this paper, we propose an alternating variable method (AVM), which contains a core engine in seeking a global maximizer. We prove that (i) the algorithm converges globally and monotonically to a solution of the MEP, (ii) any convergent point satisfies a global optimal condition of the MCP, and (iii) whenever the involved matrix A is nonnegative irreducible, it converges globally to the global maximizer. These properties imply that the AVM is an effective approach to obtain a global maximizer of the MCP. Numerical testings are carried out and suggest a superior performance to the others, especially in finding a global solution of the MCP.     

An iterative solution to the generalized Towers of Hanoi problem

An iterative solution to the generalized Towers of Hanoi problem, and its derivation are presented. In this generalization, one or more towers, consisting of a total ofn discs, are given as an initial legal configuration, and the task is to move them to a specified peg under the usual restrictions. An analysis of the iterative algorithm is also discussed.     

An iterative method for the solution of some semilinear elliptic systems with discontinuities

We present a general iterative method which can be used, in particular, to find solutions of a kind of semilinear elliptic system with discontinuities. The algorithm is obtained by adapting some ideas which have been previously introduced by C. Moreno and the second author in the framework of a single equation. More precisely, it relies on fixed-point reformulation and exact regularization. A convergence result is proven under quite general assumptions.     

Analysis of the iterative penalty method for the Stokes equations

In this work we propose an iterative penalty method for addressing the Stokes equations. We can use a “not very small” penalty parameter to avoid the unstable computation by iteration. The Numerical experiments show that the algorithm is very effective.     

On Stokes operators with variable viscosity in bounded and unbounded domains

We consider a generalization of the Stokes resolvent equation, where the constant viscosity is replaced by a general given positive function. Such a system arises in many situations as linearized system, when the viscosity of an incompressible, viscous fluid depends on some other quantities. We prove that an associated Stokes-like operator generates an analytic semi-group and admits a bounded H _∞ -calculus, which implies the maximal L ^q -regularity of the corresponding parabolic evolution equation. The analysis is done for a large class of unbounded domains with -boundary for some r > d with r ≥ q, q′. In particular, the existence of an L ^q -Helmholtz projection is assumed.     

An exact method with variable fixing for solving the generalized assignment problem

We propose a simple exact algorithm for solving the generalized assignment problem. Our contribution is twofold: we reformulate the optimization problem into a sequence of decision problems, and we apply variable-fixing rules to solve these effectively. The decision problems are solved by a simple depth-first lagrangian branch-and-bound method, improved by our variable-fixing rules to prune the search tree. These rules rely on lagrangian reduced costs which we compute using an existing but little-known dynamic programming algorithm.     

Adaptive Wavelet Solution to the Stokes Problem

This paper deals with the design and analysis of adaptive wavelet method for the Stokes problem. First, the limitation of Richardson iteration is explained and the multiplied matrix M0 in the paper of Bramble and Pasciak is proved to be the simplest possible in an appropiate sense. Similar to the divergence operator, an exact application of its dual is shown; Second, based on these above observations, an adaptive wavelet algorithm for the Stokes problem is designed. Error analysis and computational complexity are given; Finally, since our algorithm is mainly to deal with an elliptic and positive definite operator equation, the last section is devoted to the Galerkin solution of an elliptic and positive definite equation. It turns out that the upper bound for error estimation may be improved.     

Divergence-free wavelet solution to the Stokes problem

In this paper, we use divergence-free wavelets to give an adaptive solution to the velocity field of the Stokes problem. We first use divergence-free wavelets to discretize the divergence-free weak formulation of the Stokes problem and obtain a discrete positive definite linear system of equations whose coefficient matrix is quasi-sparse; Secondly, an adaptive scheme is used to solve the discrete linear system of equations and the error estimation and complexity analysis are given.     

An iterative method for the shape reconstruction of the inverse Euler problem

This article is concerned with the shape reconstruction for the inviscid fluid governed by the Euler equations. By formulating the domain derivative of the Euler equations and applying a regularized Gauss‐Newton iterative algorithm, the numerical examples are given for recovering the shape. The results show that our theory is useful for practical purpose and the proposed algorithm is feasible. © 2011 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 587–596, 2012     

An iterative method of solution for equilibrium and optimization problems

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping, the set of solutions of the variational inequality for an inverse-strongly monotone mapping and the set of solutions of an equilibrium problem in a Hilbert space. We show that the iterative sequence converges strongly to a common element of the three sets. The results of this paper extended and improved the results of H. Iiduka and W. Takahashi [Strong convergence theorems for nonexpansive mappings and inverse-strongly monotone mappings, Nonlinear Anal. 61 (2005) 341–350] and S. Takahashi and W. Takahashi [Viscosity approximation methods for equilibrium problems and fixed point problems in Hilbert spaces, J. Math. Anal. Appl. 331 (2007) 506–515]. Therefore, by using the above result, an iterative algorithm for the solution of a optimization problem was obtained.