Novel memory-efficient Arnoldi algorithms for solving matrix polynomial eigenvalue problems are presented. More specifically, we consider the case of matrix polynomials expressed in the Chebyshev basis, which is often numerically more appropriate than the standard monomial basis for a larger degree d. The standard way of solving polynomial eigenvalue problems proceeds by linearization, which in...

the purpose of this study is to present an approximate numerical method for solving high order linear fredholm-volterra integro-differential equations in terms of rational chebyshev functions under the mixed conditions. the method is based on the approximation by the truncated rational chebyshev series. finally, the effectiveness of the method is illustrated in several numerical examples. the p...

In solving semilinear initial boundary value problems with prescribed non-periodic boundary conditions using implicit-explicit and implicit time stepping schemes, both the function and derivatives of the function may need to be computed accurately at each time step. To determine the best Chebyshev collocation method to do this, the accuracy of the real space Chebyshev differentiation, spectral ...

Compared to Krylov space methods based on orthogonal or oblique projection, the Chebyshev iteration does not require inner products and is therefore particularly suited for massively parallel computers with high communication cost. Here, six different algorithms that implement this method are presented and compared with respect to roundoff effects, in particular, the ultimately achievable accur...

This paper presents the XAMG library for solving large sparse systems of linear algebraic equations with multiple right-hand side vectors. The specializes but is not limited to solution obtained from discretization elliptic differential equations. A corresponding set numerical methods includes Krylov subspace, multigrid, Jacobi, Gauss-Seidel, and Chebyshev iterative methods. parallelization imp...

The Chebyshev or L∞ estimator minimizes the maximum absolute residual and is useful in situations where the error distribution has bounded support. In this paper, we derive the asymptotic distribution of this estimator in cases where the error distribution has bounded and unbounded support. We also consider the asymptotics of set-membership estimators such as the Chebyshev centre and maximum in...

This is the first paper in a series to study vertex algebra-like objects arising from infinite-dimensional quantum groups (quantum affine algebras and Yangians). In this paper we lay a foundation for this study. We formulate and study notions of quasi module and S-quasi module for a G1-vertex algebra V , where S is a quantum Yang-Baxter operator on V . We also formulate and study a notion of qu...

The completion A[τ ] of a locally convex ∗-algebra A[τ ] with not jointly continuous multiplication is a ∗-vector space with partial multiplication xy defined only for x or y ∈ A0, and it is called a topological quasi ∗-algebra. In this paper two classes of topological quasi ∗-algebras called strict CQ-algebras and HCQ-algebras are studied. Roughly speaking, a strict CQ-algebra (resp. HCQ-algeb...