Kelvin transform and multi-harmonic polynomials
نویسندگان
چکیده
منابع مشابه
Chromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملApproximation by harmonic polynomials
In this work we studied the approximation of the fundamental solution of the Laplace operator in two-dimensional space u = log(|x|) by harmonic polynomials. We analyzed the best approximation in the semi-ring with fixed outer radius and inner radius ? tending to zero. We observed exponential convergence in the degree of polynomials used for approximation. However, with inner radius tending to z...
متن کاملSpherical Harmonic Transform Algorithms
A collection of MATLAB classes for computing and using spherical harmonic transforms is presented. Methods of these classes compute differential operators on the sphere and are used to solve simple partial differential equations in a spherical geometry. The spectral synthesis and analysis algorithms using fast Fourier transforms and Legendre transforms with the associated Legendre functions are...
متن کاملHarmonic polynomials, hyperspherical harmonics, and atomic spectra
The properties of monomials, homogeneous polynomials and harmonic polynomials in d-dimensional spaces are discussed. The properties are shown to lead to formulas for the canonical decomposition of homogeneous polynomials and formulas for harmonic projection. Many important properties of spherical harmonics, Gegenbauer polynomials and hyperspherical harmonics follow from these formulas. Harmonic...
متن کاملHarmonic mean, random polynomials and stochastic matrices
Motivated by a problem in learning theory, we are led to study the dominant eigenvalue of a class of random matrices. This turns out to be related to the roots of the derivative of random polynomials (generated by picking their roots uniformly at random in the interval [0, 1], although our results extend to other distributions). This, in turn, requires the study of the statistical behavior of t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Mathematica
سال: 2000
ISSN: 0001-5962
DOI: 10.1007/bf02392712