Evaluating matrix functions for exponential integrators via Carathéodory-Fejér approximation and contour integrals.
This paper derives upper and lower bounds for the -condition number of the stiffness matrix resulting from the finite element approximation of a linear, abstract model problem. Sharp estimates in terms of the meshsize h are obtained. The theoretical results are applied to finite element approximations of elliptic PDE's in variational and in mixed form, and to first-order PDE's approximated using the Galerkin–Least Squares technique or by means of a non-standard Galerkin technique in L1(Ω). Numerical...
In this note, we compare some Krylov subspace iterative methods on the MASPAR, a massively parallel computer with 16K processors. In particular, we apply these methods to solve large sparse nonsymmetric linear systems arising from elliptic partial differential equations. The methods under consideration include conjugate gradient type methods, semiiterative methods, and a hybrid variant. Our numerical results show that, on the MASPAR, one should compare iterative methods rather on the basis of total...
An algorithm of the preconditioned conjugate gradient method in which the solution of an auxiliary system is replaced with multiplication by the matrix for suitably chosen is presented.
Recently, Na Huang and Changfeng Ma in (2016) proposed two kinds of typical practical choices of the PPS method. In this paper, we extrapolate two versions of the PPS iterative method, and we introduce the extrapolated Hermitian and skew-Hermitian positive definite and positive semi-definite splitting (EHPPS) iterative method and extrapolated triangular positive definite and positive semi-definite splitting (ETPPS) iterative method. We also investigate convergence analysis and consistency of the...
In this paper, we deal with the construction of symmetric matrix whose corresponding graph is connected and unicyclic using some pre-assigned spectral data. Spectral data for the problem consist of the smallest and the largest eigenvalues of each leading principal submatrices. Inverse eigenvalue problem (IEP) with this set of spectral data is generally known as the extremal IEP. We use a standard scheme of labeling the vertices of the graph, which helps in getting a simple relation between the characteristic...