Effective computation of matrix elements between polynomial basis functions
نویسندگان
چکیده
منابع مشابه
Effective computation of matrix elements between polynomial basis functions
Two methods of evaluating matrix elements of a function in a polynomial basis are considered: the expansion method, where the function is expanded in the basis and the integrals are evaluated analytically, and the numerical method, where the integration is performed directly using numerical quadrature. A reduced grid is proposed for the latter which makes use of the symmetry of the basis. Compa...
متن کاملOn the Calculation of Matrix Elements between Polynomial Basis Functions
A method of evaluating matrix elements between polynomial basis functions is proposed involving the explicit expansion of the operator in terms of the polynomial. The method is shown to have several advantages over the direct evaluation of these matrix elements by Gaussian quadrature, including savings of up to a factor of 6N for an N-dimensional integral. Application to the calculation of poly...
متن کاملStable Computation of Generalized Matrix Functions via Polynomial Interpolation∗
Generalized matrix functions (GMFs) extend the concept of a matrix function to rectangular matrices via the singular value decomposition. Several applications involving directed graphs, Hamiltonian dynamical systems, and optimization problems with low-rank constraints require the action of a GMF of a large, sparse matrix on a vector. We present a new method for applying GMFs to vectors based on...
متن کاملComputation on Zagreb Polynomial of Some Families of Dendrimers
In mathematical chemistry, a particular attention is given to degree-based graph invariant. The Zagrebpolynomial is one of the degree based polynomials considered in chemical graph theory. A dendrimer isan artificially manufactured or synthesized molecule built up from branched units called monomers. Inthis note, the first, second and third Zagreb poly...
متن کاملComputation of Generalized Matrix Functions
We develop numerical algorithms for the efficient evaluation of quantities associated with generalized matrix functions [J. B. Hawkins and A. Ben-Israel, Linear and Multilinear Algebra, 1(2), 1973, pp. 163–171]. Our algorithms are based on Gaussian quadrature and Golub–Kahan bidiagonalization. Block variants are also investigated. Numerical experiments are performed to illustrate the effectiven...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computer Physics Communications
سال: 2005
ISSN: 0010-4655
DOI: 10.1016/j.cpc.2003.12.007