Premium
Product formulas and numerical algorithms
Author(s) -
Chorin Alexandre J.,
Hughes Thomas J. R.,
McCracken Marjorie F.,
Marsden Jerrold E.
Publication year - 1978
Publication title -
communications on pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 3.12
H-Index - 115
eISSN - 1097-0312
pISSN - 0010-3640
DOI - 10.1002/cpa.3160310205
Subject(s) - citation , product (mathematics) , library science , mathematics , computer science , algorithm , algebra over a field , pure mathematics , geometry
Product formulas constitute one of several bridges between numerical and functional analysis. In numerical analysis, they represent algorithms intended to approximate some evolution equation and, in functional analysis, they are used to prove estimates, existence and representation theorems. Our aim is to survey the setting for product formulas and to discuss some recent results. Needless to say, we do not attempt to accommodate all the complex variations which occur in practical algorithms, nor the sharpest possible theoretical results. Nevertheless, we hope that our middle ground approach and some of the examples will be of interest to both groups. Because of its survey nature, we have not hesitated to include some well-known examples which are important for understanding the ideas. The general idea of product formulas is the following. Suppose one is interested in an initial value problem