Search results

The purpose of this paper is to find two iterative methods to solve the general coupled matrix equations over the generalized centro‐symmetric and central antisymmetric matrices.

By extending the idea of conjugate gradient (CG) method, the authors present two iterative methods to solve the general coupled matrix equations over the generalized centro‐symmetric and central antisymmetric matrices.

When the general coupled matrix equations are consistent over the generalized centro‐symmetric and central anti‐symmetric matrices, the generalized centro‐symmetric and central anti‐symmetric solutions can be obtained within nite iterative steps. Also the least Frobenius norm generalized centrosymmetric and central anti‐symmetric solutions can be derived by choosing a special kind of initial matrices. Furthermore, the optimal approximation generalized centrosymmetric and central anti‐symmetric solutions to given generalized centro‐symmetric and central anti‐symmetric matrices can be obtained by finding the least Frobenius norm generalized centro‐symmetric and central anti‐symmetric solutions of new matrix equations. The authors employ some numerical examples to support the theoretical results of this paper. Finally, the application of the presented methods is highlighted for solving the projected generalized continuous‐time algebraic Lyapunov equations (GCALE).

By the algorithms, the solvability of the general coupled matrix equations over generalized centro‐symmetric and central anti‐symmetric matrices can be determined automatically. The convergence results of the iterative algorithms are also proposed. Several examples and an application are given to show the efficiency of the presented methods.

Gives introductory remarks about chapter 1 of this group of 31 papers, from ISEF 1999 Proceedings, in the methodologies for field analysis, in the electromagnetic community. Observes that computer package implementation theory contributes to clarification. Discusses the areas covered by some of the papers ‐ such as artificial intelligence using fuzzy logic. Includes applications such as permanent magnets and looks at eddy current problems. States the finite element method is currently the most popular method used for field computation. Closes by pointing out the amalgam of topics.

Partitioned analysis is a method by which sets of time‐dependent ordinary differential equations for coupled systems may be numerically integrated in tandem, thereby avoiding brute‐force simultaneous solution. The coupled systems addressed pertain to fluid—structure, fluid—soil, soil—structure, or even structure—structure interaction. The paper describes the partitioning process for certain discrete‐element equations of motion, as well as the associated computer implementation. It then delineates the procedure for designing a partitioned analysis method in a given application. Finally, examples are presented to illustrate the concepts. It is seen that a key element in the implementation of partitioned analysis is the use of integrated, as opposed to monolithic software.

The purpose of this paper is to analyse algorithms for fluid‐structure interaction (FSI) from a purely algorithmic point of view.

First of all a 1D model problem is selected, for which both the fluid and structural behavior are represented through a minimum number of parameters. Different coupling algorithm and time integration schemes are then applied to the simplified model problem and their properties are discussed depending on the values assumed by the parameters. Both exact and approximate time integration schemes are considered in the same framework so to allow an assessment of the different sources of error.

The properties of staggered coupling schemes are confirmed. An insight on the convergence behavior of iterative coupling schemes is provided. A technique to improve such convergence is then discussed.

All the results are proved for a given family of time integration schemes. The technique proposed can be applied to other families of time integration techniques, but some of the analytical results need to be reworked under this assumption.

The problems that are commonly encountered in FSI can be justified by simple arguments. It can also be shown that the limit at which trivial iterative schemes experience convergence difficulties is very close to that at which staggered schemes become unstable.

All the results shown are based on simple mathematics. The problems are presented so to be independent of the particular choice for the solution of the fluid flow.

Addresses problems in mechanics and physics involving two or more coupled variables of different nature, or a number of distinct domains which interact. For these kinds of problems, considers numerical solution by the coupling of operators appertaining to the individual participating phenomena, or defined in the domains. Reviews the co‐operation of distinct discretized operators in connection with the integration of temporal evolution processes, and the iterative treatment of stationary equations of state. The specification of subtasks complies with the demand for an independent treatment on different processing units arising in parallel computation. Physical subtasks refer to problems of different field variables interacting on the continuum level; their number is usually small. Fine granularity may be achieved by separating the problem region into subdomains which communicate via the boundaries. In multiphysics simulations operators are preferably combined such that subdomains are processed in parallel on different units, while physical phenomena are processed sequentially in the subdomain.

The purpose of this paper is to demonstrate new design concepts for 24 classes of laminate, which have been derived as part of an ongoing study on the development of a unified approach to the characterization of coupled laminates. The paper presents a description of each class of coupled laminate.

The paper gives an overview of the desired performance and requirements of a smart leading edge device, its aerodynamic design for the wind tunnel tests and the structural pre‐design and sizing of the full‐scale leading edge section which will be tested in the wind tunnel.

Coupled laminates have potential applications in the design of aero‐elastic compliant rotor blades or aircraft wing structures, by introducing tailored extension‐twist and/or shear‐extension coupling at the laminate level; or in the design of thermally activated morphing structures, by exploiting more complex coupling behaviour.

These laminates contain standard cross‐ply and/or angle‐ply combinations, although double angle‐ply laminates are also considered, and correspond to any standard fibre/matrix system with a constant ply thickness throughout.

The vast majority of the laminate described possess coupling behaviour not previously identified in the literature.

The paper aims to study the constraint solutions of the periodic coupled operator matrix equations by the biconjugate residual algorithm. The new algorithm can solve a lot of constraint solutions including Hamiltonian solutions and symmetric solutions, as special cases. At the end of this paper, the new algorithm is applied to the pole assignment problem.

When the studied periodic coupled operator matrix equations are consistent, it is proved that constraint solutions can converge to exact solutions. It is demonstrated that the solutions of the equations can be obtained by the new algorithm with any arbitrary initial matrices without rounding error in a finite number of iterative steps. In addition, the least norm-constrained solutions can also be calculated by selecting any initial matrices when the equations of the periodic coupled operator matrix are inconsistent.

Numerical examples show that compared with some existing algorithms, the proposed method has higher convergence efficiency because less data are used in each iteration and the data is sufficient to complete an update. It not only has the best convergence accuracy but also requires the least running time for iteration, which greatly saves memory space.

Compared with previous algorithms, the main feature of this algorithm is that it can synthesize these equations together to get a coupled operator matrix equation. Although the equation of this paper contains multiple submatrix equations, the algorithm in this paper only needs to use the information of one submatrix equation in the equation of this paper in each iteration so that different constraint solutions of different (coupled) matrix equations can be studied for this class of equations. However, previous articles need to iterate on a specific constraint solution of a matrix equation separately.

The purpose of this paper is to find the efficient iterative methods for solving the general matrix equation A1X+ XA2+A3XH+XHA4=B (including Lyapunov and Sylvester matrix equations as special cases) with the unknown complex (reflexive) matrix X.

By applying the principle of hierarchical identification and the Hermitian/skew‐Hermitian splitting of the coefficient matrix quadruplet A1; A2; A3; A4 the authors propose a shift‐splitting hierarchical identification (SSHI) method to solve the general linear matrix equation A1X+XA2+A3XH+XHA4=B. Also, the proposed algorithm is extended for finding the reflexive solution to this matrix equation.

The authors propose two iterative methods for finding the solution and reflexive solution of the general linear matrix equation, respectively. The proposed algorithms have a simple, neat and elegant structure. The convergence analysis of the methods is also discussed. Some numerical results are given which illustrate the power and effectiveness of the proposed algorithms.

So far, several methods have been presented and used for solving the matrix equations by using vec operator and Kronecker product, generalized inverse, generalized singular value decomposition (GSVD) and canonical correlation decomposition (CCD) of matrices. In several cases, it is difficult to find the solutions by using matrix decomposition and generalized inverse. Also vec operator and Kronecker product enlarge the size of the matrix greatly therefore the computations are very expensive in the process of finding solutions. To overcome these complications and drawbacks, by using the hierarchical identification principle and the Hermitian=skew‐Hermitian splitting of the coefficient matrix quadruplet (A1; A2; A3; A4), the authors propose SSHI methods for solving the general matrix equation.

A new way of solving the steady‐state coupled radiative‐conductive problem in semi‐transparent media is proposed. An angular discretization technique is applied in order to express the radiative transfer equation (RTE) in an inhomogeneous system of linear differential equations associated with Dirichlet boundary conditions. The system is solved by a direct method, after diagonalizing the characteristic matrix of the medium. The RTE is coupled with the nonlinear heat conduction equation. A simulation of a real semi‐transparent medium composed of silica fibers is illustrated. Comparison with results of other methods validates the new model. Moreover, the general scheme is easy to code and fast. The algorithm proved to be robust and stable.

Outlines a general methodology for the solution of the system of algebraic equations arising from the discretization of the field equations governing coupled problems. Considers that this discrete problem is obtained from the finite element discretization in space and the finite difference discretization in time. Aims to preserve software modularity, to be able to use existing single field codes to solve more complex problems, and to exploit computer resources optimally, emulating parallel processing. To this end, deals with two well‐known coupled problems of computational mechanics – the fluid‐structure interaction problem and thermally‐driven flows of incompressible fluids. Demonstrates the possibility of coupling the block‐iterative loop with the nonlinearity of the problems through numerical experiments which suggest that even a mild nonlinearity drives the convergence rate of the complete iterative scheme, at least for the two problems considered here. Discusses the implementation of this alternative to the direct coupled solution, stating advantages and disadvantages. Explains also the need for online synchronized communication between the different codes used as is the description of the master code which will control the overall algorithm.