نتایج جستجو برای: singular set

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

2005
PAUL JENKINS

where q = e. Let d ≡ 0, 3 (mod 4) be a positive integer, so that −d is a negative discriminant. Denote by Qd the set of positive definite integral binary quadratic forms Q(x, y) = ax + bxy + cy = [a, b, c] with discriminant −d = b − 4ac, including imprimitive forms (if such exist). We let αQ be the unique complex number in the upper half plane H which is a root of Q(x, 1) = 0. Values of j at th...

2001
Vincent K. Chan Imme Ebert-Uphoff

It is well known that parallel manipulators may encounter singular configurations that can result in a loss of full constraint. The nature of the kinematic deficiency at such a singular configuration can be analyzed by calculating the nullspace of the Jacobian matrix at that configuration. The result is a set of one or more screws, called the EE deficiency twists, representing the unconstrained...

Journal: :Cognition 2008
David Barner Justin Wood Marc Hauser Susan Carey

Set representations are explicitly expressed in natural language. For example, many languages distinguish between sets and subsets (all vs. some), as well as between singular and plural sets (a cat vs. some cats). Three experiments explored the hypothesis that these representations are language specific, and thus absent from the conceptual resources of non-linguistic animals. We found that rhes...

2006
LASSE REMPE

Let f be an entire function whose set of singular values is bounded and suppose that f has a Siegel disk U such that f |∂U is a homeomorphism. We extend a theorem of Herman by showing that, if the rotation number of U is diophantine, then ∂U contains a critical point of f . More generally, we show that, if U is a (not necessarily diophantine) Siegel disk as above, then U is bounded. Suppose fur...

2011
DANIEL KRESSNER N. TRUHAR

We consider the distance from a (square or rectangular) matrix pencil to the nearest matrix pencil in 2-norm that has a set of specified eigenvalues. We derive a singular value optimization characterization for this problem and illustrate its usefulness for two applications. First, the characterization yields a singular value formula for determining the nearest pencil whose eigenvalues lie in a...

Journal: :Math. Comput. 2007
Robert S. Maier

A machine-generated list of 192 local solutions of the Heun equation is given. They are analogous to Kummer’s 24 solutions of the Gauss hypergeometric equation, since the two equations are canonical Fuchsian differential equations on the Riemann sphere with four and three singular points, respectively. Tabulation is facilitated by the identification of the automorphism group of the equation wit...

2008
KOTARO YAMADA

In this paper, we discuss the recognition problem for Ak-type singularities on wave fronts. We give computable and simple criteria of these singularities, which will play a fundamental role in generalizing the authors’ previous work “the geometry of fronts” for surfaces. The crucial point to prove our criteria for Ak-singularities is to introduce a suitable parametrization of the singularities ...

2009
KOTARO YAMADA

In this paper, we discuss on the recognition problem of Ak-type singularities on wave fronts. We give computable and simple criteria of these singularities, which will play a fundamental role to generalize the authors’ previous work “the geometry of fronts” for surfaces. The crucial point to prove our criteria for Ak-singularities is to introduce a suitable parametrization of the singularities ...

2016
WEIWEI AO HARDY CHAN JUNCHENG WEI J. WEI

In this paper, we consider the problem of the existence of positive weak solutions of { (−∆)su = up in Ω u = 0 on Rn\Ω having prescribed isolated interior singularities. We prove that if n n−2s < p < p1 for some critical exponent p1 defined in the introduction which is related to the stability of the singular solution us, and if S is a closed subset of Ω, then there are infinitely many positive...

Journal: :SIAM J. Matrix Analysis Applications 1995
S. Chandrasekaran Ilse C. F. Ipsen

We extend the Golub-Kahan algorithm for computing the singular value decomposition of bidiagonal matrices to triangular matrices R. Our algorithm avoids the explicit formation of R T R or RRT. We derive a relation between left and right singular vectors of triangular matrices and use it to prove monotonic convergence of singular values and singular vectors. The convergence rate for singular val...

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

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