Search results for "Number"

Una variante del metodo di Aparo per la determinazione degli zeri complessi di un polinomio

1968

Si espone un metodo per il calcolo degli zeri complessi di un polinomio che si presenta con caratteristiche intermedie tra quelli tradizionali del tipo «paper and pencil» e quelli sviluppati per l’impiego sui grandi calcolatori automatici. Il metodo e fondato su un principio analogo a quello di Aparo, ma utilizza una retta di inclinazione variabile passante per l’origine del piano complesso. Il passaggio di questa retta per gli zeri del polinomio viene individnato ricorrendo ad una opportuna variante del criterio di Routh, adattato allo studio della stabilita condizionata dei sistemi lineari.

Identification of small inhomogeneities: Asymptotic factorization

2007

We consider the boundary value problem of calculating the electrostatic potential for a homogeneous conductor containing finitely many small insulating inclusions. We give a new proof of the asymptotic expansion of the electrostatic potential in terms of the background potential, the location of the inhomogeneities and their geometry, as the size of the inhomogeneities tends to zero. Such asymptotic expansions have already been used to design direct (i.e. noniterative) reconstruction algorithms for the determination of the location of the small inclusions from electrostatic measurements on the boundary, e.g. MUSIC-type methods. Our derivation of the asymptotic formulas is based on integral …

Vereinfachte Rekursionen zur Richardson-Extrapolation in Spezialf�llen

1975

Recursions are given for Richardson-extrapolation based on generalized asymptotic expansions for the solution of a finite algorithm depending upon a parameterh>0. In particular, these expansions may contain terms likeh ?·log(h), (?>0). Simplified formulae are established in special cases. They are applicable to numerical integration of functions with algebraic or logarithmic endpoint singularities and provide a Romberg-type quadrature.

Multilevel preconditioning and adaptive sparse solution of inverse problems

2012

Maximal subgroups of small index of finite almost simple groups

2022

We prove in this paper that a finite almost simple group $R$ with socle the non-abelian simple group $S$ possesses a conjugacy class of core-free maximal subgroups whose index coincides with the smallest index $\operatorname{l}(S)$ of a maximal group of $S$ or a conjugacy class of core-free maximal subgroups with a fixed index $v_S \leq {\operatorname{l}(S)^2}$, depending only on $S$. We show that the number of subgroups of the outer automorphism group of $S$ is bounded by $\log^3 {\operatorname{l}(S)}$ and $\operatorname{l}(S)^2 < |S|$.

On the structure of certain ultradistributions

2009

Let "o" be a nonempty open subset of the k-dimensional euclidean space Rk. In this paper we show that, if S is an ultradistribution in "o", belonging to a class of Roumieu type stable under differential operators, then there is a family f, 2 Nk 0, of elements of L1 loc("o") such that S is represented in the formP2Nk 0 D"a"f "a". Some other results on the structure of certain ultradistributions of Roumieu type are also given.

On the Computational Complexity of Binary and Analog Symmetric Hopfield Nets

2000

We investigate the computational properties of finite binary- and analog-state discrete-time symmetric Hopfield nets. For binary networks, we obtain a simulation of convergent asymmetric networks by symmetric networks with only a linear increase in network size and computation time. Then we analyze the convergence time of Hopfield nets in terms of the length of their bit representations. Here we construct an analog symmetric network whose convergence time exceeds the convergence time of any binary Hopfield net with the same representation length. Further, we prove that the MIN ENERGY problem for analog Hopfield nets is NP-hard and provide a polynomial time approximation algorithm for this p…

Equivalence closure in the two-variable guarded fragment

2015

We consider the satisfiability and finite satisfiability problems for the extension of the two-variable guarded fragment in which an equivalence closure operator can be applied to two distinguished binary predicates. We show that the satisfiability and finite satisfiability problems for this logic are 2-ExpTime-complete. This contrasts with an earlier result that the corresponding problems for the full two-variable logic with equivalence closures of two binary predicates are 2-NExpTime-complete.

Efficient parallel computations of flows of arbitrary fluids for all regimes of Reynolds, Mach and Grashof numbers

2002

This paper presents a unified numerical method able to address a wide class of fluid flow problems of engineering interest. Arbitrary fluids are treated specifying totally arbitrary equations of state, either in analytical form or through look‐up tables. The most general system of the unsteady Navier–Stokes equations is integrated with a coupled implicit preconditioned method. The method can stand infinite CFL number and shows the efficiency of a quasi‐Newton method independent of the multi‐block partitioning on parallel machines. Computed test cases ranging from inviscid hydrodynamics, to natural convection loops of liquid metals, and to supersonic gasdynamics, show a solution efficiency i…

Secure random number generation in wireless sensor networks

2014

The increasing adoption of wireless sensor networks as a flexible and inexpensive tool for the most diverse applications, ranging from environmental monitoring to home automation, has raised more and more attention to the issues related to the design of specifically customized security mechanisms. The scarcity of computational, storage, and bandwidth resources cannot definitely be disregarded in such context, and this makes the implementation of security algorithms particularly challenging. This paper proposes a security framework for the generation of true random numbers, which are paramount as the core building block for many security algorithms; the intrinsic nature of wireless sensor no…