We consider the convergence of Gauss-type quadrature formulas for the integral ∫∞ 0 f(x)ω(x)dx, where ω is a weight function on the half line [0,∞). The n-point Gauss-type quadrature formulas are constructed such that they are exact in the set of Laurent polynomials Λ−p,q−1 = { ∑q−1 k=−p akx k}, where p = p(n) is a sequence of integers satisfying 0 ≤ p(n) ≤ 2n and q = q(n) = 2n − p(n). It is pr...

Metric spaces can be generalized to partial metric spaces. Partial have a unique concept related distance. In usual case, there is no distance from two same points. But, we obtain the points in It means that not absolutely zero. Using basic of spaces, find analogy between and We define d^p formed by p, with applying characteristics metric. At beginning, implement determine sequences L_2 (P). th...

There is a cognitive limit in Humans. This cognitive limit has played a decisive role in almost all fields including Computer Sciences. The cognitive limit replicated in computer sciences is responsible for inherent Computational Complexity. If certain conditions are met then computational complexity starts decreasing, even sometime it does not appears at all. Very simple mechanical computing s...