Selman and Kautz proposed a method, called Horn approximation, for speeding up inference in propositional Knowledge Bases. Their technique is based on the compilation of a propositional formula into a pair of Horn formulae: a Horn Greatest Lower Bound (GLB) and a Horn Least Upper Bound (LUB). In thi
Computational aspects of pseudospectral Laguerre approximations
โ Scribed by Daniele Funaro
- Publisher
- Elsevier Science
- Year
- 1990
- Tongue
- English
- Weight
- 616 KB
- Volume
- 6
- Category
- Article
- ISSN
- 0168-9274
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A generalized-Laguerre-Hermite pseudospectral method is proposed for computing symmetric and central vortex states in Bose-Einstein condensates (BECs) in three dimensions with cylindrical symmetry. The new method is based on the properly scaled generalized-Laguerre-Hermite functions and a normalized
## Abstract In this letter, an efficient multidomain pseudospectral method is implemented to solve leaky waveguides. The exterior subdomains with the evanescent and oscillatory mode shapes, the optical fields are, respectively, expanded by LaguerreโGauss functions and Legendre polynomials incorpora
Laguerre methods provide concrete techniques for approximating infinite dimensional systems by finite dimensional systems. Laguerre shifts and shifted Hankel operators are instrumental in the explicit computation of achievable Hankel error norms and Hankel optimal Laguerre filters.
Error estimates are given for the approximation of stable recorded delay systems in the L 2 and Hยฎ norms, using two recently advocated techniques based on Laguerre series. In addition, some theoretical results on L~(0, oo) approximation are derived.