Вычислительная математика
Математика
  • формат djvu
  • размер 6.19 МБ
  • добавлен 19 февраля 2011 г.
Christensen O., Christensen K.L. Approximation Theory: From Taylor Polynomials to Wavelets
Birkh?user Boston, 2004. - 165 Pages.

This concisely written book gives an elementary introduction to a classical area of mathematics --approximation theory -- in a way that naturally leads to the mode field of wavelets. The exposition, driven by ideas rather than technical details and proofs, demonstrates the dynamic nature of mathematics and the influence of classical disciplines on many areas of mode mathematics and applications.
Похожие разделы
Смотрите также

Burden R.L., Faires J.D. Numerical Analysis

  • формат pdf
  • размер 14.53 МБ
  • добавлен 16 августа 2011 г.
Brook Cole, 2010. - 888 pages. This well-respected text gives an introduction to the theory and application of modern numerical approximation techniques for students taking a one- or two-semester course in numerical analysis. With an accessible treatment that only requires a calculus prerequisite, Burden and Faires explain how, why, and when approximation techniques can be expected to work, and why, in some situations, they fail. A wealth of ex...

Burden R.L., Faires J.D. Numerical Analysis

  • формат djvu
  • размер 7.32 МБ
  • добавлен 22 ноября 2009 г.
Cengage Learning, 2001, 850 pp. , 7 edition. Mathematical preliminaries. solutions of equations in one variable. interpolation and polynomial approximation. numerical differentiation and integration. initial-Value problems for ordinary differential equations. direct methods for solving linear systems. iterative techniques in matrix algebra. approximation theory. approximating eigenvalues. numerical solutions of nonlinear systems of equations. bou...

Cohen A., Numerical Analysis of Wavelet Methods

  • формат pdf
  • размер 13.93 МБ
  • добавлен 12 июня 2011 г.
The objectives of this book are to survey the theoretical results that are involved in the numerical analysis of wavelet methods, and more generally of multiscale decomposition methods, for numerical simulation problems, and to provide the most relevant examples of such mathematical tools in this particular context. Content: 1 Basic examples 1.1 Introduction 1.2 The Haar system 1.3 The Schauder hierarchical basis 1.4 Multivariate constructions 1...

Cohen H. Numerical Approximation Methods

  • формат pdf
  • размер 2.27 МБ
  • добавлен 17 декабря 2011 г.
Springer, 2011. - 498 pages. This book presents numerical and other approximation techniques for solving various types of mathematical problems that cannot be solved analytically. In addition to well known methods, it contains some non-standard approximation techniques that are now formally collected as well as original methods developed by the author that do not appear in the literature. This book contains an extensive treatment of approximate...

Collins G.W., II. Fundamental Numerical Methods and Data Analysis

  • формат pdf
  • размер 1.99 МБ
  • добавлен 12 декабря 2010 г.
George W. Collins, II, 2003. - 284 pages. * Contents and Introduction * Chapter 1: Introduction and Fundamental Concepts * Chapter 2: The Numerical Methods for Linear Equations and Matrices * Chapter 3: Polynomial Approximation, Interpolation, and Orthogonal Polynomials * Chapter 4: Numerical Evaluation of Derivatives and Integrals * Chapter 5: Numerical Solution of Differential and Integral Equations * Chapter 6: Least Squares, Fourier An...

Crowell R.H., Fox R.?. Introduction to knot theory

  • формат djvu
  • размер 2.46 МБ
  • добавлен 02 марта 2011 г.
Springer- Verlag, 1963. 182 p. Contents Prerequisites Chapter I Knots and Knot Types Chapter II The Fundamental Group Chapter III The Free Groups Chapter IV Presentation of Groups Chapter V Calculation of Fundamental Groups Chapter VI Presentation of a Knot Group Chapter VII The Free Calculus and the Elementary Ideals Chapter VIII The Knot Polynomials Chapter IX Characteristic Properties of the Knot Polynomials Appendix I Differentiab...

Le Mehaute A., Rabut C., Schumaker L.L. (eds.) Surface Fitting and Multiresolution Methods

  • формат chm
  • размер 3.03 МБ
  • добавлен 24 ноября 2011 г.
Vanderbilt University Press, 1997. - 408 Pages. Refereed and edited papers on the most current developments in the theory and applications of curves and surfaces. During the week of June 27-July 3, 1996, the Third International Conference on Curves and Surfaces was held in Chamonix-Mont-Blanc (France). It was organized by the Association Fran?aise d'Approximation (A. F. A.). The Conference was attended by 275 mathematicians from 26 different...

Quarteroni A., Valli A. Numerical Approximation of Partial Differential Equations

  • формат djvu
  • размер 3.37 МБ
  • добавлен 04 июня 2011 г.
Springer, 2008. - 544 Pages. This is the softcover reprint of the very popular hardcover edition. This book deals with the numerical approximation of partial differential equations. Its scope is to provide a thorough illustration of numerical methods, carry out their stability and convergence analysis, derive error bounds, and discuss the algorithmic aspects relative to their implementation. A sound balancing of theoretical analysis, description...

Szego G. Orthogonal polynomials

  • формат djvu
  • размер 4.39 МБ
  • добавлен 15 октября 2011 г.
American Mathematical Society Providence, Rhode Island, 1939. -440 p. Recent years have seen a great deal of progress in the field of orthogonal polynomials, a subject closely related to many important branches of analysis. Orthogonal polynomials are connected with trigonometric, hypergeometric, Bessel, and elliptic functions, are related to the theory of continued fractions and to important problems of interpolation and mechanical quadrature, an...

Weihrauch K. Computable Analysis: An Introduction

  • формат djvu
  • размер 2.39 МБ
  • добавлен 30 марта 2011 г.
Springer, 2000. - 285 pages. Is the exponential function computable? Are union and intersection of closed subsets of the real plane computable? Are differentiation and integration computable operators? Is zero finding for complex polynomials computable? Is the Mandelbrot set decidable? And in case of computability, what is the computational complexity? Computable analysis supplies exact definitions for these and many other similar questions and...