نتایج جستجو برای: simple zeros

تعداد نتایج: 465239  

Journal: :Numerische Mathematik 2010
Drahoslava Janovská Gerhard Opfer

Already for a long time it is known that quaternionic polynomials whose coefficients are located only at one side of the powers, may have two classes of zeros: isolated zeros and spherical zeros. Only recently a classification of the two types of zeros and a means to compute all zeros of such polynomials have been developed. In this investigation we consider quaternionic polynomials whose coeff...

Journal: :Photonics 2023

Image data set from a multi-spectral animal imaging system is used to address two issues: (a) registering the oscillation in optical coherence tomography (OCT) images due mouse eye movement and (b) suppressing shadow region under thick vessels/structures. Several classical AI-based algorithms combination are tested for each task see their compatibility with combined system. Hybridization of AI ...

Journal: :IEEE Transactions on Automatic Control 2022

Single-input single-output (SISO), systems with zeros interlacing poles (ZIP) have been extensively studied in the literature and received interest widely. However, ZIP property for multiple-input multiple-output (MIMO), has not pursued sufficiently. In this article, we pursue MIMO link to strict passivity. For class of that admit a symmetric state-space realization, which SISO case is equivale...

2007
Kathy A. Driver Nico M. Temme

We investigate the polynomials P n ; Q m and R s , having degrees n; m and s respectively, with P n monic, that solve the approximation problem E nms (x) := P n (x)e ?2x + Q m (x)e ?x + R s (x) = O(x n+m+s+2) as x ! 0: We give a connection between the coeecients of each of the polynomials P n ; Q m and R s and certain hypergeometric functions, which leads to a simple expression for Q m in the c...

Journal: :Physical review. B, Condensed matter 1995
Bowen Frensley Klimeck Lake

We report on an eKcient numerical technique for directly locating transmission resonances and zeros in semiconductor heterostructures using tight-binding multiband models. The quantum transmitting boundary method is employed to generate the inverse of the retarded Green's function G (E) in. the tight-binding representation. The poles of G (E) are located. by solving a nonlinear non-Hermitian ei...

2017
EJ Janse van Rensburg

Abstract. Partition function or Fisher zeros play a fundamental role in the theory of phase transitions in models in classical statistical mechanics. In this paper the properties of partition function zeros in a square lattice self-avoiding walk model of polymer adsorption are presented. Some results constraining the distribution of zeros in the complex plane, based on mathematical results on t...

1987
Amos Ron

Given a multivariate compactly supported distribution φ, we derive here a necessary and sufficient condition for the global linear independence of its integer translates. This condition is based on the location of the zeros of φ̂ = The Fourier-Laplace transform of φ. The utility of the condition is demonstrated by several examples and applications, showing in particular, that previous results on...

2000
C. P. Hughes J. P. Keating Neil O’Connell

Jk(T ) is clearly de­ ned for all k > 0, and, on the additional assumption that all the zeros are simple, for all k < 0. It has previously been studied by Gonek (1984, 1989, 1999) and Hejhal (1989), and is discussed in Odlyzko (1992, x 2.12) and Titchmarsh (1986, x 14). The model proposed by Keating & Snaith (2000) is the characteristic polynomial of an N £ N unitary matrix U with eigenangles 3...

2012
Behzad GHANBARI

In this paper, we develop new families of sixth-order methods for solving simple zeros of non-linear equations. These methods are constructed such that the convergence is of order six. Each member of the families requires two evaluations of the given function and two of its derivative per iteration. These methods have more advantages than Newton’s method and other methods with the same converge...

Journal: :Math. Comput. 2007
Knut Mørken Martin Reimers

We present a simple and efficient method for computing zeros of spline functions. The method exploits the close relationship between a spline and its control polygon and is based on repeated knot insertion. Like Newton’s method it is quadratically convergent, but the new method overcomes the principal problem with Newton’s method in that it always converges and no starting value needs to be sup...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید