Differential inclusions in a Banach space / Alexander Tolstonogov

Public ISBD Titre : Differential inclusions in a Banach space Type de document : texte imprimé Auteurs : Alexander Tolstonogov, Auteur Editeur : USA : Kluwer Academic Année de publication : 2000 Collection : Mathematics and its applications Importance : 302 p. Présentation : ill., couv. ill. Format : 25 cm. ISBN/ISSN/EAN : 978-0-7923-6618-8 Note générale : Trad. du russe : "Differencialʹnye vklûčeniâ v banahovom prostranstve" Langues : Anglais Langues originales : Russe Catégories : MATH:515 Analyse Mots-clés : Banach spaces  Differential inclusions Résumé : Audience: This volume will be of interest to researchers and postgraduate student whose work involves differential equations, functional analysis, topology, and the theory of set-valued functions. Differential inclusions in a Banach space [texte imprimé] / Alexander Tolstonogov, Auteur . - USA : Kluwer Academic, 2000 . - 302 p. : ill., couv. ill. ; 25 cm.. - (Mathematics and its applications) . ISBN : 978-0-7923-6618-8 Trad. du russe : "Differencialʹnye vklûčeniâ v banahovom prostranstve" Langues : Anglais Langues originales : Russe Catégories : MATH:515 Analyse Mots-clés : Banach spaces  Differential inclusions Résumé : Audience: This volume will be of interest to researchers and postgraduate student whose work involves differential equations, functional analysis, topology, and the theory of set-valued functions.

Réservation

Réserver ce document

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
515.308-1	515.308-1	Livre interne	BIBLIOTHEQUE CENTRALE	Mathématique (bc)	Disponible
515.7-27-1	515.7-27-1	Livre interne	BIBLIOTHEQUE DE FACULTE DES SCIENCES	Mathématique (SCI)	Disponible

Multigrid methods for finite elements / V.V Shaidurov

Public ISBD Titre : Multigrid methods for finite elements Type de document : texte imprimé Auteurs : V.V Shaidurov, Auteur Editeur : USA : Kluwer Academic Année de publication : 1995 Collection : Mathematics and its applications Importance : xiv-331p. Présentation : ill. Format : 25cm. ISBN/ISSN/EAN : 978-0-7923-3290-9 Langues : Anglais Catégories : MATH:515 Analyse Mots-clés : Finite element method  Multigrid methods(Numerical analysis)  Boundary value problems Résumé : Multigrid Methods for Finite Elements combines two rapidly developing fields: finite element methods, and multigrid algorithms. At the theoretical level, Shaidurov justifies the rate of convergence of various multigrid algorithms for self-adjoint and non-self-adjoint problems, positive definite and indefinite problems, and singular and spectral problems. At the practical level these statements are carried over to detailed, concrete problems, including economical constructions of triangulations and effective work with curvilinear boundaries, quasilinear equations and systems. Great attention is given to mixed formulations of finite element methods, which allow the simplification of the approximation of the biharmonic equation, the steady-state Stokes, and Navier--Stokes problems. Multigrid methods for finite elements [texte imprimé] / V.V Shaidurov, Auteur . - USA : Kluwer Academic, 1995 . - xiv-331p. : ill. ; 25cm.. - (Mathematics and its applications) . ISBN : 978-0-7923-3290-9 Langues : Anglais Catégories : MATH:515 Analyse Mots-clés : Finite element method  Multigrid methods(Numerical analysis)  Boundary value problems Résumé : Multigrid Methods for Finite Elements combines two rapidly developing fields: finite element methods, and multigrid algorithms. At the theoretical level, Shaidurov justifies the rate of convergence of various multigrid algorithms for self-adjoint and non-self-adjoint problems, positive definite and indefinite problems, and singular and spectral problems. At the practical level these statements are carried over to detailed, concrete problems, including economical constructions of triangulations and effective work with curvilinear boundaries, quasilinear equations and systems. Great attention is given to mixed formulations of finite element methods, which allow the simplification of the approximation of the biharmonic equation, the steady-state Stokes, and Navier--Stokes problems.

