50 resultados para Schrodinger operators

em Bulgarian Digital Mathematics Library at IMI-BAS


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The general ordinary quasi-differential expression M of n-th order with complex coefficients and its formal adjoint M + are considered over a regoin (a, b) on the real line, −∞ ≤ a < b ≤ ∞, on which the operator may have a finite number of singular points. By considering M over various subintervals on which singularities occur only at the ends, restrictions of the maximal operator generated by M in L2|w (a, b) which are regularly solvable with respect to the minimal operators T0 (M ) and T0 (M + ). In addition to direct sums of regularly solvable operators defined on the separate subintervals, there are other regularly solvable restrications of the maximal operator which involve linking the various intervals together in interface like style.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study the continuity of pseudo-differential operators on Bessel potential spaces Hs|p (Rn ), and on the corresponding Besov spaces B^(s,q)p (R ^n). The modulus of continuity ω we use is assumed to satisfy j≥0, ∑ [ω(2−j )Ω(2j )]2 < ∞ where Ω is a suitable positive function.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

For a polish space M and a Banach space E let B1 (M, E) be the space of first Baire class functions from M to E, endowed with the pointwise weak topology. We study the compact subsets of B1 (M, E) and show that the fundamental results proved by Rosenthal, Bourgain, Fremlin, Talagrand and Godefroy, in case E = R, also hold true in the general case. For instance: a subset of B1 (M, E) is compact iff it is sequentially (resp. countably) compact, the convex hull of a compact bounded subset of B1 (M, E) is relatively compact, etc. We also show that our class includes Gulko compact. In the second part of the paper we examine under which conditions a bounded linear operator T : X ∗ → Y so that T |BX ∗ : (BX ∗ , w∗ ) → Y is a Baire-1 function, is a pointwise limit of a sequence (Tn ) of operators with T |BX ∗ : (BX ∗ , w∗ ) → (Y, · ) continuous for all n ∈ N. Our results in this case are connected with classical results of Choquet, Odell and Rosenthal.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

∗ The final version of this paper was sent to the editor when the author was supported by an ARC Small Grant of Dr. E. Tarafdar.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

* Partially supported by Grant MM-428/94 of MESC.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A new, unified presentation of the ideal norms of factorization of operators through Banach lattices and related ideal norms is given.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

* The second author is supported by the Alexander-von-Humboldt Foundation. He is on leave from: Institute of Mathematics, Academia Sinica, Beijing 100080, People’s Republic of China.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we are considered with the optimal control of a schrodinger equation. Based on the formulation for the variation of the cost functional, a gradient-type optimization technique utilizing the finite difference method is then developed to solve the constrained optimization problem. Finally, a numerical example is given and the results show that the method of solution is robust.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, a novel approach for character recognition has been presented with the help of genetic operators which have evolved from biological genetics and help us to achieve highly accurate results. A genetic algorithm approach has been described in which the biological haploid chromosomes have been implemented using a single row bit pattern of 315 values which have been operated upon by various genetic operators. A set of characters are taken as an initial population from which various new generations of characters are generated with the help of selection, crossover and mutation. Variations of population of characters are evolved from which the fittest solution is found by subjecting the various populations to a new fitness function developed. The methodology works and reduces the dissimilarity coefficient found by the fitness function between the character to be recognized and members of the populations and on reaching threshold limit of the error found from dissimilarity, it recognizes the character. As the new population is being generated from the older population, traits are passed on from one generation to another. We present a methodology with the help of which we are able to achieve highly efficient character recognition.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: 26A33, 33E12, 33C20.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: 47B38, 31B10, 42B20, 42B15.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mathematics Subject Classification: Primary 47A60, 47D06.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: Primary 42B20; Secondary 42B15, 42B25

Relevância:

20.00% 20.00%

Publicador:

Resumo:

2000 Mathematics Subject Classification: 42B10, 43A32.