A parallel multisplitting method with self-adaptive weightings for solving H-matrix linear systems
1Higher Education Key Laboratory of Engineering and Scientific Computing, Taiyuan Normal University, Taiyuan, Shanxi 030012 P.R. China.
Abstract:
In this paper, a parallel multisplitting iterative method with the self-adaptive weighting matrices is presented for the linear system of equations when the coefficient matrix is an H-matrix. The zero pattern in weighting matrices is determined in advance, while the non-zero entries of weighting matrices are determined by finding the optimal solution in a hyperplane of α points generated by the parallel multisplitting iterations. Especially, the nonnegative restriction of weighting matrices is released. The convergence theory is established for the parallel multisplitting method with self-adaptive weightings. Finally, a numerical example shows that the parallel multisplitting iterative method with the self-adaptive weighting matrices is effective.
More Related Videos
Related Concept Videos
Multi-input and Multi-variable systems
In the absence of...
Interpreting ¹H NMR Signal Splitting: The (n + 1) Rule
¹H NMR: Complex Splitting
Splitting diagrams or splitting tree diagrams are routinely used to depict such complex couplings. While drawing splitting diagrams, the splitting with the larger coupling constant is usually applied...
Multimachine Stability
In analyzing the system, the nodal equations represent the relationship between bus voltages, machine voltages, and machine currents. The nodal equation is given by:
Gaussian Elimination: Problem Solving
Extraction: Partition and Distribution Coefficients
For extracting a solute from an aqueous phase into an...


