Professional Documents
Culture Documents
Textbook Newton S Method An Updated Approach of Kantorovich S Theory Jose Antonio Ezquerro Fernandez Ebook All Chapter PDF
Textbook Newton S Method An Updated Approach of Kantorovich S Theory Jose Antonio Ezquerro Fernandez Ebook All Chapter PDF
https://textbookfull.com/product/a-student-s-guide-to-newton-s-
laws-of-motion-mahajan/
https://textbookfull.com/product/advancing-developmental-science-
philosophy-theory-and-method-1st-edition-anthony-s-dick/
https://textbookfull.com/product/specific-characteristics-of-our-
people-s-war-jose-maria-sison/
https://textbookfull.com/product/history-an-introduction-to-
theory-method-and-practice-peter-claus/
Mechanics From Newton s Laws to Deterministic Chaos 6th
Edition Florian Scheck (Auth.)
https://textbookfull.com/product/mechanics-from-newton-s-laws-to-
deterministic-chaos-6th-edition-florian-scheck-auth/
https://textbookfull.com/product/seidel-s-guide-to-physical-
examination-an-interprofessional-approach-jane-w-ball/
https://textbookfull.com/product/history-an-introduction-to-
theory-method-and-practice-second-edition-peter-claus/
https://textbookfull.com/product/a-people-s-history-of-
psychoanalysis-from-freud-to-liberation-psychology-1st-edition-
daniel-jose-gaztambide/
https://textbookfull.com/product/integrated-water-resource-
management-an-interdisciplinary-approach-1st-edition-neil-s-
grigg-auth/
Frontiers in Mathematics
Newton’s
Method:
an Updated Approach
of Kantorovich’s
Theory
Frontiers in Mathematics
One of the most common problems in mathematics is the solution of a nonlinear equation
F (x) = 0. This problem is not always easy to solve, since we cannot frequently obtain an
exact solution to the previous equation, so that we usually look for a numerical approximation
to a solution. In this case, we use approximation methods, which are generally iterative. The
best known iteration to solve nonlinear equations is undoubtedly Newton’s method:
vii
viii PREFACE
also proved similar convergence conditions. Although both these authors observed that their
results extend immediately to the case of a general n, they themselves presented them only
for n = 2 and n = 3, respectively. Bussmann (1940), in an unpublished dissertation, proved
these results and some extensions for general n; Bussmann’s theorems are quoted by Rehbock
(1942).
Later, the Russian mathematician L. V. Kantorovich gave his now famous convergence
results for Newton’s method in Banach spaces. In 1948, Kantorovich published the seminal
paper [47], where he suggested an extension of Newton’s method to functional spaces and
established a semilocal convergence result for Newton’s method in a Banach space, which is
now called Kantorovich’s theorem or, more specifically, the Newton-Kantorovich theorem, as
we will call from now on. The result was also included in the survey paper [48]. Further
developments of the method can be found in [49, 50, 51, 52, 53] and in the monographs [54, 55].
The main contribution of Kantorovich is the formulation of the problem in a general
setting, the spaces of Banach, that uses appropriate techniques of functional analysis. This
event cannot be overestimated, since Newton’s method became a powerful tool in numerical
analysis as well as in pure mathematics. The approach of Kantorovich guarantees the appli-
cation of Newton’s method to solve a large variety of functional equations: nonlinear integral
equations, ordinary and partial differential equations, variational problems, etc. Various ex-
amples of such applications are presented in [54, 55]. For a list of relevant publications where
Newton’s method is applied to different functional equations, see [64] and the references cited
there.
The Kantorovich result is a masterpiece not only by its sheer importance but by the
original and powerful proof technique. The results of Kantorovich and his school initi-
ated some very intensive research on the Newton and related methods. A great number
of variants and extensions of his results emerged in the literature. Basic results on Newton’s
method and numerous references may be found in the books of Ostrowski [65] and Ortega and
Rheinboldt [64]. More recent bibliography is available in the books of Rheinboldt [74] and
Deulfhard [18], survey paper [85] and the special web site devoted to Newton’s method [59].
A revision of the most important theoretical results on Newton’s method concerning the
convergence properties, the error estimates, the numerical stability and the computational
complexity of the algorithm may be found in [33].
On the other hand, three types of studies can be done when we are interested in proving
the convergence of the sequence {xn } given by Newton’s method: local, semilocal and global.
First, the local study of the convergence is based on demanding conditions to the solution x∗ ,
from certain conditions on the operator F , and provide the so-called ball of convergence ([16])
of the sequence {xn }, that shows the accessibility to x∗ from the initial approximation x0
belonging to the ball. Second, the semilocal study of the convergence is based on demanding
conditions to the initial approximation x0 , from certain conditions on the operator F , and
provide the so-called domain of parameters ([30]) corresponding to the conditions required
to the initial approximation that guarantee the convergence of the sequence {xn } to the
solution x∗ . Third, the global study of the convergence guarantees, from certain conditions
on the operator F , the convergence of the sequence {xn } to the solution x∗ in a domain and
independently of the initial approximation x0 . The three studies demand conditions on the
operator F . However, requirement of conditions to the solution, to the initial approximation,
or to none of these, determines the different types of studies.
The local study of the convergence has the disadvantage of being able to guarantee that the
PREFACE ix
solution, that is unknown, can satisfy certain conditions. In general, the global study of the
convergence is very specific as regards the type of operators to consider, as a consequence of
absence of conditions on the initial approximation and on the solution. There is a plethora of
studies on the weakness and/or extension of the hypothesis made on the underlying operators.
In this textbook, we focus our attention on the analysis of the semilocal convergence of
Newton’s method.
This textbook is written for researchers interested in the theory of Newton’s method in
Banach spaces. Each chapter contains several theoretical results and interesting applications
in the solution of nonlinear integral and differential equations.
Chapter 1 presents an analysis of Kantorovich’s theory for Newton’s method where the
original theory is given along with the best-known variant, which is due to Ortega and uses
the method of majorizing sequences. In addition, we include a new approach by introducing
a new concept of majorant function which is different from that defined by Kantorovich. In
all the results presented, we suppose that the second derivative of the operator involved is
bounded in norm in the domain where the operator is defined.
In Chapter 2, we analyse the semilocal convergence of Newton’s method under different
modifications of the condition on the second derivative of the operator involved. We begin
by presenting the result of Huang where the second derivative of the operator involved is
Lipschitz continuous in the domain where the operator is defined. We pay attention to the
proof given by Huang and see that the condition on the second derivative can be relaxed to a
center Lipschitz condition to establish the semilocal convergence of Newton’s method. This
observation leads us to propose milder conditions on the second derivative of the operator
involved. So, we first prove the semilocal convergence of Newton’s method under a center
ω-Lipschitz condition for the second derivative of the operator involved. Next, the condition
of the second derivative of the operator required by Kantorovich is generalized to a condition
where the second derivative is ω-bounded in the domain where the operator is defined. This
generalization is very interesting because it avoids having to look for a domain where the
second derivative of the operator is bounded and contains a solution of the equation to solve,
which is an important problem that presents Kantorovich’s theory.
The ideas developed in Chapter 2 are extended to higher order derivatives of the operator
involved in Chapter 3, where new starting points for Newton’s method are located despite
the new conditions imposed to the operator. Three sections are included where the semilocal
convergence of Newton’s method is analysed for polynomial operators, operators with ω-
bounded k-th-derivative and operators with ω-Lipschitz k-th-derivative.
Chapter 4 examines the typical situation in which conditions on the first derivative of the
operator are only required, instead of conditions on higher order derivatives, as a consequence
of the fact that this is the only derivative of the operator involved appearing in the algorithm
of the method. We analyse in detail Ortega’s variant of the original Kantorovich’s result from
the method of majorizing sequences and pay special attention to the fact that, if we want to
relax the conditions imposed to the first derivative of the operator, we need to apply another
distinct technique to that of the method of majorizing sequences presented in Chapter 1
to guarantee the semilocal convergence of Newton’s method. In particular, we propose a
system of recurrence relations. Techniques based on recurrence relations were already used
by Kantorovich in his first proofs of the semilocal convergence of Newton’s method. We
then analyse two cases: the cases in which the first derivative of the operator involved is
ω-Lipschitz continuous and center ω-Lipschitz continuous in the domain where the operator
x PREFACE
involved is defined.
We have included a numerical example in each situation analysed theoretically to so
justify its analysis. In particular, in Chapter 1, we present two types of problems that
are used throughout the following chapters: nonlinear integral equations of Hammerstein
type and nonlinear boundary value problems. We analyse these problems some times on a
continuous form and others in a discrete way.
We emphasize the fact that we have tried to facilitate the reading of the textbook from a
detailed development of the proofs of the results given. We also want to point out that the
textbook presents some of our investigations into Newton’s method which we have carried
out over many years, including an abundant and specialized bibliography.
We ended up saying that the main aim of this textbook is to develop, expand and update
the theory introduced by Kantorovich for Newton’s method under different conditions on
the operator involved, but always with the clear objective to improve the applicability of the
method based on the location of new starting points.
Preface vii
xi
xii CONTENTS
Bibliography 161
Chapter 1
According to Polyak [66], Kantorovich proved in 1939 the semilocal convergence of Newton’s
method [46] on the basis of the contraction mapping principle of Banach, and later improved
to semilocal quadratic convergence in 1948/49 (the Newton-Kantorovich theorem) [47, 49].
Also in 1949, Mysovskikh [61] gave a much simpler independent proof of semilocal quadratic
convergence under slightly different theoretical assumptions, which are exploited in modern
Newton algorithms, see [18].
Kantorovich gave two basically different proofs of the Newton-Kantorovich theorem using
recurrence relations or majorant functions. The original proof given by Kantorovich uses
recurrence relations [47]. A nice treatment of this theorem using recurrence relations can be
found in [72]. In [50] Kantorovich gave a proof based on the concept of a majorant function.
An important feature of the Newton-Kantorovich theorem, or related results, is that it
does not assume the existence of a solution, so that the theorem is not only a convergence re-
sult for Newton’s method, but simultaneously a theorem of existence of solution for nonlinear
equations in Banach spaces. In addition, the theoretical significance of Newton’s method can
be used to draw conclusions about the existence and uniqueness of a solution and about the
region in which it is located, without finding the solution itself and this is sometimes more
important than the actual knowledge of the solution (see [55]). The results of this section
follows Kantorovich’s paper [53].
After Kantorovich establishes the Newton-Kantorovich theorem, a large number of results
has been published concerning convergence and error bounds for Newton’s method under the
assumptions of the Newton-Kantorovich theorem or under closely related ones. Among later
convergence theorems, the ones due to Ortega and Rheinboldt [64] are worth mentioning.
Also, there exist numerous versions of the Newton-Kantorovich theorem that differ in as-
sumptions and results, and it would be impossible to list all relevant publications here. We
then only mention some versions that may find in [11, 54, 55, 58, 62, 65].
Throughout the textbook we denote B(x, ) = {y ∈ X; y − x ≤ } and B(x, ) = {y ∈
X; y − x < }.
for the solution of the nonlinear equation F (x) = 0, where F : X −→ Y , X and Y are
Banach spaces and F is twice continuously Fréchet differentiable. Below, we present some
results given by Kantorovich on the convergence of Newton’s method.
≤ M β0 x1 − x0
≤ M β 0 η0
= h0
< 1,
it follows, by the Banach lemma on invertible operators [72], that the operator Γ1 = [F (x1 )]−1
exists and
β0
Γ1 ≤ = β1 .
1 − h0
Hence, x2 is well-defined.
1.1. THE NEWTON-KANTOROVICH THEOREM 3
In addition, as
x1
F (x1 ) = F (x0 ) + F (x0 )(x1 − x0 ) + F (z)(x1 − z) dz
x0
x1
= F (z)(x1 − z) dz
x0
1
= F (x0 + τ (x1 − x0 ))(x1 − x0 )2 (1 − τ ) dτ,
0
we have
1
F (x1 ) ≤ F (x0 + τ (x1 − x0 )) (1 − τ ) dτ x1 − x0 2
0
M
≤ x1 − x0 2
2
M 2
≤ η
2 0
and
β0 M 2 h0 η0
x2 − x1 = Γ1 F (x1 ) ≤ Γ1 F (x1 ) ≤ η = = η1 ≤ h0 η0 .
1 − h0 2 0 2(1 − h0 )
Moreover,
h20 1
h1 = M β1 η1 = ≤ 2h20 ≤ .
2(1 − h0 )2 2
Therefore, the hypotheses of the Newton-Kantorovich theorem are also satisfied when
we substitute β1 , η1 and h1 for β0 , η0 and h0 , respectively. This allows us to continue the
successive determination of the elements xn and the numbers connected with them, βn , ηn
and hn , so that if we assume
βn−1
Γn ≤ βn = , (1.3)
1 − hn−1
M 2 hn−1 ηn−1 1
= ηn ≤ hn−1 ηn−1 ≤ n (2h0 )2 −1 η0 ,
n
xn+1 − xn ≤ βn ηn−1 = (1.4)
2 2(1 − hn−1 ) 2
h2n−1 1
hn = M βn ηn = ≤ 2h2n−1 ≤ , (1.5)
2(1 − hn−1 )2 2
where the operator Γn = [F (xn )]−1 exists, it follows the following.
As
I − Γn F (xn+1 ) ≤ Γn F (xn ) − F (xn+1 )
1
≤ βn F (xn + τ (xn+1 − xn )) dτ (xn+1 − xn )
0
≤ M βn xn+1 − xn
≤ M β n ηn
= hn
< 1,
4 CHAPTER 1. THE CLASSIC THEORY OF KANTOROVICH
we have, by the Banach lemma on invertible operators, that the operator Γn+1 exists and
βn
Γn+1 ≤ = βn+1 .
1 − hn
Hence, xn+2 is well-defined.
Besides, as
xn+1
F (xn+1 ) = F (xn ) + F (xn )(xn+1 − xn ) + F (z)(xn+1 − z) dz
xn
xn+1
= F (z)(xn+1 − z) dz
xn
1
= F (xn + τ (xn+1 − xn ))(xn+1 − xn )2 (1 − τ ) dτ
0
we have
1
F (xn+1 ) ≤ F (xn + τ (xn+1 − xn )) (1 − τ ) dτ xn+1 − xn 2
0
M
≤ xn+1 − xn 2
2
M 2
≤ η
2 n
and
M hn ηn
xn+2 − xn+1 = Γn+1 F (xn+1 ) ≤ Γn+1 F (xn+1 ) ≤ βn+1 ηn2 = = ηn+1 .
2 2(1 − hn )
Moreover, since hn ≤ 12 , we also have
1
(2h0 )2 −1 η0
n+1
ηn+1 ≤ hn ηn ≤ · · · ≤ hn hn−1 · · · h0 η0 ≤
2n+1
and
h2n 1 1
≤ 2h2n ≤ · · · ≤ (2h0 )2
n+1
hn+1 = M βn+1 ηn+1 = ≤ .
2(1 − hn )2 2 2
As a consequence, (1.3), (1.4) and (1.5) are true for all positive integers n by mathematical
induction.
On the other hand, if we note the identity
ηn ϕ(hn ) − ηn+1 ϕ(hn+1 ) = ηn ,
√
1− 1−2t
where ϕ(t) = t
,which is verificable directly, since
√ √
1 − 1 − 2hn+1 1 − hn − 1 − 2hn
ηn+1 ϕ(hn+1 ) = ηn+1 = ηn = ηn ϕ(hn ) − ηn ,
hn+1 hn
it follows, by (1.5), for m ≥ 1 and n ≥ 1, that
xn+m − xn ≤ xn+m − xn+m−1 + xn+m−1 − xn+m−2 + · · · + xn+1 − xn
≤ ηn+m−1 + ηn+m−2 + · · · + ηn
= ηn ϕ(hn ) − ηn+m ϕ(hn+m )
≤ ηn ϕ(hn ) (1.6)
≤ 2ηn
1
≤ n−1 (2h0 )2 −1 η0 ,
n
(1.7)
2
1.1. THE NEWTON-KANTOROVICH THEOREM 5
so that {xn } is a Cauchy sequence and then convergent. In addition, passing to the limit in
(1.7) as m → +∞, we obtain (1.2).
If we now do n = 0 in (1.6), then
xm − x0 ≤ η0 ϕ(h0 ) = ρ∗ ,
θ2 ηn+1 ψ(hn+1 ).
n+1
y ∗ − xn+1 = y ∗ − xn + Γn F (xn )
= −Γn (F (y ∗ ) − F (xn ) − F (xn )(y ∗ − xn ))
y∗
= −Γn F (z)(y ∗ − z) dz
xn
1
= −Γn F (xn + τ (y ∗ − xn ))(y ∗ − xn )2 (1 − τ ) dτ (1.8)
0
and
M
y ∗ − xn+1 ≤ Γn y ∗ − xn 2
2
M 2n 2
≤ βn θ ηn ψ(hn )
2
= θ2 ηn+1 ψ(hn+1 ).
n+1
Then, by mathematical induction, we have proved that y ∗ − xj ≤ θ2 ηj ψ(hj ) are true for
j
M βn M β0
6 CHAPTER 1. THE CLASSIC THEORY OF KANTOROVICH
M M η0
y ∗ − xn+1 ≤ Γn y ∗ − xn 2 ≤ βn (2ηn )2 = 2hn ηn ≤ ηn ≤ n .
2 2 2
Then, by mathematical induction on j, we conclude that y ∗ − xj ≤ 2j−1
η0
are true for all
positive integers j. As a consequence, y − xn → 0 as n → +∞ and therefore y ∗ = x∗ .
∗
Note that condition (W4) of the Newton-Kantorovich theorem, which is often called the
Kantorovich condition, is critical, since it means that, at the initial approximation x0 , the
value F (x0 ) should be small enough, that is, x0 should be close to a solution.
According to Galantai [33], if conditions (W1)-(W2)-(W3)-(W4) of the Newton-Kantorovich
theorem are satisfied, then not only the Newton sequence {xn } exists and converges to a so-
lution x∗ but [F (x∗ )]−1 exists in this case. Rall proves in [71] that the existence of [F (x∗ )]−1
conversely guarantees that the hypotheses of the Newton-Kantorovich theorem with h < 12
are satisfied at each point of an open ball with center x∗ .
Notice that the Newton iterates xn are invariant under any affine transformation F −→
G = AF , where A denotes any bounded and bijective linear mapping from Y to any Banach
space Z [33]. This property is easily verified, since [G (x)]−1 G(x) = [F (x)]−1 A−1 AF (x) =
[F (x)]−1 F (x). The affine invariance property is clearly reflected in the Newton-Kantorovich
theorem. For other affine invariant theorems, we may see Deuflhard and Heindl [17].
Remark 1.2. The speed of convergence of an iterative method is usually measured by the
order of convergence of the method. The first definition of order of convergence was given
in 1870 by Schröder [76], but a very commonly measure of speed of convergence in Banach
spaces is the R-order of convergence [69], which is defined as follows:
Let {xn } a sequence of points of a Banach space X converging to a point x∗ ∈ X
and let σ ≥ 1 and
n if σ = 1,
en (σ) = n ≥ 0.
σ n if σ > 1,
(a) We say that σ is an R-order of convergence of the sequence {xn } if there are
two constants b ∈ (0, 1) and B ∈ (0, +∞) such that
(b) We say that σ is the exact R-order of convergence of the sequence {xn } if
there are four constants a, b ∈ (0, 1) and A, B ∈ (0, +∞) such that
In general, check double inequalities of (b) is complicated, so that normally only seek upper
inequalities as (a). Therefore, if we find an R-order of convergence σ of sequence {xn }, we
then say that sequence {xn } has order of convergence at least σ. So, according to this,
estimates (1.2) guarantee that Newton’s method has R-order of convergence ([69]) at least
two if h < 12 and at least one if h = 12 .
1.1. THE NEWTON-KANTOROVICH THEOREM 7
so that the sequence {xn } is convergent if the scalar sequence {tn } is. Also, Kantorovich
observes that Newton’s method for equation F (x) = 0 coincides with the method of successive
approximations applied to the equation x = S(x) = x − [F (x)]−1 F (x), which obviously is
equivalent to F (x) = 0.
This ingenious procedure devised by Kantorovich to prove the convergence of a sequence
in a Banach space from that of a scalar sequence has the disadvantage that the conditions
required to the scalar function majorizes the operator of the Banach space are restrictive and,
in the case of considering other iterative methods, these conditions are difficult to satisfy,
basically condition (1.12). Even if we want to apply this technique of Kantorovich directly to
the operator S(x) = x − [F (x)]−1 F (x), quite a few difficulties already appear (see [38]). For
this, in this textbook, we present Kantorovich’s theory to study the semilocal convergence
of Newton’s method under different conditions from another point of view. In particular,
we base our development on a concept that is fundamental in Kantorovich’s theory, which
is the fact that a scalar sequence {tn } verifies (1.13). Now, in the following, we develop the
majorant principle of Kantorovich.
Theorem 1.3. Suppose the operator S has a continuous first Fréchet derivative in a closed
ball B(x0 , r) and the scalar function g is derivable in the interval [t0 , t ] with t − t0 = r. If
equation (1.10) majorizes equation (1.9) and equation (1.10) has a solution in [t0 , t ], then
8 CHAPTER 1. THE CLASSIC THEORY OF KANTOROVICH
(1.9) has a solution x∗ and the sequence {xn }, given by the method of successive approxima-
tions xn+1 = S(xn ), n ≥ 0, starting at x0 , converges to x∗ . Moreover, x∗ − x0 ≤ t∗ − t0 ,
where t∗ is the samllest positive solution of (1.10) in [t0 , t ].
Proof . Note that S is defined in all the points of B(x0 , r), since B(x0 , r) ⊂ B(x0 , R). If
t∗ is the samllest positive solution of equation (1.10) in [t0 , t ], then t0 ≤ t∗ . In addition, if
we suppose ti ≤ t∗ , with i = 0, 1, . . . , n, then tn+1 = g(tn ) ≤ g(t∗ ) = t∗ , since the function
g is nondecreasing (as we see from condition (1.12)). As a consequence, by mathematical
induction on n, it follows easily that tn ≤ t∗ , for all n ≥ 0.
Next, from condition (1.11), we have 0 ≤ g(t0 ) − t0 = t1 − t0 , so that t1 ≥ t0 . In addition,
from a mathematical induction on n, it follows that tn ≤ tn+1 , n ≥ 0, since the function g is
nondecreasing.
Therefore, there exists v = limn tn such that v ≤ t∗ . Besides, as g is a continuous function,
it follows
v = lim tn+1 = lim g(tn ) = g lim tn = g(v),
n→+∞ n→+∞ n→+∞
∗
and then v = t is solution of equation (1.10). As a consequence, the sequence {tn } converges
to the smallest positive solution t∗ of (1.10).
After that, we see that the sequence {xn } is well defined; namely, xn ∈ B(x0 , r) for n ∈ N.
From condition (1.11), we obtain
x1 − x0 = S(x0 ) − x0 ≤ g(t0 ) − t0 = t1 − t0 ≤ t − t0 = r,
so that x1 ∈ B(x0 , r).
Assume that it has already been proved that x1 , x2 , . . . , xn ∈ B(x0 , r) and
xi+1 − xi ≤ ti+1 − ti , for i = 0, 1, . . . , n − 1, (1.14)
and prove by induction that xn+1 ∈ B(x0 , r) and (1.14) are true for all i ≥ 0. Indeed, from
xn 1
xn+1 − xn = S(xn ) − S(xn−1 ) = S (z) dz = S (xn−1 + τ (xn − xn−1 )) (xn − xn−1 ) dτ,
xn−1 0
= g(tn ) − g(tn−1 )
= tn+1 − tn ,
1.1. THE NEWTON-KANTOROVICH THEOREM 9
so that
and, since {tn } is convergent, it is a Cauchy sequence. In addition, {xn } is a Cauchy sequence
in the Banach space X and, as a consequence, there exists x∗ = limn xn . Taking then into
account that S is a continuous operator, we obtain
x∗ = lim xn+1 = lim S(xn ) = S lim xn = S(x∗ ),
n→+∞ n→+∞ n→+∞
∗
so that x is a solution of equation (1.9).
Finally, by setting n = 0 in (1.15), we have xm − x0 ≤ tm − t0 , for m ∈ N, and, by
letting m → +∞, it follows x∗ − x0 ≤ t∗ − t0 .
Remark 1.4. Observe in the proof of Theorem 1.3 that we have also proved that the scalar
sequence {tn }, starting at t0 , is nondecreasing and converges to t∗ if the function g majorizes
the operator S.
Remark 1.5. By letting m → +∞ in (1.15), we have x∗ − xn ≤ t∗ − tn , for n ≥ 0, so that
we obtain a priori error bounds for Newton’s sequence {xn } in the Banach space X from the
scalar sequence {tn }.
Remark 1.6. Observe that we have not made full use of condition (1.12) in the proof of
Theorem 1.3. The proof requires only that S (x) ≤ g (t) for corresponding points of the
intervals [xn−1 , xn ] and [tn−1 , tn ], for n ∈ N.
Equation (1.9) may have other solutions different from x∗ in the closed ball B(x0 , r), even
if t is the unique solution of equation (1.10) in the interval [t0 , t ]. However, we can establish
∗
As a consequence,
Thus,
xn+1 − x0 ≤ xn+1 − xn+1 + xn+1 − x0 ≤ tn+1 − t0 ≤ r
and so xn+1 ∈ B(x0 , r). Then, by mathematical induction on n, we conclude that xj ∈
B(x0 , r) and (1.17) is true for j ≥ 0.
1.1. THE NEWTON-KANTOROVICH THEOREM 11
On the other hand, we have that the sequence {tn } is nondecreasing and convergent to t∗ ,
the sequence {tn } is nonincreasing and convergent to t∗ and the sequence {xn } is convergent
to x∗ . Then, from xn −xn ≤ tn −tn , we obtain limn xn = limn xn = x∗ , so that the sequence
xn+1 = S(xn ), n ≥ 0, converges to x∗ whatever the initial approximation x0 ∈ B(x0 , r) is
used.
The uniqueness of solution of equation (1.9) is immediate from the last fact, since if y ∗
is other solution of equation (1.9) different from x∗ and choose x0 = y ∗ , we obviously have
xn = y ∗ , for n ≥ 0, so that {xn } is constant. Then, as limn xn = x∗ , it follows x∗ = y ∗ and
the proof is complete.
Remark 1.8. In Theorem 1.7, it has been proved that B(x0 , r) is a ball of convergence for
the sequence defined from the operator S, since the corresponding method of successive
approximations is convergent starting at any point of B(x0 , r).
In addition, Kantorovich first considers an operator F defined on the ball B(x0 , R) and a
scalar function f on the interval [t0 , t ], supposes that there exists the operator Γ0 = [F (x0 )]−1
with Γ0 ≤ − f (t1 0 ) , takes into account S(x) = x − Γ0 F (x) and g(t) = t − ff (t(t)0 ) , and proves
that the sequence xn+1 = xn − Γ0 F (xn ), n ≥ 0, generated by the modified Newton method, is
convergent from the convergence of the scalar sequence tn+1 = tn − ff(t(tn0)) , n ≥ 0, if the function
g majorizes the operator S. Next, through an inductive process, Kantorovich extends this
study to the convergence of Newton’s method.
After that, we start studying the semilocal convergence of Newton’s method to approx-
imate a solution of the operator equation F (x) = 0, where F : B(x0 , R) ⊆ X −→ Y is a
twice continuously Fréchet differentiable operator defined on the ball B(x0 , R). For this, we
consider f : [t0 , t ] −→ R, with t = t0 + r and such that f is twice differentiable on [t0 , t ],
and a closed ball B(x0 , r) with r < R, choose
f (t)
S(x) = x − [F (x)]−1 F (x) and g(t) = t − ,
f (t)
and see the modified Newton methods as the methods of successive approximations applied
to the operators
f (t)
S(x) = x − [F (x0 )]−1 F (x) and g(t) = t − .
f (t0 )
First, we obtain a semilocal convergence result for the modified Newton method in the
Banach space X. Note that condition (1.12) is easier to prove for the operator S and the
function g than for S and g. Second, we extend the result obtained for the modified Newton
method to Newton’s method.
Theorem 1.9. Let F : B(x0 , R) ⊆ X −→ Y be a twice continuously Fréchet differentiable
operator defined on the ball B(x0 , R) of a Banach space X with values in a Banach space
Y . Suppose that there exists f ∈ C 2 ([t0 , t ]) with t − t0 = r < R and such that the following
conditions are satisfied:
1 f (t0 )
(a) There exists Γ0 = [F (x0 )]−1 ∈ L(Y, X), Γ0 ≤ − and Γ0 F (x0 ) ≤ − .
f (t0 ) f (t0 )
(b) F (x) ≤ f (t) for x − x0 ≤ t − t0 , x ∈ B(x0 , R) and t ∈ [t0 , t ].
12 CHAPTER 1. THE CLASSIC THEORY OF KANTOROVICH
If the equation f (t) = 0 has only one solution t∗ in [t0 , t ], then the methods of successive
approximations given by xn+1 = S(xn ), n ≥ 0, and tn+1 = g(tn ), n ≥ 0, starting respectively
at x0 = x0 and t0 = t0 , converge respectively to x∗ and t∗ , where x∗ is a solution of the
equation F (x) = 0, and such that x∗ − x0 ≤ t∗ − t0 .
Proof . We start proving that the function g majorizes the operator S. On the one hand,
from condition (a), it follows S(x0 ) − x0 ≤ g(t0 ) − t0 . On the other hand, from
it follows x x
S (x) = S (x) − S (x0 ) = S (z) dz = − Γ0 F (z) dz,
x0 x0
and
x 1
S (x) = − Γ0 F (z) dz = − Γ0 F (x0 + τ (x − x0 )) dτ (x − x0 ) .
x0 0
Then, as
x0 + τ (x − x0 ) − x0 ≤ τ x − x0 ≤ τ (t − t0 ) = t0 + τ (t − t0 ) − t0 ,
Therefore, the function g majorizes the operator S and the proof is completed by using
Theorem 1.3.
x∗ − xn ≤ t∗ − tn , n ≥ 0, (1.18)
taking into account x0 = x0 and t0 = t0 as starting points for xn+1 = S(xn ), n ≥ 0, and
tn+1 = g(tn ), n ≥ 0, respectively.
Now, from Theorem 1.7, we establish the following result of uniqueness of solution for the
modified Newton method.
1.1. THE NEWTON-KANTOROVICH THEOREM 13
Theorem 1.11. Under the hypotheses of Theorem 1.9 and condition f (t ) ≤ 0, if the equation
f (t) = 0 has only one solution in [t0 , t ], then the equation F (x) = 0 has only one solution in
the closed ball B(x0 , r).
Proof . If f (t ) ≤ 0, we have
f (t )
g(t ) = t − ≤ t ,
f (t0 )
so that the additional condition of Theorem 1.7 is satisfied. Then, from Theorem 1.7, it
follows the uniqueness of solution.
Remark 1.12. Since t∗ is the smallest positive solution of the equation f (t) = 0, we can apply
Theorem 1.11 when t = t∗ . Therefore, the uniqueness of solution x∗ is always guaranteed in
the closed ball B(x0 , t∗ − t0 ), which is also the domain of existence of solution.
The semilocal convergence of Newton’s method can be then established from the semilocal
convergence of the modified Newton method established in Theorem 1.9.
Theorem 1.13. Under the hypotheses of Theorem 1.9, Newton’s method, starting at x0 ∈
B(x0 , R), converges to a solution x∗ of the equation F (x) = 0.
Proof . We consider
f (tn )
tn+1 = Nf (tn ) = tn − , n ≥ 0, with t0 given,
f (tn )
and Newton’s sequence {xn } given in (1.1).
As the first step of Newton’s method and the modified Newton method is the same, then
x1 is well defined and x1 ∈ B(x0 , r).
We now verify that the conditions of Theorem 1.9 are not violated when x0 is replaced
by x1 and t0 by t1 .
Taking into account
I − Γ0 F (x1 ) = −Γ0 (F (x1 ) − F (x0 ))
x1
=− Γ0 F (z) dz
x0
1
=− Γ0 F (x0 + τ (x1 − x0 )) dτ (x1 − x0 ),
0
and
x0 + τ (x1 − x0 ) − x0 ≤ τ x1 − x0 ≤ τ (t1 − t0 ) = t0 + τ (t1 − t0 ) − t0 ,
it follows, from condition (b) of Theorem 1.9, that
1
I − Γ0 F (x1 ) ≤ Γ0 F (x0 + τ (x1 − x0 )) dtx1 − x0
0
1
1
≤−
f (t0 + τ (t1 − t0 )) dτ (t1 − t0 )
f (t0 ) 0
1 t1
=− f (ξ) dξ
f (t0 ) t0
1
=− (f (t1 ) − f (t0 ))
f (t0 )
f (t1 )
=1− .
f (t0 )
14 CHAPTER 1. THE CLASSIC THEORY OF KANTOROVICH
From conditions (a) and (b) of Theorem 1.9, we have f (t) ≥ 0 in [t0 , t ] and f (t0 ) ≥ 0.
Besides, the function f cannot have a minimum to the left of the solution t∗ , since t∗ is the
lowest positive zero of f , so that f (t) < 0 in [t0 , t∗ ]. Now, by the Mean-Value Theorem,
there exists θ ∈ (t0 , t∗ ) such that
f (θ)f (θ)
t1 − t∗ = Nf (t0 ) − Nf (t∗ ) = Nf (θ)(t0 − t∗ ) = (t0 − t∗ )
f (θ)2
and then t1 ≤ t∗ . Therefore, t1 ∈ [t0 , t∗ ] and 1 − ff (t1)
(t0 )
< 1.
By the Banach lemma on invertible operators, the operator [F (x1 )]−1 exists and
−1 Γ0 − f (t1 0 ) 1
Γ1 = [F (x1 )] ≤
f (t1 )
≤ f (t1 )
=− .
1− 1− f (t0 )
f (t1 )
f (t0 )
Moreover, as
x1
F (x1 ) = F (x0 ) + F (x0 )(x1 − x0 ) + F (z)(x1 − z) dz
x0
1
= F (x0 + τ (x1 − x0 )) (x1 − x0 )2 (1 − τ ) dz,
0
and, as a consequence,
f (t1 )
Γ1 F (x1 ) ≤ Γ1 F (x1 ) ≤ − .
f (t1 )
Moreover, if x − x1 ≤ t − t1 , then
x − x0 ≤ x − x1 + x1 − x0 ≤ t − t1 + t1 − t0 = t − t0 ,
and
F (x) ≤ f (t) for x − x1 ≤ t − t1 .
Furthermore, since t1 ≤ t∗ , it is clear that f (t) = 0 has a solution in [t1 , t ] and, from
f (t0 )
t1 − t0 = − ≥ 0,
f (t0 )
1.1. THE NEWTON-KANTOROVICH THEOREM 15
it follows t0 ≤ t1 ≤ t∗ .
Therefore, the hypotheses of Theorem 1.9 are also satisfied when we substitute x1 and
t1 for x0 and t0 , respectively. This allows us to continue the successive determination of the
elements xn and tn , so that xn ∈ B(x0 , r) and
f (tn )
xn+1 − xn = Γn F (xn ) ≤ Γn F (xn ) ≤ − = tn+1 − tn , (1.19)
f (tn )
for all n ≥ 0.
On the other hand, as tn ≤ tn+1 and tn ≤ t∗ , for all n ≥ 0, there exists v = limn tn ≤ t∗ .
Besides, as v = limn tn = limn Nf (tn−1 ) = Nf (v), then f (v) = 0 and, therefore, v = t∗ . In
addition, from (1.19), it also follows that there exists x∗ = limn xn .
Now, from the algorithm of Newton’s method (1.1), we have
since
Then, taking limits in (1.20) and bearing in mind that F is continuous, we obtain F (x∗ ) = 0,
so that x∗ is a solution of F (x) = 0.
Remark 1.14. Note that we also have the following estimates x∗ − xn ≤ t∗ − tn , n ≥ 0.
This is a consequence of (1.18), since xn and tn can be seen as first approximations in the
modified Newton method with initial approximations xn−1 and tn−1 , respectively.
Next, from Theorem 1.9, we establish the following result of uniqueness of solution for
Newton’s method.
Theorem 1.15. Under the hypotheses of Theorem 1.9, the equation F (x) = 0 has only one
solution in the closed ball B(x0 , t∗ − t0 ), where t∗ is the unique solution of f (t) = 0 in [t0 , t ].
Note that the semilocal convergence results given by Theorems 1.9 and 1.13 are often
difficult to make direct use, since they contain the undefined function f . To know what the
function f is, some conditions on the operator F are required. For this, the following result
acquires importance.
16 CHAPTER 1. THE CLASSIC THEORY OF KANTOROVICH
Proof . To apply Theorem 1.13, we need to know the scalar function f : [t0 , t ] −→ R. As
quadratic polynomials are the most basic functions that satisfy condition (W3), we can find f
by solving a problem of interpolation fitting from fixing the three coefficients of the quadratic
polynomial by conditions (W1)-(W2)-(W3). So, we do
1 f (t0 )
f (t) = M, − = β, − =η
f (t0 ) f (t0 )
and obtain
M t − t0 η
f (t) = (t − t0 )2 − + . (1.21)
2 β β
√ √
As the two zeros of the last polynomial√are t0 + 1± h1−2h η, if r ≥ t0 + 1− h1−2h η = t∗ , then
t = r + t0 ≥ s∗ + t0 = t∗ , where s∗ = 1− h1−2h η. Therefore, (1.21) satisfies all the conditions
of Theorem 1.13 and the thesis of the theorem is proved.
In addition, we can also establish the following result on the uniqueness of solution.
Theorem 1.17. Under the hypotheses of Theorem 1.16, the√ equation F (x) = 0 has only one
solution in the closed ball B(x0 , t∗ − t0 ), where t∗ = t0 + 1− h1−2h η.
Proof . As t∗ is the unique zero of quadratic polynomial (1.21) in [t0 , t∗ ], then the thesis of
the theorem follows from Theorem 1.15.
As we have just seen, Kantorovich also gives a result of uniqueness of solution, which is
obtained from Theorem 1.11 for the modified Newton method with the condition f (t ) = 0,
that is: t = t∗ .
Remark 1.18. (Property of translation of Kantorovich’s polynomial.) Notice that we have
considered any t0 ≥ 0 in the above-mentioned, but Kantorovich considers t0 = 0, so that the
quadratic polynomial f given in (1.21) is reduced to p(t) = M2 t2 − βt + βη , which is usually
known as Kantorovich’s polynomial. This is a consequence of the fact that p(t) = f (t + t0 ).
In addition, the sequence {tn+1 = Nf (tn )}n≥0 , for any t0 > 0, satisfies tn+1 = Nf (tn ) =
t0 + Np (sn ), n ≥ 0, where sn+1 = Np (sn ) with s0 = 0, since we have, for t0 ≥ 0 and s0 = 0,
for all n ≥ 0. Therefore, the real sequences {tn } and {sn } given by Newton’s method when
they are constructed from f and p, respectively, can be obtained, one from the other, by
translation. Besides, tn+1 − tn = sn+1 − sn , for all n ≥ 0, and all the results obtained
previously are independent of the value t0 ≥ 0, so that we choose t0 = 0 because, in practice,
it is the most favorable situation.
1.1. THE NEWTON-KANTOROVICH THEOREM 17
Majorizing sequence
From the study of the semilocal convergence of Newton’s method performed by Kantorovich
through the majorant principle, turns clearly out the difficulty of its application to other
iterative methods as a result of the concept of majorant function of an operator. However,
there is one fact that is distinguised from Kantorovich’s theory: estimates
x∗ − xn ≤ t∗ − tn , n ≥ 0,
given in Remark 1.5. From this fact and the concept of majorizing sequence, which is defined
below, we can prove the semilocal convergence of Newton’s method more easily. This con-
cept also serves to introduce a modification of the majorant principle of Kantorovich, whose
application is easier and allows modifying the classic conditions of Kantorovich. So, we in-
troduce the concept of majorizing sequence and show how it is used to prove the convergence
of sequences in Banach spaces.
Definition 1.19. If {xn } is a sequence in a Banach space X and {tn } is a real sequence,
then {tn } is a majorizing sequence of {xn } if xn+1 − xn ≤ tn+1 − tn , for all n ≥ 0.
From the last inequality, we observe that the sequence {tn } is nondecreasing. The interest
of the majorizing sequence is that the convergence of the sequence {xn } in the Banach space
X is deduced from the convergence of the scalar sequence {tn }, as we see in the following
result [63].
Theorem 1.20. Let {xn } be a sequence in a Banach space X and {tn } a majorizing sequence
of {xn }. Then, if {tn } converges to t∗ ∈ R, there exists a x∗ ∈ X such that x∗ = limn xn and
x∗ − xn ≤ t∗ − tn , for n = 0, 1, 2, . . .
Another random document with
no related content on Scribd:
Jesus Christ, along with Moses and Ezra. Thus there was not full
proof against the accused on the principal point of the statute
charged upon—namely, the cursing of God or any other person of the
blessed Trinity. The jury nevertheless unanimously found it proven
‘that the panel, Thomas Aikenhead, has railed against the first
person, and also cursed and railed our blessed Lord, the second
person, of the holy Trinity.’ They further found ‘the other crimes
libelled proven—namely, the denying the incarnation of our Saviour,
the holy Trinity, and scoffing at the Holy Scriptures.’ Wherefore the
judges ‘decern and adjudge the said Thomas Aikenhead to be taken
to the Gallowlee, betwixt Leith and Edinburgh, upon Friday the
eighth day of January next to come, and there to be hanged on a
gibbet till he be dead, and his body to be interred at the foot of the
gallows.’
It struck some men in the Privy Council that it was hard to take the
life of a lad of eighteen, otherwise irreproachable, for a purely
metaphysical offence, regarding which he had already expressed an
apparently sincere penitence; and this feeling was probably
increased when a petition was received from Aikenhead, not asking
for life, which he had ceased to hope for, but simply entreating for
delay of a sentence which he acknowledged to be just, on the ground
that it had ‘pleased Almighty God to begin so far in His mercy to
work upon your petitioner’s obdured heart, as to give him some
sense and conviction of his former wicked errors ... and he doth
expect ... if time were allowed ... through the merits of Jesus, by a
true remorse and repentance, to be yet reconciled to his offended
God and Saviour.’ I desire, he said, this delay, that ‘I may have the
opportunity of conversing with godly ministers in the place, and by
their assistance be more prepared for an eternal rest.’
Lord Anstruther and Lord Fountainhall, two members of the
Council, were led by humane feeling to visit the culprit in prison. ‘I
found a work on his spirit,’ says the former gentleman, ‘and wept
that ever he should have maintained such tenets.’ He adds that he
desired for Aikenhead a short reprieve, as his eternal state depended
on it. ‘I plead [pleaded] for him in Council, and brought it to the
Chan[cellor’s] vote. It was told it could not be granted unless the
ministers would intercede.... The ministers, out of a pious, though I
think ignorant zeal, spoke and preached for 1696.
cutting him off ... our ministers being,’ he adds, ‘generally of a
narrow set of thoughts and confined principles, and not able to bear
things of this nature.’ It thus appears that the clergy were eager for
the young man’s blood, and the secular powers so far under awe
towards that body, that they could not grant mercy. The Council
appears in numberless instances as receiving applications for delay
and pardon from criminals under sentence, and so invariably assents
to the petition, that we may infer there having been a routine
practice in the case, by which petitions were only sent after it was
ascertained that they would probably be complied with. There being
no petition for pardon from Aikenhead to the Council after his trial,
we may fairly presume that he had learned there was no relaxation of
the sentence to be expected.
As the time designed for his execution drew nigh, Aikenhead wrote
a paper of the character of a ‘last speech’ for the scaffold, in which he
described the progress of his mind throughout the years of his
education. From the age of ten, he had sought for grounds on which
to build his faith, having all the time an insatiable desire of attaining
the truth. He had bewildered himself amongst the questions on
morals and religion which have bewildered so many others, and only
found that the more he thought on these things the further he was
from certainty. He now felt the deepest contrition for the ‘base,
wicked, and irreligious expressions’ he had uttered—‘although I did
the same out of a blind zeal for what I thought the truth.’ ‘Withal, I
acknowledge and confess to the glory of God, that in all he hath
brought upon me, either one way or other, he hath done it most
wisely and justly.... Likeas I bless God I die in the true Christian
Protestant apostolic faith.’ He then alluded in terms of self-
vindication to aspersions regarding him which had been circulated in
a satire by Mr Mungo Craig, ‘whom I leave,’ said he, ‘to reckon with
God and his own conscience, if he was not as deeply concerned in
those hellish notions for which I am sentenced, as ever I was:
however, I bless the Lord, I forgive him and all men, and wishes the
Lord may forgive him likewise.’ Finally, he prayed that his blood
might ‘give a stop to that raging spirit of atheism which hath taken
such a footing in Britain both in practice and profession.’ Along with
this paper, he left a letter to his friends, dated the day of his
execution, expressing a hope that what he had written would give
them and the world satisfaction, ‘and after I am gone produce more
charity than [it] hath been my fortune to be trysted hitherto with,
and remove the apprehensions which I hear 1696.
[195]
are various with many about my case.’
There was at that time in Edinburgh an English Nonconformist
clergyman, of Scottish birth, named William Lorimer, who had come
to fill the chair of divinity at St Andrews. While Aikenhead was under
sentence, Mr Lorimer preached before the Lord Chancellor and other
judges and chief magistrates, On the Reverence due to Jesus Christ,
being a sermon apropos to the occasion; and we find in this
discourse not one word hinting at charity or mercy for Aikenhead,
but much to encourage the audience in an opposite temper. It would
appear, however, that the preacher afterwards found some cause for
vindicating himself from a concern in bringing about the death of
Aikenhead, and therefore, when he published his sermon, he gave a
preface, in which he at once justified the course which had been
taken with the youth, and tried to shew that he, and at least one
other clergyman, had tried to get the punishment commuted. The
prosecution, he tells us, was undertaken entirely on public grounds,
in order to put down a ‘plague of blasphemous deism’ which had
come to Edinburgh. The magistrates, being informed of the progress
of this pestilence among the young men, had two of them
apprehended. ‘One [John Fraser] made an excuse ... humbly
confessed that it was a great sin for him to have uttered with his
mouth such words of blasphemy against the Lord; professed his
hearty repentance ... and so the government pardoned him, but
withal ordered that he should confess his sin, and do public penance
in all the churches in Edinburgh. And I believe the other might have
been pardoned also, if he had followed the example of his
companion; but he continued sullen and obstinate, I think for some
months; and the party were said to be so very bold and insolent, as to
come in the night and call to him by name at his chamber-window in
the prison, and to tell him that he had a good cause, and to exhort
him to stand to it, and suffer for it bravely. This influenced the
government to execute the law.’
With regard to efforts in favour of Aikenhead, Mr Lorimer’s
statement is as follows: ‘I am sure the ministers of the Established
Church used him with an affectionate tenderness, and took much
pains with him to bring him to faith and repentance, and to save his
soul; yea, and some of the ministers, to my certain knowledge, and
particularly the late reverend, learned, prudent, peaceable, and pious
Mr George Meldrum, then minister of the Tron Church, interceded
for him with the government, and solicited for his pardon; and when
that could not be obtained, he desired a reprieve for him, and I
joined with him in it. This was the day before his execution. The
chancellor was willing to have granted him a reprieve, but could not
do it without the advice of the Privy Council and judges; and, to shew
his willingness, he called the Council and judges, who debated the
matter, and then carried it by a plurality of votes for his execution,
according to the sentence of the judges, that there might be a stop
put to the spreading of that contagion of blasphemy.’[196]
Mr Lorimer’s and Lord Anstruther’s statements are somewhat
discrepant, and yet not perhaps irreconcilable. It may be true that, at
the last moment, one of the city clergy, accompanied by an English
stranger, tried to raise his voice for mercy. It is evident, however,
that no very decided effort of the kind was made, for the records of
the Privy Council contain no entry on the subject, although, only
three days before Aikenhead’s execution, we find in them a reprieve
formally granted to one Thomas Weir, sentenced for housebreaking.
The statement itself, implying a movement entirely exceptive, only
makes the more certain the remarkable fact, derived from Lord
Anstruther’s statement, that the clergy, as a body, did not intercede,
but ‘spoke and preached for cutting him off,’ for which reason the
civil authorities were unable to save him. The clergy thus appear
unmistakably in the character of the persecutors of Aikenhead, and
as those on whom, next to Sir James Steuart, rests the guilt of his
blood.
The Postman, a journal of the day, relates the last moments of the
unhappy young man. ‘He walked thither [to the place of execution—a
mile from the prison] on foot, between a strong guard of fusiliers
drawn up in two lines. Several ministers assisted him in his last
moments; and, according to all human appearance, he died with all
the marks of a true penitent. When he was called out of the prison to
the City Council-house, before his going to the place of execution, as
is usual on such occasions, he delivered his thoughts at large in a
paper written by him, and signed with his own hand, and then
requested the ministers that were present to 1696.
pray for him, which they did; and afterwards he himself prayed, and
several times invocated the blessed Trinity, as he did likewise at the
place of execution, holding all the time the Holy Bible in his hand;
and, being executed, he was buried at the foot of the gallows.’
There had been for two years under 1697. Jan. 16.
process in the Court of Session a case in
which a husband was sued for return of a deceased wife’s tocher of
eight thousand merks (£444, 8s. 10d.⅔), and her paraphernalia or
things pertaining to her person. It came, on this occasion, to be
debated what articles belonging to a married woman were to be
considered as paraphernalia, or jocalia, and so destined in a
particular way in case of her decease. The Lords, after long
deliberation, fixed on a rule to be observed in future cases, having a
regard, on the one hand, to ‘the dignity of wives,’ and, on the other,
to the restraining of extravagances. First was ‘the mundus or vestitus
muliebris—namely, all the body-clothes belonging to the wife,
acquired by her at any time, whether in this or any prior marriage, or
in virginity or viduity; and whatever other ornaments or other things
were peculiar or proper to her person, and not proper to men’s use or
wearing, as necklaces, earrings, breast-jewels, gold chains, bracelets,
&c. Under childbed linens, as paraphernal and proper to the wife,
are to be understood only the linen on the wife’s person in childbed,
but not the linens on the child itself, nor on the bed or room, which
are to be reckoned as common movables; therefore found the child’s
spoon, porringer, and whistle contained in the condescendence [in
this special case] are not paraphernal, but fall under the communion
of goods; but that ribbons, cut or uncut, are paraphernal, and belong
to the wife, unless the husband were a merchant. All the other
articles that are of their own nature of promiscuous and common
use, either to men or women, are not paraphernal, but fall under the
communion of goods, unless they become peculiar and paraphernal
by the gift and appropriation of the husband to her, such as a
marriage-watch, rings, jewels, and medals. A purse of gold or other
movables that, by the gift of a former husband, became properly the
wife’s goods and paraphernal, exclusive of the husband, are only to
be reckoned as common movables quoad a second husband, unless
they be of new gifted and appropriated by him to the wife again. Such
gifts and presents as one gives to his bride before or on the day of the
marriage, are paraphernal and irrevokable by the husband during
that marriage, and belong only to the wife 1697.
and her executors; but any gifts by the
husband to the wife after the marriage-day are revokable, either by
the husband making use of them himself, or taking them back during
the marriage; but if the wife be in possession of them during the
marriage or at her death, the same are not revokable by the husband
thereafter. Cabinets, coffers, &c., for holding the paraphernalia, are
not paraphernalia, but fall under the communion of goods. Some of
the Lords were for making anything given the next morning after the
marriage, paraphernalia, called the morning gift in our law; but the
Lords esteemed them man and wife then, and [the gift] so
irrevokable.’[197]