Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Mapping Functions
By C. von Kerczek 1 and E. O. Tuck 2
Introduction
THE MATHEMATICAL representation of a ship hull is
desirable for at least two reasons: firstly, it is conveuient
for calculating the hydrodynamic and hydrostatic proper-
ties of the ship; and secondly, it may be used in the design
and construction process of the ship.
The calculation of the hydrodynamic properties of
ships, in which the detailed geometry of the hull form is
taken into account, m a y be carried out very conveniently
in terms of a hull surface equation, or at least in terms of
equations describing the cross sections of the hull. Re-
cent efforts in representing either the entire or discrete $
sections of the ship hull mathematically and using this
representation in hydrodynamic calculations include Fig. 1 Coordinate system
[1-12].~
I(erwin [1] wrote a computer program which takes
the offsets of the ship as input and fits the entire hull by
semi-orthogonal pobmomials. He fits the complete cation of the conformal mapping functions has been re-
ship by least-squares polynomials such that, in the coor- stricted to fitting only discrete cross sections of ships and
dinate system of Fig. 1, x is a polynomial function of both using the results in hydrodynamic calculations. The
y and s. This representation is primarily itltended for advantage of this method for representing ship hulls
the computation of wavemaking resistance and the hy- stems from the fact that some two-dimensional hydro-
drodynamic properties of an oscillating thin ship, and dynamic problems for arbitrary cross sections may be
was used by Gerritsma, I(erwin and Newman to calculate solved directly in terms of the coetfieients of the mapping
the damping of Series 60 hull forms [9]. The major functions; e.g., [2,3,8]. Three-dimensional results
drawback to this method is that polynomials of very m a y be obtained by summation over cross sections, using
high degree and a large number of input poiuts are re- strip or slender body theory. For instance Vassilopoulos
quired. [4] performs two-dimensional heaving calculations sta-
An alternative approach is to make use of certain con- tion by station in terms of the mapping functions, and
formal mapping functions to represent the hull. Appli- then uses the strip theory of ship motions in waves to
obtain three-dimensional heave and pitch estimates.
Steady longitudinal flow calculations m a y also be made
1Aerospace Engineer, Naval Ship Research and Development [5,6,7] using slender-body theory, l>or the latter ap-
Center, Washington, D. C. plication it is desirable to know the mapping function of
2Naval Ship Research and Development Center, Washington,
D.C. Presently: Reader of Mathematics, University of Adelaide, the cross section as a smooth function of the lengthwise
Adelaide, South Australia. coordinate of the ship.
3Numbers in brackets designate References at end of paper. With the advent of "active graphics" [14] facilities on
Manuscript received at SNAME Headquarters January 24,
] 969. Revised manuscript received AugtLst28, 1969. large-scale computers the possibility arises that a
specifying a number of unknown coefficients. The co- where z = x + iy and ~ = e q- i~ = re '~. which maps the
efficients of the surface equation need not be explicitly circle [~[ = 1 in the F-plane onto the contour, consisting
written in terms of various geometric characteristics of of the station and its reflection across the x-axis, in the
the hull. I t is only necessary that there be enough de- z-plane. Then the a~'s, considered as functions of s, are
grees of freedom in the surface equation so that it is fitted by polynomials in s. Thus, with
capable of describing a wide class of hull shapes. I t is M
also desirable that, by restricting the surface equation to a,,(s) = ~ A,,,~s '~-I n = 1,..., N
a few terms, a basic hull form can be generated which is m=l
reasonably shiplike. Such a basic hull form would be
the desired surface equation is
necessary as a starting point in the design process.
This paper describes one class of surface equations and N M
a convenient method by which a ship hull can be repre- x = x(s,) = E E A,~ s~-'cs [ ( 3 - - 2n)~]
n=l m=l
sented by such equations. This type of representatiou
was originally used because of its convenience in hydro- (3)
N M
dynamical calculations and has been used successfully in y = y ( s , ~) = ~ ~_~ A m n s m-1 sin [(3 - - 2n)~o]
such calculations. I t also appears to have some merits n=l m=l
for use in a design procedure such as that described in the where we have made use of the fact that r = 1 gives the
concluding section of this paper. coordinates of points on the desired contour.
The method consists of fitting each cross section of the The task confronting us then is to determine the
ship by a mapping function in a least-squares sense. matrix [A,,~ ].
Then the set of coefficients corresponding to a given term
in the mapping function is fitted with a lengthwise poly- Mapping of Each Station
nomial, also in a least-squares sense. The result is a In general, most shiplike sections can be couform~lly
completely analytical representation of the ship hull. mapped onto the circle I~-I = 1 in the ~-plane by a
mapping such as
Hull Surface Equation N
z = (c~ q- ib~)f q- ~ (c~ q- ib~)~ ~-'~
The x, y, s coordinate system is taken as shown iu n=2
Fig. 1. I t is desired to express the hull surf'me by an
If the curve is symmetric in y then b~ = 0, n = 1. . . . , N,
equation of the form
and if it is also symmetric in x then n is only even. Now
x = f ( y , s) the curves we wish to map have both these axes of sym-
metry, so that
or in the parametric form as
N
x = x(s, ~) Z = E an~ (a-2n) (9_)
n=l
and
(1) where ax = c~ and a~ = c.,~_2,n = 2 , . . . , N.
y = y(s, ~) Also, the nature of the mapping is such that a point in
Nomenclature
r_-1
N
bE P
- E {xp cos [(3 - 2j)gp] + yp sill [(3 -- 2/)~p]}
y~ -= ~ a,~ sin [(3 -- 2 n ) ~ ] baj p= t
n=l P N
- E a~ cos [2(j - n)p] = 0
This gives us 2P equations to solve for u m a x i m u m of P /J=l n=l
an's and P unknown ~ / s . I t is undesirable to let N = P,
though this would determine a set of a~'s that would map j-- 1,...,N (5)
points on the unit circle exactly into the (x,, yp)'s, be- bE N
cause the mapping function could give ~ section which is - ~ aria -- 21)[x~ sin [(3 -- 2 l ) ~ ]
b~i 1=1
pathological in between the given points. I n order to N N
avoid this and find a,,'s t h a t would produce a section -- y~cos [ ( 3 - - 2l)~,]}-- ~ ~ a~az(3 -- 2/)
which fits the data points smoothly, though not neces- n=l /=1
sarily exactly, N is taken Jess than P (of the order of ~ P Xsin[2(n-- /)~] = 0 i = 1,...P
or 2~ p ) and the a~'s and q~p's are determined in a least-
squares sense. This produces a form t h a t is smooth and I t is almost hopeless to a t t e m p t to solve these equ-~tions
also fits the data points in such a manner as to minimize directly, but note t h a t the first set of (5) is linear in the
the squared distance between the data points and the a / s and can be solved directly if the ~p's are known.
generated form. I n this sense, we have This suggests the following iteration scheme for solving
N
for the a,'s and Cp's: Let
x~ = ~ a,, cos [(3 -- 2 n ) ~ ] + E , ' bE
n=l ~(aj; ~ ) = 0 .i = 1 . . . . , N
N<P baj
N bE
y~ = ~ a~ sin [(3 -- 2n)~] -{- E~ '~ "--~(~; aj) = 0 i = 1,..., P
n=l
a
and letting ~iheu, with a suitable first guess for the a,'s t h a t would
give a form t h a t does not depart too much from the data
1) points, we calculate a set of approximate ~ ' s fl'om the
E = E (E~ ' ~ + E~ "~) equations ~ ( ~ ; a j) = 0. Using this set of ~,'s we go to
p=l
2(aA ~ ) = 0 and solve for a new set of a,'s. Using this
minimization of squared dist~mce between generated new set of a / s we repeat the procedure. This iteration
curve and d~ta points requires t h a t continues until A E ( ~ , a j) is brought to within a specific
tions in ~, and thus are not easily solved. One of their 0 = E A , , , ( m -- 1)s/m-2) --~ .f.., (8)
simplifying features, however, is that each equation
M
involves only a single ~ ; thus each may be solved
separately for ~, by some technique such as a Newton- 0 = ~ A,,~(m- 1) ( m - - 2) s,( .... a)~--f~
~n=l
Raphson iteration. A simpler and more reliable tech-
nique used here is that of directly computing E for a are the constraining equations. The error function is
given (xp, y~,) and a set of ~,'s and then picking out the now
~op that minimizes E (see Appendix 1). A Newton-
Ilaphson iteration is used in the rare eases in which this E = a,~i - n m n s i (m-I)
method fails. i = 1
i#r
m= 1
Polynomial Fitting to the Mapping CoefFicients Introducing Lagrange multipliers Xl, X2, Xa, we form the
After representing each given station of the ship by a. function
mapping as described in the previous section, the map- = E - xi(k - a2") - X,k - X~f~
ping coefficients, considered as functions of s, are fitted
by least-squares polynomials in s. then the equations to be solved are given by miniinizing
Defining the square-error function of the poly,nonfials F; i.e.
and the data points (here the coefficients a,) as
bF
K M -0
E = E [a=i - ~ A,~,s~("-I)] ~" ~A j,,
i=1 m=l
j = 1,..., M
where K is the number of given stations, M -- 1 is the
degree of the polynomial, and a~~is the n'th coefficient of which gives us
the mapping of the station located at s~, then K
an~8l (a-l) Amn - -
t-
huh is exactly defined by the surface equation and off- section -rod have zero slope and curw~ture there. One
sets may be iuterpolated to any desired degree of ac- can then insert any length parallel middlebody desired
curacy. and be assured that the entire ship fits together smoothly
If a huli has a long parallel middlebody, it is unde- at least to the second degree. Moreover, computation
sirable to fit the entire middlebody by a lengthwise poly- time is reduced by this device since only one middlebody
nomial because this might introduce small wobbles in the section need be fitted by the mapping function and this
waterlines. To eliminate this problem, the hul[ can be can be done separately, once and for all, for all ships
divided into three sections, the forebody, the parallel which use this p-~rticular section. In our example of the
middlebody, and the afterbody; the forebody and the Series 60 block 0.70 hull, this feature was not utilized,
afterbody can then each be fitted by the surface equation rod four identical middlebody section,s were fitted.
the polynomials of which are constrained (using the con- Each of these consumed about one minute of com-
straining procedure described in an earlier section, purer time. Thus a savings of three minutes could have
Polynomial F i t t i n g . . . ) ~,o go through the middlebody been affected if the constraining procedure were used.
O,Q6,
Q Y~
G.e41
/
D.|S
//, !
ti I
, !
r/
ii
t !
!
\
I
0I~,
t
-I,00
I
-0,$0 *0.40
J
*0.40
l
*O.lO 0 O,IO
l
0.40
I
O,eO O.lO S.OO
I_ TRANS. c o ( f t . 1.o [
I I
.OSO
/
.IS
/ i
' ! I \
-.OSO
-.lOG
\
-*150 t I
-,3gO
-,460
-,JO0
-t.O0 *0,10
l
-0,10 -0,40 -0,20 0 O,IO 0.40 O,eO O. eO bOO
I TRAH$. o ( r r . z.o I
Fig. 5 Mapping coefficients a~, a2 for Series 60. Circles denote intermediate values at input stations; solid curves give lOth
degree polynomial fit to these points
.9
J I \
--05011
-.lOO~
-.190
jJ
-.zoc
-.zso
-,5oo
-.$go
-.400
-,4fO
".|DO
-l,OO *0,$0 -0.@0 -0.40 -0.|0 0 O.tO 0.40 0.@0 0.@0 I.1~@
.1~4@ J
.030 I
/
.O~O
O[OI
/
.@
/ /S
-I.00 -O.S~ -0.00 -0.40 "0.|0 @ 0.80 0.40 9.@0 0.60 @.~@
I_ T~ANS. COEKK. 4.0 !
very quickly -,ttailmd -~way from the uppermost water- 23 stations and the degree of the polynomials is 10. The
line. To illustrate this, the complete Series 60 block surface equation fit to the input data for this ease is
0.70 hull (from the keel to an artifiei~l waterline above shown in Fig. 8. The fit to the last station can be im-
the uppermost deck) was fitted with a seven-term map- proved by supplying more and better input data, which
ping surface equ-~tion. The input was obt'~ined as be- would be provided automatically in our design process.
fore, using 16 offsets for stations at the bow and stern A filial suggestion for an important design "~pplieation
and up to 22 offsets for st'~tions at, midships. There ~re of these surface equations is in fairing of lines. I t is
,IDSS
i
i
f
/
.oso
.oos
+,,,.~ ..-+----~
.0
-.oos
-! *00 -O.lO *O.lO -O,4O *0,10 0,10 0.40 0.II0 OoOO l*O0
,04Q+
I
.ISSl
!+
.Qll
/, +
.Q,L~
/r
.OlS
1
/
O0.q
/
-.~
-bOO *O.lO *O,lO *0.40 -O.lO O.lO 0.40 O.lO 0.80 hOll
l TRAHS. CO(TIP. I.O I
! I
,olto
]
i i
oO2S~
1
*010
.1201
.II v 0 C 0
[
-.008
I la
1
| II
-J . 0 0 -O.llO *O.O0 -0.40 *0,|0 0,|0 0.40 II.tg
I_ TRANS, c o [ F T , ~.o I
Fig. 8 Final surface equation fit to complete Series 60 hull up to uppermost deck
~O -06
A -0 8
-'o J
' )---------- l'-
C ~.al ._~,,a I
-
~,
. . _~b 1-7- Cbl -~c
B 9-r
#
~..
C 00
~ .
~3 I i
I I
X Fig. 10
Cb2
I The Newton-Raphson (N-R) iteration on ~(~,as) = 0
has been programmed as an alternative method for com-
]Fig.9 puting approximations of the ~ ' s ; the corresponding
subroutine is called on automatically if, and only if, the
interpolation method should fail to converge for any
reason. Although the N-R iteration takes only about
to keel and then keel to waterline, and the ~ for each one third the iterations to find ~ , it takes about the same
(x~,y0 chosen which gives the smaller E~(aj,~), then the amount of time since there are roughly three times as
gap in ~ would only be shifted to a different spot ( be- m a n y arithmetic operations to perform as in the interpo-
tween e,, and eb, in Fig. 9) and the same phenomenon lation. The main reason for not using the N-R iteration
would still occur. In order to avoid this phenomenon, the is that d ~ / d ~ might vanish for some ~ in (-7r/2,0),
Lewis Form used for the first approximation is restricted causing this method to fail. I t is worth noting that the
to a form such as in Fig. 11 and described in Appendix N-R iteration would not work any better than interpola-
2, having less section area than the given data would in- tion in the troublesome case just described, since the
dicate, but without the objectionable "tunneled-bulbous" N-R iteration depends on a starting guess which will be
property. necessarily the same as that used in the interpolation
where
al = 1/2(b ~- H ) - a~
O a2 = '/2(b - H) (13)
-----O a~ = --~/4(b + H) + 1/4
O
X [ (b+H)2+8 (
bH-- 2-S
7;"
)F
Dividing (13) by the draft H yields new coefficients
a.~
2 ax' = H,a~.' = H, a n d a a ' -
:\ al = 1/.~(X + 1) - a3
a2 = 1/2(X -- 1) (14)
a3 = --I/4 ()k -~- 1) -~ 1/4
O
[(x + 1)2 + Sx ( 1 - -4
) 1 ~1 / " 7 r
:
The Lewis Forms may be categorized into the four
shapes shown in Fig. 12, and the ranges of the parameters
X, a which generate each shape are shown in Fig. 13.
The reentrant form is characterized by the property
that x < 0 (shown) and/or y > 0 (not shown) for some
fit the 4th quadrant. From (12)
x = ( a l + a _ ~ ) c o s ~ + a3cos3~
and
y = (al -- a2) sin ~o -- a3 sin 3~o
O
Equation (14) and the requirement that x >_ 0 and y < 0
for - 7r/2 _< ~ _< 0 yields the inequalities
a3_< l f o r y < 0
method. With such a starting guess the iteration will
go to the nearest minimum, which results in the same
Thus to avoid reentrant forms we take the first of (15) if
bad approximations for ~ ' s as the iaterpolation.
X < l and the seeond of (15) if X > 1. In terms of the
half-beam/draft ratio and section-area coefficient we
have, for X _< 1
Appendix 2
)X
( > --'/4(X1 ~- 1) ~- -1/4[(X -~- 1)2 -t- 8)~ - - 4* / cr
2)-1
A Nofe on Lewis Forms 4-- ~r
A Lewis Form is defined by the mapping or
REENTRANT
r~0,29 ~i~ CONVENTI
0,7 ONAL
1.0
CONVENTIONAL
REENTRANT
=
1
TUNNELED-
BULBOUS
o~ 1.0
BULBOUS 0.0 1.0 2.0
(Z 1.15
b
tf
3+ <~<~ 3+ )
The tunneled forms ure obtained when X > 1 und then the radical ill the formula for a3 is negative and a~ is
complex, which violates one of our symmetry condi-
3+ _<~_<~ 3+ tions. Therefore, the upper bound of ~ that still gives
symmetric Lewis Forms is given by (20). I t is interest-
The last category, forms which are both tumteled and ing to note that the formula (13) for a3 comes from the
bulbous, are characterized by x'(~) = 0 and y'(~) = 0 solution of a quadratic equation, and the second root of
for some ~ in ( - 7r/2, 0). Therefore the range of X aud this equation is
for which such forms are obtained is given by
. . . .
~>32 3+ andX_< 1
Such forms are not considered since it can be shown that
and they are looped, i.e., that they intersect themselves at a
point within the 4th quadrant.
> ~2 3 + andX > 1 In the application of the Lewis Forms as the starting
guess in our iteration, only those forms are used that lie
The upper boundary of the region in which the tun- in the region which gives bulbous, conventionM, or
neled-bulbous forms occur defines forms with a cusp at tunneled forms. If ~ should fall outside this region for
some value of ~ in the open interval ( - w / 2 , 0 ) . . , I t can any section, then as the initial guess for this section we
be shown that this occurs when choose the Lewis Form which corresponds to the point
on the boundary of this region nearest to ~ for the given
a~ = -'/4(x + 1) X. This works adequately even for very severe bulbs
that is, when where ~ is well into the region of nonsymmetric forms.