This book constitutes thoroughly revised selected papers of the 6th International Conference on Numerical Analysis and Its Applications, NAA 2016, held in Lozenetz, Bulgaria, in June 2016. The 90 revised papers presented were carefully reviewed and selected from 98 submissions. The conference offers a wide range of the following topics: Numerical Modeling; Numerical Stochastics; Numerical Approx-imation and Computational Geometry; Numerical Linear Algebra and Numer-ical Solution of Transcendental Equations; Numerical Methods for Differential Equations; High Performance Scientific Computing; and also special topics such as Novel methods in computational finance based on the FP7 Marie Curie Action,Project Multi-ITN STRIKE - Novel Methods in Compu-tational Finance, Grant Agreement Number 304617; Advanced numerical and applied studies of fractional differential equations.
This book offers a comprehensive presentation of some of the most successful and popular domain decomposition preconditioners for finite and spectral element approximations of partial differential equations. It places strong emphasis on both algorithmic and mathematical aspects. It covers in detail important methods such as FETI and balancing Neumann-Neumann methods and algorithms for spectral element methods.
th This volume contains a selection of 41 refereed papers presented at the 18 International Conference of Domain Decomposition Methods hosted by the School of ComputerScience and Engineering(CSE) of the Hebrew Universityof Jerusalem, Israel, January 12–17, 2008. 1 Background of the Conference Series The International Conference on Domain Decomposition Methods has been held in twelve countries throughout Asia, Europe, the Middle East, and North America, beginning in Paris in 1987. Originally held annually, it is now spaced at roughly 18-month intervals. A complete list of past meetings appears below. The principal technical content of the conference has always been mathematical, but the principal motivation has been to make ef cient use of distributed memory computers for complex applications arising in science and engineering. The leading 15 such computers, at the “petascale” characterized by 10 oating point operations per second of processing power and as many Bytes of application-addressablem- ory, now marshal more than 200,000 independentprocessor cores, and systems with many millions of cores are expected soon. There is essentially no alternative to - main decomposition as a stratagem for parallelization at such scales. Contributions from mathematicians, computerscientists, engineers,and scientists are together n- essary in addressing the challenge of scale, and all are important to this conference.
This volume contains a selection of papers presented at the 21st international conference on domain decomposition methods in science and engineering held in Rennes, France, June 25-29, 2012. Domain decomposition is an active and interdisciplinary research discipline, focusing on the development, analysis and implementation of numerical methods for massively parallel computers. Domain decomposition methods are among the most efficient solvers for large scale applications in science and engineering. They are based on a solid theoretical foundation and shown to be scalable for many important applications. Domain decomposition techniques can also naturally take into account multiscale phenomena. This book contains the most recent results in this important field of research, both mathematically and algorithmically and allows the reader to get an overview of this exciting branch of numerical analysis and scientific computing.
Domain decomposition (DD) methods provide powerful tools for constructing parallel numerical solution algorithms for large scale systems of algebraic equations arising from the discretization of partial differential equations. These methods are well-established and belong to a fast developing area. In this volume, the reader will find a brief historical overview, the basic results of the general theory of domain and space decomposition methods as well as the description and analysis of practical DD algorithms for parallel computing. It is typical to find in this volume that most of the presented DD solvers belong to the family of fast algorithms, where each component is efficient with respect to the arithmetical work. Readers will discover new analysis results for both the well-known basic DD solvers and some DD methods recently devised by the authors, e.g., for elliptic problems with varying chaotically piecewise constant orthotropism without restrictions on the finite aspect ratios.The hp finite element discretizations, in particular, by spectral elements of elliptic equations are given significant attention in current research and applications. This volume is the first to feature all components of Dirichlet-Dirichlet-type DD solvers for hp discretizations devised as numerical procedures which result in DD solvers that are almost optimal with respect to the computational work. The most important DD solvers are presented in the matrix/vector form algorithms that are convenient for practical use.
The purpose of this book is to offer an overview of the most popular domain decomposition methods for partial differential equations (PDEs). These methods are widely used for numerical simulations in solid mechanics, electromagnetism, flow in porous media, etc., on parallel machines from tens to hundreds of thousands of cores. The appealing feature of domain decomposition methods is that, contrary to direct methods, they are naturally parallel. The authors focus on parallel linear solvers. The authors present all popular algorithms, both at the PDE level and at the discrete level in terms of matrices, along with systematic scripts for sequential implementation in a free open-source finite element package as well as some parallel scripts. Also included is a new coarse space construction (two-level method) that adapts to highly heterogeneous problems.
Für die näherungsweise Lösung von Randwertproblemen zweiter Ordnung wird eine einheitliche Theorie der Finiten Elemente Methode und der Randelementmethode präsentiert. Neben der Stabilitäts- und Fehleranalysis wird vor allem auf effiziente Lösungsverfahren eingegangen. Für die Diskretisierung der auftretenden Randintegraloperatoren werden schnelle Randelementmethoden (Wavelets, Multipol, algebraische Techniken) mit der Darstellung durch partielle Integration verknüpft. Durch die Kopplung von FEM und BEM mittels Gebietszerlegungsmethoden können gekoppelte Randwertprobleme in komplexen Strukturen behandelt werden. Numerische Beispiele illustrieren die theoretischen Aussagen.
Effective Polynomial Computation is an introduction to the algorithms of computer algebra. It discusses the basic algorithms for manipulating polynomials including factoring polynomials. These algorithms are discussed from both a theoretical and practical perspective. Those cases where theoretically optimal algorithms are inappropriate are discussed and the practical alternatives are explained. Effective Polynomial Computation provides much of the mathematical motivation of the algorithms discussed to help the reader appreciate the mathematical mechanisms underlying the algorithms, and so that the algorithms will not appear to be constructed out of whole cloth. Preparatory to the discussion of algorithms for polynomials, the first third of this book discusses related issues in elementary number theory. These results are either used in later algorithms (e.g. the discussion of lattices and Diophantine approximation), or analogs of the number theoretic algorithms are used for polynomial problems (e.g. Euclidean algorithm and p-adic numbers). Among the unique features of Effective Polynomial Computation is the detailed material on greatest common divisor and factoring algorithms for sparse multivariate polynomials. In addition, both deterministic and probabilistic algorithms for irreducibility testing of polynomials are discussed.
Das Buch bietet einen Überblick über die numerischen Methoden zur Lösung strömungsmechanischer Probleme. Die in der Praxis meistgenutzten Methoden werden detailliert beschrieben. Behandelt werden auch fortgeschrittene Methoden, wie die Simulation von Turbulenzen und Parallel-Verarbeitung. Das Buch beschreibt die Grundlagen und Prinzipien der verschiedenen Methoden. Numerische Genauigkeit und Abschätzung sowie Fehlerreduktion werden detailliert mit vielen Beispielen behandelt. Alle Computercodes sind über den Server ftp.springer.de des Springer-Verlages erhältlich (Internet).
Das Verständnis der numerischen Behandlung elliptischer Differentialgleichungen erfordert notwendigerweise auch die Kenntnisse der Theorie der Differentialgleichungen. Deshalb behandelt das Buch beide parallel. Zunächst wird der klassische Zugang (starke Lösungen, Differenzenverfahren) beschrieben. Dem Maximum-Minimum-Prinzip auf der theoretischen Seite entsprechen beispielsweise die Eigenschaften der M-Matrizen, die sich bei der Diskretisierung ergeben. Nach einem Exkurs über die Funktionalanalysis werden die Variationsformulierung und die Finite-Element-Diskretisierungen behandelt. Weitere Themen sind die Analyse der Diskretisierungen von Eigenwertaufgaben und die Stokes-Gleichungen mit den inf-sup-Bedingungen für die Finite-Element-Diskretisierung. Auf der theoretischen Seite wird die Regularität der Lösungen näher untersucht. Gegenüber der zweiten Auflage enthält der vorliegende Text zahlreiche Aktualisierungen, vor allem im Bereich der Finiten Elemente sowie in den Literaturangaben. Außerdem wurden die vollständigen Lösungen der Übungsaufgaben hinzugefügt.

Best Books