Search results

The purpose of this paper is to propose an efficient iterative method for large-scale finite element equations of bad numerical stability arising from deformation analysis with multi-point constraint using Lagrange multiplier method.

In this paper, taking warpage analysis of polymer injection molding based on surface model as an example, the performance of several popular Krylov subspace methods, including conjugate gradient, BiCGSTAB and generalized minimal residual (GMRES), with diffident Incomplete LU (ILU)-type preconditions is investigated and compared. For controlling memory usage, GMRES(m) is also considered. And the ordering technique, commonly used in the direct method, is introduced into the presented iterative method to improve the preconditioner.

It is found that the proposed preconditioned GMRES method is robust and effective for solving problems considered in this paper, and approximate minimum degree (AMD) ordering is most beneficial for the reduction of fill-ins in the ILU preconditioner and acceleration of the convergence, especially for relatively accurate ILU-type preconditioning. And because of concerns about memory usage, GMRES(m) is a good choice if necessary.

In this paper, for overcoming difficulties of bad numerical stability resulting from Lagrange multiplier method, together with increasing scale of problems in engineering applications and limited hardware conditions of computer, a stable and efficient preconditioned iterative method is proposed for practical purpose. Before the preconditioning, AMD reordering, commonly used in the direct method, is introduced to improve the preconditioner. The numerical experiments show the good performance of the proposed iterative method for practical cases, which is implemented in in-house and commercial codes on PC.

This paper aims to present a dynamically adjusted deflated restarting procedure for the generalized conjugate residual method with an inner orthogonalization (GCRO) method.

The proposed method uses a GCR solver for the outer iteration and the generalized minimal residual (GMRES) with deflated restarting in the inner iteration. Approximate eigenpairs are evaluated at the end of each inner GMRES restart cycle. The approach determines the number of vectors to be deflated from the spectrum based on the number of negative Ritz values, k∗.

The authors show that the approach restores convergence to cases where GMRES with restart failed and compare the approach against standard GMRES with restarts and deflated restarting. Efficiency is demonstrated for a 2D NACA 0012 airfoil and a 3D common research model wing. In addition, numerical experiments confirm the scalability of the solver.

This paper proposes an extension of dynamic deflated restarting into the traditional GCRO method to improve convergence performance with a significant reduction in the memory usage. The novel deflation strategy involves selecting the number of deflated vectors per restart cycle based on the number of negative harmonic Ritz eigenpairs and defaulting to standard restarted GMRES within the inner loop if none, and restricts the deflated vectors to the smallest eigenvalues present in the modified Hessenberg matrix.

This paper aims to describe a method for efficient frequency domain model order reduction. The method attempts to combine the desirable attributes of Krylov reduction and proper orthogonal decomposition (POD) and is entitled Krylov enhanced POD (KPOD).

The KPOD method couples Krylov’s moment-matching property with POD’s data generalization ability to construct reduced models capable of maintaining accuracy over wide frequency ranges. The method is based on generating a sequence of state- and frequency-dependent Krylov subspaces and then applying POD to extract a single basis that generalizes the sequence of Krylov bases.

The frequency response of a pre-stressed microelectromechanical system resonator is used as an example to demonstrate KPOD’s ability in frequency domain model reduction, with KPOD exhibiting a 44 per cent efficiency improvement over POD.

The results indicate that KPOD greatly outperforms POD in accuracy and efficiency, making the proposed method a potential asset in the design of frequency-selective applications.

The purpose of this paper is the realization of Fast nonlinear finite element analysis (FEA).

Nonlinear magnetic field analysis is achieved by using Newton-Raphson method implemented by relaxed convergence criterion of Krylov subspace method.

This paper mathematically analyzes the reason why nonlinear convergence can be achieved if the convergence criterion for linearized equation is relaxed.

The proposed method is essential to reduce the elapsed time in nonlinear magnetic field analysis of quasi-stationary field.

The proposed method is able to be extended to not only static field but also time domain FEA strongly coupled with circuit equation.

Because the speedup of performance evaluation of electrical machines would be achieved using proposed method, the work efficiency in manufacturing would be accelerated.

It can be seen that the nonlinear convergence can be achieved if the convergence criterion for linearized equation is relaxed. The verification of proposed method is demonstrated using practical nonlinear magnetic field problem.

This paper aims to present a novel hybrid time integration approach for efficient numerical simulations of multiscale problems involving interactions of electromagnetic fields with fine structures.

The entire computational domain is discretized with a coarse grid and a locally refined subgrid containing the tiny objects. On the coarse grid, the time integration of Maxwell’s equations is realized by the conventional finite-difference technique, while on the subgrid, the unconditionally stable Krylov-subspace-exponential method is adopted to breakthrough the Courant–Friedrichs–Lewy stability condition.

It is shown that in contrast with the conventional finite-difference time-domain method, the proposed approach significantly reduces the memory costs and computation time while providing comparative results.

An efficient hybrid time integration approach for numerical simulations of multiscale electromagnetic problems is presented.

