Simple approximation scheme for the Anderson impurity Hamiltonian

1990 ◽  
Vol 79 (3) ◽  
pp. 365-375 ◽  
Author(s):  
G. Zwicknagl ◽  
V. Zevin ◽  
P. Fulde
Keyword(s):  
Approximation Scheme ◽  
Simple Approximation

scholarly journals Simple approximation scheme for the Anderson impurity Hamiltonian

1991 ◽  
Vol 83 (1) ◽  
pp. 153-153 ◽  
Author(s):  
G. Zwicknagl ◽  
V. Zevin ◽  
P. Fulde
Keyword(s):  
Approximation Scheme ◽  
Simple Approximation

scholarly journals Super-Accuracy Calculation for the Half Width of a Voigt Profile

Mathematics ◽  
2022 ◽  
Vol 10 (2) ◽  
pp. 210
Author(s):  
Yihong Wang ◽  
Bin Zhou ◽  
Rong Zhao ◽  
Bubin Wang ◽  
Qi Liu ◽  
...  
Keyword(s):  
Approximation Scheme ◽  
Half Width ◽  
Simple Approximation ◽  
Quadruple Precision ◽  
Voigt Profile ◽  
Better Than

A simple approximation scheme to describe the half width of the Voigt profile as a function of the relative contributions of Gaussian and Lorentzian broadening is presented. The proposed approximation scheme is highly accurate and provides an accuracy better than 10−17 for arbitrary αL/αG ratios. In particular, the accuracy reaches an astonishing 10−34 (quadruple precision) in the domain 0 ≤ αL/αG ≤ 0.2371 ∪ αL/αG ≥ 33.8786.

Facility location with adjacent units: a simple approximation scheme

2013 ◽  
Vol 5 (3) ◽  
pp. 214
Author(s):  
Shailesh S. Kulkarni ◽  
Hakan Tarakci ◽  
Kwabena G. Boakye ◽  
Subramaniam Ponnaiyan ◽  
Matthew Lasuzzo
Keyword(s):  
Facility Location ◽  
Approximation Scheme ◽  
Simple Approximation

Simple Approximation to Diffraction-Limited MTF

1971 ◽  
Vol 10 (11) ◽  
pp. 2547_1
Author(s):  
R. E. Hufnagel
Keyword(s):  
Simple Approximation

M-groupoid as a tool for investigating mathematical models of computers

1977 ◽  
Vol 1 (1) ◽  
pp. 71-91
Author(s):  
Jerzy Tiuryn
Keyword(s):  
Mathematical Models ◽  
Simple Approximation ◽  
Simplified Model ◽  
Suitable Choice ◽  
Iterative Systems

An M-groupoid is a simplified model of computer. The classes of M-groupoids, address machines, stored program computers and iterative systems are presented as categories – by a suitable choice of homomorphisms. It is shown that the first three categories are equivalent, whereas the fourth is weaker (it is not equivalent to the previous ones and it can easily be embedded in the category of M-groupoids). This fact proves that M-groupoids form an essentially better and reasonably simple approximation of more complicated models of computers than iterative systems.

Sign in / Sign up

Export Citation Format

Share Document