Comprehensive Mathematics for Computer Scientists 2: Calculus and ODEs, Splines, Probability, Fourier and Wavelet Theory, Fractals and Neural Networks, Categories and Lambda CalculusSpringer Science & Business Media, 21 oct. 2004 - 355 pages This second volume of a comprehensive tour through mathematical core subjects for computer scientists completes the ?rst volume in two - gards: Part III ?rst adds topology, di?erential, and integral calculus to the t- ics of sets, graphs, algebra, formal logic, machines, and linear geometry, of volume 1. With this spectrum of fundamentals in mathematical e- cation, young professionals should be able to successfully attack more involved subjects, which may be relevant to the computational sciences. In a second regard, the end of part III and part IV add a selection of more advanced topics. In view of the overwhelming variety of mathematical approaches in the computational sciences, any selection, even the most empirical, requires a methodological justi?cation. Our primary criterion has been the search for harmonization and optimization of thematic - versity and logical coherence. This is why we have, for instance, bundled such seemingly distant subjects as recursive constructions, ordinary d- ferential equations, and fractals under the unifying perspective of c- traction theory. |
Avis des internautes - Rédiger un commentaire
Aucun commentaire n'a été trouvé aux emplacements habituels.
Table des matières
XLII | 183 |
XLIII | 185 |
XLIV | 188 |
XLV | 191 |
XLVI | 194 |
XLVII | 200 |
XLVIII | 204 |
XLIX | 209 |
L | 215 |
LI | 217 |
LII | 221 |
LIII | 225 |
LIV | 231 |
LV | 232 |
LVI | 236 |
LVII | 242 |
LVIII | 253 |
LIX | 254 |
LX | 264 |
LXI | 269 |
LXII | 272 |
LXIII | 279 |
LXIV | 283 |
LXV | 290 |
LXVI | 299 |
LXVII | 306 |
LXVIII | 310 |
LXIX | 313 |
LXX | 314 |
LXXI | 316 |
LXXII | 318 |
LXXIII | 320 |
LXXIV | 326 |
LXXV | 328 |
LXXVI | 331 |
LXXVII | 335 |
LXXVIII | 337 |
LXXIX | 341 |
Autres éditions - Tout afficher
Expressions et termes fréquents
affine algorithm approximation arrows basis Bezier curve bijection calculation called Cartesian product Cauchy chain rule chapter closed cube coefficients compact constant construction continuous map contraction control points convergent cos(x defined definition denoted diagram differentiable digraph distribution function elements equation equivalence event Example Exercise fact figure finite fixpoint formula Fourier series Fourier theory fractals function f functors given graph Haar wavelet identity induction input integral curves interval isomorphism lemma limit linear map map f mathematical matrix means method metric space morphism f morphisms n-stream natural number natural transformations neural network neuron notation object one-dimensional open sets output partition perceptron polynomial proposition random variable real vector space recursive sequence sin(x solution sorite spline subset subspace Suppose term theorem theory tion topology unique values vector field vector space vertexes volume wavelet weight yields
Fréquemment cités
Page 42 - The slope of this curve at the point x = xn is equal to the slope of the tangent to the curve at the point x0.
Page 105 - A metric space is a pair (X,d) where X is a set and d...
Page 38 - One magnitude is said to be the limit of another magnitude when the second may approach the first within any given magnitude, however small, though the first magnitude may never exceed the magnitude it approaches.
Page 159 - We say that F is left adjoint to G or that G is right adjoint to F if given any objects AoiC and B of X?
Page 41 - The slope of the line which is tangent to the graph of loga x at the point x = 1, y = 0, is equal to loga e where (7) e = lim (1 + 0...
Page 93 - The tetrahedron in question is defined by the plane passing through the points (a, 0, 0), (0, b, 0), and (0, 0, h).
Page 300 - The range of the sample series is the difference v = of an ordered permuted sequence, ie, the difference between the largest and the smallest value in the sequence x.

