Search results for "Program"
showing 10 items of 5938 documents
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…
Binding energies and pairing gaps in semi-magic nuclei obtained using new regularized higher-order EDF generators
2016
We present results of the Hartree-Fock-Bogolyubov calculations performed using nuclear energy density functionals based on regularized functional generators at next-to-leading and next-to-next-to-leading order. We discuss properties of binding energies and pairing gaps determined in semi-magic spherical nuclei. The results are compared with benchmark calculations performed for the functional generator SLyMR0 and functional UNEDF0.
General aggregation operators based on a fuzzy equivalence relation in the context of approximate systems
2016
Our paper deals with special constructions of general aggregation operators, which are based on a fuzzy equivalence relation and provide upper and lower approximations of the pointwise extension of an ordinary aggregation operator. We consider properties of these approximations and explore their role in the context of extensional fuzzy sets with respect to the corresponding equivalence relation. We consider also upper and lower approximations of a t-norm extension of an ordinary aggregation operator. Finally, we describe an approximate system, considering the lattice of all general aggregation operators and the lattice of all fuzzy equivalence relations.
A note on Sturmian words
2012
International audience; We describe an algorithm which, given a factor of a Sturmian word, computes the next factor of the same length in the lexicographic order in linear time. It is based on a combinatorial property of Sturmian words which is related with the Burrows-Wheeler transformation.
Marked systems and circular splicing
2007
Splicing systems are generative devices of formal languages, introduced by Head in 1987 to model biological phenomena on linear and circular DNA molecules. In this paper we introduce a special class of finite circular splicing systems named marked systems. We prove that a marked system S generates a regular circular language if and only if S satisfies a special (decidable) property. As a consequence, we show that we can decide whether a regular circular language is generated by a marked system and we characterize the structure of these regular circular languages.
On linear extension operators from growths of compactifications of products
1996
Abstract We obtain some results on product spaces. Among them we prove that for noncompact spaces X 1 and X 2 , the norm of every linear extension operator from C ( β ( X 1 × X 2 ) β ( X 1 × X 2 )) into C ( β ( X 1 × X 2 )) is greater or equal than 2, and also that β ( X 1 × X 2 ) β ( X 1 × X 2 ) is not a neighborhood retract of β ( X 1 × X 2 ).