Acta Numerica 1996 (Volume 5) by Arieh Iserles

Posted by

By Arieh Iserles

The 5th quantity of Acta Numerica presents "state of the artwork" research and strategies in numerical arithmetic and clinical computing. This assortment encompasses numerous vital facets of numerical research, together with eigenvalue optimization; idea, algorithms and alertness of point set tools for propagating interfaces; hierarchical bases and the finite point process. it will likely be a worthwhile source for researchers during this vital box.

Show description

Read Online or Download Acta Numerica 1996 (Volume 5) PDF

Similar mathematical analysis books

Understanding the fast Fourier transform: applications

This can be a educational at the FFT set of rules (fast Fourier rework) together with an creation to the DFT (discrete Fourier transform). it truly is written for the non-specialist during this box. It concentrates at the real software program (programs written in easy) in order that readers might be capable of use this know-how once they have comprehensive.

Acta Numerica 1995: Volume 4 (v. 4)

Acta Numerica has verified itself because the top discussion board for the presentation of definitive studies of numerical research issues. Highlights of this year's factor comprise articles on sequential quadratic programming, mesh adaption, unfastened boundary difficulties, and particle equipment in continuum computations.

Extra resources for Acta Numerica 1996 (Volume 5)

Example text

With this definition, it is easy to introduce the notion of the level of a given vertex in the triangulation Tj. All vertices in the original triangulation T\ are called level­1 vertices. The new vertices created in forming Tj from Tj-\ are called level­j vertices. Notice that all vertices in Tj have a level less than or equal to j . Also note that each vertex has a unique level, and this unique level is the same in all triangulations that contain it. Let M j be the space of continuous piecewise linear polynomials associated with Tj.

TTJV­I, which implies that (ITN^N) = 0, that is, TTJV vanishes at all the support points of d\N. 11) holds for all k G No, with f}k > 0, then by a well­known 52 W. GAUTSCHI theorem of Favard (see, for instance, Natanson 1964/65, Volume II, Chapter VIII, Section 6) the system of polynomials {TT^} is orthogonal relative to some positive measure dA having infinitely many support points. 11) is generally quite stable, numerically, and indeed provides an excellent means of computing the orthogonal polynomials TTfc ; dA), both inside and outside the interval of orthogonality.

F. Van Loan (1983), Matrix Computations, Johns Hopkins University Press, Baltimore.  O'Leary (1989), 'Some history of the conjugate gradient and Lanczos algorithms: 1948­1976', SIAM Review 31, 50­102.  Griebel (1994), 'Multilevel algorithms considered as iterative methods on semi­ definite systems', SIAM J. Sci. Comput. 15, 547­565. W. Hackbusch (1985), Multigrid Methods and Applications, Springer, Berlin. J. F. Maitre and F. Musy (1982), 'The contraction number of a class of two level methods; an exact evaluation for some finite element subspaces and model problems', in Multigrid Methods: Proceedings, Cologne 1981, Lecture Notes in Mathematics 960, Springer, Heidelberg, 535­544.

Download PDF sample

Rated 4.46 of 5 – based on 21 votes