- Басты бет
- →
- 01.NU Schools
- →
- School of Science and Technology (2015-2019)
- →
- Mathematics
- →
- Articles
- →
- Шығу күні бойынша Articles көру
JavaScript is disabled for your browser. Some features of this site may not work without it.
Шығу күні бойынша Articles көру
Көрінетін элементтер 1-20 из 85
-
(Society for Industrial and Applied Mathematics. SIAM Journal on Numerical Analysis, 1992-04)A quasilinear parabolic problem is studied. By using the method of lines, the existence and uniqueness of a solution to the initial boundary value problem with sufficiently smooth initial conditions are shown. Also given ...
-
(Electronic journal of differential equations, 2001)We study approximations of the steady state Stokes problem governed by the power-law model for viscous incompressible non-Newtonian flow using the penalty formulation. We establish convergence and find error estimates.
-
(Electronic journal of differential equations, 2001)In this work, we compare a parabolic equation with an elliptic equation both of which are used in modeling temperature profile of a powerlaw polymer ow in a semi-infinite straight pipe with circular cross section. We ...
-
(Journal of Numerical Mathematics, 2003)Finite element approximations of the stationary power-law Stokes problem using penalty formulation are considered. A priori error estimates under appropriate smoothness assumptions on the solutions are established without ...
-
(2004)We give two sufficient conditions for the lattice Co(Rn,X) of rel- atively convex sets of Rn to be join-semidistributive, where X is a finite union of segments. We also prove that every finite lower bounded lattice can ...
-
(2005)For a class C of finite lattices, the question arises whether any lattice in C can be embedded into some atomistic, biatomic lattice in C. We provide answers to the question above for C being, respectively, — The class ...
-
(2006)Let V be a variety of algebras. We establish a condition (so called generalized entropic property), equivalent to the fact that for every algebra A 2 V, the set of all subalgebras of A is a subuniverse of the complex ...
-
(2007)The Edelman-Jamison problem is to characterize those abstract convex geometries that are representable by a set of points in the plane. We show that some natural modification of the Edelman-Jamison problem is equivalent to ...
-
(2010)On the space of unimodular lattices, we construct a sequence of invariant probability measures under a singular diagonal element with high entropy and show that the limit measure is 0
-
(Computing (Vienna/New York), 2010-06-09)The hierarchical ( backslashfancyscriptH -) matrix format allows storing a variety of dense matrices from certain applications in a special data-sparse way with linear-polylogarithmic complexity. Many operations from linear ...
-
(2011)We study the relation between measure theoretic entropy and escape of mass for the case of a singular diagonal flow on the moduli space of three-dimensional unimodular lattices
-
(Functiones et Approximatio, Commentarii Mathematici, 2011)We establish a criterion to decide when a countable projective limit of countable inductive limits of normed spaces is bornological. We compare the conditions occurring within our criterion with well-known abstract conditions ...
-
(2011)Let x = (x1; : : : ; xd) 2 [1; 1]d be linearly independent over Z, set K = f(ez; ex1z; ex2z : : : ; exdz) : jzj 1g:We prove sharp estimates for the growth of a polynomial of degree n, in terms of En(x) := supfkPk d+1 ...
-
(2011)Let G be a connected semisimple Lie group of real rank 1 with finite center, let be a non-uniform lattice in G and a any diagonalizable element in G. We investigate the relation between the metric entropy of a acting ...
-
(2011)A closure system with the anti-exchange axiom is called a convex geometry. One geometry is called a sub-geometry of the other if its closed sets form a sublattice in the lattice of closed sets of the other. We prove that ...
-
(2011)An assosiahedron Kn, known also as Stasheff polytope, is a multifaceted combinatorial object, which, in particular, can be realized as a convex hull of certain points in Rn, forming (n − 1)-dimensional polytope1. A ...
-
(2012)We give a su cient condition for an in nite computable family of 1 a sets, to have computable positive but undecidable numberings, where a is a notation for a nonzero computable ordinal. This extends a theorem proved ...
-
(2012)Closure system on a nite set is a unifying concept in logic programming, relational data bases and knowledge systems. It can also be presented in the terms of nite lattices, and the tools of economic description of a ...
-
(Applied Mathematical Sciences, 2012)In this paper, it is shown that D. Shelupsky's generalized sine func- tion, and various general sine functions developed by P. Drabek, R. Manasevich and M. Otani, P. Lindqvist, including the generalized Ja- cobi elliptic ...
Көрінетін элементтер 1-20 из 85
Ұсыну нұсқаулығы