@@ -26,14 +26,14 @@ \chapter*{About this version}
2626Both this and the full version are maintained by St\' ephane Ducasse and Serge Stinckwich.
2727Remember that we are all Charlie.
2828
29- \bigskip\noindent
30- --- 28 January 2015
29+ \bigskip
30+ \relboxr {1}{ 28 January 2015}
3131
3232
3333
3434\chapter* {Preface }
3535
36- \vspace {10 ex} \ begin {flushright } {\sl Si je savais une chose
36+ \begin {flushright } {\sl Si je savais une chose
3737utile \` {a} ma nation qui f\^ {u}t ruineuse \` {a} une autre,\\ je ne
3838la proposerais pas \` {a} mon prince,\\ parce que je suis homme
3939avant d'\^ etre Fran\c cais,\\ parce que je suis n\' ecessairement
@@ -45,7 +45,7 @@ \chapter*{Preface}
4545\end {flushright }
4646
4747
48- \vspace {8 ex} When I first encountered object-oriented
48+ When I first encountered object-oriented
4949programming I immediately became highly enthusiastic about it,
5050mainly because of my mathematical inclination. After all I learned
5151to use computers as a high-energy physicist. In mathematics, a
@@ -55,7 +55,7 @@ \chapter*{Preface}
5555premises as the original one. In object-oriented language, this is
5656called reuse and inheritance. Thus, numerical algorithms using
5757mathematical concepts that can be mapped directly into objects.
58- \par
58+
5959This book is intended to be read by object-oriented programmers
6060who need to implement numerical methods in their applications. The
6161algorithms exposed here are mostly fundamental numerical
@@ -64,7 +64,7 @@ \chapter*{Preface}
6464language is feasible and quite easily feasible. We expect readers
6565to be able to implement their own favorite numerical algorithm
6666after seeing the examples discussed in this book.
67- \par
67+
6868The scope of the book is limited. It is not a Bible about
6969numerical algorithms. Such Bible-like books already exist and are
7070quoted throughout the chapters. Instead I wanted to illustrate how
@@ -73,7 +73,7 @@ \chapter*{Preface}
7373in real applications over 12 years of object-oriented programming.
7474Thus, the reader can be certain that the algorithms have been
7575tested in the field.
76- \par
76+
7777Because the intent of the book is showing numerical methods to
7878object-oriented programmers the code presented in commented in
7979depth. Each algorithm is presented with the same organization.
@@ -86,7 +86,6 @@ \chapter*{Preface}
8686are just interested in using the algorithm. Then, the code
8787implementation is discussed and presented.
8888
89-
9089As far as possible each algorithm is presented with such example
9190of use. I did not want to build contrived examples. Instead I have
9291used examples personally encountered in my professional life. Some
@@ -131,7 +130,8 @@ \chapter*{Preface}
131130and who did a terrific job of rendering the early manuscript not
132131only readable but entertaining.
133132
134- \vspace {5 ex}\relboxr {1}{Genolier, 11 April 2000}
133+ \bigskip
134+ \relboxr {1}{Genolier, 11 April 2000}
135135
136136
137137\ifx \wholebook\relax \else \end {document }\fi
0 commit comments