SlideShare a Scribd company logo
Identification of theIdentification of the
Mathematical Models ofMathematical Models of
Complex Relaxation ProcessesComplex Relaxation Processes
in Solidsin Solids
Bakhrushin V.E.Bakhrushin V.E.
University of HumanitiesUniversity of Humanities
“ZISMG”, Zaporozhye, Ukraine“ZISMG”, Zaporozhye, Ukraine
Relaxation processes:
- internal friction;
- dispersion of modulus;
- stress relaxation;
- elastic aftereffect.
Parameters:
- interstitial concentrations for different states;
- interstitial solubility;
- local diffusion coefficients;
- activation energies for jumps.
Identification tasks
1. To choose the type of mathematical model: ideal
Debay peak (model of the standard linear body); the
sum of ideal peaks (processes); enhanced Debay
peak; the sum of enhanced peaks; the sum of peaks +
background.
2. To determine the quantity of relaxation processes
3. To determine the parameters of relaxation processes
( )
n
1 1 1 1 i
0 0i
i 1 0i
E E 1 1
Q T Q exp Q cosh
RT R T T
− − − −
=
   
= − + −  ÷ ÷
    
∑
0i
i 0i
kT
E RT ln
hf
=
Model of spectrum at Snoeck relaxation area:
1
0Q ,E−
– background intensity and activation energy;
1
0i 0iQ ,T−
– i-th peak height and temperature
– i-th peak activation energy
f – sample vibration frequency
Parameters, which must be determined are:
1
0i 0in,Q ,T−
or
1
0i in,Q ,E−
( )0,14139 0,003245
0T 12,89967 2,706674f 0,04547 0,04929f E,= + + − +
An error for 300 – 800 К interval at f = 20 – 60 Hz
is not more, then 1 %
From Wert & Marx formula such approximation may
be obtained:
( )( )
m 2
1 1
j j
j 1
S Q Q T min− −
=
= − →∑
( )( )
2
1 1
m
j j
1 2
j 1 j
Q Q T
S min
− −
=
−
= →
σ
∑
( )
( )
2
exp z/
z
 − β
 ψ =
β π
( )mz ln /= τ τ z2β = σ
Peak enhance may be taken into account by the model
of log-normal distribution of relaxation time:
max
max id
δ
ρ =
δ
2
0,0853 0,197 0,970ρ = ϕ + ϕ +
n
1 1 1 i
0i
i 1 0i
E 1 1
Q Q cosh
R T T
− − −
=
  
= −  ÷
ρ  
∑
In this case:
( )mlnϕ = ωτ
For ρ value from N.P. Kushnareva & V.S. Petchersky
data such approximation may be obtained:
Graphic decomposition
2 peaks without error
-8
-4
0
4
1,4 1,7 2 2,3
arcch(Q-1
m/Q-1
)
103
/T
4 peaks + error
-6
-3
0
3
6
1,2 1,5 1,8 2,1 2,4
arcch(Q-1
m/Q-1
)
Linear least-squares method:
( )
n
1
j i i j i
i 1
x A cosh [B (x c )]−
=
ϕ = −∑
1
i 0i j j i 0iA Q , x 1/T , c 1/T−
= = =
i
i i
1 k
B ln
c hfc
=
( )
( )
( )
( )
( )
( )
n
j
j j
j 1 1
n
j
j j
j 1 2
n
j
j j
j 1 n
x
y x 0;
A
x
y x 0;
A
x
y x 0,
A
=
=
=
∂ϕ
 − ϕ =  ∂
∂ϕ
 − ϕ =  ∂
∂ϕ
 − ϕ =  ∂
∑
∑
∑
LLLLLLLLLLLL
( )j 1
i j i ij
i
x
cosh [B (x c )] F
A
−
∂ϕ
= − =
∂
n n n n
2
1 1j 2 1j 2 j n 1j nj j 1j
j 1 j 1 j 1 j 1
n n n n
2
1 2 j 1j 2 2 j n 2 j nj j 2 j
j 1 j 1 j 1 j 1
1 nj 1j 2 nj
A F A F F A F F y F ;
A F F A F A F F y F ;
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
A F F A F
= = = =
= = = =
+ + + =
+ + + =
+
∑ ∑ ∑ ∑
∑ ∑ ∑ ∑
L
L
n n n n
2
2 j n nj j nj
j 1 j 1 j 1 j 1
F A F y F
= = = =
+ + =∑ ∑ ∑ ∑L
1 11 2 12 n 1n 1
1 21 2 22 n 2n 21
1 n1 2 n2 n nn n
A W A W ... A W Z ;
A W A W ... A W Z ;
. . . . . . . . . . . . . . . . . . . . . . . . . .
A W A W ... A W Z ,
+ + + =
 + + + =


 + + + =
n
1 1
ik i k
j 1 j i j k
1 1 1 1
W cosh B cosh B
x c x c
− −
=
       
 = − − ÷ ÷  ÷  ÷  ÷ ÷        
∑
n
1
i i i
j 1 j i
1 1
Z y cosh B
x c
−
=
  
= −  ÷ ÷
   
∑
The advantages of linear least-squares
method:
- simple realization;
- sufficient accuracy (up to 10 % for the main peaks
heights)
Method disadvantages:
- linearization error;
- necessity of peak temperatures preliminary definition;
- possibility to obtain an ill-condition system;
- supposition of uniformly precise of the data;
- supposition of absolute accuracy of temperature
measurements;
- possibility of obtaining the negative values of peak
heights.
The method of gradient descent
(linearized least square method)
Main differences:
- an expression of ideal peak is linearized by Taylor
series expansion in the neighborhood of some point
(initial estimate) with abandonment of only linear
terms;
- the possibility to choose the different types of
objective function (cancellation of supposition that the
data have the same errors)
[L. Crer et. al, 1969; M.S. Ahmad et. al, 1971;
O.N. Razumov et. al., 1974; A.I. Efimov et. al., 1982.]
( )( ) ( )
1 1 1m
j j
2
j 1 j k
Q Q T Q T
0, k 1,2,...q
a
− − −
=
− ∂
= =
σ ∂
∑
{ }1 1 1
0 01 0n 1 n 01 0na E,Q ,Q ,...,Q ,E ,...,E ,T ,...,T− − −
=
q 3n 2= +
( )( )
2
1 1
m
j j
1 2
j 1 j
Q Q T
S min
− −
=
−
= →
σ
∑
From
we can obtain:
at general case, q 3n= without background,
q 2n= for ideal Debay peaks.
After linearization we obtain:
( ) ( )
m
0 1
k k k mkm
1
a a a M Z ,−
=
∆ = − = ∑l
( ) ( )1 1m
k 2
j 1 j k
Q T Q T1
M ,
a a
− −
=
 ∂ ∂
=  ÷ ÷σ ∂ ∂ 
∑l
l
( )( ) ( )
1 1 1m
j j
2
j 1 j
Q Q T Q T
Z ,
a
− − −
=
− ∂
=
σ ∂
∑l
l
where:
derivatives are determined in 0
ka
Adjusted values:
0
k k ka a a , 0 1.= + γ∆ < γ ≤
From the definition of ka∆ follows, that it corresponds
with the general formula of gradient search methods:
0
k k 1a a gradS .= −β
Gradient methods realize an iteration procedure, in
which such stopping conditions may be used:
p p 1
k ka a ;−
− < ε p p 1
1 1S S ;−
− < δ 1gradS ;< ξ , , 0.ε δ ξ >
Problems and disadvantages:
- poor convergence at the case of large number of
peaks;
- possibility of iteration stopping at the critical point,
which is not the point of minimum;
- possibility of getting into a loop, when the objective
functional S is ravine;
- absence of realization at standard libraries of the most
popular software packages;
- М matrix must be positively defined at the every step
of iterations
( ) ( )(k 1) (k) 1 (k) (k)
H ,+ −
= −X X X G X
Quasi-Newton algorithm
{ }1 1 1
0 01 0n 1 n 01 0na E,Q ,Q ,...,Q ,E ,...,E ,T ,...,T− − −
=
2 2 2
2
1 1 2 1 q
2 2 2
2
2 1 2 2 q
2 2 2
2
q 1 q 2 q
S S S
...
a a a a a
S S S
...
a a a a aH
... ... ... ...
S S S
...
a a a a a
 ∂ ∂ ∂
 ÷
∂ ∂ ∂ ∂ ∂ ÷
 ÷∂ ∂ ∂
 ÷
∂ ∂ ∂ ∂ ∂=  ÷
 ÷
 ÷
 ÷∂ ∂ ∂
 ÷
∂ ∂ ∂ ∂ ∂ 
1
2
q
S
a
S
aG
...
S
a
∂ 
 ÷∂
 ÷
∂ ÷
 ÷∂=
 ÷
 ÷
 ÷∂
 ÷
 ÷∂ 
ij
ij
h , i j;
c
0, i j.
 =