Réservation

Réserver ce document

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
515.234-1	515.234-1	Livre interne	BIBLIOTHEQUE CENTRALE	Mathématique (bc)	Disponible

Universal compression and retrieval / Rafail Krichevsky

Public ISBD Titre : Universal compression and retrieval Type de document : texte imprimé Auteurs : Rafail Krichevsky, Auteur Editeur : USA : Kluwer Academic Année de publication : 1994 Collection : Mathematics and its applications Importance : viii-219p. Format : 25cm. ISBN/ISSN/EAN : 978-0-7923-2672-4 Langues : Anglais Catégories : INFORMATIQUE:005.1.Programmation,programmes,organisations des donnees Mots-clés : Information storage and retrieval systems  Data compression (Computer science) Résumé : This volume constitutes a comprehensive self-contained course on source encoding. This is a rapidly developing field and the purpose of this book is to present the theory from its beginnings to the latest developments, some of which appear in book form for the first time. The major differences between this volume and previously published works is that here information retrieval is incorporated into source coding instead of discussing it separately. Second, this volume places an emphasis on the trade-off between complexity and the quality of coding; i.e. what is the price of achieving a maximum degree of data compression? Third, special attention is paid to universal families which contain a good compressing map for every source in a set. The volume presents a new algorithm for retrieval, which is optimal with respect to both program length and running time, and algorithms for hashing and adaptive on-line compressing. All the main tools of source coding and data compression such as Shannon, Ziv--Lempel, Gilbert--Moore codes, Kolmogorov complexity epsilon-entropy, lexicographic and digital search, are discussed. Moreover, data compression methods are described for developing short programs for partially specified Boolean functions, short formulas for threshold functions, identification keys, stochastic algorithms for finding the occurrence of a word in a text, and T-independent sets. For researchers and graduate students of information theory and theoretical computer science. The book will also serve as a useful reference for communication engineers and database designers. Universal compression and retrieval [texte imprimé] / Rafail Krichevsky, Auteur . - USA : Kluwer Academic, 1994 . - viii-219p. ; 25cm.. - (Mathematics and its applications) . ISBN : 978-0-7923-2672-4 Langues : Anglais Catégories : INFORMATIQUE:005.1.Programmation,programmes,organisations des donnees Mots-clés : Information storage and retrieval systems  Data compression (Computer science) Résumé : This volume constitutes a comprehensive self-contained course on source encoding. This is a rapidly developing field and the purpose of this book is to present the theory from its beginnings to the latest developments, some of which appear in book form for the first time. The major differences between this volume and previously published works is that here information retrieval is incorporated into source coding instead of discussing it separately. Second, this volume places an emphasis on the trade-off between complexity and the quality of coding; i.e. what is the price of achieving a maximum degree of data compression? Third, special attention is paid to universal families which contain a good compressing map for every source in a set. The volume presents a new algorithm for retrieval, which is optimal with respect to both program length and running time, and algorithms for hashing and adaptive on-line compressing. All the main tools of source coding and data compression such as Shannon, Ziv--Lempel, Gilbert--Moore codes, Kolmogorov complexity epsilon-entropy, lexicographic and digital search, are discussed. Moreover, data compression methods are described for developing short programs for partially specified Boolean functions, short formulas for threshold functions, identification keys, stochastic algorithms for finding the occurrence of a word in a text, and T-independent sets. For researchers and graduate students of information theory and theoretical computer science. The book will also serve as a useful reference for communication engineers and database designers.

Réservation

Réserver ce document

Exemplaires

Code-barres	Cote	Support	Localisation	Section	Disponibilité
005.1.160-1	005.1.160-1	Livre interne	BIBLIOTHEQUE CENTRALE	Informatique (bc)	Disponible

---

page 1/1