Prijava na forum:
Ime:
Lozinka:
Prijavi me trajno:
Trajanje:
Registruj nalog:
Ime:
Lozinka:
Ponovi Lozinku:
E-mail:

ConQUIZtador
Trenutno vreme je: 09. Maj 2024, 21:37:05
nazadnapred
Korisnici koji su trenutno na forumu 0 članova i 1 gost pregledaju ovu temu.
Idi dole
Stranice:
Počni novu temu Nova anketa Odgovor Štampaj Dodaj temu u favorite Pogledajte svoje poruke u temi
Tema: Mjera nekompaktnosti  (Pročitano 499 puta)
26. Apr 2008, 21:52:21
Udaljen sa foruma
Svakodnevni prolaznik


Balkan IT magazin

Zodijak Scorpio
Pol Muškarac
Poruke 498
Zastava Tuzla
OS
Windows XP
Browser
Mozilla Firefox 2.0.0.7
mob
LG Cookie
Unapred se izvinjavam ako pitanje možda postavljam na pogrešno mesto!

Mjera nekompaktnosti (eng. Measure of non-compactness)
Mjera nekompaktnosti Hausdorffa,
Mjera nekompaktnosti Kuratowski,
Mjera nekompaktnosti Nina Aleksandrovna

Tražio sam preko google-a ali nisam se baš najbolje snašao!:)
IP sačuvana
social share
Edit by Anea: Linkovi i bilo kakvi drugi reklamni elementi nisu dozvoljeni u potpisima korisnika!
Pogledaj profil WWW
 
Prijava na forum:
Ime:
Lozinka:
Zelim biti prijavljen:
Trajanje:
Registruj nalog:
Ime:
Lozinka:
Ponovi Lozinku:
E-mail:
Prijatelj foruma
Jet set burekdzija


The true method is no method.

Zodijak Aquarius
Pol Muškarac
Poruke 6103
Zastava Starship Enterprize
OS
Windows XP
Browser
Mozilla Firefox 2.0.0.14
mob
Bosch ima centrifugu
Measure of non-compactness
From Wikipedia, the free encyclopedia
Jump to: navigation, search

In functional analysis, two measures of non-compactness are commonly used; these associate numbers to sets in such a way that compact sets all get the measure 0, and other sets get measures that are bigger according to "how far" they are removed from compactness.

The underlying idea is the following: a bounded set can be covered by a single ball of some radius. Sometimes several balls of a smaller radius can also cover the set. A compact set in fact can be covered by finitely many balls of arbitrary small radius, because it is totally bounded. So one could ask: what is the smallest radius that allows to cover the set with finitely many balls?

Formally, we start with a metric space M and a subset X. The ball measure of non-compactness is defined as

    α(X) = inf {r > 0 : there exist finitely many balls of radius r which cover X}

and the Kuratowski measure of non-compactness is defined as

    β(X) = inf {d > 0 : there exist finitely many sets of diameter at most d which cover X}

Since a ball of radius r has diameter at most 2r, we have α(X) ≤ β(X) ≤ 2α(X).

The two measures α and β share many properties, and we will use γ in the sequel to denote either one of them. Here is a collection of facts:

    * X is bounded if and only if γ(X) < ∞.
    * γ(X) = γ(Xcl), where Xcl denotes the closure of X.
    * If X is compact, then γ(X) = 0. Conversely, if γ(X) = 0 and X is complete, then X is compact.
    * γ(X ∪ Y) = max(γ(X), γ(Y)) for any two subsets X and Y.
    * γ is continuous with respect to the Hausdorff distance of sets.

Measures of non-compactness are most commonly used if M is a normed vector space. In this case, we have in addition:

    * γ(aX) = |a| γ(X) for any scalar a
    * γ(X + Y) ≤ γ(X) + γ(Y)
    * γ(conv(X)) = γ(X), where conv(X) denotes the convex hull of X

Note that these measures of non-compactness are useless for subsets of Euclidean space Rn: by the Heine-Borel theorem, every bounded closed set is compact there, which means that γ(X) = 0 or ∞ according to whether X is bounded or not.

Measures of non-compactness are however useful in the study of infinite-dimensional Banach spaces, for example. In this context, one can prove that any ball B of radius r has α(B) = r and β(B) = 2r.
Retrieved from "http://en.wikipedia.org/wiki/Measure_of_non-compactness"
Categories: Functional analysis
IP sačuvana
social share


"I mourn the loss of thousands of precious lives, but I will not rejoice in the death of one, not even an enemy. Returning hate for hate multiplies hate, adding deeper darkness to a night already devoid of stars. Darkness cannot drive out darkness: only light can do that. Hate cannot drive out hate: Only love can do that."
Pogledaj profil
 
Prijava na forum:
Ime:
Lozinka:
Zelim biti prijavljen:
Trajanje:
Registruj nalog:
Ime:
Lozinka:
Ponovi Lozinku:
E-mail:
Idi gore
Stranice:
Počni novu temu Nova anketa Odgovor Štampaj Dodaj temu u favorite Pogledajte svoje poruke u temi
Trenutno vreme je: 09. Maj 2024, 21:37:05
nazadnapred
Prebaci se na:  
Oznake: Mjera

Poslednji odgovor u temi napisan je pre više od 6 meseci.  

Temu ne bi trebalo "iskopavati" osim u slučaju da imate nešto važno da dodate. Ako ipak želite napisati komentar, kliknite na dugme "Odgovori" u meniju iznad ove poruke. Postoje teme kod kojih su odgovori dobrodošli bez obzira na to koliko je vremena od prošlog prošlo. Npr. teme o određenom piscu, knjizi, muzičaru, glumcu i sl. Nemojte da vas ovaj spisak ograničava, ali nemojte ni pisati na teme koje su završena priča.

web design

Forum Info: Banneri Foruma :: Burek Toolbar :: Burek Prodavnica :: Burek Quiz :: Najcesca pitanja :: Tim Foruma :: Prijava zloupotrebe

Izvori vesti: Blic :: Wikipedia :: Mondo :: Press :: Naša mreža :: Sportska Centrala :: Glas Javnosti :: Kurir :: Mikro :: B92 Sport :: RTS :: Danas

Prijatelji foruma: Triviador :: Domaci :: Morazzia :: TotalCar :: FTW.rs :: MojaPijaca :: Pojacalo :: 011info :: Burgos :: Alfaprevod

Pravne Informacije: Pravilnik Foruma :: Politika privatnosti :: Uslovi koriscenja :: O nama :: Marketing :: Kontakt :: Sitemap

All content on this website is property of "Burek.com" and, as such, they may not be used on other websites without written permission.

Copyright © 2002- "Burek.com", all rights reserved. Performance: 0.091 sec za 16 q. Powered by: SMF. © 2005, Simple Machines LLC.