= 
≠
n
1 T
1 k k k
k 1
P z ,
−
=
= ∑ v v
° 1 1 1
1H C PC ,
− − −
=
zk are eigenvalues and vk are eigenvectors of matrix:
Grinshtadt technique:
1 1
P C HC ,− −
=
It is necessary to provide the positive definiteness of
Hesse matrix or to find an approximation of Н-1
and
F is a Fisher criterion value for the corresponding
numbers of degrees of freedom and significance level,
∆2
- sum of errors squares (relative errors) of
experimental points.
Adequacy criteria for spectrum models:
2
S
F≤
∆
2
F
S
∆
≤
( )0,052
S
F F 2,0...2,5> ≈ ⇒
∆
number of model parameters must be increased;
2
F
S
∆
> ⇒
number of model parameters must be decreased.
Quasi-unimodelity (an absence of physically
different minimums) of objective functional, that is all
minimums of objective functional correspond to the
same physical model of a spectrum.
Deviation from quasi-unimodality may be caused
with:
- the presence of excess peaks in the model;
- absence of some essential peak in the model;
- presence at the real spectrum of some collateral
peak, which height is close to measurement error.
Absence of model residuals serial correlation
(Darbin & Watson criterion):
( )
m 2
j j 1
j 2
m
2
t
j 1
e e
d ,
e
−
=
=
−
=
∑
∑
( )1 1
j j je Q Q T− −
= − - model residuals.
d 2≈ - serial correlation is absent;
d 0→
d 4≈
- positive serial correlation;
- negative serial correlation
(there are excess peaks).
0
5
10
500 600 700 800
Q-1
·103
T, K
Given data (4 peaks + error)
Initial approach (4 peaks) σ=0,1
0
4
8
12
500 600 700 800 T, K
Q-1
·103
The result of decomposition
S=0,30
F=0,74
-0,25
-0,1
0,05
0,2
500 600 700 800
∆Q-1
·103
T, K
Residuals
d=2,18
0
4
8
12
500 600 700 800 T, K
Q-1
·103
Initial approach 1 (3 peaks) σ=0,1
0
4
8
12
500 600 700 800 T, K
Q-1
·103
The result of decomposition 1 (3 peaks)
S=20,52
F=50,31
-2
-1
0
1
500 600 700 800
∆Q-1
·103
T, K
Residuals
d=0,33
0
4
8
12
500 600 700 800 T, K
Q-1
·103
Initial approach 2 (3 peaks) σ=0,1
0
4
8
12
500 600 700 800 T, K
Q-1
·103
The result of decomposition 2 (3 peaks)
S=13,58
F=33,28
-2
-1
0
1
500 600 700 800
∆Q-1
·103
T, K
Residuals
d=0,54
0
4
8
12
500 600 700 800
Q-1
·103
T, K
Initial approach 1 (5 peaks) σ=0,1
Initial approach 2 (5 peaks)
0
4
8
12
500 600 700 800
Q-1
·103
T, K
σ=0,1
Given 3_1 3_2 4 5_1 5_2
T1 570 571,3 578,6 569,4 569,4 569,4
T2 620 632,5 619,8 619,8 619,8
T3 690 698,1 685,5 690,2 690,2 690,2
T4 750 742,4 749,2 749,2 749,2
T5 499,6 718,2
Q1 6 6,3 7,4 5,9 5,9 5,9
Q2 3 3,5 3,1 3,1 3,1
Q3 12 13,0 12,2 12,0 12,0 12,0
Q4 3 3,6 2,9 2,9 2,9
Q5 0,0 0,0
σ=0,1
0
4
8
12
500 600 700 800 T, K
Q-1
·103
σ=0,3Initial approach 1 (4 peaks)
0
4
8
12
500 600 700 800 T, K
Q-1
·103
Initial approach 2 (4 peaks) σ=0,3
0
4
8
12
500 600 700 800 T, K
Q-1
·103
Initial approach 3 (4 peaks) σ=0,3
0
4
8
12
500 600 700 800 T, K
Q-1
·103
The result of decomposition
s=3,01
F=0,76
-0,5
-0,2
0,1
0,4
500 600 700 800
∆Q-1
·103
T, K
d=1,20
Residuals
0
4
8
12
500 600 700 800 T, K
Q-1
·103
Initial approach 1 (3 peaks) σ=0,3
0
4
8
12
500 600 700 800 T, K
Q-1
·103
Initial approach 2 (3 peaks) σ=0,3
0
4
8
12
500 600 700 800 T, K
Q-1
·103
Initial approach 3 (3 peaks) σ=0,3
The result of decomposition
0
4
8
12
500 600 700 800 T, K
Q-1
·103
s=15,87
F=3,99
-2,5
-1
0,5
500 600 700 800
∆Q-1
·103
T, K
Residuals
d=0,57
0
4
8
12
500 600 700 800
Q-1
·103
T, K
Initial approach 1 (5 peaks) σ=0,3
0
4
8
12
500 600 700 800
Q-1
·103
T, K
The result of decomposition
s=2,92
F=0,74
-0,5
-0,2
0,1
0,4
0,7
500 600 700 800
∆Q-1
·103
T, K
Residuals
d=1,21
0
4
8
12
500 600 700 800
Q-1
·103
T, K
Initial approach 2 (5 peaks) σ=0,3
0
4
8
12
500 600 700 800
Q-1
·103
T, K
The result of decomposition
s=1,41
F=0,35
-0,5
-0,2
0,1
0,4
0,7
500 600 700 800
∆Q-1
·103
T, K
Residuals
d=2,47
Given 3 4 5_1 5_2
T1 570 578,7 569,8 571,2 569,7
T2 620 621,8 622,8 621,3
T3 690 686,5 691,2 691,2 690,6
T4 750 749,2 757,1 757,2 751,7
T5 537,5 851,0
Q1 6 7,2 5,9 5,7 5,8
Q2 3 3,0 2,9 2,9
Q3 12 12,4 12,2 12,2 12,0
Q4 3 3,6 2,9 2,9 2,9
Q5 0,3 0,6
σ=0,3
0
10
20
450 550 650 750
Q-1
·103
T, K
0,18
0,36
0,42
0,60
[N], at.%:
Nb – 2 at.% W – N (3 peaks, 1 result)
-3,5
-2,5
-1,5
-0,5
0,5
1,5
2,5
450 550 650 750
∆Q-1
·103
T, K
d: 0,69; 0,52
1,94; 1,14
Residuals
0
10
20
450 550 650 750
Q-1
·103
T, K
0,18
0,36
0,42
0,60
[N], at.%:
Nb – 2 at.% W – N (3 peaks, 2 result)
-3,5
-2,5
-1,5
-0,5
0,5
1,5
2,5
450 550 650 750
∆Q
-1
·103
T, K
d: 0,85; 1,33
1,88; 1,27
Residuals
0
10
20
450 550 650 750
Q-1
·103
T, K
[N], at.%: 0,18
0,36
0,42
0,60
Nb – 2 at.% W – N (4 peaks)
-2,2
-1,2
-0,2
0,8
1,8
2,8
450 550 650 750
∆Q-1
·103 d: 1,83; 2,10
2,84; 1,67
Residuals
0
10
20
450 550 650 750 T, K
Q-1
·103
[N], at.%: 0,18
0,36
0,42
0,60
Nb – 2 at.% W – N (5 peaks, 1 result)
Residuals
-2
-1
0
1
2
450 550 650 750
∆Q
-1
·103
T, K
d: 1,60; 2,36
3,09; 1,83
0
10
20
450 550 650 750 T, K
Q-1
·103
[N], at.%: 0,18
0,36
0,42
0,60
Nb – 2 at.% W – N (5 peaks, 2 result)
-2
-1
0
1
2
450 550 650 750
∆Q-1
·103
T, K
d: 2,54; 2,36
2,96; 2,25
Residuals
T1 T2 T3 T4 Т5 S F
3_1 539,1 657,2 685,2 70,1 2,0
3_2 647,1 673,6 748,7 86,5 1,6
4 537,9 650,9 674,7 749,0 43,3 3,3
5_1 528,8 656,9 676,4 748,0 593,0 35,7 4,0
5_2 535,5 641,4 674,4 745,5 665,5 34,1 4,2
Q1 Q2 Q3 Q4 Q5
3_1 2,2 18,2 13,4
3_2 9,3 21,3 2,7
4 2,1 10,8 19,5 2,6
5_1 1,5 13,6 15,9 2,6 2,1
5_2 2,0 7,0 17,9 2,6 5,8
Nb – 12 at.% W Nb – 6
at.%
W
4
peaks
5 peaks 4
peaks1 set 2 set
E1, kJ/mol 102,2 86
E2, kJ/mol 109,5 111,5 110,1 109,8
E3, kJ/mol 116,3 116,9 116,5 116,5
E4, kJ/mol 128,9 129,6 129,1 128,3
E5, kJ/mol 1456 145,9 145,9 145,9
0
0,3
0,6
0,9
500 600 700 800
Nb – 2 at.% Hf – 0,32 at.% N (3 peaks):
E = 1,47; 1,61; 1,76 kJ/mol;
d = 0,90; F = 1,73.
0
0,3
0,6
0,9
500 600 700 800
Nb – 2 at.% Hf – 0,32 at.% N (4 peaks):
E = 1,29; 1,48; 1,62; 1,79 kJ/mol;
d = 1,26; F = 2,64.
0
0,3
0,6
0,9
500 600 700 800
Nb – 2 at.% Hf – 0,32 at.% N (5 peaks, 1 result):
E = 1,44; 1,54; 1,63; 1,77; 1,91 kJ/mol;
d = 1,06; F = 3,21.
0
0,3
0,6
0,9
500 600 700 800
Nb – 2 at.% Hf – 0,32 at.% N (5 peaks, 2 result):
E = 1,26; 1,46; 1,57; 1,64; 1,80 kJ/mol;
d = 1,55; F = 3,58.
n
N i
i 1
0i
i 2 2 2
i
i
0i
i
M(T) M M (T);
M
M (T) ;
1 4 f
E 1 1
exp
R T T
.
2 f
=


 = − ∆


∆
∆ =
+ π τ
   
 −  ÷
   τ = π
∑
The temperature dependence of dynamic elastic
modulus in a case of n processes, which satisfy the
model of standard linear body, may be determined
from a system:
MN – non-relaxed modulus.
Model parameters, which must be identified, are:
0i 0iM ,T .∆
( ) ( )
m 2
1 exp j j
j 1
S M T M T min,
=
 = − → ∑
We are to solve such minimization problem:
( )exp jM Twhere are experimental data for modulus at Tj.
(*)
Functional (*) has a great number of minimums,
so the result of minimization strongly depends on initial
assumption.
Adequate model may be obtained by using as T0i
initial values the results of relaxation spectrum
decomposition and setting initial values as0iM∆
1
0i N 0iM 2M Q .−
∆ =
T0i values after minimization are very close with the
initial ones, and values change essentially. But
there is a correlation (r = 0,90 – 0,97) between partial
Snoek peaks heights and results for :
0iM∆
0i
1
0i H
M
2,00 0,15.
Q M−
∆
= ±
0iM∆
Nb – 12 at.% W – N
[N], at.%:  - 0,11;
■ – 0,16;
▲ – 0,22;
♦ - 0,31
Identification of the Mathematical Models of Complex Relaxation Processes in Solids

