𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A fast polynomial representation for the translation operators of an MLFMA

✍ Scribed by Sanjay Velamparambil; Weng Cho Chew

Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
133 KB
Volume
28
Category
Article
ISSN
0895-2477

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An algorithm for the divisors of monic p
An algorithm for the divisors of monic polynomials over a commutative ring
✍ Ihsen Yengui πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 147 KB

Gilmer and Heinzer proved that given a reduced ring R, a polynomial f divides a monic polynomial in R[X] if and only if there exists a direct sum decomposition of R = R0 βŠ• . . . βŠ• Rm (m ≀ deg f ), associated to a fundamental system of idempotents e0, . . . , em, such that the component of f in each

Analyticity of a Nonlinear Operator Asso
Analyticity of a Nonlinear Operator Associated to the Conformal Representation in Schauder Spaces. An Integral Equation Approach
✍ Massimo Lanza de Cristoforis; Sergei V. Rogosin πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 279 KB πŸ‘ 2 views

We consider the Riemann map g ΞΆ,w of the complex unit disk to the plane domain I[ΞΆ] enclosed by the Jordan curve ΞΆ and normalized by the conditions g ΞΆ,w (0) = w, g ΞΆ,w (0) > 0, where w is a point of I[ΞΆ], and we present a nonlinear singular integral equation approach to prove that the nonlinear ope

An Accurate and Efficient Algorithm for
An Accurate and Efficient Algorithm for the Computation of the Characteristic Polynomial of a General Square Matrix
✍ S. Rombouts; K. Heyde πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 99 KB

An algorithm is presented for the efficient and accurate computation of the coefficients of the characteristic polynomial of a general square matrix. The algorithm is especially suited for the evaluation of canonical traces in determinant quantum Monte-Carlo methods.