A block equation solver for the solution of large, sparse, banded unsymmetric system of linear equations is presented in this paper. The method employs Crout variation of Gauss elimination technique for the solution. The solver ensures the efficient use of the available memory by doing block factori
The design and use of a sparse direct solver for skew symmetric matrices
β Scribed by Iain S. Duff
- Publisher
- Elsevier Science
- Year
- 2009
- Tongue
- English
- Weight
- 380 KB
- Volume
- 226
- Category
- Article
- ISSN
- 0377-0427
No coin nor oath required. For personal study only.
β¦ Synopsis
GMRES a b s t r a c t
We consider the LDL T factorization of sparse skew symmetric matrices. We see that the pivoting strategies are similar, but simpler, to those used in the factorization of sparse symmetric indefinite matrices, and we briefly describe the algorithms used in a forthcoming direct code based on multifrontal techniques for the factorization of real skew symmetric matrices. We show how this factorization can be very efficient for preconditioning matrices that have a large skew component.
π SIMILAR VOLUMES
In this paper we compare Krylov subspace methods with Chebyshev series expansion for approximating the matrix exponential operator on large, sparse, symmetric matrices. Experimental results upon negative-definite matrices with very large size, arising from (2D and 3D) FE and FD spatial discretizatio
## Abstract The multifrontal method is applied for solving a large, sparse, and unsymmetric system of linear equations resulting from the use of the edgeβbased finiteβelement method (FEM). The finiteβelement method combined with perfectly matched layers (PML) is given for simulation of microwave de
## Abstract In the numerical modelling of mechanical systems, eigenvalue problems occur in connection with the evaluation of resonance frequencies, buckling modes and other more esoteric calculations. The matrices whose eigenvalues are sought sometimes have a skewβsymmetric component and the presen