More Related Content

What's hot

Engineering Mathematics-IV_B.Tech_Semester-IV_Unit-II
Engineering Mathematics-IV_B.Tech_Semester-IV_Unit-IIEngineering Mathematics-IV_B.Tech_Semester-IV_Unit-II
Engineering Mathematics-IV_B.Tech_Semester-IV_Unit-II
Rai University
 
Automated theorem proving for special functions: the next phase
Automated theorem proving for special functions: the next phaseAutomated theorem proving for special functions: the next phase
Automated theorem proving for special functions: the next phase
Lawrence Paulson
 
Stochastic Hydrology Lecture 1: Introduction
Stochastic Hydrology Lecture 1: Introduction Stochastic Hydrology Lecture 1: Introduction
Stochastic Hydrology Lecture 1: Introduction
Amro Elfeki
 
Lecture 2: Stochastic Hydrology
Lecture 2: Stochastic Hydrology Lecture 2: Stochastic Hydrology
Lecture 2: Stochastic Hydrology
Amro Elfeki
 
Introduction to Mathematical Probability
Introduction to Mathematical ProbabilityIntroduction to Mathematical Probability
Introduction to Mathematical Probability
Solo Hermelin
 
Lecture 3: Stochastic Hydrology
Lecture 3: Stochastic HydrologyLecture 3: Stochastic Hydrology
Lecture 3: Stochastic Hydrology
Amro Elfeki
 
Second-order Cosmological Perturbations Engendered by Point-like Masses
Second-order Cosmological Perturbations Engendered by Point-like MassesSecond-order Cosmological Perturbations Engendered by Point-like Masses
Second-order Cosmological Perturbations Engendered by Point-like Masses
Maxim Eingorn
 
Numerical Methods: Solution of system of equations
Numerical Methods: Solution of system of equationsNumerical Methods: Solution of system of equations
Numerical Methods: Solution of system of equations
Nikolai Priezjev
 
Hierarchical matrix techniques for maximum likelihood covariance estimation
Hierarchical matrix techniques for maximum likelihood covariance estimationHierarchical matrix techniques for maximum likelihood covariance estimation
Hierarchical matrix techniques for maximum likelihood covariance estimation
Alexander Litvinenko
 
