Search results for "Programming"
showing 10 items of 3090 documents
The Asynchronous Leontief Model
1992
International audience; The traditional dynamic Leontief model is synchronous: every vertex acts simultaneously. A model with delays of action has been proposed, but it still remains synchronous. In this paper we propose an asynchronous version of the model that allows realistic computations. We fiurnish an algorithm and a program.
Quantum Finite Automata and Logics
2006
The connection between measure once quantum finite automata (MO-QFA) and logic is studied in this paper. The language class recognized by MO-QFA is compared to languages described by the first order logics and modular logics. And the equivalence between languages accepted by MO-QFA and languages described by formulas using Lindstrom quantifier is shown.
On the best Lipschitz extension problem for a discrete distance and the discrete ∞-Laplacian
2012
Abstract This paper concerns the best Lipschitz extension problem for a discrete distance that counts the number of steps. We relate this absolutely minimizing Lipschitz extension with a discrete ∞-Laplacian problem, which arises as the dynamic programming formula for the value function of some e -tug-of-war games. As in the classical case, we obtain the absolutely minimizing Lipschitz extension of a datum f by taking the limit as p → ∞ in a nonlocal p -Laplacian problem.
On generalized a-Browder's theorem
2007
We characterize the bounded linear operators T satisfying generalized a-Browder's theorem, or generalized a-Weyl's theorem, by means of localized SVEP, as well as by means of the quasi-nilpotent part H0(�I T) asbelongs to certain sets of C. In the last part we give a general framework in which generalized a-Weyl's theorem follows for several classes of operators. 1. Preliminaries. Let L(X) denote the space of bounded linear oper- ators on an infinite-dimensional complex Banach space X. For T ∈ L(X), denote by α(T) the dimension of the kernel ker T, and by β(T) the codi- mension of the range T(X). The operator T ∈ L(X) is called upper semi- Fredholm if α(T) < ∞ and T(X) is closed, and lower …
On the Class of Languages Recognizable by 1-Way Quantum Finite Automata
2007
It is an open problem to characterize the class of languages recognized by quantum finite automata (QFA). We examine some necessary and some sufficient conditions for a (regular) language to be recognizable by a QFA. For a subclass of regular languages we get a condition which is necessary and sufficient. Also, we prove that the class of languages recognizable by a QFA is not closed under union or any other binary Boolean operation where both arguments are significant.
Nonlinear systems solver in floating-point arithmetic using LP reduction
2009
This paper presents a new solver for systems of nonlinear equations. Such systems occur in Geometric Constraint Solving, e.g., when dimensioning parts in CAD-CAM, or when computing the topology of sets defined by nonlinear inequalities. The paper does not consider the problem of decomposing the system and assembling solutions of subsystems. It focuses on the numerical resolution of well-constrained systems. Instead of computing an exponential number of coefficients in the tensorial Bernstein basis, we resort to linear programming for computing range bounds of system equations or domain reductions of system variables. Linear programming is performed on a so called Bernstein polytope: though,…
DIN-Norm für PASCAL
1983
Die DIN-Norm Pascal ist aus einer Ubersetzung der ISO 7185 Pascal-Norm entstanden, die zum 1. Dezember 1983 von ISO nach einer mehrjahrigen Entwurfsphase verabschiedet wurde.
On the Bishop–Phelps–Bollobás theorem for multilinear mappings
2017
Abstract We study the Bishop–Phelps–Bollobas property and the Bishop–Phelps–Bollobas property for numerical radius. Our main aim is to extend some known results about norm or numerical radius attaining operators to multilinear and polynomial cases. We characterize the pair ( l 1 ( X ) , Y ) to have the BPBp for bilinear forms and prove that on L 1 ( μ ) the numerical radius and the norm of a multilinear mapping are the same. We also show that L 1 ( μ ) fails the BPBp-nu for multilinear mappings although L 1 ( μ ) satisfies it in the operator case for every measure μ.
Rank structured approximation method for quasi--periodic elliptic problems
2016
We consider an iteration method for solving an elliptic type boundary value problem $\mathcal{A} u=f$, where a positive definite operator $\mathcal{A}$ is generated by a quasi--periodic structure with rapidly changing coefficients (typical period is characterized by a small parameter $\epsilon$) . The method is based on using a simpler operator $\mathcal{A}_0$ (inversion of $\mathcal{A}_0$ is much simpler than inversion of $\mathcal{A}$), which can be viewed as a preconditioner for $\mathcal{A}$. We prove contraction of the iteration method and establish explicit estimates of the contraction factor $q$. Certainly the value of $q$ depends on the difference between $\mathcal{A}$ and $\mathcal…
C3v Top Data System (C3vTDS) software for spectrum simulation of XY3Z symmetric-top molecules using the group chain
2010
Abstract The C3v Top Data System (C3vTDS) program suite has been developed with the aim of studying any rovibrational band or polyad of XY3Z (C3v) symmetric-tops molecules in a singlet electronic state. It is developed in the same way as similar programs for various molecular symmetries (Td, Oh, C4v, C2v and D2h). We work in the O ( 3 ) ⊃ C ∞ v ⊃ C 3 v group chain and this choice has consequences on the method used to specify the input parameters for Hamiltonian and transition moment calculations. One example concerning the ν 2 band of the CH 3 12 D symmetric-top molecule is presented. This package consists in a series of FORTRAN programs called by scripts. The whole package is freely acces…