Listing 1 - 10 of 36 | << page >> |
Sort by
|
Choose an application
Approximation theory --- Interpolation --- Numerical analysis --- Applied Mathematics
Choose an application
Stein's method is a collection of probabilistic techniques that allow one to assess the distance between two probability distributions by means of differential operators. In 2007, the authors discovered that one can combine Stein's method with the powerful Malliavin calculus of variations, in order to deduce quantitative central limit theorems involving functionals of general Gaussian fields. This book provides an ideal introduction both to Stein's method and Malliavin calculus, from the standpoint of normal approximations on a Gaussian space. Many recent developments and applications are studied in detail, for instance: fourth moment theorems on the Wiener chaos, density estimates, Breuer-Major theorems for fractional processes, recursive cumulant computations, optimal rates and universality results for homogeneous sums. Largely self-contained, the book is perfect for self-study. It will appeal to researchers and graduate students in probability and statistics, especially those who wish to understand the connections between Stein's method and Malliavin calculus.
Approximation theory. --- Malliavin calculus. --- Calculus, Malliavin --- Stochastic analysis --- Theory of approximation --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems --- Analyse stochastique
Choose an application
This book presents a unique survey of solutions in algebraic approximation. Several results related with direct and converse theorems in the theory of approximation by algebraic polynomials in a finite interval are discussed. Some of these results are not collected in any other book. In addition, facts concerning trigonometric approximation that are necessary for motivation and comparisons are included. The selection of papers that are referenced and discussed document trends in polynomial approximation from the 1950s to the present day. Algebraic Approximation: A Guide to Past and Current Solutions will be invaluable to anyone seeking to understand the evolution of ideas in algebraic approximation. Its extensive bibliographic character will help finding the correct references for a specific result.
Approximation theory. --- Approximation theory --- Civil & Environmental Engineering --- Mathematics --- Physical Sciences & Mathematics --- Engineering & Applied Sciences --- Algebra --- Operations Research --- Algebra. --- Theory of approximation --- Mathematics. --- Approximations and Expansions. --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems --- Mathematical analysis --- Math --- Science
Choose an application
These proceedings were prepared in connection with the international conference Approximation Theory XIII, which was held March 7–10, 2010 in San Antonio, Texas. The conference was the thirteenth in a series of meetings in Approximation Theory held at various locations in the United States, and was attended by 144 participants. The book will be of interest to mathematicians, engineers, and computer scientists working in approximation theory, computer-aided geometric design, numerical analysis, and related application areas. It contains a carefully refereed and edited selection of papers. Along with the many plenary speakers, the contributors to this proceedings provided inspiring talks and set a high standard of exposition in their descriptions of new directions for research. Many relevant topics in approximation theory are included in this book, such as abstract approximation, approximation with constraints, interpolation and smoothing, wavelets and frames, shearlets, orthogonal polynomials, univariate and multivariate splines, and complex approximation. Marian Neamtu is Professor of Mathematics at Vanderbilt University, Nashville, TN. Larry L. Schumaker is Stevenson Professor of Mathematics at Vanderbilt University, Nashville, TN.
Approximation theory -- Congresses. --- Civil & Environmental Engineering --- Mathematics --- Engineering & Applied Sciences --- Physical Sciences & Mathematics --- Algebra --- Operations Research --- Approximation theory --- Mathematics. --- Approximation theory. --- Computer mathematics. --- Approximations and Expansions. --- Computational Mathematics and Numerical Analysis. --- Computer science --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Math --- Science --- Theory of approximation --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems
Choose an application
The approximation of a continuous function by either an algebraic polynomial, a trigonometric polynomial, or a spline, is an important issue in application areas like computer-aided geometric design and signal analysis. This book is an introduction to the mathematical analysis of such approximation, and, with the prerequisites of only calculus and linear algebra, the material is targeted at senior undergraduate level, with a treatment that is both rigorous and self-contained. The topics include polynomial interpolation; Bernstein polynomials and the Weierstrass theorem; best approximations in the general setting of normed linear spaces and inner product spaces; best uniform polynomial approximation; orthogonal polynomials; Newton-Cotes , Gauss and Clenshaw-Curtis quadrature; the Euler-Maclaurin formula ; approximation of periodic functions; the uniform convergence of Fourier series; spline approximation,with an extensive treatment of local spline interpolation,and its application in quadrature. Exercises are provided at the end of each chapter.
Asymptotic expansions. --- Transformations (Mathematics). --- Mathematics --- Physical Sciences & Mathematics --- Mathematical Theory --- Approximation theory. --- Numerical analysis. --- Theory of approximation --- Mathematics. --- Computer science --- Computer mathematics. --- Applied mathematics. --- Engineering mathematics. --- Mathematics, general. --- Computational Mathematics and Numerical Analysis. --- Approximations and Expansions. --- Mathematics of Computing. --- Appl.Mathematics/Computational Methods of Engineering. --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems --- Mathematical analysis --- Computer science. --- Mathematical and Computational Engineering. --- Engineering --- Engineering analysis --- Informatics --- Science --- Computer mathematics --- Discrete mathematics --- Electronic data processing --- Math --- Approximation theory --- Data processing. --- Study and teaching. --- Computer science—Mathematics.
Choose an application
Since the first edition of this book, the literature on fitted mesh methods for singularly perturbed problems has expanded significantly. Over the intervening years, fitted meshes have been shown to be effective for an extensive set of singularly perturbed partial differential equations. In the revised version of this book, the reader will find an introduction to the basic theory associated with fitted numerical methods for singularly perturbed differential equations. Fitted mesh methods focus on the appropriate distribution of the mesh points for singularly perturbed problems. The global erro
Differential equations --- Perturbation (Mathematics) --- Perturbation equations --- Perturbation theory --- Approximation theory --- Dynamics --- Functional analysis --- Mathematical physics --- 517.91 Differential equations --- Numerical solutions. --- Perturbation (Mathematics).
Choose an application
This second, revised and substantially extended edition of Approximations and Endomorphism Algebras of Modules reflects both the depth and the width of recent developments in the area since the first edition appeared in 2006. The new division of the monograph into two volumes roughly corresponds to its two central topics, approximation theory (Volume 1) and realization theorems for modules (Volume 2). It is a widely accepted fact that the category of all modules over a general associative ring is too complex to admit classification. Unless the ring is of finite representation type we must limit attempts at classification to some restricted subcategories of modules. The wild character of the category of all modules, or of one of its subcategories C, is often indicated by the presence of a realization theorem, that is, by the fact that any reasonable algebra is isomorphic to the endomorphism algebra of a module from C. This results in the existence of pathological direct sum decompositions, and these are generally viewed as obstacles to classification. In order to overcome this problem, the approximation theory of modules has been developed. The idea here is to select suitable subcategories C whose modules can be classified, and then to approximate arbitrary modules by those from C. These approximations are neither unique nor functorial in general, but there is a rich supply available appropriate to the requirements of various particular applications. The authors bring the two theories together. The first volume, Approximations, sets the scene in Part I by introducing the main classes of modules relevant here: the S-complete, pure-injective, Mittag-Leffler, and slender modules. Parts II and III of the first volume develop the key methods of approximation theory. Some of the recent applications to the structure of modules are also presented here, notably for tilting, cotilting, Baer, and Mittag-Leffler modules. In the second volume, Predictions, further basic instruments are introduced: the prediction principles, and their applications to proving realization theorems. Moreover, tools are developed there for answering problems motivated in algebraic topology. The authors concentrate on the impossibility of classification for modules over general rings. The wild character of many categories C of modules is documented here by the realization theorems that represent critical R-algebras over commutative rings R as endomorphism algebras of modules from C. The monograph starts from basic facts and gradually develops the theory towards its present frontiers. It is suitable both for graduate students interested in algebra and for experts in module and representation theory.
Modules (Algebra) --- Moduli theory. --- Approximation theory. --- Finite number systems --- Modular systems (Algebra) --- Algebra --- Finite groups --- Rings (Algebra) --- Theory of approximation --- Functional analysis --- Functions --- Polynomials --- Chebyshev systems --- Theory of moduli --- Analytic spaces --- Functions of several complex variables --- Geometry, Algebraic --- Approximations of Modules. --- Cotorsion Pair. --- E-Ring. --- Endomorphism Algebra. --- Filtration. --- Infinite Dimensional Tilting Theory. --- Prediction Principle.
Choose an application
Michael A. Matt constructs two trivariate local Lagrange interpolation methods which yield optimal approximation order and Cr macro-elements based on the Alfeld and the Worsey-Farin split of a tetrahedral partition. The first interpolation method is based on cubic C1 splines over type-4 cube partitions, for which numerical tests are given. The second is the first trivariate Lagrange interpolation method using C2 splines. It is based on arbitrary tetrahedral partitions using splines of degree nine. The author constructs trivariate macro-elements based on the Alfeld split, where each tetrahedron is divided into four subtetrahedra, and the Worsey-Farin split, where each tetrahedron is divided into twelve subtetrahedra, of a tetrahedral partition. In order to obtain the macro-elements based on the Worsey-Farin split minimal determining sets for Cr macro-elements are constructed over the Clough-Tocher split of a triangle, which are more variable than those in the literature.
Applications of mathematics. --- Mathematics. --- Spline theory. --- Engineering & Applied Sciences --- Applied Mathematics --- Partitions (Mathematics) --- Spline functions --- Applied mathematics. --- Engineering mathematics. --- Applications of Mathematics. --- Number theory --- Approximation theory --- Interpolation --- Math --- Science --- Engineering --- Engineering analysis --- Mathematical analysis --- Mathematics
Choose an application
This book grew out of a course taught in the Department of Mathematics, Indian Institute of Technology, Delhi, which was tailored to the needs of the applied community of mathematicians, engineers, physicists etc., who were interested in studying the problems of mathematical physics in general and their approximate solutions on computer in particular. Almost all topics which will be essential for the study of Sobolev spaces and their applications in the elliptic boundary value problems and their finite element approximations are presented. Also many additional topics of interests for specific applied disciplines and engineering, for example, elementary solutions, derivatives of discontinuous functions of several variables, delta-convergent sequences of functions, Fourier series of distributions, convolution system of equations etc. have been included along with many interesting examples.
Theory of distributions (Functional analysis) --- Sobolev spaces --- Spaces, Sobolev --- Function spaces --- Distribution (Functional analysis) --- Distributions, Theory of (Functional analysis) --- Functions, Generalized --- Generalized functions --- Functional analysis --- Distribution Theory. --- Elliptic Boundary Value Problem. --- Finite Element Approximation. --- Sobolev Space.
Choose an application
When precise algorithmic solutions are difficult to compute, the use of approximation algorithms can help. Design and Analysis of Approximation Algorithms is a textbook for a graduate course in theoretical computer science taught globally in universities. It can also be used as a reference work for researchers in the area of design and analysis algorithms. There are few texts available for this standard course, and those that do exist mainly follow a problem-oriented format. This text follows a structured, technique-oriented presentation. Approximation algorithms are organized into chapters based on the design techniques for the algorithms, enabling the reader to study algorithms of the same nature with ease, and providing an improved understanding of the design and analysis techniques for approximation algorithms. Instructors benefit from this approach allowing for an easy way to present the ideas and techniques of algorithms with a unified approach.
Approximation algorithms. --- Geometry -- Data processing. --- Approximation algorithms --- Mathematics --- Civil & Environmental Engineering --- Physical Sciences & Mathematics --- Engineering & Applied Sciences --- Mathematical Theory --- Operations Research --- Geometry --- Data processing. --- Mathematics. --- Algorithms. --- Mathematical optimization. --- Optimization. --- Algorithm Analysis and Problem Complexity. --- Heuristic algorithms --- Computer software. --- Software, Computer --- Computer systems --- Optimization (Mathematics) --- Optimization techniques --- Optimization theory --- Systems optimization --- Mathematical analysis --- Maxima and minima --- Operations research --- Simulation methods --- System analysis --- Algorism --- Algebra --- Arithmetic --- Foundations
Listing 1 - 10 of 36 | << page >> |
Sort by
|