• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations

Tools

Sorted by:
Try your query at:
Semantic Scholar Scholar Academic
Google Bing DBLP
Results 1 - 10 of 368
Next 10 →

Classical Solutions of Multi-Dimensional Hele-Shaw Models

by Joachim Escher, Gieri Simonett , 1997
"... . Existence and uniqueness of classical solutions for the multi-dimensional expanding Hele-Shaw problem is proved. Key words. Classical solutions, Hele-Shaw model, moving boundary problem, maximal regularity. AMS subject classifications. 35R35, 35K55, 35S30, 76D99. 1. The problem. We are concern ..."
Abstract - Cited by 33 (7 self) - Add to MetaCart
. Existence and uniqueness of classical solutions for the multi-dimensional expanding Hele-Shaw problem is proved. Key words. Classical solutions, Hele-Shaw model, moving boundary problem, maximal regularity. AMS subject classifications. 35R35, 35K55, 35S30, 76D99. 1. The problem. We

ON A TAUBERIAN CONDITION FOR BOUNDED LINEAR OPERATORS

by Espoo A, J. Malinen, O. Nevanlinna, Z. Yuan, Ab Teknillinen Korkeakoulu, Universite De, J. Malinen, O. Nevanlinna, Z. Yuan, J. Malinen, O. Nevanlinna , 2004
"... ematics Research Reports A468 (2004). Abstract: We study the relation between the growth of sequences kT nk and k(n + 1)(I ¡ T)T nk for operators T 2 L(X) satisfying weak variants of the Ritt resolvent condition k(¸ ¡ T)¡1k · C j¸¡1j for various sets of j¸j> 1. AMS subject classi¯cations: 47A10, ..."
Abstract - Add to MetaCart
ematics Research Reports A468 (2004). Abstract: We study the relation between the growth of sequences kT nk and k(n + 1)(I ¡ T)T nk for operators T 2 L(X) satisfying weak variants of the Ritt resolvent condition k(¸ ¡ T)¡1k · C j¸¡1j for various sets of j¸j> 1. AMS subject classi¯cations: 47A10

A linear bound on the diameter of the transportation polytope

by Graham Brightwell, Jan Heuvel, Leen Stougie
"... We prove that the combinatorial diameter of the skeleton of the polytope of feasible solutions of any m × n transportation problem is at most 8(m + n − 2). The transportation problem ( TP) is a classic problem in operations research. The problem was posed for the first time by Hitchcock in 1941 [9] ..."
Abstract - Cited by 13 (1 self) - Add to MetaCart
famous conjecture (cf. [5]) saying that any d-dimensional polytope with n facets has diameter at most n − d. So far the best known bound for arbitrary polytopes is O(n log d+1) [10]. Any polynomial bound is still lacking. Such bounds have been proved for some special classes of polytopes ( for examples

Classical and Quantum Scattering for a Class of Long Range Random Potentials

by Igor Rodnianski, Wilhelm Schlag , 2001
"... this paper we prove existence of modi ed wave operators, with probability one, for the family of random operators on L ), d 2, H = 1 4 V (1.1) where x n jnj (1.2) with uniformly bounded independent ! n with mean 0, and > 2 . The most important example are Bernoulli variables ..."
Abstract - Cited by 21 (1 self) - Add to MetaCart
this paper we prove existence of modi ed wave operators, with probability one, for the family of random operators on L ), d 2, H = 1 4 V (1.1) where x n jnj (1.2) with uniformly bounded independent ! n with mean 0, and > 2 . The most important example are Bernoulli variables

Bounding Zeros of H² Functions via Concentrations

by Maria Girardi , 1994
"... . It is well-known that the zeros fz j g of a function in the classical Hardy space H 2 satisfy P 1 \Gamma jz j j ! 1 ; however, this sum can be arbitrarily large. We shall bound this sum by a constant that depends on the concentration of the function, a concept introduced by Beauzamy and Enflo. ..."
Abstract - Add to MetaCart
. It is well-known that the zeros fz j g of a function in the classical Hardy space H 2 satisfy P 1 \Gamma jz j j ! 1 ; however, this sum can be arbitrarily large. We shall bound this sum by a constant that depends on the concentration of the function, a concept introduced by Beauzamy and Enflo

A spin-conformal lower bound of the first positive Dirac eigenvalue

