Results 161 to 170 of about 531,187 (203)

On the Evaluation of Sources in Highly Accurate Time Domain Simulations on the Basis of Faber Polynomials

Progress in Electromagnetics Research Symposium, 2018
We investigate approaches for the time domain solution of Maxwell's equations on the basis of Faber polynomial expansions. Their convergence properties allow the formulation of highly efficient time propagation schemes. In this context, the efficient and
Hendrik Kleene, Dirk Schulz
semanticscholar   +1 more source

Faber Polynomials and the Faber Series

The American Mathematical Monthly, 1971
(1971). Faber Polynomials and the Faber Series. The American Mathematical Monthly: Vol. 78, No. 6, pp. 577-596.
openaire   +1 more source

Explicit Wideband Time-Domain Beam Propagation Algorithm Based on Faber Polynomials

IEEE Journal on Multiscale and Multiphysics Computational Techniques, 2019
A novel explicit algorithm based on a wideband time-domain beam propagation approach for the solution of Maxwell's equation in the time domain is presented.
Hendrik Kleene, D. Schulz
semanticscholar   +1 more source

FUNDAMENTAL PROPERTIES OF FABER POLYNOMIALS

Russian Mathematical Surveys, 1964
CONTENTSIntroduction § 1. Estimates for Faber polynomials within the domain § 2. Asymptotic formulae § 3. Convergence of Faber series within the domain § 4. Convergence of Faber series in the closed domain § 5. Series of Faber polynomials § 6. On the uniqueness of series of Faber polynomials § 7. Application of Faber polynomials to the interpolation of
openaire   +2 more sources

The conformal ‘bratwurst’ mapsand associated Faber polynomials

Numerische Mathematik, 2000
In the construction of polynomial iteration methods for the solution of a linear system \(Ax= b\), it is necessary to find inclusion sets \(\Omega\) which contain the spectrum of \(A\) but \(0\not\in\Omega\). The main object of this paper is to construct explicitly a class of non-convex inclusion sets.
Koch, Tino, Liesen, Jörg
openaire   +2 more sources

Lattice Paths and Faber Polynomials

1997
The r-th Faber polynomial of the Laurent series f(t) = t + f 0 + f 1/t + f 2/t 2 + … is the unique polynomial F r (u) of degree r in u such that F r (f) = t r + negative powers of t. We apply Faber polynomials, which were originally used to study univalent functions, to lattice path enumeration.
Ira M. Gessel, Sangwook Ree
openaire   +1 more source

Irreducibility of some Faber polynomials

The Ramanujan Journal, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Studies In Faber Polynomials.

1962
PhD ; Mathematics ; University of Michigan, Horace H. Rackham School of Graduate Studies ; http://deepblue.lib.umich.edu/bitstream/2027.42/185361/2/6202692 ...
openaire   +2 more sources

On the Distribution of Zeros of Faber Polynomials

Computational Methods and Function Theory, 2011
From the introduction: Let \(K\) be a compact subset of the complex plane containing more than one point whose complement \(\Omega =: \overline{\mathbb{C}} \setminus K \) is a simply connected domain. Denote by \(\Psi: \mathbb D^{*} \to \Omega\), the Riemann conformal mapping from \(\mathbb D^{*} : = \{w \in \overline{\mathbb{C}} \,: |w| > 1 \}\) onto \
Andrievskii, Vladimir V., Blatt, Hans-Peter   +1 more
openaire   +2 more sources

d-Orthogonal Faber polynomials

Integral Transforms and Special Functions, 2007
Douak and Maroni stated the following problem: P1: For fixed non-negative integer r and positive integer d, find all d-orthogonal polynomial sets {P n } n ≥ 0 which satisfy being the r-th associated polynomial set of {P n } n≥0. They solved it for the particular cases (r, d)=(1, 1) and (r, d)=(1, 2).
openaire   +1 more source