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

2018 ◽  
Vol 2018 ◽  
pp. 1-12 ◽  
Author(s):  
Qinghua Wu ◽  
Liang Bao ◽  
Yiqin Lin
Keyword(s):  
Linear Systems ◽  
Linear Dependence ◽  
Numerical Experiments ◽  
Gmres Method ◽  
Algebraic Equations ◽  
Rank Deficiency ◽  
Nonsymmetric Linear Systems ◽  
Right Hand ◽  
Linear Algebraic Equations ◽  
Block Arnoldi

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.

scholarly journals A block GMRES method with deflated restarting for solving linear systems with multiple shifts and multiple right-hand sides

2018 ◽  
Vol 25 (5) ◽  
pp. e2148 ◽  
Author(s):  
Dong-Lin Sun ◽  
Ting-Zhu Huang ◽  
Yan-Fei Jing ◽  
Bruno Carpentieri
Keyword(s):  
Linear Systems ◽  
Gmres Method ◽  
Right Hand ◽  
Deflated Restarting

scholarly journals A Polynomial Preconditioned Global CMRH Method for Linear Systems with Multiple Right-Hand Sides

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Ke Zhang ◽  
Chuanqing Gu
Keyword(s):  
Theoretical Result ◽  
Linear Systems ◽  
Numerical Experiments ◽  
Krylov Subspace ◽  
Polynomial Degree ◽  
Right Hand

The restarted global CMRH method (Gl-CMRH(m)) (Heyouni, 2001) is an attractive method for linear systems with multiple right-hand sides. However, Gl-CMRH(m) may converge slowly or even stagnate due to a limited Krylov subspace. To ameliorate this drawback, a polynomial preconditioned variant of Gl-CMRH(m) is presented. We give a theoretical result for the square case that assures that the number of restarts can be reduced with increasing values of the polynomial degree. Numerical experiments from real applications are used to validate the effectiveness of the proposed method.

Calculation of Correlation Matrices for Linear Systems Subjected to Nonwhite Excitation

1972 ◽  
Vol 39 (2) ◽  
pp. 559-562 ◽  
Author(s):  
I-Min Yang ◽  
W. D. Iwan
Keyword(s):  
Spectral Density ◽  
Linear Systems ◽  
Random Response ◽  
Algebraic Equations ◽  
Correlation Matrices ◽  
Linear Algebraic Equations ◽  
Special Case

This paper presents an approach which provides a particularly simple and direct way of determining the instantaneous correlation matrices for the stationary random response of multidegree-of-freedom linear systems subjected to excitations of nearly arbitrary spectral density. In the special case of white excitation, the instantaneous correlation matrices are determined directly from a set of linear algebraic equations. When the excitation is nonwhite, some integrals must be evaluated before solving a system of linear algebraic equations. However, the form of these integrals is considerably simpler than that encountered in other common approaches.

scholarly journals A block IDR(s) method for nonsymmetric linear systems with multiple right-hand sides

2011 ◽  
Vol 235 (14) ◽  
pp. 4095-4106 ◽  
Author(s):  
L. Du ◽  
T. Sogabe ◽  
B. Yu ◽  
Y. Yamamoto ◽  
S.-L. Zhang
Keyword(s):  
Linear Systems ◽  
Nonsymmetric Linear Systems ◽  
Right Hand

scholarly journals Fluid-structure coupled wave scattering in a flexible duct at the junction of planar discontinuities

2017 ◽  
Vol 9 (7) ◽  
pp. 168781401771318 ◽  
Author(s):  
Rab Nawaz ◽  
Aasim Ullah Jan ◽  
Muhammad Afzal
Keyword(s):  
Wave Scattering ◽  
Numerical Experiments ◽  
Normal Modes ◽  
Acoustic Scattering ◽  
Algebraic Equations ◽  
Linear Algebraic Equations ◽  
Matching Technique ◽  
Generalized Orthogonal ◽  
Bounding Surfaces ◽  
Infinite Linear

This article applies the mode-matching technique to discuss acoustic scattering of waves in flexible duct/channel at the junction of planar discontinuities. Fields across the junction are expanded in normal modes that involve discontinuities in velocities at the flanged junction. The reflected and transmitted fields are matched at interface wherein the use of generalized orthogonal properties (in case of flexible bounded ducts) enables the mode coefficients in terms of system of infinite linear algebraic equations. This system is truncated and solved numerically. The numerical experiments show that the variation of structural discontinuities along with different bounding surfaces significantly alters the reflected and transmitted powers.

scholarly journals Parallel Algorithms for Solving Linear Systems on Hybrid Computers

2020 ◽  
pp. 53-66
Author(s):  
Alexander Khimich ◽  
Victor Polyanko ◽  
Tamara Chistyakova
Keyword(s):  
Parallel Algorithms ◽  
Computer Architecture ◽  
Linear Systems ◽  
High Performance ◽  
Numerical Data ◽  
Algebraic Equations ◽  
Existing Problems ◽  
Mathematical Properties ◽  
Linear Algebraic Equations ◽  
Computer Problem

Introduction. At present, in science and technology, new computational problems constantly arise with large volumes of data, the solution of which requires the use of powerful supercomputers. Most of these problems come down to solving systems of linear algebraic equations (SLAE). The main problem of solving problems on a computer is to obtain reliable solutions with minimal computing resources. However, the problem that is solved on a computer always contains approximate data regarding the original task (due to errors in the initial data, errors when entering numerical data into the computer, etc.). Thus, the mathematical properties of a computer problem can differ significantly from the properties of the original problem. It is necessary to solve problems taking into account approximate data and analyze computer results. Despite the significant results of research in the field of linear algebra, work in the direction of overcoming the existing problems of computer solving problems with approximate data is further aggravated by the use of contemporary supercomputers, do not lose their significance and require further development. Today, the most high-performance supercomputers are parallel ones with graphic processors. The architectural and technological features of these computers make it possible to significantly increase the efficiency of solving problems of large volumes at relatively low energy costs. The purpose of the article is to develop new parallel algorithms for solving systems of linear algebraic equations with approximate data on supercomputers with graphic processors that implement the automatic adjustment of the algorithms to the effective computer architecture and the mathematical properties of the problem, identified in the computer, as well with estimates of the reliability of the results. Results. A methodology for creating parallel algorithms for supercomputers with graphic processors that implement the study of the mathematical properties of linear systems with approximate data and the algorithms with the analysis of the reliability of the results are described. The results of computational experiments on the SKIT-4 supercomputer are presented. Conclusions. Parallel algorithms have been created for investigating and solving linear systems with approximate data on supercomputers with graphic processors. Numerical experiments with the new algorithms showed a significant acceleration of calculations with a guarantee of the reliability of the results. Keywords: systems of linear algebraic equations, hybrid algorithm, approximate data, reliability of the results, GPU computers.

Sign in / Sign up

Export Citation Format

Share Document