33 resultados para Approximate Hahn–Banach theorem
                                
Resumo:
Mathematics Subject Classification 2010: 26A33, 33E12.
                                
Resumo:
MSC 2010: 30C45
                                
Resumo:
Марусия Н. Славчова-Божкова - В настоящата работа се обобщава една гранична теорема за докритичен многомерен разклоняващ се процес, зависещ от възрастта на частиците с два типа имиграция. Целта е да се обобщи аналогичен резултат в едномерния случай като се прилагат “coupling” метода, теория на възстановяването и регенериращи процеси.
                                
Resumo:
Real-time systems are usually modelled with timed automata and real-time requirements relating to the state durations of the system are often specifiable using Linear Duration Invariants, which is a decidable subclass of Duration Calculus formulas. Various algorithms have been developed to check timed automata or real-time automata for linear duration invariants, but each needs complicated preprocessing and exponential calculation. To the best of our knowledge, these algorithms have not been implemented. In this paper, we present an approximate model checking technique based on a genetic algorithm to check real-time automata for linear durration invariants in reasonable times. Genetic algorithm is a good optimization method when a problem needs massive computation and it works particularly well in our case because the fitness function which is derived from the linear duration invariant is linear. ACM Computing Classification System (1998): D.2.4, C.3.
                                
Resumo:
AMS subject classification: 65J15, 47H04, 90C30.
                                
Resumo:
In 1952 Y. Tagamlitzki gave an elegant proof of the classical Bochner’s theorem on the positively definite functions. Unfortunately, he never published his proof. In this paper we consider a related but simpler problem, the trigonometric moment problem, by using Tagamlitzki’s approach.
                                
                                
                                
                                
Resumo:
In 1900 E. B. Van Vleck proposed a very efficient method to compute the Sturm sequence of a polynomial p (x) ∈ Z[x] by triangularizing one of Sylvester’s matrices of p (x) and its derivative p′(x). That method works fine only for the case of complete sequences provided no pivots take place. In 1917, A. J. Pell and R. L. Gordon pointed out this “weakness” in Van Vleck’s theorem, rectified it but did not extend his method, so that it also works in the cases of: (a) complete Sturm sequences with pivot, and (b) incomplete Sturm sequences. Despite its importance, the Pell-Gordon Theorem for polynomials in Q[x] has been totally forgotten and, to our knowledge, it is referenced by us for the first time in the literature. In this paper we go over Van Vleck’s theorem and method, modify slightly the formula of the Pell-Gordon Theorem and present a general triangularization method, called the VanVleck-Pell-Gordon method, that correctly computes in Z[x] polynomial Sturm sequences, both complete and incomplete.
                                
Resumo:
2000 Mathematics Subject Classification: 15A15, 15A24, 15A33, 16S50.
                                
Resumo:
2000 Mathematics Subject Classification: 41A25, 41A36.
                                
Resumo:
2000 Mathematics Subject Classification: 30C10.
                                
Resumo:
MSC 2010: 54A25, 54A35.
                                
Resumo:
MSC 2010: 30C10
 
                    