Lecture 6: Stochastic Hydrology (Estimation Problem-Kriging-, Conditional Sim...
Lecture 6: Stochastic Hydrology (Estimation Problem-Kriging-, Conditional Sim...Lecture 6: Stochastic Hydrology (Estimation Problem-Kriging-, Conditional Sim...
Lecture 6: Stochastic Hydrology (Estimation Problem-Kriging-, Conditional Sim...
Amro Elfeki
 
Duel of cosmological screening lengths
Duel of cosmological screening lengthsDuel of cosmological screening lengths
Duel of cosmological screening lengths
Maxim Eingorn
 
Unit iv complex integration
Unit iv complex integrationUnit iv complex integration
Unit iv complex integrationBabu Rao
 
4017
40174017
Response Surface in Tensor Train format for Uncertainty Quantification
Response Surface in Tensor Train format for Uncertainty QuantificationResponse Surface in Tensor Train format for Uncertainty Quantification
Response Surface in Tensor Train format for Uncertainty Quantification
Alexander Litvinenko
 
On Optimization of Manufacturing of a Sense-amplifier Based Flip-flop
On Optimization of Manufacturing of a Sense-amplifier Based Flip-flopOn Optimization of Manufacturing of a Sense-amplifier Based Flip-flop
On Optimization of Manufacturing of a Sense-amplifier Based Flip-flop
BRNSS Publication Hub
 
Research Project Primus
Research Project PrimusResearch Project Primus
Research Project Primus
Predrag Terzic
 
IIT JAM Mathematical Statistics - MS 2022 | Sourav Sir's Classes
IIT JAM Mathematical Statistics - MS 2022 | Sourav Sir's ClassesIIT JAM Mathematical Statistics - MS 2022 | Sourav Sir's Classes
IIT JAM Mathematical Statistics - MS 2022 | Sourav Sir's Classes
SOURAV DAS
 
T.I.M.E. JEE Advanced 2013 Solution Paper1
T.I.M.E. JEE Advanced 2013 Solution Paper1T.I.M.E. JEE Advanced 2013 Solution Paper1
T.I.M.E. JEE Advanced 2013 Solution Paper1
askiitians
 
NUMERICAL METHODS -Iterative methods(indirect method)
NUMERICAL METHODS -Iterative methods(indirect method)NUMERICAL METHODS -Iterative methods(indirect method)
NUMERICAL METHODS -Iterative methods(indirect method)
krishnapriya R
 
Hideitsu Hino
Hideitsu HinoHideitsu Hino
Hideitsu Hino
Suurist
 

What's hot (20)

Engineering Mathematics-IV_B.Tech_Semester-IV_Unit-II
Engineering Mathematics-IV_B.Tech_Semester-IV_Unit-IIEngineering Mathematics-IV_B.Tech_Semester-IV_Unit-II
Engineering Mathematics-IV_B.Tech_Semester-IV_Unit-II
 
Automated theorem proving for special functions: the next phase
Automated theorem proving for special functions: the next phaseAutomated theorem proving for special functions: the next phase
Automated theorem proving for special functions: the next phase
 
Stochastic Hydrology Lecture 1: Introduction
Stochastic Hydrology Lecture 1: Introduction Stochastic Hydrology Lecture 1: Introduction
Stochastic Hydrology Lecture 1: Introduction
 
Lecture 2: Stochastic Hydrology
Lecture 2: Stochastic Hydrology Lecture 2: Stochastic Hydrology
Lecture 2: Stochastic Hydrology
 
Introduction to Mathematical Probability
Introduction to Mathematical ProbabilityIntroduction to Mathematical Probability
Introduction to Mathematical Probability
 
Lecture 3: Stochastic Hydrology
Lecture 3: Stochastic HydrologyLecture 3: Stochastic Hydrology
Lecture 3: Stochastic Hydrology
 
Second-order Cosmological Perturbations Engendered by Point-like Masses
Second-order Cosmological Perturbations Engendered by Point-like MassesSecond-order Cosmological Perturbations Engendered by Point-like Masses
Second-order Cosmological Perturbations Engendered by Point-like Masses
 
Numerical Methods: Solution of system of equations
Numerical Methods: Solution of system of equationsNumerical Methods: Solution of system of equations
Numerical Methods: Solution of system of equations
 
Hierarchical matrix techniques for maximum likelihood covariance estimation
Hierarchical matrix techniques for maximum likelihood covariance estimationHierarchical matrix techniques for maximum likelihood covariance estimation
Hierarchical matrix techniques for maximum likelihood covariance estimation
 
Lecture 6: Stochastic Hydrology (Estimation Problem-Kriging-, Conditional Sim...
Lecture 6: Stochastic Hydrology (Estimation Problem-Kriging-, Conditional Sim...Lecture 6: Stochastic Hydrology (Estimation Problem-Kriging-, Conditional Sim...
Lecture 6: Stochastic Hydrology (Estimation Problem-Kriging-, Conditional Sim...
 
Duel of cosmological screening lengths
Duel of cosmological screening lengthsDuel of cosmological screening lengths
Duel of cosmological screening lengths
 
Unit iv complex integration
Unit iv complex integrationUnit iv complex integration
Unit iv complex integration
 
4017
40174017
4017
 
Response Surface in Tensor Train format for Uncertainty Quantification
Response Surface in Tensor Train format for Uncertainty QuantificationResponse Surface in Tensor Train format for Uncertainty Quantification
Response Surface in Tensor Train format for Uncertainty Quantification
 
On Optimization of Manufacturing of a Sense-amplifier Based Flip-flop
On Optimization of Manufacturing of a Sense-amplifier Based Flip-flopOn Optimization of Manufacturing of a Sense-amplifier Based Flip-flop
On Optimization of Manufacturing of a Sense-amplifier Based Flip-flop
 
Research Project Primus
Research Project PrimusResearch Project Primus
Research Project Primus
 
IIT JAM Mathematical Statistics - MS 2022 | Sourav Sir's Classes
IIT JAM Mathematical Statistics - MS 2022 | Sourav Sir's ClassesIIT JAM Mathematical Statistics - MS 2022 | Sourav Sir's Classes
IIT JAM Mathematical Statistics - MS 2022 | Sourav Sir's Classes
 
T.I.M.E. JEE Advanced 2013 Solution Paper1
T.I.M.E. JEE Advanced 2013 Solution Paper1T.I.M.E. JEE Advanced 2013 Solution Paper1
T.I.M.E. JEE Advanced 2013 Solution Paper1
 
NUMERICAL METHODS -Iterative methods(indirect method)
NUMERICAL METHODS -Iterative methods(indirect method)NUMERICAL METHODS -Iterative methods(indirect method)
NUMERICAL METHODS -Iterative methods(indirect method)
 
Hideitsu Hino
Hideitsu HinoHideitsu Hino
Hideitsu Hino
 

Viewers also liked

Статистичний аналіз ЗНО 2009 - 2011
Статистичний аналіз ЗНО 2009 - 2011Статистичний аналіз ЗНО 2009 - 2011
Статистичний аналіз ЗНО 2009 - 2011
Vladimir Bakhrushin
 
Кластерний аналіз даних методом k-середніх в R
Кластерний аналіз даних методом k-середніх в RКластерний аналіз даних методом k-середніх в R
Кластерний аналіз даних методом k-середніх в R
Vladimir Bakhrushin
 
Деякі графічні засоби R
Деякі графічні засоби RДеякі графічні засоби R
Деякі графічні засоби R
Vladimir Bakhrushin
 
Часові ряди: випадкова складова
Часові ряди: випадкова складоваЧасові ряди: випадкова складова
Часові ряди: випадкова складова
Vladimir Bakhrushin
 
ОПЫТ ИСПОЛЬЗОВАНИЯ ЭЛЕКТРОННЫХ КУРСОВ ПО АНАЛИЗУ ДАННЫХ
ОПЫТ ИСПОЛЬЗОВАНИЯ ЭЛЕКТРОННЫХ КУРСОВ ПО АНАЛИЗУ ДАННЫХ ОПЫТ ИСПОЛЬЗОВАНИЯ ЭЛЕКТРОННЫХ КУРСОВ ПО АНАЛИЗУ ДАННЫХ
ОПЫТ ИСПОЛЬЗОВАНИЯ ЭЛЕКТРОННЫХ КУРСОВ ПО АНАЛИЗУ ДАННЫХ Vladimir Bakhrushin
 
Нові методи статистичного аналізу складних систем_ Львів 2012
Нові методи статистичного аналізу складних систем_ Львів 2012Нові методи статистичного аналізу складних систем_ Львів 2012
Нові методи статистичного аналізу складних систем_ Львів 2012Vladimir Bakhrushin
 
ЯКІСТЬ ВИЩОЇ ОСВІТИ ТА СУЧАСНІ ПІДХОДИ ДО ЇЇ ВИМІРЮВАННЯ
ЯКІСТЬ ВИЩОЇ ОСВІТИ ТА СУЧАСНІ ПІДХОДИ ДО ЇЇ ВИМІРЮВАННЯЯКІСТЬ ВИЩОЇ ОСВІТИ ТА СУЧАСНІ ПІДХОДИ ДО ЇЇ ВИМІРЮВАННЯ
ЯКІСТЬ ВИЩОЇ ОСВІТИ ТА СУЧАСНІ ПІДХОДИ ДО ЇЇ ВИМІРЮВАННЯVladimir Bakhrushin
 
Робота з файлами даних в R, блоки виразів, цикли, функції
Робота з файлами даних в R, блоки виразів, цикли, функціїРобота з файлами даних в R, блоки виразів, цикли, функції
Робота з файлами даних в R, блоки виразів, цикли, функції
Vladimir Bakhrushin
 
Миссия университетов
Миссия университетовМиссия университетов
Миссия университетов
Vladimir Bakhrushin
 
Plot function in R
Plot function in RPlot function in R
Plot function in R
Vladimir Bakhrushin
 
Statistical analysis of world university rankings (report for PDMU-2010)
Statistical analysis of world university rankings (report for PDMU-2010)Statistical analysis of world university rankings (report for PDMU-2010)
Statistical analysis of world university rankings (report for PDMU-2010)
Vladimir Bakhrushin
 
Statistical analysis of university rankings
Statistical analysis of university rankingsStatistical analysis of university rankings
Statistical analysis of university rankings
Vladimir Bakhrushin
 
Часові ряди: моделі
Часові ряди: моделіЧасові ряди: моделі
Часові ряди: моделі
Vladimir Bakhrushin
 
Starting work with R
Starting work with RStarting work with R
Starting work with R
Vladimir Bakhrushin
 
Функція plot() в R
Функція plot() в RФункція plot() в R
Функція plot() в R
Vladimir Bakhrushin
 
Cluster analysis using k-means method in R
Cluster analysis using k-means method in RCluster analysis using k-means method in R
Cluster analysis using k-means method in R
Vladimir Bakhrushin
 
Критерий максимакса
Критерий максимаксаКритерий максимакса
Критерий максимакса
Vladimir Bakhrushin
 
Нові застосування статистичних методів в прикладних дослідженнях
Нові застосування статистичних методів в прикладних дослідженняхНові застосування статистичних методів в прикладних дослідженнях
Нові застосування статистичних методів в прикладних дослідженнях
Vladimir Bakhrushin
 
Критерий максимина
Критерий максиминаКритерий максимина
Критерий максимина
Vladimir Bakhrushin
 

Viewers also liked (19)

Статистичний аналіз ЗНО 2009 - 2011
Статистичний аналіз ЗНО 2009 - 2011Статистичний аналіз ЗНО 2009 - 2011
Статистичний аналіз ЗНО 2009 - 2011
 
Кластерний аналіз даних методом k-середніх в R
Кластерний аналіз даних методом k-середніх в RКластерний аналіз даних методом k-середніх в R
Кластерний аналіз даних методом k-середніх в R
 
Деякі графічні засоби R
Деякі графічні засоби RДеякі графічні засоби R
Деякі графічні засоби R
 
Часові ряди: випадкова складова
Часові ряди: випадкова складоваЧасові ряди: випадкова складова
Часові ряди: випадкова складова
 
ОПЫТ ИСПОЛЬЗОВАНИЯ ЭЛЕКТРОННЫХ КУРСОВ ПО АНАЛИЗУ ДАННЫХ
ОПЫТ ИСПОЛЬЗОВАНИЯ ЭЛЕКТРОННЫХ КУРСОВ ПО АНАЛИЗУ ДАННЫХ ОПЫТ ИСПОЛЬЗОВАНИЯ ЭЛЕКТРОННЫХ КУРСОВ ПО АНАЛИЗУ ДАННЫХ
ОПЫТ ИСПОЛЬЗОВАНИЯ ЭЛЕКТРОННЫХ КУРСОВ ПО АНАЛИЗУ ДАННЫХ
 
Нові методи статистичного аналізу складних систем_ Львів 2012
Нові методи статистичного аналізу складних систем_ Львів 2012Нові методи статистичного аналізу складних систем_ Львів 2012
Нові методи статистичного аналізу складних систем_ Львів 2012
 
ЯКІСТЬ ВИЩОЇ ОСВІТИ ТА СУЧАСНІ ПІДХОДИ ДО ЇЇ ВИМІРЮВАННЯ
ЯКІСТЬ ВИЩОЇ ОСВІТИ ТА СУЧАСНІ ПІДХОДИ ДО ЇЇ ВИМІРЮВАННЯЯКІСТЬ ВИЩОЇ ОСВІТИ ТА СУЧАСНІ ПІДХОДИ ДО ЇЇ ВИМІРЮВАННЯ
ЯКІСТЬ ВИЩОЇ ОСВІТИ ТА СУЧАСНІ ПІДХОДИ ДО ЇЇ ВИМІРЮВАННЯ
 
Робота з файлами даних в R, блоки виразів, цикли, функції
Робота з файлами даних в R, блоки виразів, цикли, функціїРобота з файлами даних в R, блоки виразів, цикли, функції
Робота з файлами даних в R, блоки виразів, цикли, функції
 
Миссия университетов
Миссия университетовМиссия университетов
Миссия университетов
 
Plot function in R
Plot function in RPlot function in R
Plot function in R
 
Statistical analysis of world university rankings (report for PDMU-2010)
Statistical analysis of world university rankings (report for PDMU-2010)Statistical analysis of world university rankings (report for PDMU-2010)
Statistical analysis of world university rankings (report for PDMU-2010)
 
Statistical analysis of university rankings
Statistical analysis of university rankingsStatistical analysis of university rankings
Statistical analysis of university rankings
 
Часові ряди: моделі
Часові ряди: моделіЧасові ряди: моделі
Часові ряди: моделі
 
Starting work with R
Starting work with RStarting work with R
Starting work with R
 
Функція plot() в R
Функція plot() в RФункція plot() в R
Функція plot() в R
 
Cluster analysis using k-means method in R
Cluster analysis using k-means method in RCluster analysis using k-means method in R
Cluster analysis using k-means method in R
 
Критерий максимакса
Критерий максимаксаКритерий максимакса
Критерий максимакса
 
Нові застосування статистичних методів в прикладних дослідженнях
Нові застосування статистичних методів в прикладних дослідженняхНові застосування статистичних методів в прикладних дослідженнях
Нові застосування статистичних методів в прикладних дослідженнях
 
Критерий максимина
Критерий максиминаКритерий максимина
Критерий максимина
 

Similar to Identification of the Mathematical Models of Complex Relaxation Processes in Solids

Ph ddefence
Ph ddefencePh ddefence
Discrete Nonlinear Optimal Control of S/C Formations Near The L1 and L2 poi...
  Discrete Nonlinear Optimal Control of S/C Formations Near The L1 and L2 poi...  Discrete Nonlinear Optimal Control of S/C Formations Near The L1 and L2 poi...
Discrete Nonlinear Optimal Control of S/C Formations Near The L1 and L2 poi...
Belinda Marchand
 
Rosser's theorem
Rosser's theoremRosser's theorem
Rosser's theorem
Wathna
 
Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...
Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...
Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...
Shizuoka Inst. Science and Tech.
 
Bayesian inference on mixtures
Bayesian inference on mixturesBayesian inference on mixtures
Bayesian inference on mixtures
Christian Robert
 
The Queue Length of a GI M 1 Queue with Set Up Period and Bernoulli Working V...
The Queue Length of a GI M 1 Queue with Set Up Period and Bernoulli Working V...The Queue Length of a GI M 1 Queue with Set Up Period and Bernoulli Working V...
The Queue Length of a GI M 1 Queue with Set Up Period and Bernoulli Working V...
YogeshIJTSRD
 
Litvinenko low-rank kriging +FFT poster
Litvinenko low-rank kriging +FFT  posterLitvinenko low-rank kriging +FFT  poster
Litvinenko low-rank kriging +FFT poster
Alexander Litvinenko
 
Smoothed Particle Galerkin Method Formulation.pdf
Smoothed Particle Galerkin Method Formulation.pdfSmoothed Particle Galerkin Method Formulation.pdf
Smoothed Particle Galerkin Method Formulation.pdf
keansheng
 
Ray : modeling dynamic systems
Ray : modeling dynamic systemsRay : modeling dynamic systems
Ray : modeling dynamic systems
Houw Liong The
 
002 ray modeling dynamic systems
002 ray modeling dynamic systems002 ray modeling dynamic systems
002 ray modeling dynamic systems
Institute of Technology Telkom
 
002 ray modeling dynamic systems
002 ray modeling dynamic systems002 ray modeling dynamic systems
002 ray modeling dynamic systems
Institute of Technology Telkom
 
Phase diagram at finite T & Mu in strong coupling limit of lattice QCD
Phase diagram at finite T & Mu in strong coupling limit of lattice QCDPhase diagram at finite T & Mu in strong coupling limit of lattice QCD
Phase diagram at finite T & Mu in strong coupling limit of lattice QCD
Benjamin Jaedon Choi
 
NITheP UKZN Seminar: Prof. Alexander Gorokhov (Samara State University, Russi...
NITheP UKZN Seminar: Prof. Alexander Gorokhov (Samara State University, Russi...NITheP UKZN Seminar: Prof. Alexander Gorokhov (Samara State University, Russi...
NITheP UKZN Seminar: Prof. Alexander Gorokhov (Samara State University, Russi...
Rene Kotze
 
Data sparse approximation of the Karhunen-Loeve expansion
Data sparse approximation of the Karhunen-Loeve expansionData sparse approximation of the Karhunen-Loeve expansion
Data sparse approximation of the Karhunen-Loeve expansion
Alexander Litvinenko
 
Delayed acceptance for Metropolis-Hastings algorithms
Delayed acceptance for Metropolis-Hastings algorithmsDelayed acceptance for Metropolis-Hastings algorithms
Delayed acceptance for Metropolis-Hastings algorithms
Christian Robert
 
Formations Near The Libration Points: Design Strategies Using Natural And Non...
Formations Near The Libration Points: Design Strategies Using Natural And Non...Formations Near The Libration Points: Design Strategies Using Natural And Non...
Formations Near The Libration Points: Design Strategies Using Natural And Non...
Belinda Marchand
 
Digital Signal Processing
Digital Signal ProcessingDigital Signal Processing
Digital Signal Processing
aj ahmed
 
Time-Response Lecture
Time-Response LectureTime-Response Lecture
Time-Response Lecture
s2021677
 
Application of parallel hierarchical matrices and low-rank tensors in spatial...
Application of parallel hierarchical matrices and low-rank tensors in spatial...Application of parallel hierarchical matrices and low-rank tensors in spatial...
Application of parallel hierarchical matrices and low-rank tensors in spatial...
Alexander Litvinenko
 

Similar to Identification of the Mathematical Models of Complex Relaxation Processes in Solids (20)

Ph ddefence
Ph ddefencePh ddefence
Ph ddefence
 
Discrete Nonlinear Optimal Control of S/C Formations Near The L1 and L2 poi...
  Discrete Nonlinear Optimal Control of S/C Formations Near The L1 and L2 poi...  Discrete Nonlinear Optimal Control of S/C Formations Near The L1 and L2 poi...
Discrete Nonlinear Optimal Control of S/C Formations Near The L1 and L2 poi...
 
Rosser's theorem
Rosser's theoremRosser's theorem
Rosser's theorem
 
Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...
Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...
Talk at SciCADE2013 about "Accelerated Multiple Precision ODE solver base on ...
 
05_AJMS_332_21.pdf
05_AJMS_332_21.pdf05_AJMS_332_21.pdf
05_AJMS_332_21.pdf
 
Bayesian inference on mixtures
Bayesian inference on mixturesBayesian inference on mixtures
Bayesian inference on mixtures
 
The Queue Length of a GI M 1 Queue with Set Up Period and Bernoulli Working V...
The Queue Length of a GI M 1 Queue with Set Up Period and Bernoulli Working V...The Queue Length of a GI M 1 Queue with Set Up Period and Bernoulli Working V...
The Queue Length of a GI M 1 Queue with Set Up Period and Bernoulli Working V...
 
Litvinenko low-rank kriging +FFT poster
Litvinenko low-rank kriging +FFT  posterLitvinenko low-rank kriging +FFT  poster
Litvinenko low-rank kriging +FFT poster
 
Smoothed Particle Galerkin Method Formulation.pdf
Smoothed Particle Galerkin Method Formulation.pdfSmoothed Particle Galerkin Method Formulation.pdf
Smoothed Particle Galerkin Method Formulation.pdf
 
Ray : modeling dynamic systems
Ray : modeling dynamic systemsRay : modeling dynamic systems
Ray : modeling dynamic systems
 
002 ray modeling dynamic systems
002 ray modeling dynamic systems002 ray modeling dynamic systems
002 ray modeling dynamic systems
 
002 ray modeling dynamic systems
002 ray modeling dynamic systems002 ray modeling dynamic systems
002 ray modeling dynamic systems
 
Phase diagram at finite T & Mu in strong coupling limit of lattice QCD
Phase diagram at finite T & Mu in strong coupling limit of lattice QCDPhase diagram at finite T & Mu in strong coupling limit of lattice QCD
Phase diagram at finite T & Mu in strong coupling limit of lattice QCD
 
NITheP UKZN Seminar: Prof. Alexander Gorokhov (Samara State University, Russi...
NITheP UKZN Seminar: Prof. Alexander Gorokhov (Samara State University, Russi...NITheP UKZN Seminar: Prof. Alexander Gorokhov (Samara State University, Russi...
NITheP UKZN Seminar: Prof. Alexander Gorokhov (Samara State University, Russi...
 
Data sparse approximation of the Karhunen-Loeve expansion
Data sparse approximation of the Karhunen-Loeve expansionData sparse approximation of the Karhunen-Loeve expansion
Data sparse approximation of the Karhunen-Loeve expansion
 
Delayed acceptance for Metropolis-Hastings algorithms
Delayed acceptance for Metropolis-Hastings algorithmsDelayed acceptance for Metropolis-Hastings algorithms
Delayed acceptance for Metropolis-Hastings algorithms
 
Formations Near The Libration Points: Design Strategies Using Natural And Non...
Formations Near The Libration Points: Design Strategies Using Natural And Non...Formations Near The Libration Points: Design Strategies Using Natural And Non...
Formations Near The Libration Points: Design Strategies Using Natural And Non...
 
Digital Signal Processing
Digital Signal ProcessingDigital Signal Processing
Digital Signal Processing
 
Time-Response Lecture
Time-Response LectureTime-Response Lecture
Time-Response Lecture
 
Application of parallel hierarchical matrices and low-rank tensors in spatial...
Application of parallel hierarchical matrices and low-rank tensors in spatial...Application of parallel hierarchical matrices and low-rank tensors in spatial...
Application of parallel hierarchical matrices and low-rank tensors in spatial...
 

More from Vladimir Bakhrushin

Decision-making on assessment of higher education institutions under uncertainty
Decision-making on assessment of higher education institutions under uncertaintyDecision-making on assessment of higher education institutions under uncertainty
Decision-making on assessment of higher education institutions under uncertainty
Vladimir Bakhrushin
 
Якими бути стандартам вищої освіти для докторів філософії
Якими бути стандартам вищої освіти для докторів філософіїЯкими бути стандартам вищої освіти для докторів філософії
Якими бути стандартам вищої освіти для докторів філософії
Vladimir Bakhrushin
 
Академічна автономія і трансформація української освіти
Академічна автономія і трансформація української освітиАкадемічна автономія і трансформація української освіти
Академічна автономія і трансформація української освіти
Vladimir Bakhrushin
 
Оптимізація в освіті і управлінні
Оптимізація в освіті і управлінні Оптимізація в освіті і управлінні
Оптимізація в освіті і управлінні
Vladimir Bakhrushin
 
Мій 2015
Мій 2015Мій 2015
Мій 2015
Vladimir Bakhrushin
 
Українські університети: Сучасні виклики та можливі відповіді
Українські університети: Сучасні виклики та можливі відповідіУкраїнські університети: Сучасні виклики та можливі відповіді
Українські університети: Сучасні виклики та можливі відповіді
Vladimir Bakhrushin
 
Два проекти закону україни
Два проекти закону україниДва проекти закону україни
Два проекти закону україни
Vladimir Bakhrushin
 
Окремі аспекти реформування освіти України з погляду системного підходу
Окремі аспекти реформування освіти України з погляду системного підходуОкремі аспекти реформування освіти України з погляду системного підходу
Окремі аспекти реформування освіти України з погляду системного підходу
Vladimir Bakhrushin
 
Decision-making in education based on multi-criteria ranking of alternatives
Decision-making in education based on multi-criteria ranking of alternativesDecision-making in education based on multi-criteria ranking of alternatives
Decision-making in education based on multi-criteria ranking of alternatives
Vladimir Bakhrushin
 
Деякі проблеми прийняття рішень в освіті
Деякі проблеми прийняття рішень в освітіДеякі проблеми прийняття рішень в освіті
Деякі проблеми прийняття рішень в освіті
Vladimir Bakhrushin
 
Закон про освіту
Закон про освітуЗакон про освіту
Закон про освіту
Vladimir Bakhrushin
 
Описова статистика в R
Описова статистика в RОписова статистика в R
Описова статистика в R
Vladimir Bakhrushin
 
Files,blocks and functions in R
Files,blocks and functions in RFiles,blocks and functions in R
Files,blocks and functions in R
Vladimir Bakhrushin
 
Парадоксы голосования
Парадоксы голосованияПарадоксы голосования
Парадоксы голосования
Vladimir Bakhrushin
 
Начало работы в R
Начало работы в RНачало работы в R
Начало работы в R
Vladimir Bakhrushin
 
Початок роботи в R: змінні, вектори та матриці
Початок роботи в R: змінні, вектори та матриціПочаток роботи в R: змінні, вектори та матриці
Початок роботи в R: змінні, вектори та матриці
Vladimir Bakhrushin
 
Часові ряди: основні поняття та характеристики
Часові ряди: основні поняття та характеристикиЧасові ряди: основні поняття та характеристики
Часові ряди: основні поняття та характеристики
Vladimir Bakhrushin
 
Критерий Сэвиджа
Критерий СэвиджаКритерий Сэвиджа
Критерий Сэвиджа
Vladimir Bakhrushin
 
Критерий Гурвица
Критерий ГурвицаКритерий Гурвица
Критерий Гурвица
Vladimir Bakhrushin
 

More from Vladimir Bakhrushin (19)

Decision-making on assessment of higher education institutions under uncertainty
Decision-making on assessment of higher education institutions under uncertaintyDecision-making on assessment of higher education institutions under uncertainty
Decision-making on assessment of higher education institutions under uncertainty
 
Якими бути стандартам вищої освіти для докторів філософії
Якими бути стандартам вищої освіти для докторів філософіїЯкими бути стандартам вищої освіти для докторів філософії
Якими бути стандартам вищої освіти для докторів філософії
 
Академічна автономія і трансформація української освіти
Академічна автономія і трансформація української освітиАкадемічна автономія і трансформація української освіти
Академічна автономія і трансформація української освіти
 
Оптимізація в освіті і управлінні
Оптимізація в освіті і управлінні Оптимізація в освіті і управлінні
Оптимізація в освіті і управлінні
 
Мій 2015
Мій 2015Мій 2015
Мій 2015
 
Українські університети: Сучасні виклики та можливі відповіді
Українські університети: Сучасні виклики та можливі відповідіУкраїнські університети: Сучасні виклики та можливі відповіді
Українські університети: Сучасні виклики та можливі відповіді
 
Два проекти закону україни
Два проекти закону україниДва проекти закону україни
Два проекти закону україни
 
Окремі аспекти реформування освіти України з погляду системного підходу
Окремі аспекти реформування освіти України з погляду системного підходуОкремі аспекти реформування освіти України з погляду системного підходу
Окремі аспекти реформування освіти України з погляду системного підходу
 
Decision-making in education based on multi-criteria ranking of alternatives
Decision-making in education based on multi-criteria ranking of alternativesDecision-making in education based on multi-criteria ranking of alternatives
Decision-making in education based on multi-criteria ranking of alternatives
 
Деякі проблеми прийняття рішень в освіті
Деякі проблеми прийняття рішень в освітіДеякі проблеми прийняття рішень в освіті
Деякі проблеми прийняття рішень в освіті
 
Закон про освіту
Закон про освітуЗакон про освіту
Закон про освіту
 
Описова статистика в R
Описова статистика в RОписова статистика в R
Описова статистика в R
 
Files,blocks and functions in R
Files,blocks and functions in RFiles,blocks and functions in R
Files,blocks and functions in R
 
Парадоксы голосования
Парадоксы голосованияПарадоксы голосования
Парадоксы голосования
 
Начало работы в R
Начало работы в RНачало работы в R
Начало работы в R
 
Початок роботи в R: змінні, вектори та матриці
Початок роботи в R: змінні, вектори та матриціПочаток роботи в R: змінні, вектори та матриці
Початок роботи в R: змінні, вектори та матриці
 
Часові ряди: основні поняття та характеристики
Часові ряди: основні поняття та характеристикиЧасові ряди: основні поняття та характеристики
Часові ряди: основні поняття та характеристики
 
Критерий Сэвиджа
Критерий СэвиджаКритерий Сэвиджа
Критерий Сэвиджа
 
Критерий Гурвица
Критерий ГурвицаКритерий Гурвица
Критерий Гурвица
 

Recently uploaded

Monitoring Java Application Security with JDK Tools and JFR Events
Monitoring Java Application Security with JDK Tools and JFR EventsMonitoring Java Application Security with JDK Tools and JFR Events
Monitoring Java Application Security with JDK Tools and JFR Events
Ana-Maria Mihalceanu
 
A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
sonjaschweigert1
 
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfObservability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Paige Cruz
 
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdf
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdfSAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdf
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdf
Peter Spielvogel
 
Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !
KatiaHIMEUR1
 
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdfFIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance
 
When stars align: studies in data quality, knowledge graphs, and machine lear...
When stars align: studies in data quality, knowledge graphs, and machine lear...When stars align: studies in data quality, knowledge graphs, and machine lear...
When stars align: studies in data quality, knowledge graphs, and machine lear...
Elena Simperl
 
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
Thierry Lestable
 
Assuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyesAssuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyes
ThousandEyes
 
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Albert Hoitingh
 
The Art of the Pitch: WordPress Relationships and Sales
The Art of the Pitch: WordPress Relationships and SalesThe Art of the Pitch: WordPress Relationships and Sales
The Art of the Pitch: WordPress Relationships and Sales
Laura Byrne
 
The Future of Platform Engineering
The Future of Platform EngineeringThe Future of Platform Engineering
The Future of Platform Engineering
Jemma Hussein Allen
 
UiPath Test Automation using UiPath Test Suite series, part 4
UiPath Test Automation using UiPath Test Suite series, part 4UiPath Test Automation using UiPath Test Suite series, part 4
UiPath Test Automation using UiPath Test Suite series, part 4
DianaGray10
 
FIDO Alliance Osaka Seminar: Overview.pdf
FIDO Alliance Osaka Seminar: Overview.pdfFIDO Alliance Osaka Seminar: Overview.pdf
FIDO Alliance Osaka Seminar: Overview.pdf
FIDO Alliance
 
Elizabeth Buie - Older adults: Are we really designing for our future selves?
Elizabeth Buie - Older adults: Are we really designing for our future selves?Elizabeth Buie - Older adults: Are we really designing for our future selves?
Elizabeth Buie - Older adults: Are we really designing for our future selves?
Nexer Digital
 
GraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge GraphGraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge Graph
Guy Korland
 
Leading Change strategies and insights for effective change management pdf 1.pdf
Leading Change strategies and insights for effective change management pdf 1.pdfLeading Change strategies and insights for effective change management pdf 1.pdf
Leading Change strategies and insights for effective change management pdf 1.pdf
OnBoard
 
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Ramesh Iyer
 
Elevating Tactical DDD Patterns Through Object Calisthenics
Elevating Tactical DDD Patterns Through Object CalisthenicsElevating Tactical DDD Patterns Through Object Calisthenics
Elevating Tactical DDD Patterns Through Object Calisthenics
Dorra BARTAGUIZ
 
Bits & Pixels using AI for Good.........
Bits & Pixels using AI for Good.........Bits & Pixels using AI for Good.........
Bits & Pixels using AI for Good.........
Alison B. Lowndes
 

Recently uploaded (20)

Monitoring Java Application Security with JDK Tools and JFR Events
Monitoring Java Application Security with JDK Tools and JFR EventsMonitoring Java Application Security with JDK Tools and JFR Events
Monitoring Java Application Security with JDK Tools and JFR Events
 
A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...A tale of scale & speed: How the US Navy is enabling software delivery from l...
A tale of scale & speed: How the US Navy is enabling software delivery from l...
 
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfObservability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdf
 
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdf
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdfSAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdf
SAP Sapphire 2024 - ASUG301 building better apps with SAP Fiori.pdf
 
Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !Securing your Kubernetes cluster_ a step-by-step guide to success !
Securing your Kubernetes cluster_ a step-by-step guide to success !
 
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdfFIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
FIDO Alliance Osaka Seminar: Passkeys at Amazon.pdf
 
When stars align: studies in data quality, knowledge graphs, and machine lear...
When stars align: studies in data quality, knowledge graphs, and machine lear...When stars align: studies in data quality, knowledge graphs, and machine lear...
When stars align: studies in data quality, knowledge graphs, and machine lear...
 
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
Empowering NextGen Mobility via Large Action Model Infrastructure (LAMI): pav...
 
Assuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyesAssuring Contact Center Experiences for Your Customers With ThousandEyes
Assuring Contact Center Experiences for Your Customers With ThousandEyes
 
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024
 
The Art of the Pitch: WordPress Relationships and Sales
The Art of the Pitch: WordPress Relationships and SalesThe Art of the Pitch: WordPress Relationships and Sales
The Art of the Pitch: WordPress Relationships and Sales
 
The Future of Platform Engineering
The Future of Platform EngineeringThe Future of Platform Engineering
The Future of Platform Engineering
 
UiPath Test Automation using UiPath Test Suite series, part 4
UiPath Test Automation using UiPath Test Suite series, part 4UiPath Test Automation using UiPath Test Suite series, part 4
UiPath Test Automation using UiPath Test Suite series, part 4
 
FIDO Alliance Osaka Seminar: Overview.pdf
FIDO Alliance Osaka Seminar: Overview.pdfFIDO Alliance Osaka Seminar: Overview.pdf
FIDO Alliance Osaka Seminar: Overview.pdf
 
Elizabeth Buie - Older adults: Are we really designing for our future selves?
Elizabeth Buie - Older adults: Are we really designing for our future selves?Elizabeth Buie - Older adults: Are we really designing for our future selves?
Elizabeth Buie - Older adults: Are we really designing for our future selves?
 
GraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge GraphGraphRAG is All You need? LLM & Knowledge Graph
GraphRAG is All You need? LLM & Knowledge Graph
 
Leading Change strategies and insights for effective change management pdf 1.pdf
Leading Change strategies and insights for effective change management pdf 1.pdfLeading Change strategies and insights for effective change management pdf 1.pdf
Leading Change strategies and insights for effective change management pdf 1.pdf
 
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
Builder.ai Founder Sachin Dev Duggal's Strategic Approach to Create an Innova...
 
Elevating Tactical DDD Patterns Through Object Calisthenics
Elevating Tactical DDD Patterns Through Object CalisthenicsElevating Tactical DDD Patterns Through Object Calisthenics
Elevating Tactical DDD Patterns Through Object Calisthenics
 
Bits & Pixels using AI for Good.........
Bits & Pixels using AI for Good.........Bits & Pixels using AI for Good.........
Bits & Pixels using AI for Good.........
 

Identification of the Mathematical Models of Complex Relaxation Processes in Solids

  • 1. Identification of theIdentification of the Mathematical Models ofMathematical Models of Complex Relaxation ProcessesComplex Relaxation Processes in Solidsin Solids Bakhrushin V.E.Bakhrushin V.E. University of HumanitiesUniversity of Humanities “ZISMG”, Zaporozhye, Ukraine“ZISMG”, Zaporozhye, Ukraine
  • 2. Relaxation processes: - internal friction; - dispersion of modulus; - stress relaxation; - elastic aftereffect. Parameters: - interstitial concentrations for different states; - interstitial solubility; - local diffusion coefficients; - activation energies for jumps.
  • 3. Identification tasks 1. To choose the type of mathematical model: ideal Debay peak (model of the standard linear body); the sum of ideal peaks (processes); enhanced Debay peak; the sum of enhanced peaks; the sum of peaks + background. 2. To determine the quantity of relaxation processes 3. To determine the parameters of relaxation processes
  • 4. ( ) n 1 1 1 1 i 0 0i i 1 0i E E 1 1 Q T Q exp Q cosh RT R T T − − − − =     = − + −  ÷ ÷      ∑ 0i i 0i kT E RT ln hf = Model of spectrum at Snoeck relaxation area: 1 0Q ,E− – background intensity and activation energy; 1 0i 0iQ ,T− – i-th peak height and temperature – i-th peak activation energy f – sample vibration frequency
  • 5. Parameters, which must be determined are: 1 0i 0in,Q ,T− or 1 0i in,Q ,E− ( )0,14139 0,003245 0T 12,89967 2,706674f 0,04547 0,04929f E,= + + − + An error for 300 – 800 К interval at f = 20 – 60 Hz is not more, then 1 % From Wert & Marx formula such approximation may be obtained: ( )( ) m 2 1 1 j j j 1 S Q Q T min− − = = − →∑ ( )( ) 2 1 1 m j j 1 2 j 1 j Q Q T S min − − = − = → σ ∑
  • 6. ( ) ( ) 2 exp z/ z  − β  ψ = β π ( )mz ln /= τ τ z2β = σ Peak enhance may be taken into account by the model of log-normal distribution of relaxation time:
  • 7. max max id δ ρ = δ 2 0,0853 0,197 0,970ρ = ϕ + ϕ + n 1 1 1 i 0i i 1 0i E 1 1 Q Q cosh R T T − − − =    = −  ÷ ρ   ∑ In this case: ( )mlnϕ = ωτ For ρ value from N.P. Kushnareva & V.S. Petchersky data such approximation may be obtained:
  • 8. Graphic decomposition 2 peaks without error -8 -4 0 4 1,4 1,7 2 2,3 arcch(Q-1 m/Q-1 ) 103 /T
  • 9. 4 peaks + error -6 -3 0 3 6 1,2 1,5 1,8 2,1 2,4 arcch(Q-1 m/Q-1 )
  • 10. Linear least-squares method: ( ) n 1 j i i j i i 1 x A cosh [B (x c )]− = ϕ = −∑ 1 i 0i j j i 0iA Q , x 1/T , c 1/T− = = = i i i 1 k B ln c hfc =
  • 11. ( ) ( ) ( ) ( ) ( ) ( ) n j j j j 1 1 n j j j j 1 2 n j j j j 1 n x y x 0; A x y x 0; A x y x 0, A = = = ∂ϕ  − ϕ =  ∂ ∂ϕ  − ϕ =  ∂ ∂ϕ  − ϕ =  ∂ ∑ ∑ ∑ LLLLLLLLLLLL
  • 12. ( )j 1 i j i ij i x cosh [B (x c )] F A − ∂ϕ = − = ∂ n n n n 2 1 1j 2 1j 2 j n 1j nj j 1j j 1 j 1 j 1 j 1 n n n n 2 1 2 j 1j 2 2 j n 2 j nj j 2 j j 1 j 1 j 1 j 1 1 nj 1j 2 nj A F A F F A F F y F ; A F F A F A F F y F ; . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . A F F A F = = = = = = = = + + + = + + + = + ∑ ∑ ∑ ∑ ∑ ∑ ∑ ∑ L L n n n n 2 2 j n nj j nj j 1 j 1 j 1 j 1 F A F y F = = = = + + =∑ ∑ ∑ ∑L
  • 13. 1 11 2 12 n 1n 1 1 21 2 22 n 2n 21 1 n1 2 n2 n nn n A W A W ... A W Z ; A W A W ... A W Z ; . . . . . . . . . . . . . . . . . . . . . . . . . . A W A W ... A W Z , + + + =  + + + =    + + + = n 1 1 ik i k j 1 j i j k 1 1 1 1 W cosh B cosh B x c x c − − =          = − − ÷ ÷  ÷  ÷  ÷ ÷         ∑ n 1 i i i j 1 j i 1 1 Z y cosh B x c − =    = −  ÷ ÷     ∑
  • 14. The advantages of linear least-squares method: - simple realization; - sufficient accuracy (up to 10 % for the main peaks heights) Method disadvantages: - linearization error; - necessity of peak temperatures preliminary definition; - possibility to obtain an ill-condition system; - supposition of uniformly precise of the data; - supposition of absolute accuracy of temperature measurements; - possibility of obtaining the negative values of peak heights.
  • 15. The method of gradient descent (linearized least square method) Main differences: - an expression of ideal peak is linearized by Taylor series expansion in the neighborhood of some point (initial estimate) with abandonment of only linear terms; - the possibility to choose the different types of objective function (cancellation of supposition that the data have the same errors) [L. Crer et. al, 1969; M.S. Ahmad et. al, 1971; O.N. Razumov et. al., 1974; A.I. Efimov et. al., 1982.]
  • 16. ( )( ) ( ) 1 1 1m j j 2 j 1 j k Q Q T Q T 0, k 1,2,...q a − − − = − ∂ = = σ ∂ ∑ { }1 1 1 0 01 0n 1 n 01 0na E,Q ,Q ,...,Q ,E ,...,E ,T ,...,T− − − = q 3n 2= + ( )( ) 2 1 1 m j j 1 2 j 1 j Q Q T S min − − = − = → σ ∑ From we can obtain: at general case, q 3n= without background, q 2n= for ideal Debay peaks.
  • 17. After linearization we obtain: ( ) ( ) m 0 1 k k k mkm 1 a a a M Z ,− = ∆ = − = ∑l ( ) ( )1 1m k 2 j 1 j k Q T Q T1 M , a a − − =  ∂ ∂ =  ÷ ÷σ ∂ ∂  ∑l l ( )( ) ( ) 1 1 1m j j 2 j 1 j Q Q T Q T Z , a − − − = − ∂ = σ ∂ ∑l l where: derivatives are determined in 0 ka
  • 18. Adjusted values: 0 k k ka a a , 0 1.= + γ∆ < γ ≤ From the definition of ka∆ follows, that it corresponds with the general formula of gradient search methods: 0 k k 1a a gradS .= −β Gradient methods realize an iteration procedure, in which such stopping conditions may be used: p p 1 k ka a ;− − < ε p p 1 1 1S S ;− − < δ 1gradS ;< ξ , , 0.ε δ ξ >
  • 19. Problems and disadvantages: - poor convergence at the case of large number of peaks; - possibility of iteration stopping at the critical point, which is not the point of minimum; - possibility of getting into a loop, when the objective functional S is ravine; - absence of realization at standard libraries of the most popular software packages; - М matrix must be positively defined at the every step of iterations
  • 20. ( ) ( )(k 1) (k) 1 (k) (k) H ,+ − = −X X X G X Quasi-Newton algorithm { }1 1 1 0 01 0n 1 n 01 0na E,Q ,Q ,...,Q ,E ,...,E ,T ,...,T− − − = 2 2 2 2 1 1 2 1 q 2 2 2 2 2 1 2 2 q 2 2 2 2 q 1 q 2 q S S S ... a a a a a S S S ... a a a a aH ... ... ... ... S S S ... a a a a a  ∂ ∂ ∂  ÷ ∂ ∂ ∂ ∂ ∂ ÷  ÷∂ ∂ ∂  ÷ ∂ ∂ ∂ ∂ ∂=  ÷  ÷  ÷  ÷∂ ∂ ∂  ÷ ∂ ∂ ∂ ∂ ∂  1 2 q S a S aG ... S a ∂   ÷∂  ÷ ∂ ÷  ÷∂=  ÷  ÷  ÷∂  ÷  ÷∂ 
  • 21. ij ij h , i j; c 0, i j.  = =  ≠ n 1 T 1 k k k k 1 P z , − = = ∑ v v ° 1 1 1 1H C PC , − − − = zk are eigenvalues and vk are eigenvectors of matrix: Grinshtadt technique: 1 1 P C HC ,− − = It is necessary to provide the positive definiteness of Hesse matrix or to find an approximation of Н-1
  • 22. and F is a Fisher criterion value for the corresponding numbers of degrees of freedom and significance level, ∆2 - sum of errors squares (relative errors) of experimental points. Adequacy criteria for spectrum models: 2 S F≤ ∆ 2 F S ∆ ≤ ( )0,052 S F F 2,0...2,5> ≈ ⇒ ∆ number of model parameters must be increased; 2 F S ∆ > ⇒ number of model parameters must be decreased.
  • 23. Quasi-unimodelity (an absence of physically different minimums) of objective functional, that is all minimums of objective functional correspond to the same physical model of a spectrum. Deviation from quasi-unimodality may be caused with: - the presence of excess peaks in the model; - absence of some essential peak in the model; - presence at the real spectrum of some collateral peak, which height is close to measurement error.
  • 24. Absence of model residuals serial correlation (Darbin & Watson criterion): ( ) m 2 j j 1 j 2 m 2 t j 1 e e d , e − = = − = ∑ ∑ ( )1 1 j j je Q Q T− − = − - model residuals. d 2≈ - serial correlation is absent; d 0→ d 4≈ - positive serial correlation; - negative serial correlation (there are excess peaks).
  • 25. 0 5 10 500 600 700 800 Q-1 ·103 T, K Given data (4 peaks + error)
  • 26. Initial approach (4 peaks) σ=0,1
  • 27. 0 4 8 12 500 600 700 800 T, K Q-1 ·103 The result of decomposition S=0,30 F=0,74
  • 28. -0,25 -0,1 0,05 0,2 500 600 700 800 ∆Q-1 ·103 T, K Residuals d=2,18
  • 29. 0 4 8 12 500 600 700 800 T, K Q-1 ·103 Initial approach 1 (3 peaks) σ=0,1
  • 30. 0 4 8 12 500 600 700 800 T, K Q-1 ·103 The result of decomposition 1 (3 peaks) S=20,52 F=50,31
  • 31. -2 -1 0 1 500 600 700 800 ∆Q-1 ·103 T, K Residuals d=0,33
  • 32. 0 4 8 12 500 600 700 800 T, K Q-1 ·103 Initial approach 2 (3 peaks) σ=0,1
  • 33. 0 4 8 12 500 600 700 800 T, K Q-1 ·103 The result of decomposition 2 (3 peaks) S=13,58 F=33,28
  • 34. -2 -1 0 1 500 600 700 800 ∆Q-1 ·103 T, K Residuals d=0,54
  • 35. 0 4 8 12 500 600 700 800 Q-1 ·103 T, K Initial approach 1 (5 peaks) σ=0,1
  • 36. Initial approach 2 (5 peaks) 0 4 8 12 500 600 700 800 Q-1 ·103 T, K σ=0,1
  • 37. Given 3_1 3_2 4 5_1 5_2 T1 570 571,3 578,6 569,4 569,4 569,4 T2 620 632,5 619,8 619,8 619,8 T3 690 698,1 685,5 690,2 690,2 690,2 T4 750 742,4 749,2 749,2 749,2 T5 499,6 718,2 Q1 6 6,3 7,4 5,9 5,9 5,9 Q2 3 3,5 3,1 3,1 3,1 Q3 12 13,0 12,2 12,0 12,0 12,0 Q4 3 3,6 2,9 2,9 2,9 Q5 0,0 0,0 σ=0,1
  • 38. 0 4 8 12 500 600 700 800 T, K Q-1 ·103 σ=0,3Initial approach 1 (4 peaks)
  • 39. 0 4 8 12 500 600 700 800 T, K Q-1 ·103 Initial approach 2 (4 peaks) σ=0,3
  • 40. 0 4 8 12 500 600 700 800 T, K Q-1 ·103 Initial approach 3 (4 peaks) σ=0,3
  • 41. 0 4 8 12 500 600 700 800 T, K Q-1 ·103 The result of decomposition s=3,01 F=0,76
  • 42. -0,5 -0,2 0,1 0,4 500 600 700 800 ∆Q-1 ·103 T, K d=1,20 Residuals
  • 43. 0 4 8 12 500 600 700 800 T, K Q-1 ·103 Initial approach 1 (3 peaks) σ=0,3
  • 44. 0 4 8 12 500 600 700 800 T, K Q-1 ·103 Initial approach 2 (3 peaks) σ=0,3
  • 45. 0 4 8 12 500 600 700 800 T, K Q-1 ·103 Initial approach 3 (3 peaks) σ=0,3
  • 46. The result of decomposition 0 4 8 12 500 600 700 800 T, K Q-1 ·103 s=15,87 F=3,99
  • 47. -2,5 -1 0,5 500 600 700 800 ∆Q-1 ·103 T, K Residuals d=0,57
  • 48. 0 4 8 12 500 600 700 800 Q-1 ·103 T, K Initial approach 1 (5 peaks) σ=0,3
  • 49. 0 4 8 12 500 600 700 800 Q-1 ·103 T, K The result of decomposition s=2,92 F=0,74
  • 50. -0,5 -0,2 0,1 0,4 0,7 500 600 700 800 ∆Q-1 ·103 T, K Residuals d=1,21
  • 51. 0 4 8 12 500 600 700 800 Q-1 ·103 T, K Initial approach 2 (5 peaks) σ=0,3
  • 52. 0 4 8 12 500 600 700 800 Q-1 ·103 T, K The result of decomposition s=1,41 F=0,35
  • 53. -0,5 -0,2 0,1 0,4 0,7 500 600 700 800 ∆Q-1 ·103 T, K Residuals d=2,47
  • 54. Given 3 4 5_1 5_2 T1 570 578,7 569,8 571,2 569,7 T2 620 621,8 622,8 621,3 T3 690 686,5 691,2 691,2 690,6 T4 750 749,2 757,1 757,2 751,7 T5 537,5 851,0 Q1 6 7,2 5,9 5,7 5,8 Q2 3 3,0 2,9 2,9 Q3 12 12,4 12,2 12,2 12,0 Q4 3 3,6 2,9 2,9 2,9 Q5 0,3 0,6 σ=0,3
  • 55. 0 10 20 450 550 650 750 Q-1 ·103 T, K 0,18 0,36 0,42 0,60 [N], at.%: Nb – 2 at.% W – N (3 peaks, 1 result)
  • 56. -3,5 -2,5 -1,5 -0,5 0,5 1,5 2,5 450 550 650 750 ∆Q-1 ·103 T, K d: 0,69; 0,52 1,94; 1,14 Residuals
  • 57. 0 10 20 450 550 650 750 Q-1 ·103 T, K 0,18 0,36 0,42 0,60 [N], at.%: Nb – 2 at.% W – N (3 peaks, 2 result)
  • 58. -3,5 -2,5 -1,5 -0,5 0,5 1,5 2,5 450 550 650 750 ∆Q -1 ·103 T, K d: 0,85; 1,33 1,88; 1,27 Residuals
  • 59. 0 10 20 450 550 650 750 Q-1 ·103 T, K [N], at.%: 0,18 0,36 0,42 0,60 Nb – 2 at.% W – N (4 peaks)
  • 60. -2,2 -1,2 -0,2 0,8 1,8 2,8 450 550 650 750 ∆Q-1 ·103 d: 1,83; 2,10 2,84; 1,67 Residuals
  • 61. 0 10 20 450 550 650 750 T, K Q-1 ·103 [N], at.%: 0,18 0,36 0,42 0,60 Nb – 2 at.% W – N (5 peaks, 1 result)
  • 62. Residuals -2 -1 0 1 2 450 550 650 750 ∆Q -1 ·103 T, K d: 1,60; 2,36 3,09; 1,83
  • 63. 0 10 20 450 550 650 750 T, K Q-1 ·103 [N], at.%: 0,18 0,36 0,42 0,60 Nb – 2 at.% W – N (5 peaks, 2 result)
  • 64. -2 -1 0 1 2 450 550 650 750 ∆Q-1 ·103 T, K d: 2,54; 2,36 2,96; 2,25 Residuals
  • 65. T1 T2 T3 T4 Т5 S F 3_1 539,1 657,2 685,2 70,1 2,0 3_2 647,1 673,6 748,7 86,5 1,6 4 537,9 650,9 674,7 749,0 43,3 3,3 5_1 528,8 656,9 676,4 748,0 593,0 35,7 4,0 5_2 535,5 641,4 674,4 745,5 665,5 34,1 4,2 Q1 Q2 Q3 Q4 Q5 3_1 2,2 18,2 13,4 3_2 9,3 21,3 2,7 4 2,1 10,8 19,5 2,6 5_1 1,5 13,6 15,9 2,6 2,1 5_2 2,0 7,0 17,9 2,6 5,8
  • 66. Nb – 12 at.% W Nb – 6 at.% W 4 peaks 5 peaks 4 peaks1 set 2 set E1, kJ/mol 102,2 86 E2, kJ/mol 109,5 111,5 110,1 109,8 E3, kJ/mol 116,3 116,9 116,5 116,5 E4, kJ/mol 128,9 129,6 129,1 128,3 E5, kJ/mol 1456 145,9 145,9 145,9
  • 67. 0 0,3 0,6 0,9 500 600 700 800 Nb – 2 at.% Hf – 0,32 at.% N (3 peaks): E = 1,47; 1,61; 1,76 kJ/mol; d = 0,90; F = 1,73.
  • 68. 0 0,3 0,6 0,9 500 600 700 800 Nb – 2 at.% Hf – 0,32 at.% N (4 peaks): E = 1,29; 1,48; 1,62; 1,79 kJ/mol; d = 1,26; F = 2,64.
  • 69. 0 0,3 0,6 0,9 500 600 700 800 Nb – 2 at.% Hf – 0,32 at.% N (5 peaks, 1 result): E = 1,44; 1,54; 1,63; 1,77; 1,91 kJ/mol; d = 1,06; F = 3,21.
  • 70. 0 0,3 0,6 0,9 500 600 700 800 Nb – 2 at.% Hf – 0,32 at.% N (5 peaks, 2 result): E = 1,26; 1,46; 1,57; 1,64; 1,80 kJ/mol; d = 1,55; F = 3,58.
  • 71. n N i i 1 0i i 2 2 2 i i 0i i M(T) M M (T); M M (T) ; 1 4 f E 1 1 exp R T T . 2 f =    = − ∆   ∆ ∆ = + π τ      −  ÷    τ = π ∑ The temperature dependence of dynamic elastic modulus in a case of n processes, which satisfy the model of standard linear body, may be determined from a system: MN – non-relaxed modulus.
  • 72. Model parameters, which must be identified, are: 0i 0iM ,T .∆ ( ) ( ) m 2 1 exp j j j 1 S M T M T min, =  = − → ∑ We are to solve such minimization problem: ( )exp jM Twhere are experimental data for modulus at Tj. (*)
  • 73. Functional (*) has a great number of minimums, so the result of minimization strongly depends on initial assumption. Adequate model may be obtained by using as T0i initial values the results of relaxation spectrum decomposition and setting initial values as0iM∆ 1 0i N 0iM 2M Q .− ∆ = T0i values after minimization are very close with the initial ones, and values change essentially. But there is a correlation (r = 0,90 – 0,97) between partial Snoek peaks heights and results for : 0iM∆ 0i 1 0i H M 2,00 0,15. Q M− ∆ = ± 0iM∆
  • 74. Nb – 12 at.% W – N [N], at.%:  - 0,11; ■ – 0,16; ▲ – 0,22; ♦ - 0,31