We suggest and analyze an iterative algorithm without the assumption of any type of commutativity on an infinite family of nonexpansive mappings. We show that the proposed iterative algorithm converges to the unique m...
详细信息
We suggest and analyze an iterative algorithm without the assumption of any type of commutativity on an infinite family of nonexpansive mappings. We show that the proposed iterative algorithm converges to the unique minimizer of some quadratic function over the common fixed point sets of an infinite family of nonexoansive mappings. Our result extend and improve many results announced by many authors. (C) 2006 Elsevier Inc. All rights reserved.
The mapping from the symmetric solution set to its independent parameter space is studied and an iterative method is proposed for the least-squares minimum-norm symmetric solution of AXB = E. Numerical results are rep...
详细信息
The mapping from the symmetric solution set to its independent parameter space is studied and an iterative method is proposed for the least-squares minimum-norm symmetric solution of AXB = E. Numerical results are reported that show the efficiency of the proposed methods.
One of the system greatly affecting the performance of a database server is the size-division of buffer pools. This letter proposes an adaptive control method of the buffer pool sizes. This method obtains the nearly o...
详细信息
One of the system greatly affecting the performance of a database server is the size-division of buffer pools. This letter proposes an adaptive control method of the buffer pool sizes. This method obtains the nearly optimal division using only observed response times in a comparatively short duration.
An iterative condensation method for both undamped and damped structures is presented. The iterative order-reduction method, which uses iterative forms of mass and transformation matrices to reduce the finite element ...
详细信息
An iterative condensation method for both undamped and damped structures is presented. The iterative order-reduction method, which uses iterative forms of mass and transformation matrices to reduce the finite element system matrices, is a computationally efficient technique to obtain the lowest eigerivalues of undamped and classically damped finite element models. However, the iterative order-reduction method is not suitable for application in nonclassically damped systems, due to the absence of damping in the dynamic transformation matrix. In this paper, an improved iterative order-reduction method based on the state-space model is proposed for nonclassically damped systems by fully taking into account the effect of damping on the transformation matrix. By combining the original and improved iterative order-reduction schemes with the substructuring scheme, a new iterative order-reduction substructuring method is also proposed to overcome the problem of requiring more computational resources to construct the transformation matrix of large-scale finite element models. The proposed method may be applied to the reduction problems of large-scale undamped and damped finite element models with limited computer storage and high computational efficiency. Two numerical examples are provided to demonstrate the effectiveness of the proposed method.
This paper describes a numerical inverse method used in temperature-sensitive-paint measurements for quantitative global heat flux diagnostics in hypersonic tunnels. An iterative algorithm is developed to solve the on...
详细信息
This paper describes a numerical inverse method used in temperature-sensitive-paint measurements for quantitative global heat flux diagnostics in hypersonic tunnels. An iterative algorithm is developed to solve the one-dimensional inverse heat transfer problem for unsteady heat flux into a polymer layer (temperature-sensitive paint) on a semi-infinite base, where the temperature dependencies of the thermal properties of materials are taken into account. Surface heat flux distributions on cone models are calculated by using this algorithm from temperature-sensitive-paint images acquired in hypersonic wind tunnel testing.
First a new system of nonlinear set-valued variational inclusions involving (A, eta)-monotone mappings in Hilbert spaces is introduced and then its solvability is explored. Based on the general resolvent operator meth...
详细信息
First a new system of nonlinear set-valued variational inclusions involving (A, eta)-monotone mappings in Hilbert spaces is introduced and then its solvability is explored. Based on the general resolvent operator method associated with (A, eta)-monotone mappings, approximation solvability of this system of nonlinear set-valued variational inclusions is established. The convergence analysis is discussed in detail. The obtained results generalize a number of results on nonlinear variational inclusion systems. (C) 2006 Elsevier Ltd. All rights reserved.
This study proposes neural network-based iterative inverse solutions for non-destructive evaluation (NDE) in which vector finite elements (VFEM) represent the forward model that closely models the physical process. Th...
详细信息
This study proposes neural network-based iterative inverse solutions for non-destructive evaluation (NDE) in which vector finite elements (VFEM) represent the forward model that closely models the physical process. The iterative algorithm can eventually estimate the material parameters. Vector finite element method global matrix is stored in a compact form using its sparsity and symmetry. The stored matrix elements are employed as the neurons weights, and preconditioning techniques are used to accelerate convergence of the neural networks (NN) algorithm. Detailed algorithm describing this new method is given to facilitate implementation. Combining vector finite elements and NNs offers several advantages over each technique alone, such as reducing memory storage requirements and the easily computed fixed weights of the NN. Various examples are solved to show the performance and usefulness of the proposed method, including lossy printed circuit board and lossy inhomogeneous cylindrical problems with ferromagnetic materials. These solutions compare very well with other published data where the maximum relative error was 5%. Copyright (C) 2011 John Wiley & Sons, Ltd.
For solving a system of nonlinear algebraic equations (NAEs) of the type: F(x) = 0, or F(i)(x(j)) = 0, i, j = 1, ..., n, a Newton-like algorithm has several drawbacks such as local convergence, being sensitive to the ...
详细信息
For solving a system of nonlinear algebraic equations (NAEs) of the type: F(x) = 0, or F(i)(x(j)) = 0, i, j = 1, ..., n, a Newton-like algorithm has several drawbacks such as local convergence, being sensitive to the initial guess of solution, and the time-penalty involved in finding the inversion of the Jacobian matrix partial derivative F(i)/partial derivative x(j). Based-on an invariant manifold defined in the space of (x, t) in terms of the residual-norm of the vector F(x), we can derive a gradient-flow system of nonlinear ordinary differential equations (ODEs) governing the evolution of x with a fictitious time-like variable t as an independent variable. We can prove that in the present novel Residual-Norm Based algorithms (RNBAs), the residual-error is automatically decreased to zero along the path of x(t). More importantly, we have derived three iterative algoritms which do not involve the fictitious time and its stepsize Delta t. We apply the three RNBAs to several numerical examples, revealing exponential convergences with different slopes and displaying the high efficiencies and accuracies of the present iterative algorithms. All the three presently proposed RNBAs: (i) are easy to implement numerically, (ii) converge much faster than the Newton's method, (iii) do not involve the inversion of the Jacobian partial derivative F(i)/partial derivative x(j), (iv) are suitable for solving a large system of NAEs, and (v) are purely iterative in nature.
In this article, the problem of the numerical computation of the stabilising solution of the game theoretic algebraic Riccati equation is investigated. The Riccati equation under consideration occurs in connection wit...
详细信息
In this article, the problem of the numerical computation of the stabilising solution of the game theoretic algebraic Riccati equation is investigated. The Riccati equation under consideration occurs in connection with the solution of the H-infinity control problem for a class of stochastic systems affected by state-dependent and control-dependent white noise and subjected to Markovian jumping. The stabilising solution of the considered game theoretic Riccati equation is obtained as a limit of a sequence of approximations constructed based on stabilising solutions of a sequence of algebraic Riccati equations of stochastic control with definite sign of the quadratic part. The proposed algorithm extends to this general framework the method proposed in Lanzon, Feng, Anderson, and Rotkowitz (Lanzon, A., Feng, Y., Anderson, B.D.O., and Rotkowitz, M. (2008), 'Computing the Positive Stabilizing Solution to Algebraic Riccati Equations with an Indefinite Quadratic Term Viaa Recursive Method,' IEEE Transactions on Automatic Control, 53, pp. 2280-2291). In the proof of the convergence of the proposed algorithm different concepts associated the generalised Lyapunov operators as stability, stabilisability and detectability are widely involved. The efficiency of the proposed algorithm is demonstrated by several numerical experiments.
A matrix P is called a symmetric orthogonal matrix if P = P-T = P-1. A matrix X is said to be a generalized bisymmetric with respect to P, if X = X-T = PXP. It is obvious that every symmetric matrix is a generalized b...
详细信息
A matrix P is called a symmetric orthogonal matrix if P = P-T = P-1. A matrix X is said to be a generalized bisymmetric with respect to P, if X = X-T = PXP. It is obvious that every symmetric matrix is a generalized bisymmetric matrix with respect to I (identity matrix). In this article, we establish two iterative algorithms for solving the system of generalized Sylvester matrix equations A(1)YB(1) + A(2)YB(2) + ... + A(l)YB(l) = M, C1YD1 + C2YD2 + ... + ClYDl = N, (including the Sylvester and Lyapunov matrix equations as special cases) over the generalized bisymmetric and skew-symmetric matrices, respectively. When this system is consistent over the generalized bisymmetric (skew-symmetric) matrix Y, firstly it is demonstrated that the first (second) algorithm can obtain a generalized bisymmetric (skew-symmetric) solution for any initial generalized bisymmetric (skew-symmetric) matrix. Secondly, by the first (second) algorithm, we can obtain the least Frobenius norm generalized bisymmetric (skew-symmetric) solution for special initial generalized bisymmetric (skew-symmetric) matrices. Moreover, it is shown that the optimal approximate generalized bisymmetric (skew-symmetric) solution of this system for a given generalized bisymmetric (skew-symmetric) matrix (Y) over cap can be derived by finding the least Frobenius norm generalized bisymmetric (skew-symmetric) solution of a new system of generalized Sylvester matrix equations. Finally, the iterative methods are tested with some numerical examples.
暂无评论