A Block Arnoldi Algorithm Based Reduced-Order Model Applied to Large-Scale Algebraic Equations of a 3-D Field Problem

In simulations of three-dimensional transient physics filled through a numerical approach, the order of the equation set of high-fidelity models is extremely high. To eliminate the large dimension of equations, a model order reduction (MOR) technique is introduced. In the existing MOR methods, the block Arnoldi algorithm-based MOR method is numerically stable, achieving a passively reduced order model. Nevertheless, this method performs poorly when it is applied to very wide-frequency transients. To eliminate this deficiency, multipoint MOR methods are emerging. However, it is hard to directly apply an existing multipoint MOR method to a 3-D transient field equation set. The implementation issues in a reduction process (such as the selection of expansion points, the number of moments matched at a point and the error bound) have not been explored in detail. In this respect, an adaptive multipoint model reduction model based on the Arnoldi algorithm is proposed to obtain the reduced-order models of a 3-D temperature field. The originality of this study is the proposal of a novel adaptive algorithm for selecting expansion points, matching moments automatically, using a posterior-error estimator based on temperature response coupled with a network topological method (NTM). The computational efficiency and accuracy of the proposed method are evaluated by the numerical results from solving the temperature field of a prototype insulated-gate bipolar transistor (IGBT).

Indefinite Ruhe’s Variant of the Block Lanczos Method for Solving the Systems of Linear Equations

In this paper, we equip Cn with an indefinite scalar product with a specific Hermitian matrix, and our aim is to develop some block Krylov methods to indefinite mode. In fact, by considering the block Arnoldi, block FOM, and block Lanczos methods, we design the indefinite structures of these block Krylov methods; along with some obtained results, we offer the application of this methods in solving linear systems, and as the testifiers, we design numerical examples.

On applying weighted seed techniques to GMRES algorithm for solving multiple linear systems

In the present paper, we are concerned by weighted Arnoldi like methods for solving large and sparse linear systems that have different right-hand sides but have the same coefficient matrix. We first give detailed descriptions of the weighted Gram-Schmidt process and of a Ruhe variant of the weighted block Arnoldi algorithm. We also establish some theoretical results that links the iterates of the weighted block Arnoldi process to those of the non weighted one. Then, to accelerate the convergence of the classical restarted block and seed GMRES methods, we introduce the weighted restarted block and seed GMRES methods. Numerical experiments that are done with different matrices coming from the Matrix Market repository or from the university of Florida sparse matrix collection are reported at the end of this work in order to compare the performance and show the effectiveness of the proposed methods.

Residual-Based Simpler Block GMRES for Nonsymmetric Linear Systems with Multiple Right-Hand Sides

We propose in this paper a residual-based simpler block GMRES method for solving a system of linear algebraic equations with multiple right-hand sides. We show that this method is mathematically equivalent to the block GMRES method and thus equivalent to the simpler block GMRES method. Moreover, it is shown that the residual-based method is numerically more stable than the simpler block GMRES method. Based on the deflation strategy proposed by Calandra et al. (2013), we derive a deflation strategy to detect the possible linear dependence of the residuals and a near rank deficiency occurring in the block Arnoldi procedure. Numerical experiments are conducted to illustrate the performance of the new method.