by Bernd Ammann , 2000
"... Let D be the Dirac operator on a compact spin manifold M . Assume that 0 is in the spectrum of D. We prove the existence of a lower bound on the rst positive eigenvalue of D depending only on the spin structure and the conformal type. Keywords: Dirac operator, rst positive eigenvalue, conformal met ..."
Abstract - Cited by 15 (9 self) - Add to MetaCart
Let D be the Dirac operator on a compact spin manifold M . Assume that 0 is in the spectrum of D. We prove the existence of a lower bound on the rst positive eigenvalue of D depending only on the spin structure and the conformal type. Keywords: Dirac operator, rst positive eigenvalue, conformal

Lower Bounds for Norms of Inverses of Interpolation Matrices for Radial Basis Functions

by Robert Schaback , 1994
"... : Interpolation of scattered data at distinct points x 1 ; . . . ; x n 2 IR d by linear combinations of translates \Phi(kx \Gamma x j k 2 ) of a radial basis function \Phi : IR 0 ! IR requires the solution of a linear system with the n by n distance matrix A := (\Phi(kx i \Gamma x j k 2 ). Recent ..."
Abstract - Cited by 13 (5 self) - Add to MetaCart
: Interpolation of scattered data at distinct points x 1 ; . . . ; x n 2 IR d by linear combinations of translates \Phi(kx \Gamma x j k 2 ) of a radial basis function \Phi : IR 0 ! IR requires the solution of a linear system with the n by n distance matrix A := (\Phi(kx i \Gamma x j k 2 ). Recent

An abstract domain extending Difference-Bound Matrices with disequality constraints

by Nicolas Halbwachs - 8th International Conference on Verification, Model-checking, and Abstract Intepretation, VMCAI’07 , 2007
"... Abstract. Knowing that two numerical variables always hold different values, at some point of a program, can be very useful, especially for analyzing aliases: if i 6 = j, then A[i] and A[j] are not aliased, and this knowledge is of great help for many other program analyses. Surprisingly, disequalit ..."
Abstract - Cited by 9 (2 self) - Add to MetaCart
Abstract. Knowing that two numerical variables always hold different values, at some point of a program, can be very useful, especially for analyzing aliases: if i 6 = j, then A[i] and A[j] are not aliased, and this knowledge is of great help for many other program analyses. Surprisingly

ON CLASSICAL SOLVABILITY OF THE FIRST INITIAL-BOUNDARY VALUE PROBLEM FOR EQUATIONS GENERATED BY CURVATURES

by Nina Ivochkina, Olga Ladyzhenskaya, Dedicated To Jürgen Moser, Main Theorem, Estimations In C, N. Ivochkina O. Ladyzhenskaya
"... The aim of this paper is to prove the existence theorem announced in [5]. The proof is based on á priori estimates which were done in [6]–[8] for solutions to equations including the equations from [5]. We have to add to these estimates the estimates of Hölder constants for ut and uxixj. Section 2 i ..."
Abstract - Add to MetaCart
is devoted to this purpose. We study the problems (1.1) Mm[u] = 3D − ut √ + fm(k[u]) = 3Dg in QT = 3DΩ × (0, T), 1 + u2 x (1.2) u = 3Dϕ on ∂ ′ QT, m ∈ [2, n], where Ω is a bounded domain in R n with a smooth boundary ∂Ω, ∂ ′ QT = 3D ∂ ′ ′ QT ∪ Ω(0), ∂ ′ ′ QT = 3D∂Ω × [0, T], Ω(0) = 3D{z = 3D(x, t

Bounds on Conditional Probabilities with Applications in Multi-User Communication

by Z. Wahrscheinlichkeitstheorie Verw Gebiete, R. Ahlswede, P. Gfics, J. Krner , 1976
"... We consider a sequence {Zg}i ~ 1 of independent, identically distributed random variables where each Z i is a pair (Xi, Y/). For any pair of events {X" ~ ~r { Y" ~ N} satisfying Pr(Y " e NIX " s d)> 1- ~ and for any non-negative real c we investigate how small Pr(Y"~) can ..."
Abstract - Add to MetaCart
We consider a sequence {Zg}i ~ 1 of independent, identically distributed random variables where each Z i is a pair (Xi, Y/). For any pair of events {X" ~ ~r { Y" ~ N} satisfying Pr(Y " e NIX " s d)> 1- ~ and for any non-negative real c we investigate how small Pr
Next 10 →
Results 1 - 10 of 368
Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University