Results 241 to 250 of about 693,136 (285)

Two-lens telecentric model eyes for image distortion measurement in adaptive optics ophthalmoscopes. [PDF]

Biomed Opt Express
Xia Y, Ayubi GA, Bentley J, Dubra A.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Constant solutions of polynomial equations

International Journal of Control, 1991
Abstract A necessary and sufficient condition is given for the equation AX + BY = C in polynomial matrices to have a constant solution pair X, Y and also for X to be non-singular. A sufficient condition is then established under which the equation with A and B fixed has a constant solution for each C from a given class. Applications to the construction
VLADIMÍR KUČERA, PETR ZAGALAK
openaire   +3 more sources

Polynomial maps with constant Jacobian

Israel Journal of Mathematics, 1979
It has been long conjectured that ifn polynomialsf 1, …,f n inn variables have a (non-zero) constant Jacobian determinant then every polynomial can be expressed as a polynomial inf 1, …,f n. In this paper, various extra assumptions (particularly whenn=2) are shown to imply the conclusion. These conditions are discussed algebraically and geometrically.
openaire   +4 more sources

John constants for polynomials

Complex Variables, Theory and Application: An International Journal, 1996
Let g be some set of non-constant analytic functions in the unit disk D, and for f e dg define The quantity where g u is the set of univalent functions in g, is called the John constant of g. We discuss where T k consists of the trinomials In particular, we find We also establish a conjecture of Rahman and Szynal for univalent trinomials in T ...
openaire   +1 more source

Polynomial Constants Are Decidable

2002
Constant propagation aims at identifying expressions that always yield a unique constant value at run-time. It is well-known that constant propagation is undecidable for programs working on integers even if guards are ignored as in non-deterministic flow graphs. We show that polynomial constants are decidable in non-deterministic flow graphs.
Markus Müller-Olm, Helmut Seidl
openaire   +1 more source