Finite element discretizations of low‐frequency, time‐harmonic magnetic problems lead to sparse, complex symmetric systems of linear equations. The question arises which Krylov subspace methods are appropriate to solve such systems. The quasi minimal residual method combines a constant amount of work and storage per iteration step with a smooth convergence history. These advantages are obtained by building a quasi minimal residual approach on top of a Lanczos process to construct the search space. Solving the complex systems by transforming them to equivalent real ones of double dimension has to be avoided as such real systems have spectra that are less favourable for the convergence of Krylov‐based methods. Numerical experiments are performed on electromagnetic engineering problems to compare the quasi minimal residual method to the bi‐conjugate gradient method and the generalized minimal residual method.

The purpose of this paper is to introduce efficient methods for solving the 2D biharmonic equation with Dirichlet boundary conditions of second kind. This equation describes the deflection of loaded plate with boundary conditions of simply supported plate kind. Also it can be derived from the calculus of variations combined with the variational principle of minimum potential energy. Because of existing fourth derivatives in this equation, introducing high‐order accurate methods need to use artificial points. Also solving the resulted linear system of equations suffers from slow convergence when iterative methods are used. This paper aims to introduce efficient methods to overcome these problems.

The paper considers several compact finite difference approximations that are derived on a nine‐point compact stencil using the values of the solution and its second derivatives as the unknowns. In these approximations there is no need to define special formulas near the boundaries and boundary conditions can be incorporated with these techniques. Several iterative linear systems solvers such as Krylov subspace and multigrid methods and their combination (with suitable preconditioner) have been developed to compare the efficiency of each method and to design powerful solvers.

The paper finds that the combination of compact finite difference schemes with multigrid method and Krylov iteration methods preconditioned by multigrid have excellent results for the second biharmonic equation, and that Krylov iteration methods preconditioned by multigrid are the most efficient methods.

The paper is of value in presenting, via some tables and figures, some numerical experiments which resulted from applying new methods on several test problems, and making comparison with conventional methods.

This paper aims to present a method for the efficient reduction of networks modelling parasitic couplings in very‐large‐scale integration (VLSI) circuits.

The parasitic effects are modelled by large RLC networks and current sources for the digital switching currents. Based on the determined behaviour of the digital modules, an efficient description of these networks is proposed, which allows for a more efficient model reduction than standard methods.

The proposed method enables a fast and efficient simulation of the parasitic effects. Additionally, an extension of the reduction method to elements, which incorporate some supply voltage dependence to model the internal currents more precisely than independent current sources is presented.

The presented method can be applied to large electrical networks, used in the modelling of parasitic effects, for reducing their size. A reduced model is created which can be used in investigations with circuit simulators requiring a lowered computational effort.

Contrary to existing methods, the presented method includes the knowledge of the behaviour of the sources in the model to enhance the model reduction process.

The purpose of this paper is to present the efficient iterative methods for solving linear complementarity problems (LCP), using a class of pre-conditioners.

By using the concept of solving the fixed-point system of equations associated to the LCP, pre-conditioning techniques and Krylov subspace methods the authors design some projected methods to solve LCP. Furthermore, within the computational framework, some models of pre-conditioners candidates are investigated and evaluated.

The proposed algorithms have a simple and graceful structure and can be applied to other complementarity problems. Asymptotic convergence of the sequence generated by the method to the unique solution of LCP is proved, along with a result regarding the convergence rate of the pre-conditioned methods. Finally, a computational comparison of the standard methods against pre-conditioned methods based on Example 1 is presented which illustrate the merits of simplicity, power and effectiveness of the proposed algorithms.

Comparison between the authors' methods and other similar methods for the studied problem shows a remarkable agreement and reveals that their models are superior in point of view rate of convergence and computing efficiency.

For solving LCP more attention has recently been paid on a class of iterative methods called the matrix-splitting such as AOR, MAOR, GAOR, SSOR, etc. But up to now, no paper has discussed the effect of pre-conditioning technique for matrix-splitting methods in LCP. So, this paper is planning to fill in this gap and the authors use a class of pre-conditioners with iterative methods and analyze the convergence of these methods for LCP.

Electrical capacitance tomography (ECT) and electrical resistance tomography (ERT) are promising techniques for multiphase flow measurement due to their high speed, low cost, non-invasive and visualization features. There are two major difficulties in image reconstruction for ECT and ERT: the “soft-field”effect, and the ill-posedness of the inverse problem, which includes two problems: under-determined problem and the solution is not stable, i.e. is very sensitive to measurement errors and noise. This paper aims to summarize and evaluate various reconstruction algorithms which have been studied and developed in the word for many years and to provide reference for further research and application.

In the past 10 years, various image reconstruction algorithms have been developed to deal with these problems, including in the field of industrial multi-phase flow measurement and biological medical diagnosis.

This paper reviews existing image reconstruction algorithms and the new algorithms proposed by the authors for electrical capacitance tomography and electrical resistance tomography in multi-phase flow measurement and biological medical diagnosis.

The authors systematically summarize and evaluate various reconstruction algorithms which have been studied and developed in the word for many years and to provide valuable reference for practical applications.