
This study was conducted to synthesize magnetic wood through the ex situ impregnation method of magnetite nanoparticles and analyze its physical properties and characterization. The process was initiated with the synthesis of magnetite nanoparticles by the co-precipitation method and the nano-magnetite was successfully synthesized with a particle distribution of 17–233 nm at an average size of 75 nm. Furthermore, the impregnation solution consisted of three different levels of magnetite nanoparticles dispersed in furfuryl alcohol, untreated and furfurylated wood for comparison. Sengon wood (Falcataria moluccana Miq.) was also used due to its low physical properties. The impregnation process was conducted by immersing the samples in the solution at a vacuum of −0.5 bar for 30 min, followed by a pressure of 1 bar for 2 h. There was also an improvement in the physical properties, such as weight percent gain, bulking effect, anti-swelling efficiency and density, while the water uptake continued to decrease. Additionally, magnetite nanoparticles appeared in wood microstructure image, supported by the result of ferrum content in chemical element analysis. The results showed that chemical change analysis proved the presence of Fe–O functional group cross-linked with wood polymer. The diffractogram also reported the appearance of magnetite nanoparticles peak and a decrease in crystallinity due to an increase in the concentration. Based on the analysis, sengon wood was classified as a superparamagnetic material with soft magnetic characteristics and the optimum treatment was furfurylated-magnetite 12.5% wood.
Citation: Saviska Luqyana Fadia, Istie Rahayu, Deded Sarip Nawawi, Rohmat Ismail, Esti Prihatini, Gilang Dwi Laksono, Irma Wahyuningtyas. Magnetic characteristics of sengon wood-impregnated magnetite nanoparticles synthesized by the co-precipitation method[J]. AIMS Materials Science, 2024, 11(1): 1-27. doi: 10.3934/matersci.2024001
[1] | Yan Ling Fu, Wei Zhang . Some results on frames by pre-frame operators in Q-Hilbert spaces. AIMS Mathematics, 2023, 8(12): 28878-28896. doi: 10.3934/math.20231480 |
[2] | Gang Wang . Some properties of weaving K-frames in n-Hilbert space. AIMS Mathematics, 2024, 9(9): 25438-25456. doi: 10.3934/math.20241242 |
[3] | Sergio Verdú . Relative information spectra with applications to statistical inference. AIMS Mathematics, 2024, 9(12): 35038-35090. doi: 10.3934/math.20241668 |
[4] | Ligong Wang . Output statistics, equivocation, and state masking. AIMS Mathematics, 2025, 10(6): 13151-13165. doi: 10.3934/math.2025590 |
[5] | Cure Arenas Jaffeth, Ferrer Sotelo Kandy, Ferrer Villar Osmin . Functions of bounded (2,k)-variation in 2-normed spaces. AIMS Mathematics, 2024, 9(9): 24166-24183. doi: 10.3934/math.20241175 |
[6] | Chibueze C. Okeke, Abubakar Adamu, Ratthaprom Promkam, Pongsakorn Sunthrayuth . Two-step inertial method for solving split common null point problem with multiple output sets in Hilbert spaces. AIMS Mathematics, 2023, 8(9): 20201-20222. doi: 10.3934/math.20231030 |
[7] | Osmin Ferrer Villar, Jesús Domínguez Acosta, Edilberto Arroyo Ortiz . Frames associated with an operator in spaces with an indefinite metric. AIMS Mathematics, 2023, 8(7): 15712-15722. doi: 10.3934/math.2023802 |
[8] | Abdullah Ali H. Ahmadini, Amal S. Hassan, Ahmed N. Zaky, Shokrya S. Alshqaq . Bayesian inference of dynamic cumulative residual entropy from Pareto Ⅱ distribution with application to COVID-19. AIMS Mathematics, 2021, 6(3): 2196-2216. doi: 10.3934/math.2021133 |
[9] | Messaoud Bounkhel . V-Moreau envelope of nonconvex functions on smooth Banach spaces. AIMS Mathematics, 2024, 9(10): 28589-28610. doi: 10.3934/math.20241387 |
[10] | Jamilu Adamu, Kanikar Muangchoo, Abbas Ja'afaru Badakaya, Jewaidu Rilwan . On pursuit-evasion differential game problem in a Hilbert space. AIMS Mathematics, 2020, 5(6): 7467-7479. doi: 10.3934/math.2020478 |
This study was conducted to synthesize magnetic wood through the ex situ impregnation method of magnetite nanoparticles and analyze its physical properties and characterization. The process was initiated with the synthesis of magnetite nanoparticles by the co-precipitation method and the nano-magnetite was successfully synthesized with a particle distribution of 17–233 nm at an average size of 75 nm. Furthermore, the impregnation solution consisted of three different levels of magnetite nanoparticles dispersed in furfuryl alcohol, untreated and furfurylated wood for comparison. Sengon wood (Falcataria moluccana Miq.) was also used due to its low physical properties. The impregnation process was conducted by immersing the samples in the solution at a vacuum of −0.5 bar for 30 min, followed by a pressure of 1 bar for 2 h. There was also an improvement in the physical properties, such as weight percent gain, bulking effect, anti-swelling efficiency and density, while the water uptake continued to decrease. Additionally, magnetite nanoparticles appeared in wood microstructure image, supported by the result of ferrum content in chemical element analysis. The results showed that chemical change analysis proved the presence of Fe–O functional group cross-linked with wood polymer. The diffractogram also reported the appearance of magnetite nanoparticles peak and a decrease in crystallinity due to an increase in the concentration. Based on the analysis, sengon wood was classified as a superparamagnetic material with soft magnetic characteristics and the optimum treatment was furfurylated-magnetite 12.5% wood.
In [13,14,15,16,19], it was proposed that insight into a probability distribution, μ, posed on a Hilbert space, H, could be obtained by finding a best fit Gaussian approximation, ν. This notion of best, or optimal, was with respect to the relative entropy, or Kullback-Leibler divergence:
R(ν||μ)={Eν[logdνdμ],ν≪μ,+∞,otherwise. | (1.1) |
Having a Gaussian approximation provides qualitative insight into μ, as it provides a concrete notion of the mean and variance of the distribution. Additionally, this optimized distribution can be used in algorithms, such as random walk Metropolis, as a preconditioned proposal distribution to improve performance. Such a strategy can benefit a number of applications, including path space sampling for molecular dynamics and parameter estimation in statistical inverse problems.
Observe that in the definition of R, (1.1), there is an asymmetry in the arguments. Were we to work with R(μ||ν), our optimal Gaussian would capture the first and second moments of μ, and in some applications this is desirable. However, for a multimodal problem (consider a distribution with two well separated modes), this would be inadequate; our form attempts to match individual modes of the distribution by a Gaussian. For a recent review of the R(ν||μ) problem, see [4], where it is remarked that this choice of arguments is likely to underestimate the dispersion of the distribution of interest, μ. The other ordering of arguments has been explored, in the finite dimensional case, in [2,3,10,18].
To be of computational use, it is necessary to have an algorithm that will converge to this optimal distribution. In [15], this was accomplished by first expressing ν=N(m,C(p)), where m is the mean and p is a parameter inducing a well defined covariance operator, and then solving the problem,
(m,p)∈argminR(N(m,C(p))||μ), | (1.2) |
over an admissible set. The optimization step itself was done using the Robbins-Monro algorithm (RM), [17], by seeking a root of the first variation of the relative entropy. While the numerical results of [15] were satisfactory, being consistent with theoretical expectations, no rigorous justification for the application of RM to the examples was given.
In this work, we emphasize the study and application of RM to potentially infinite dimensional problems. Indeed, following the framework of [15,16], we assume that μ is posed on the Borel σ-algebra of a separable Hilbert space (H,⟨∙,∙⟩,‖∙‖). For simplicity, we will leave the covariance operator C fixed, and only optimize over the mean, m. Even in this case, we are seeking m∈H, a potentially infinite-dimensional space.
Given the objective function f:H→H, assume that it has a root, x⋆. In our application to relative entropy, f will be its first variation. Further, we assume that we can only observe a noisy version of f, F:H×χ→H, such that for all x∈H,
f(x)=E[F(x,Z)]=∫χF(x,z)μZ(dz), | (1.3) |
where μZ is the distribution associated with the random variable (r.v.) Z, taking values in the auxiliary space χ. The naive Robbins-Monro algorithm is given by
Xn+1=Xn−an+1F(Xn,Zn+1), | (1.4) |
where Zn∼μZ, are independent and identically distributed (i.i.d.), and an>0 is a carefully chosen sequence. Subject to assumptions on f, F, and the distribution μZ, it is known that Xn will converge to x⋆ almost surely (a.s.), in finite dimensions, [5,6,17]. Often, one needs to assume that f grows at most linearly,
‖f(x)‖≤c0+c1‖x‖, | (1.5) |
in order to apply the results in the aforementioned papers. The analysis in the finite dimensional case has been refined tremendously over the years, including an analysis based on continuous dynamical systems. We refer the reader to the books [1,8,11] and references therein.
As noted, much of the analysis requires the regression function f to have, at most, linear growth. Alternatively, an a priori assumption is sometimes made that the entire sequence generated by (1.4) stays in a bounded set. Both assumptions are limiting, though, in practice, one may find that the algorithms converge.
One way of overcoming these assumptions, while still ensuring convergence, is to introduce trust regions that the sequence {Xn} is permitted to explore, along with a "truncation" which enforces the constraint. Such truncations distort (1.4) into
Xn+1=Xn−an+1F(Xn,Zn+1)+an+1Pn+1, | (1.6) |
where Pn+1 is the projection keeping the sequence {Xn} within the trust region. Projection algorithms are also discussed in [1,8,11].
We consider RM on a possibly infinite dimensional separable Hilbert space. This is of particular interest as, in the context of relative entropy optimization, we may be seeking a distribution in a Sobolev space associated with a PDE model. A general analysis of RM with truncations in Hilbert spaces can be found in [20]. The main purpose of this work is to adapt the analysis of [12] to the Hilbert space setting for two versions of the truncated problem. The motivation for this is that the analysis of [12] is quite straightforward, and it is instructive to see how it can be easily adapted to the infinite dimensional setting. The key modification in the proof is that results for Banach space valued martingales must be invoked. We also adapt the results to a version of the algorithm where there is prior knowledge on the location of the root. With these results in hand, we can then verify that the relative entropy minimization problem can be solved using RM.
In some problems, one may have a priori information on the root. For instance, we may know that x⋆∈U1, some open bounded set. In this version of the truncated algorithm, we have two open bounded sets, U0⊊U1, and x⋆∈U1. Let σ0=0 and X0∈U0 be given, then (1.6) can be formulated as
˜Xn+1=Xn−an+1F(Xn,Zn+1) | (1.7a) |
Xn+1={˜Xn+1˜Xn+1∈U1X(σn)0˜Xn+1∉U1 | (1.7b) |
σn+1={σn˜Xn+1∈U1σn+1˜Xn+1∉U1 | (1.7c) |
We interpret ˜Xn+1 as the proposed move, which is either accepted or rejected depending on whether or not it will remain in the trust region. If it is rejected, the algorithm restarts at X(σn)0∈U0. The restart points, {X(σn)0}, may be random, or it may be that X(σn)0=X0 is fixed. The essential property is that the algorithm will restart in the interior of the trust region, away from its boundary. The r.v. σn counts the number of times a truncation has occurred. Algorithm (1.7) can now be expressed as
Xn+1=Xn−an+1F(Xn,Zn+1)+Pn+1Pn+1={X(σn)0−˜Xn+1}1˜Xn+1∉U1. | (1.8) |
In the second version of truncated Robbins-Monro, define the sequence of open bounded sets, Un such that:
U0⊊U1⊊U2⊊…,∪∞n=0Un=H. | (1.9) |
Again, letting X0∈U0, σ0=0, the algorithm is
˜Xn+1=Xn−an+1F(Xn,Zn+1) | (1.10a) |
Xn+1={˜Xn+1˜Xn+1∈UσnX(σn)0˜Xn+1∉Uσn | (1.10b) |
σn+1={σn˜Xn+1∈Uσnσn+1˜Xn+1∉Uσn | (1.10c) |
A consequence of this formulation is that Xn∈Uσn for all n. As before, the restart points may be random or fixed, and they are in U0. This would appear superior to the fixed trust region algorithm, as it does not require knowledge of the sets. However, to guarantee convergence, global (in H) assumptions on the regression function are required; see Assumption 2 below. (1.10) can written with Pn+1 as
Xn+1=Xn−an+1F(Xn,Zn+1)+Pn+1Pn+1={X(σn)0−˜Xn+1}1˜Xn+1∉Uσn | (1.11) |
In Section 2, we state sufficient assumptions for which we are able to prove convergence in both the fixed and expanding trust region problems, and we also establish some preliminary results. In Section 3, we focus on the relative entropy minimization problem, and identify what assumptions must hold for convergence to be guaranteed. Examples are then presented in Section 4, and we conclude with remarks in Section 5.
We first reformulate (1.8) and (1.15) in the more general form
Xn+1=Xn−an+1f(Xn)−an+1δMn+1⏟=˜Xn+1+an+1Pn+1, | (2.1) |
where δMn+1, the noise term, is
δMn+1=F(Xn,Zn+1)−f(Xn)=F(Xn,Zn+1)−E[F(Xn,Zn+1)∣Xn]. | (2.2) |
A natural filtration for this problem is Fn=σ(X0,Z1,…,Zn). Xn is Fn measurable and the noise term can be expressed in terms of the filtration as δMn+1=F(Xn,Zn+1)−E[F(Xn,Zn+1)∣Fn].
We now state our main assumptions:
Assumption 1. f has a zero, x⋆. In the case of the fixed trust region problem, there exist R0<R1 such that
U0⊆BR0(x⋆)⊂BR1(x⋆)⊆U1. |
In the case of the expanding trust region problem, the open sets are defined as Un=Brn(0) with
0<r0<r1<r2<…<rn→∞. | (2.3) |
These sets clearly satisfy (1.9).
Assumption 2. For any 0<a<A, there exists δ>0:
infa≤‖x−x⋆‖≤A⟨x−x⋆,f(x)⟩≥δ. |
In the case of the fixed truncation, this inequality is restricted to x∈U1. This is akin to a convexity condition on a functional F with f=DF.
Assumption 3. x↦E[‖F(x,Z)‖2] is bounded on bounded sets, with the restriction to U1 in the case of fixed trust regions.
Assumption 4. an>0, ∑an=∞, and ∑a2n<∞
Theorem 2.1. Under the above assumptions, for the fixed trust region problem, Xn→x⋆ a.s. and σn is a.s. finite.
Theorem 2.2. Under the above assumptions, for the expanding trust region problem, Xn→x⋆ a.s. and σn is a.s. finite.
Note the distinction between the assumptions in the two algorithms. In the fixed truncation algorithm, Assumptions 2 and 3 need only hold in the set U1, while in the expanding truncation algorithm, they must hold in all of H. While this would seem to be a weaker condition, it requires identification of the sets U0 and U1 for which the assumptions hold. Such sets may not be readily identifiable, as we will see in our examples.
We first need some additional information about f and the noise sequence δMn.
Lemma 2.1. Under Assumption 3, f is bounded on U1, for the fixed trust region problem, and on arbitrary bounded sets, for the expanding trust region problem.
Proof. Trivially,
‖f(x)‖=‖E[F(x,Z)]‖≤E[‖F(x,Z)‖]≤√E[‖F(x,Z)‖2], |
and the results follows from the assumption.
Proposition 2.1. For the fixed trust region problem, let
Mn=n∑i=1aiδMi. |
Alternatively, in the expanding trust region problem, for r>0, let
Mn=n∑i=1aiδMi1‖Xi−1−x⋆‖≤r. |
Under Assumptions 3 and 4, Mn is a martingale, converging in H, a.s.
Proof. The following argument holds in both the fixed and expanding trust region problems, with appropriate modifications. We present the expanding trust region case. The proof is broken up into 3 steps:
1. Relying on Theorem 6 of [7] for Banach space valued martingales, it will be sufficient to show that Mn is a martingale, uniformly bounded in L1(P).
2. In the case of the expanding truncations,
E[‖δMi1‖Xi−1−x⋆‖≤r‖2]≤2E[‖F(Xi−1,Zi)1‖Xi−1−x⋆‖≤r‖2]+2E[‖f(Xi−1)1‖Xi−1−x⋆‖≤r‖2]≤2sup‖x−x⋆‖≤rE[‖F(x,Z)‖2]+2sup‖x−x⋆‖≤r‖f(x)‖2 |
Since both of these terms are bounded, independently of i, by Assumption 3 and Lemma 1, this is finite.
3. Next, since {δMi1‖Xi−1−x⋆‖≤r} is a martingale difference sequence, we can use the above estimate to obtain the uniform L2(P) bound,
E[‖Mn‖2]=n∑i=1a2iE[‖δMi1‖Xi−1−x⋆‖≤r‖2]≤supiE[‖δMi1‖Xi−1−x⋆‖≤r‖2]∞∑i=1a2i<∞ |
Uniform boundedness in L2, gives boundedness in L1, and this implies a.s. convergence in H.
In this section we prove results showing that only finitely many truncations will occur, in either the fixed or expanding trust region case. Recall that when a truncation occurs, the equivalent conditions hold: Pn+1≠0; σn+1=σn+1; and ˜Xn+1∉U1 in the fixed trust region algorithm, while ˜Xn+1∉Uσn in the expanding trust region case.
Lemma 2.2. In the fixed trust region algorithm, if Assumptions 1, 2, 3, and 4 hold, then the number of truncations is a.s. finite; a.s., there exists N, such that for all n≥N, σn=σN.
Proof. We break the proof up into 7 steps:
1. Pick ρ and ρ′ such that
R0<ρ′<ρ<R1 | (2.4) |
Let ˉf=sup‖f(x)‖, with the supremum over U1; this bound exists by Lemma 1. Under Assumption 2, there exists δ>0 such that
infR0/2≤‖x−x⋆‖≤R1⟨x−x⋆,f(x)⟩=δ. | (2.5) |
Having fixed ρ, ρ′, ˉf, and δ, take ϵ>0 such that:
ϵ<min{ρ′−R0,R1−ρ′2+ˉf,ρ′−R0ˉf,R02,δ2ˉf,δˉf2,ρ−ρ′}. | (2.6) |
Having fixed such an ϵ, by the assumptions of this lemma and Proposition 1, a.s., there exists nϵ such that for any n,m≥nϵ, both
‖m∑k=nakδMk‖≤ϵ,an≤ϵ. | (2.7) |
2. Define the auxiliary sequence
X′n=Xn−∞∑k=n+1akδMk. | (2.8) |
Using (2.1), we can then write
X′n+1=X′n−an+1f(Xn)+an+1Pn+1. | (2.9) |
By (2.7), for any n≥nϵ,
‖X′n−Xn‖≤ϵ | (2.10) |
3. We will show X′n∈Bρ′(x⋆) for all n large enough. The significance of this is that if n≥nϵ, and X′n∈Bρ′(x⋆), then no truncation occurs. Indeed, using (2.6)
‖˜Xn+1−x⋆‖≤‖X′n−x⋆‖+‖Xn−X′n‖+an+1ˉf+‖an+1δMn+1‖<ρ′+ϵ+ϵˉf+ϵ<R1,⇒˜Xn+1∈U1. | (2.11) |
Consequently, Pn+1=0, Xn+1=˜Xn+1, and σn+1=σn. Thus, establishing X′n∈Bρ′(x⋆) will yield the result.
4. Let
N=inf{n≥nϵ∣˜Xn+1∉U1}+1 | (2.12) |
This corresponds to the the first truncation after nϵ. If the above set is empty, for that realization, no truncations occur after nϵ, and we are done. In such a case, we may take N=nϵ in the statement of the lemma.
5. We now prove by induction that in the case that (2.12) is finite, X′n∈Bρ′(x⋆) for all n≥N. First, note that XN∈BR0(x⋆)⊂Bρ(x⋆). By (2.6) and (2.10),
‖X′N−x⋆‖≤‖XN−x⋆‖+‖X′N−XN‖<R0+ϵ<ρ′,⇒X′N∈Bρ′(x⋆). |
Next, assume X′N,X′N+1,…,X′n are all in Bρ′(x⋆). Using (2.11), we have that PN+1=…=Pn+1=0 and σN=…=σn=σn+1. Therefore,
‖X′n+1−x⋆‖2=‖X′n−x⋆‖2−2an+1⟨X′n−x⋆,f(Xn)⟩+a2n+1‖f(Xn)‖2≤‖X′n−x⋆‖2−2an+1⟨X′n−x⋆,f(Xn)⟩+an+1ϵˉf2 | (2.13) |
We now consider two cases of (2.13) to conclude ‖X′n+1−x⋆‖<ρ′.
6. In the first case, ‖X′n−x⋆‖≤R0. By Cauchy-Schwarz and (2.6)
‖X′n+1−x⋆‖2<R20+2ϵR0ˉf+ϵ2ˉf2=(R0+ϵˉf)2<(ρ′)2. |
In the second case, R0<‖X′n−x⋆‖<ρ′. Dissecting the inner product term in (2.13) and using Assumption 2 and (2.10),
⟨X′n−x⋆,f(Xn)⟩=⟨Xn−x⋆,f(Xn)⟩+⟨X′n−Xn,f(Xn)⟩≥⟨Xn−x⋆,f(Xn)⟩−ˉfϵ | (2.14) |
Conditions (2.6) and (2.10) yield the following upper and lower bounds:
‖Xn−x⋆‖≥‖X′n−x⋆‖−‖X′n−Xn‖≥R0−ϵ>12R0,‖Xn−x⋆‖≤‖X′n−x⋆‖+‖X′n−Xn‖≤ρ′+ϵ<ρ<R1. |
Therefore, (2.5) applies and ⟨Xn−x⋆,f(Xn)⟩≥δ. Using this in (2.14), and condition (2.6),
⟨X′n−x⋆,f(Xn)⟩≥δ−ˉfϵ>12δ. |
Substituting this last estimate back into (2.13), and using (2.6),
‖X′n+1−x⋆‖2<(ρ′)2−an+1(δ−ϵˉf2)<(ρ′)2. |
This completes the inductive step.
7. Since the auxiliary sequence remains in Bρ′(x⋆) for all n≥N>nϵ, (2.11) ensures ˜Xn+1∈BR1(x⋆), Pn+1=0, and σn+1=σN, a.s.
To obtain a similar result for the expanding trust region problem, we first relate the finiteness of the number of truncations with the sequence persisting in a bounded set.
Lemma 2.3. In the expanding trust region algorithm, if Assumptions 1, 3, and 4 hold, then the sequence remains in a set of the form BR(0) for some R>0 if and only if the number of truncations is finite, a.s.
Proof. We break this proof into 4 steps:
1. If the number of truncations is finite, then there exists N such that for all n≥N, σn=σN. Consequently, the proposed moves are always accepted, and Xn∈Uσn=UσN for all n≥N. Since Xn∈Uσn⊂UσN for n<N, Xn∈UσN for all n. By Assumption 3, BR(0)=BrσN(0)=UσN is the desired set.
2. For the other direction, assume that there exists R>0 such that Xn∈BR(0) for all n. Since the rn in (2.3) tend to infinity, there exists N1, such that R<R+1<rN1. Hence, for all n≥N1,
BR(0)⊂BR+1(0)⊂Un | (2.15) |
Let ˉf=sup‖f(x)‖, with the supremum over BR(0). Let ˜R be sufficiently large such that BR+1(0)⊂B˜R(x⋆). Lastly, using Proposition 1 and Assumption 4, a.s., there exists N2, such that for all n≥N2
‖anδMn1‖Xn−x⋆‖≤˜R‖<12,an<12(1+ˉf) | (2.16) |
Since Xn∈BR(0)⊂B˜R(x⋆), the indicator function in (2.16) is always one, and ‖anδMn‖<1/2.
3. Next, let
N=inf{n≥0∣σn≥max{N1,N2}} | (2.17) |
If the above set is empty, then σn<max{N1,N2} for all n, and the number of truncations is a.s. finite. In this case, the proof is complete.
4. If the set in (2.17) is not empy, then N<∞. Take n≥N. As Xn∈BR(0), and since n≥σn≥max{N1,N2}, (2.16) applies. Therefore,
‖˜Xn+1‖≤‖Xn‖+‖˜Xn+1−Xn‖≤‖Xn‖+an+1‖f(Xn)‖+‖an+1δMn+1‖<R+12+12<R+1. | (2.18) |
Thus, ˜Xn+1∈BR+1(0)⊂UN1, σn≥N1, and UN1⊂Uσn. Therefore, ˜Xn+1∈Uσn. No truncation occurs, and σn=σn+1. Since this holds for all n≥N, σn=σN, and the number of truncations is a.s. finite.
Next, we establish that, subject to an additional assumption, the sequence remains in a bounded set; the finiteness of the truncations is then a corollary.
Lemma 2.4. In the expanding trust region algorithm, if Assumptions 1, 2, 3, and 4 hold, and for any r>0, there a.s. exists N<∞, such that for all n≥N,
Pn+11‖Xn−x⋆‖≤r=0, |
then {Xn} remains in a bounded open set, a.s.
Proof. We break this proof into 7 steps:
1. We begin by setting some constants for the rest of the proof. Fix R>0 sufficiently large such that BR(x⋆)⊃U0. Next, let ˉf=sup‖f(x)‖ with the supremum taken over BR+2(x⋆). Assumption 2 ensures there exists δ>0 such that
infR/2≤‖x−x⋆‖≤R+2⟨x−x⋆,f(x)⟩=δ. | (2.19) |
Having fixed R, ˉf, and δ, take ϵ>0 such that:
ϵ<min{1,1ˉf,δ2ˉf,δˉf2,R2}. | (2.20) |
By the assumptions of this lemma and Proposition 1 there exists, a.s., nϵ≥N such that for all n≥nϵ,
‖∞∑i=n+1aiδMi1‖Xi−1−x⋆‖≤R+2‖≤ϵ, | (2.21a) |
Pn+11‖Xn−x⋆‖≤R+2=0, | (2.21b) |
an+1≤ϵ | (2.21c) |
2. Define the modified sequence for n≥nϵ as
X′n=Xn−∞∑k=n+1akδMk1‖Xk−1−x⋆‖≤R+2,⇒‖X′n−Xn‖≤ϵ. | (2.22) |
Using (2.1), we have the iteration
X′n+1=X′n−an+1δMn+11‖Xn−x⋆‖>R+2−an+1f(Xn)+an+1Pn+1. | (2.23) |
3. Let
N=inf{n≥nϵ∣σn+1≠σn}+1, | (2.24) |
the first time after nϵ that a truncation occurs.
If the above set is empty, no truncations occur after nϵ. In this case, σn=σnϵ≤nϵ<∞ for all n≥nϵ. Therefore, for all n≥nϵ, Xn∈Uσn⊂Uσnϵ. Since Uσn⊂Uσnϵ for all n<nϵ too, the proof is complete in this case.
4. Now assume that N<∞. We will show that {X′n} remains in BR+1(x⋆) for all n≥N. Were this to hold, then for n≥N,
‖Xn−x⋆‖≤‖X′n−x⋆‖+‖∞∑i=n+1aiδMi1‖Xi−1−x⋆‖≤R+2‖<R+1+ϵ<R+2, | (2.25) |
having used (2.21) and (2.22). For n<N, Xn∈Uσn⊂UσN=BrN(0). Therefore, for all n, Xn∈B˜R(0) where ˜R=max{rN,‖x⋆‖+R+2}.
5. We prove X′n∈BR+1(x⋆) by induction. First, since ϵ<1 and XN∈U0⊂BR(x⋆),
‖X′N−x⋆‖≤‖X′N−XN‖+‖XN−x⋆‖<ϵ+R<R+1. |
Next, assume that X′N,X′N+1,…,X′n are all in BR+1(x⋆). By (2.25), Xn∈BR+2(x⋆). Since Pn+11‖Xn−x⋆‖≤R+2=0, we conclude Pn+1=0. The modified iteration (2.23) simplifies to have
X′n+1=X′n−an+1f(Xn), |
and
‖X′n+1−x⋆‖2=‖X′n−x⋆‖2−2an+1⟨X′n−x⋆,f(Xn)⟩+a2n+1‖f(Xn)‖2<‖X′n−x⋆‖2−2an+1⟨X′n−x⋆,f(Xn)⟩+an+1ϵˉf2. | (2.26) |
6. We now consider two cases of (2.26). First, assume ‖X′n−x⋆‖≤R. Then (2.26) can immediately be bounded as
‖X′n+1−x⋆‖2<R2+2ϵRˉf+ϵ2ˉf2=(R+ϵˉf)2<(R+1)2, |
where we have used condition (2.20) in the last inequality.
7. Now consider the case R<‖X′n−x⋆‖<R+1. Using (2.20), the inner product in (2.26) can first be bounded from below:
⟨X′n−x⋆,f(Xn)⟩=⟨Xn−x⋆,f(Xn)⟩+⟨X′n−Xn,f(Xn)⟩≥⟨Xn−x⋆,f(Xn)⟩−ϵˉf>⟨Xn−x⋆,f(Xn)⟩−12δ. |
Next, using (2.20)
‖Xn−x⋆‖≥‖X′n−x⋆‖−‖Xn−X′n‖>R−ϵ>R−12R=12R |
Therefore, 12R<‖Xn−x⋆‖<R+2, so (2.19) ensures ⟨Xn−x⋆,f(Xn)⟩≥δ and
⟨X′n−x⋆,f(Xn)⟩>δ−12δ=12δ. |
Returning to (2.26), by (2.20),
‖X′n+1−x⋆‖2≤(R+1)2−an+1(δ−ϵˉf2)<(R+1)2. |
This completes the proof of the inductive step in this second case, completing the proof.
Corollary 2.1. For the expanding trust region algorithm, if Assumptions 1, 2, 3, and 4 hold, then the number of truncations is a.s. finite.
Proof. The proof is by contradiction. We break the proof into 4 steps:
1. Assuming that there are infinitely many truncations, Lemma 3 implies that the sequence cannot remain in a bounded set. Then, continuing to assume that Assumptions 1, 2, 3, and 4 hold, the only way for the conclusion of Lemma 4 to fail is if the assumption on Pn+11‖Xn−x⋆‖≤r is false. Therefore, there exists r>0 and a set of positive measure on which a subsequence, Pnk+11‖Xnk−x⋆‖≤r≠0. Hence X_{n_k}\in B_{r}(x_\star) , and P_{n_k+1}\neq 0 . So truncations occur at these indices, and \tilde{X}_{n_k+1} \not\in U_{\sigma_{n_k}} .
2. Let \bar{f} = \sup \|f(x)\| with the supremum over the set B_r(x_\star) and let \epsilon > 0 satisfy
\begin{equation} \epsilon \lt (\bar{f}+1)^{-1}. \end{equation} | (2.27) |
By our assumptions of the lemma and Proposition 1, there exists n_ \epsilon such that for all n\geq n_ \epsilon
\begin{equation} \|a_{n+1}\delta M_{n+1}1_{\|X_n - x_\star\|\leq r}\|\leq \epsilon, \quad a_{n+1}\leq \epsilon \end{equation} | (2.28) |
Along the subsequence, for all n_k\geq n_ \epsilon ,
\begin{equation} \|a_{n_k+1}\delta M_{n_k+1}1_{\|X_{n_k} - x_\star\|\leq r}\| = \|a_{n_k+1}\delta M_{n_k+1}\|\leq \epsilon. \end{equation} | (2.29) |
3. Furthermore, for n_k \geq n_ \epsilon :
\begin{equation} \begin{split} \|\tilde{X}_{n_k+1} - x_\star\| &\leq \| X_{n_k} - x_\star\| + a_{n_k+1}\|f(X_{n_k})\| + \|a_{n_k+1}\delta M_{n_k+1}\|\\ & \lt r + \epsilon \bar{f} + \epsilon \lt r+1, \Rightarrow \tilde{X}_{n_k+1} \in B_{r+1}(x_\star), \end{split} \end{equation} | (2.30) |
where (2.27) has been used in the last inequality.
4. By the definition of the U_n , there exists an index M such that U_{M}\supset B_{r+1}(x_\star) . Let
\begin{equation} N = \inf\{n\geq n_ \epsilon\mid \sigma_n \geq M\}. \end{equation} | (2.31) |
This set is nonempty and N < \infty since we have assumed there are infinitely many truncations. Let n_k \geq N . Then \sigma_{n_k}\geq M and U_{\sigma_{n_k}}\supset B_{r+1}(x_\star) . But (2.30) then implies that \tilde{X}_{n_k+1} \in U_{\sigma_{n_k}} , and no truncation will occur; P_{n_k+1} = 0 , providing the desired the contradiction.
Using the above results, we are able to prove Theorems 2.1 and 2.2. Since the proofs are quite similar, we present the more complicated expanding trust region case.
Proof. We split this proof into 6 steps:
1. First, by Corollary 1, only finitely many truncations occur. By Lemma 3, there exists R > 0 such that X_n\in B_R(0) for all n . Consequently, there is an r such that X_n\in B_r(x_\star) for all n .
2. Next, we fix constants. Let \bar f = \sup \|f(x)\| with the supremum taken over B_r(x_\star) . Fix \eta \in (0, 2R) , and use Assumption 2 to determine \delta > 0 such that
\begin{equation} \inf\limits_{\eta/2 \leq \|x-x_\star\|\leq r}\left\langle {x-x_\star},{f(x)}\right\rangle = \delta \end{equation} | (2.32) |
Take \epsilon > 0 such that:
\begin{equation} \epsilon \lt \min\left\{{1,\frac{\eta}{2}, \frac{\delta}{2\bar{f}}, \frac{\delta}{2\bar{f}^2}}\right\} \end{equation} | (2.33) |
Having set \epsilon , we again appeal to Assumption 4 and Proposition 1 to find n_ \epsilon such that for all n\geq n_ \epsilon :
\begin{equation} \left \|{\sum\limits_{i = n+1}^\infty a_i \delta M_i 1_{\|X_{i-1} -x_\star\|\leq r}}\right\| = \left \|{\sum\limits_{i = n+1}^\infty a_i \delta M_i }\right\| \leq \epsilon, \quad a_{n+1}\leq \epsilon \end{equation} | (2.34) |
3. Define the auxiliary sequence,
\begin{equation} X_n' = X_n - \sum\limits_{i = n+1}^\infty a_i \delta M_i 1_{\|X_{i-1} - x_\star \|\leq r} = X_n - \sum\limits_{i = n+1}^\infty a_i \delta M_i. \end{equation} | (2.35) |
Since there are only finitely many truncations, there exists N\geq n_ \epsilon , such that for all n\geq N , P_{n+1} = 0 , as the truncations have ceased. Consequently, for n\geq N ,
\begin{equation} X'_{n+1} = X'_n - a_{n+1}f(X_n) \end{equation} | (2.36) |
By (2.34) and (2.35), for n\geq N , \|X_n - X_n'\|\leq \epsilon . Since \epsilon > 0 may be arbitrarily small, it will be sufficient to prove X_n'\to x_\star .
4. To obtain convergence of X_n' , we first examine \|X_{n+1}'-x_\star\| . For n\geq N ,
\begin{equation} \begin{split} \|X_{n+1}' - x_\star\|^2 &\leq \|X_{n}' - x_\star\|^2-2a_{n+1}\left\langle {X_n' - x_\star},{f(X_n)}\right\rangle + a_{n+1} \epsilon \bar f^2, \end{split} \end{equation} | (2.37) |
Now consider two cases of this expression. First, assume \|X_n' - x_\star\|\leq\eta . In this case, using (2.33),
\begin{equation} \begin{split} -2a_{n+1}\left\langle {X_n' - x_\star},{f(X_n)}\right\rangle + a_{n+1} \epsilon \bar f^2&\leq a_{n+1}(2\eta \bar f + \epsilon \bar f^2) \\ & \lt a_{n+1}(4R\bar f + \bar f^2) = a_{n+1} B. \end{split} \end{equation} | (2.38) |
where B > 0 is a constant depending only on R and \bar f . For \|X_n' - x_\star\| > \eta , using (2.33)
\begin{equation} \begin{split} \left\langle {X'_{n}-x_\star},{f(X_n) }\right\rangle & = \left\langle {X_{n}-x_\star},{f(X_n) }\right\rangle + \left\langle {X'_{n}-X_n},{f(X_n) }\right\rangle\\ &\geq \left\langle {X_{n}-x_\star},{f(X_n) }\right\rangle - \epsilon \bar{f}\\ & \gt \left\langle {X_{n}-x_\star},{f(X_n) }\right\rangle -\tfrac{1}{2}\delta. \end{split} \end{equation} | (2.39) |
By (2.33),
\begin{equation*} \|X_{n}-x_\star\|\geq \|X'_{n}-x_\star\| -\| X_{n}-X_n'\| \gt \eta - \epsilon \gt \tfrac{1}{2}\eta \end{equation*} |
Since \|X_n - x_\star\| < r too, (2.32) and (2.39) yield the estimate
\begin{equation*} \left\langle {X'_{n}-x_\star},{f(X_n) }\right\rangle \gt \delta - \epsilon \bar{f} \gt \tfrac{1}{2}\delta \end{equation*} |
Thus, in this regime, using (2.33),
\begin{equation} \begin{split} -2a_{n+1}\left\langle {X_n' - x_\star},{f(X_n)}\right\rangle + a_{n+1} \epsilon \bar f^2&\leq -a_{n+1}(\delta - \epsilon \bar f^2)\\ & \lt -\tfrac{1}{2}\delta a_{n+1} = - A a_{n+1} \end{split} \end{equation} | (2.40) |
where A > 0 is a constant depending only on \delta .
Combining estimates (2.38) and (2.40), we can write for n\geq N
\begin{equation} \|X_{n+1}' - x_\star\|^2 \lt \|X_{n}' - x_\star\|^2 - a_{n+1} A 1_{\|X_n' - x_\star\| \gt \eta} + a_{n+1} B 1_{\|X_n' - x_\star\|\leq \eta}. \end{equation} | (2.41) |
5. We now show that \|X_n' - x_\star\|\leq \eta i.o. The argument is by contradiction. Let M\geq N be such that for all n\geq M , \|X_n' - x_\star\| > \eta . For such n ,
\begin{equation} \begin{split} \eta^2 \lt \|X_{n+1}'-x_\star\|^2 & \lt \|X_{n}'-x_\star\|^2 - a_{n+1}A \\ & \lt \|X_{n-1}'-x_\star\|^2 - a_{n+1}A - a_n A\\ & \lt \ldots \lt \|X_M' - x_\star\|^2 - A \sum\limits_{i = M}^n a_{i+1}. \end{split} \end{equation} | (2.42) |
Using Assumption 4 and taking n\to \infty , we obtain a contradiction.
6. Finally, we prove convergence of X_n'\to x_\star . Since X_n'\in B_{\eta}(x_\star) i.o., let
\begin{equation} N' = \inf \{n\geq N\mid \|X_n' - x_\star\| \lt \eta \}. \end{equation} | (2.43) |
For n\geq N' , we can then define
\begin{equation} \varphi(n) = \max\left\{{p\leq n\mid \left \|{X_p' - x_\star}\right\| \lt \eta }\right\}. \end{equation} | (2.44) |
For all such n , \varphi(n)\leq n , and X_{\varphi(n)}'\in B_\eta(x_\star) .
We claim that for n\geq N' ,
\|X_{n+1}' - x_\star\|^2 \lt \|X_{\varphi(n)}' -x_\star\|^2 + B a_{\varphi(n)+1} \lt \eta^2 + Ba_{\varphi(n)+1}. |
First, if n = \varphi(n) , this trivially holds in (2.41). Suppose now that n > \varphi(n) . Then for i = \varphi(n)+1, \varphi(n)+2, \ldots n , \|X_{i}' - x_\star\| > \eta . Consequently,
\begin{equation*} \begin{split} \|X_{n+1}' - x_\star\|^2& \lt \|X_{n}' - x_\star\|^2 \lt \|X_{n-1}' - x_\star\|^2 \lt \ldots\\ & \lt \|X_{\varphi(n)+1}' - x_\star\|^2 \lt \|X_{\varphi(n)}' - x_\star\|^2 + B a_{\varphi(n)+1}\\ & \lt \eta^2 + B a_{\varphi(n)+1} \end{split} \end{equation*} |
As \varphi(n)\to \infty ,
\begin{equation*} \limsup\limits_{n\to \infty }\|X_{n+1}' - x_\star\|^2\leq \eta^2 \end{equation*} |
Since \eta may be arbitrarily small, we conclude that
\limsup\limits_{n\to \infty }\|X_{n+1}' - x_\star\| = \lim\limits_{n\to \infty }\|X_{n+1}' - x_\star\| = 0, |
completing the proof.
Recall from the introduction that our distribution of interest, \mu , is posed on the Borel subsets of Hilbert space \mathcal{H} . We assume that \mu \ll \mu_0 , where \mu_0 = N(m_0, C_0) is some reference Gaussian. Thus, we write
\begin{equation} \frac{d\mu}{d\mu_0} = \frac{1}{Z_\mu}\exp\left\{{-\Phi_\mu(u)}\right\}, \end{equation} | (3.1) |
where \Phi_\nu: X\to \mathbb{R} , X a Banach space, a subspace of \mathcal{H} , of full measure with respect to \mu_0 , a Gaussian on \mathcal{H} , assumed to be continuous. Z_\mu = \mathbb{E}^{\mu_0}[\exp\left\{{-\Phi(u)}\right\}]\in (0, \infty) is the partition function ensuring we have a probability measure.
Let \nu = N(m, C) , be another Gaussian, equivalent to \mu_0 , such that we can write
\begin{equation} \frac{d\nu}{d\mu_0} = \frac{1}{Z_\nu}\exp\left\{{-\Phi_\nu(v)}\right\}, \end{equation} | (3.2) |
Assuming that \nu \ll \mu , we can write
\begin{equation} \mathcal{R}(\nu||\mu) = \mathbb{E}^{\nu}[\Phi_\mu(u) - \Phi_\nu(u)] + \log(Z_\mu) - \log(Z_\nu) \end{equation} | (3.3) |
The assumption that \nu \ll \mu implies that \nu and \mu are equivalent measures. As was proven in [16], if \mathcal{A} is a set of Gaussian measures, closed under weak convergence, such that at least one element of \mathcal{A} is absolutely continuous with respect to \mu , then any minimizing sequence over \mathcal{A} will have a weak subsequential limit.
If we assume, for this work, that C = C_0 , then, by the Cameron-Martin formula (see [9]),
\begin{equation} \Phi_\nu(u) = -\left\langle {u-m},{m -m_0}\right\rangle_{ \mathcal{H}^1} - \frac{1}{2}\left \|{m - m_0}\right\|_{ \mathcal{H}^1}^2, \quad Z_{\nu} = 1. \end{equation} | (3.4) |
Here, \left\langle {\bullet}, {\bullet}\right\rangle_{ \mathcal{H}^1} and \|\bullet\|_{ \mathcal{H}^1} are the inner product and norms of the Cameron-Martin Hilbert space, denoted \mathcal{H}^1 ,
\begin{equation} \left\langle {f},{g}\right\rangle_{ \mathcal{H}^1} = \left\langle {C_0^{-1/2} f},{C_0^{-1/2} g}\right\rangle, \quad \left \|{f}\right\|_{ \mathcal{H}^1}^2 = \left\langle {f},{f}\right\rangle_{ \mathcal{H}^1}^2. \end{equation} | (3.5) |
Convergence to the minimizer will be established in \mathcal{H}^1 , and \mathcal{H}^1 will be the relevant Hilbert space in our application of Theorems 2.1 and 2.2 to this problem.
Letting \nu_0 = N(0, C_0) and v\sim \nu_0 , we can then rewrite (3.3) as
\begin{equation} J(m) \equiv \mathcal{R}(\nu||\mu) = \mathbb{E}^{\nu_0}[\Phi_{\mu}(v + m)] + \frac{1}{2}\left \|{m - m_0}\right\|_{ \mathcal{H}^1}^2 + \log(Z_\mu) \end{equation} | (3.6) |
The Euler-Lagrange equation associated with (3.6), and the second variation, are:
\begin{align} J'(m) & = \mathbb{E}^{\nu_0}[\Phi'_\mu(v+m)] + C_0^{-1}(m-m_0), \end{align} | (3.7) |
\begin{align} J''(m) & = \mathbb{E}^{\nu_0}[\Phi''_\mu(v+m)] + C_0^{-1}. \end{align} | (3.8) |
In [15], it was suggested that rather than try to find a root of (3.7), the equation first be preconditioned by multiplying by C_0 ,
\begin{equation} C_0 \mathbb{E}^{\nu_0}[\Phi'_\mu(v+m)] + (m-m_0), \end{equation} | (3.9) |
and a root of this mapping is sought, instead. Defining
\begin{align} f(m) & = C_0 \mathbb{E}^{\nu_0}[\Phi'_\mu(v+m)] + (m-m_0), \end{align} | (3.10) |
\begin{align} F(m,v) & = C_0\Phi'_\mu(v+m) + (m-m_0). \end{align} | (3.11) |
The Robbins-Monro formulation is then
\begin{equation} m_{n+1} = m_n - a_{n+1} F(m_n, v_{n+1}) + P_{n+1}, \end{equation} | (3.12) |
with v_n \sim \nu_0 , i.i.d.
We thus have
Theorem 3.1. Assume:
● There exists \nu = N(m, C_0)\sim \mu_0 such that \nu\ll\mu .
● \Phi_\mu' and \Phi_\mu'' exist for all u \in \mathcal{H}^1 .
● There exists m_\star , a local minimizer of J , such that J'(m_\star) = 0 .
● The mapping
\begin{equation} m\mapsto \mathbb{E}^{\nu_0}\left[{\left \|{\sqrt{C_0}\Phi_\mu'(m+v)}\right\|^2}\right] \end{equation} | (3.13) |
is bounded on bounded subsets of \mathcal{H}^1 .
● There exists a convex neighborhood U_\star of m_\star and a constant \alpha > 0 , such that for all m\in U_\star , for all u \in \mathcal{H}^1 ,
\begin{equation} \left\langle {J''(m)u},{u}\right\rangle\geq \alpha \left \|{u}\right\|_{ \mathcal{H}^1}^2 \end{equation} | (3.14) |
Then, choosing a_n according to Assumption 4,
● If the subset U_\star can be taken to be all of \mathcal{H}^1 , for the expanding truncation algorithm, m_n \to m_\star a.s. in \mathcal{H}^1 .
● If the subset U_\star is not all of \mathcal{H}^1 , then, taking U_1 to be a bounded (in \mathcal{H}^1 ) convex subset of U_\star , with m_\star \in U_1 , and U_0 any subset of U_1 such that there exist R_0 < R_1 with
U_0 \subset B_{R_0}(x_\star) \subset B_{R_1}(x_\star)\subset U_1, |
for the fixed truncation algorithm, m_n\to m_\star a.s. in \mathcal{H}^1 .
Proof. We split the proof into 2 steps:
1. By the assumptions of the theorem, we clearly satisfy Assumptions 1 and 4. To satisfy Assumption 3, we observe that
\begin{equation*} \mathbb{E}^{\nu_0}[\left \|{F(m,v)}\right\|^2_{ \mathcal{H}^1}]\leq 2 \mathbb{E}^{\nu_0}\left[{\left \|{\sqrt{C_0}\Phi_\mu'(m+v)}\right\|^2}\right] + 2\left \|{m-m_0}\right\|_{ \mathcal{H}^1}^2. \end{equation*} |
This is bounded on bounded subsets of \mathcal{H}^1 .
2. Per the convexity assumption, (3.14), implies Assumption 2, since, by the mean value theorem in function spaces,
\begin{equation*} \begin{split} \left\langle {m-m_\star},{f(m)}\right\rangle_{ \mathcal{H}^1} & = \left\langle {m-m_\star},{C_0\left[{J'(m_\star) +J''(\tilde m)(m-m_\star) }\right]}\right\rangle_{ \mathcal{H}^1}\\ & = \left\langle {m-m_\star},{J''(\tilde m)(m-m_\star)}\right\rangle\geq \alpha\left \|{m-m_\star}\right\|_{ \mathcal{H}^1}^2 \end{split} \end{equation*} |
where \tilde m is some intermediate point between m and m_\star . This completes the proof.
While condition (3.14) is sufficient to obtain convexity, other conditions are possible. For instance, suppose there is a convex open set U_\star containing m_\star and constant \theta\in [0, 1) , such that for all m \in U_\star ,
\begin{equation} \inf\limits_{\substack{u\in \mathcal{H}\\ u\neq 0}} \frac{\left\langle { \mathbb{E}^{\nu_0}[\Phi''_\mu(v+m)]u},{u}\right\rangle}{\left \|{u}\right\|^2}\geq -\theta\lambda_1^{-1}, \end{equation} | (3.15) |
where \lambda_1 is the principal eigenvalue of C_0 . Then this would also imply Assumption 2, since
\begin{equation*} \begin{split} \left\langle {m-m_\star},{f(m)}\right\rangle_{ \mathcal{H}^1} & = \left\langle {m-m_\star},{C_0\left[{J'(m_\star) +J''(\tilde m)(m-m_\star) }\right]}\right\rangle_{ \mathcal{H}^1}\\ & = \left\langle {m-m_\star},{J''(\tilde m)(m-m_\star)}\right\rangle\\ &\geq \left \|{m-m_\star}\right\|_{ \mathcal{H}^1}^2 + \left\langle {m-m_\star},{ \mathbb{E}^{\nu_0}[\Phi''_\mu(v+\tilde m)] (m-m_\star)}\right\rangle\\ &\geq \left \|{m-m_\star}\right\|_{ \mathcal{H}^1}^2 -\theta \lambda_1^{-1} \left \|{m-m_\star}\right\|^2\\ &\geq (1-\theta)\left \|{m-m_\star}\right\|_{ \mathcal{H}^1}^2. \end{split} \end{equation*} |
We mention (3.15) as there may be cases, shown below, for which the operator \mathbb{E}^{\nu_0}[\Phi''_\mu(v+ m)] is obviously nonnegative.
To apply the Robbins-Monro algorithm to the relative entropy minimization problem, the \Phi_\mu functional of interest must be examined. In this section we present a few examples, based on those presented in [15], and examine when the assumptions hold. The one outstanding assumption that we must make is that, a priori, \mu_0 is an equivalent measure to \mu .
Taking \mu_0 = N(0, 1) , the standard unit Gaussian, let V: \mathbb{R} \to \mathbb{R} be a smooth function such that
\begin{equation} \frac{d\mu}{d\mu_0} = \frac{1}{Z_\mu} \exp\left\{{-{ \epsilon^{-1}}V(x)}\right\} \end{equation} | (4.1) |
is a probability measure on \mathbb{R} . For these scalar cases, we use x in place of v . In the above framework,
\begin{align*} F(x,\xi) & = { \epsilon^{-1}}V'(x+\xi) -\xi,\\ f(x) & = { \epsilon^{-1}} \mathbb{E}[V'(x+\xi)]m \\ \Phi_\mu'(x) & = { \epsilon^{-1}}V'(x), \\ \Phi_\mu''(x)& = { \epsilon^{-1}}V''(x) \end{align*} |
and \xi\sim N(0, 1) = \nu_0 = \mu_0 .
Consider the case that
\begin{equation} V(x) = \tfrac{1}{2}x^2 + \tfrac{1}{4}x^4. \end{equation} | (4.2) |
In this case
\begin{align*} F(x,\xi)& = { \epsilon^{-1}}\left({x+\xi + (x+\xi)^3}\right) + x,\\ f(x) & = { \epsilon^{-1}}\left({4x + x^3}\right) +x, \\ \mathbb{E}[\Phi''_\mu(x+\xi)] & = { \epsilon^{-1}}(4 + 3x^2),\\ \mathbb{E}[\left |{\Phi'_\mu(x+\xi)}\right |^2] & = { \epsilon^{-1}} \left({22 + 58 x^2 + 17 x^4 + x^6}\right). \end{align*} |
Since \mathbb{E}[\Phi''_\mu(x+\xi)] \geq 4 { \epsilon^{-1}} , all of our assumptions are satisfied and the expanding truncation algorithm will converge to the unique root at x_\star = 0 a.s. See Figure 1 for an example of the convergence at \epsilon = 0.1 , U_{n} = (-n -1, n+1) , and always restarting at 0.5 .
We refer to this as a "globally convex'' problem since \mathcal{R} is globally convex about the minimizer.
In contrast to the above problem, some mimizers are only "locally'' convex. Consider the case the double well potential
\begin{equation} V(x) = \tfrac{1}{4}(4-x^2)^2 \end{equation} | (4.3) |
Now, the expressions for RM are
\begin{align*} F(x,\xi) & = { \epsilon^{-1}}\left({(x+\xi)^3-4(x+\xi))}\right) + x,\\ f(x) & = { \epsilon^{-1}}\left({x^3-x}\right) +x, \\ \mathbb{E}[\Phi''_\mu(x+\xi)] & = { \epsilon^{-1}}\left({3x^2-1}\right),\\ \mathbb{E}[\left |{\Phi'_\mu(x+\xi)}\right |^2] & = { \epsilon^{-1}} (1 + x^2) (7 + 6 x^2 +x^4). \end{align*} |
In this case, f(x) vanishes at 0 and \pm \sqrt{1- \epsilon} , and J'' changes sign from positive to negative when x enters ({-\sqrt{(1- \epsilon)/3}, \sqrt{({1- \epsilon})/{3}}}) . We must therefore restrict to a fixed trust region if we want to ensure convergence to either of \pm\sqrt{1- \epsilon} .
We ran the problem at \epsilon = 0.1 in two cases. In the first case, U_1 = (0.6, 3.0) and the process always restarts at 2 . This guarantees convergence since the second variation will be strictly postive. In the second case, U_1 = (-0.5, 1.5) , and the process always restarts at -0.1 . Now, the second variation can change sign. The results of these two experiments appear in Figure 2. For some random number sequences the algorithm still converged to \sqrt{1- \epsilon} , even with the poor choice of trust region.
Take \mu_0 = N(m_0(t), C_0) , with
\begin{equation} C_0 = \left({-\frac{d^2}{dt^2}}\right)^{-1}, \end{equation} | (4.4) |
equipped with Dirichlet boundary conditions on \mathcal{H} = L^2(0, 1) .* In this case the Cameron-Martin space \mathcal{H}^1 = H^1_0(0, 1) , the standard Sobolev space equipped with the Dirichlet norm. Let us assume m_0 \in H^1(0, 1) , taking values in \mathbb{R}^d .
* This is the covariance of the standard unit Brownian bridge, Y_t = B_t - t B_1 .
Consider the path space distribution on L^2(0, 1) , induced by
\begin{equation} \frac{d\mu}{d\mu_0} = - \frac{1}{Z_\mu}\exp\left\{{-\Phi_\mu(v)}\right\}, \quad \Phi_\mu(u) = { \epsilon^{-1}}\int_0^1 V(v(t))dt, \end{equation} | (4.5) |
where V: \mathbb{R}^d\to \mathbb{R} is a smooth function. We assume that V is such that this probability distribution exists and that \mu \sim \mu_0 , our reference measure.
We thus seek an \mathbb{R}^d valued function m(t) \in H^1(0, 1) for our Gaussian approximation of \mu , satisfying the boundary conditions
\begin{equation} m(0) = m_-,\quad m(1) = m_+. \end{equation} | (4.6) |
For simplicity, take m_0 = (1-t)m_- + t m_+ , the linear interpolant between m_\pm . As above, we work in the shifted coordinated x(t) = m(t) - m_0(t)\in H^1_0(0, 1) .
Given a path v(t)\in H^1_0 , by the Sobolev embedding, v is continuous with its L^\infty norm controlled by its H^1 norm. Also recall that for \xi \sim N(0, C_0) , in the case of \xi(t) \in \mathbb{R} ,
\begin{equation} \mathbb{E}\left[{\xi(t)^p}\right] = \begin{cases} 0, & \text{$p$ odd},\\ (p-1)!!\left[{t(1-t)}\right]^{\frac p 2}, & \text{$p$ even}. \end{cases} \end{equation} | (4.7) |
Letting \lambda_1 = 1/\pi^2 be the ground state eigenvalue of C_0 ,
\begin{equation*} \begin{split} \mathbb{E}[\|\sqrt{C_0}\Phi'_\mu(v +m_0+\xi)\|^2]&\leq {\lambda_1} \mathbb{E}[\|\Phi'_\mu(v +m_0+\xi)\|^2]\\ &\quad = {\lambda_1}{ \epsilon^{-2}}\int_0^1 \mathbb{E}[{\left |{V'(v(t)+m_0(t)+\xi(t))}\right |^2}]dt. \end{split} \end{equation*} |
The terms involving v+m_0 in the integrand can be controlled by the L^\infty norm, which in turn is controlled by the H^1 norm, while the terms involving \xi can be integrated according to (4.7). As a mapping applied to x , this expression is bounded on bounded subsets of H^1 .
Minimizers will satisfy the ODE
\begin{equation} { \epsilon}^{-1} \mathbb{E}\left[{V'(x+m_0 +\xi)}\right] -x'' = 0,\quad x(0) = x(1) = 0. \end{equation} | (4.8) |
With regard to convexity about a minimizer, m_\star , if, for instance, V'' were pointwise positive definite, then the problem would satisfy (3.15), ensuring convergence. Consider the quartic potential V given by (4.2). In this case,
\begin{equation} \Phi(v) = { \epsilon}^{-1}\int_0^1 \frac{1}{2}v(t)^2 +\frac{1}{4}v(t)^4 dt, \end{equation} | (4.9) |
and
\begin{align*} \Phi'(v+m_0+ \xi) & = { \epsilon}^{-1}\left[{(v+m_0 +\xi) +3(v+m_0 +\xi)^3 }\right]\\ \Phi''(v+m_0 + \xi) & = { \epsilon}^{-1}\left[{1 +3 (v+m_0+\xi)^2}\right],\\ \mathbb{E}[\Phi'(v+m_0 + \xi)]& = { \epsilon}^{-1}\left[{v+m_0 +(v+m_0)^3+ 3 t(1-t) (v+m_0)}\right]\\ \mathbb{E}[\Phi''(v+m_0 + \xi)]& = { \epsilon}^{-1}\left[{1 + 3 (v+m_0)^2 + 3 t(1-t) }\right] \end{align*} |
Since \Phi''(v+m_0+\xi)\geq \epsilon^{-1} , we are guaranteed convergence using expanding trust regions. Taking \epsilon = 0.01 , m_- = 0 and m_+ = 2 , this is illustrated in Figure 3, where we have also solved (4.8) by ODE methods for comparison. As trust regions, we take
\begin{equation} U_n = \left\{{m \in H^1_0(0,1)\mid \left \|{x}\right\|_{H^1}\leq 10+n}\right\}, \end{equation} | (4.10) |
and we always restart at the zero solution Figure 3 also shows robustness to discretization; the number of truncations is relatively insensitive to \Delta t .
For many problems of interest, we do not have global convexity. Consider the double well potential (4.3), but in the case of paths,
\begin{equation} \Phi(u) = { \epsilon^{-1}}\int_0^1\frac{1}{4} (4-v(t)^2)^2dt. \end{equation} | (4.11) |
Then,
\begin{align*} \Phi'(v + m_0 + \xi)& = { \epsilon}^{-1}\left[{(v + m_0 + \xi)^3 - 4 (v + m_0 + \xi)}\right]\\ \Phi''(v + m_0 + \xi) & = { \epsilon}^{-1}\left[{3 (v + m_0 + \xi)^2 - 4}\right],\\ \mathbb{E}[\Phi'(v+m_0 + \xi)]& = { \epsilon}^{-1}\left[{(v+m_0)^3 + 3 t(1-t) (v+m_0)-4(v+m_0)}\right]\\ \mathbb{E}[\Phi''(v+m_0 + \xi)]& = { \epsilon}^{-1}\left[{3(v+m_0)^2 + 3 t(1-t) -4}\right] \end{align*} |
Here, we take m_- = 0 , m_+ = 2 , and \epsilon = 0.01 . We have plotted the numerically solved ODE in Figure 4. Also plotted is \mathbb{E}[\Phi''(v_\star +m_0+ \xi)] . Note that \mathbb{E}[\Phi''(v_\star +m_0+ \xi)] is not sign definite, becoming as small as -400 . Since C_0 has \lambda_1 = 1/\pi^2 \approx 0.101 , (3.15) cannot apply.
Discretizing the Schrödinger operator
\begin{equation} J''(v_\star) = -\frac{d^2}{dt^2} + { \epsilon}^{-1}\left({3(v_\star(t)+m_0(t))^2 + 3 t(1-t) -4}\right), \end{equation} | (4.12) |
we numerically compute the eigenvalues. Plotted in Figure 5, we see that the minimal eigenvalue of J''(m_\star) is approximately \mu_1\approx 550 . Therefore,
\begin{equation} \left\langle {J''(x_\star)u},{u}\right\rangle\geq \mu_1 \left \|{u}\right\|^2_{L^2}\Rightarrow \left\langle {J''(x)u},{u}\right\rangle\geq \alpha\left \|{u}\right\|_{H^1}^2, \end{equation} | (4.13) |
for all v in some neighborhood of v_\star . For an appropriately selected fixed trust region, the algorithm will converge.
However, we can show that the convexity condition is not global. Consider the path m(t) = 2t^2 , which satisfies the boundary conditions. As shown in Figure 5, this path induces negative eigenvalues.
Despite this, we are still observe convergence. Using the fixed trust region
\begin{equation} U_1 = \left\{{x\in H^1_0(0,1)\mid \left \|{x}\right\|_{H^1}\leq 100}\right\}, \end{equation} | (4.14) |
we obtain the results in Figure 6. Again, the convergence is robust to discretization.
We have shown that the Robbins-Monro algorithm, with both fixed and expanding trust regions, can be applied to Hilbert space valued problems, adapting the finite dimensional proof of [12]. We have also constructed sufficient conditions for which the relative entropy minimization problem fits within this framework.
One problem we did not address here was how to identify fixed trust regions. Indeed, that requires a tremendous amount of a priori information that is almost certainly not available. We interpret that result as a local convergence result that gives a theoretical basis for applying the algorithm. In practice, since the root is likely unknown, one might run some numerical experiments to identify a reasonable trust region, or just use expanding trust regions. The practitioner will find that the algorithm converges to a solution, though perhaps not the one originally envisioned. A more sophisticated analysis may address the convergence to a set of roots, while being agnostic as to which zero is found.
Another problem we did not address was how to optimize not just the mean, but also the covariance in the Gaussian. As discussed in [15], it is necessary to parameterize the covariance in some way, which will be application specific. Thus, while the form of the first variation of relative entropy with respect to the mean, (3.7), is quite generic, the corresponding expression for the covariance will be specific to the covariance parameterization. Additional constraints are also necessary to guarantee that the parameters always induce a covariance operator. We leave such specialization as future work.
This work was supported by US Department of Energy Award DE-SC0012733. This work was completed under US National Science Foundation Grant DMS-1818716. The authors would like to thank J. Lelong for helpful comments, along with anonymous reviewers whose reports significantly impacted our work.
The authors declare that there is no conflicts of interest in this paper.
[1] |
Mashkour M, Ranjbar Y (2018) Superparamagnetic Fe3O4@ wood flour/polypropylene nanocomposites: Physical and mechanical properties. Ind Crop Prod 111: 47–54. https://doi.org/10.1016/j.indcrop.2017.09.068 doi: 10.1016/j.indcrop.2017.09.068
![]() |
[2] |
Sudirman AW (2020) Effect of cellphone electromagnetic wave radiation on the development of sperm. JIKSH 9: 708–712. https://doi.org/10.35816/jiskh.v12i2.385 doi: 10.35816/jiskh.v12i2.385
![]() |
[3] | Swamardika IBA (2009) Pengaruh radiasi gelombang elektromagnetik terhadap kesehatan manusia (suatu kajian pustaka). MITE 8: 1–4. https://ojs.unud.ac.id/index.php/jte/article/view/1585 |
[4] |
Wang S, Ashfaq MZ, Gong H, et al. (2021) Electromagnetic wave absorption properties of magnetic particle-doped SiCN (C) composite ceramics. J Mater Sci Mater Electron 32: 4529–4543. https://doi.org/10.1007/s10854-020-05195-5 doi: 10.1007/s10854-020-05195-5
![]() |
[5] |
Gao K, Zhao J, Bai Z, et al. (2019) The preparation of FeCo/ZnOcomposites and enhancement of microwave absorbing property by two-step method. Materials 12: 3259. https://doi.org/10.3390/ma12193259 doi: 10.3390/ma12193259
![]() |
[6] |
Lu C, Wu M, Lin L, et al. (2019) Single-phase multiferroics: New materials, phenomena, and physics. Natl Sci Rev 6: 653–668. https://doi.org/10.1093/nsr/nwz091 doi: 10.1093/nsr/nwz091
![]() |
[7] |
Zhao Z, Gao Z, Lan D, et al. (2021) MOFs-derived hollow materials for electromagnetic wave absorption: Prospects and challenges. J Mater Sci Mater Electron 32: 25631–25648. https://doi.org/10.1007/s10854-021-06069-0 doi: 10.1007/s10854-021-06069-0
![]() |
[8] |
Shanenkov I, Sivkov A, Ivashutenko A, et al. (2017) Magnetite hollow microspheres with a broad absorption bandwidth of 11.9 GHz: Toward promising lightweight electromagnetic microwave absorption. Phys Chem Chem Phys 19: 19975–19983. https://doi.org/10.1039/c7cp03292g doi: 10.1039/c7cp03292g
![]() |
[9] |
Wang F, Liu J, Kong J, et al. (2011) Template free synthesis and electromagnetic wave absorption properties of monodispersed hollow magnetite nano-spheres. J Mater Chem 21: 4314–4320. https://doi.org/10.1039/c0jm02894k doi: 10.1039/c0jm02894k
![]() |
[10] |
Zhang D, Cheng J, Yang X (2014) Electromagnetic and microwave absorbing properties of magnetite nanoparticles decorated carbon nanotubes/polyaniline multiphase heterostructures. J Mater Sci 49: 7221–7230. https://doi.org/10.1007/s10853-014-8429-3 doi: 10.1007/s10853-014-8429-3
![]() |
[11] |
Lou Z, Li Y, Han H, et al. (2018) Synthesis of porous 3D Fe/C composites from waste wood with tunable and excellent electromagnetic wave absorption performance. ACS Sustainable Chem Eng 6: 15598–15607. https://doi.org/10.1021/acssuschemeng.8b04045 doi: 10.1021/acssuschemeng.8b04045
![]() |
[12] |
Lou Z, Han H, Zhou M, et al. (2018) Synthesis of magnetic wood with excellent and tunable electromagnetic wave-absorbing properties by a facile vacuum/pressure impregnation method. ACS Sustainable Chem Eng 6: 1000–1008. https://doi.org/10.1021/acssuschemeng.7b03332 doi: 10.1021/acssuschemeng.7b03332
![]() |
[13] |
Zhao S, Gao Z, Chen C, et al. (2016) Alternate nonmagnetic and magnetic multilayer nanofilms deposited on carbon nanocoils by atomic layer deposition to tune microwave absorption property. Carbon 98: 196–203. https://doi.org/10.1016/j.carbon.2015.10.101 doi: 10.1016/j.carbon.2015.10.101
![]() |
[14] |
Qiang R, Du Y, Wang Y, et al. (2016) Rational design of yolk-shell C@C microspheres for the effective enhancement in microwave absorption. Carbon 98: 599–606. https://doi.org/10.1016/j.carbon.2015.11.054 doi: 10.1016/j.carbon.2015.11.054
![]() |
[15] |
Xu H, Yin X, Zhu M, et al. (2017) Carbon hollow microspheres with a designable mesoporous shell for high-performance electromagnetic wave absorption. ACS Appl Mater Interfaces 9: 6332–6341. https://doi.org/10.1021/acsami.6b15826 doi: 10.1021/acsami.6b15826
![]() |
[16] |
Zhang N, Huang Y, Wang M (2018) 3D ferromagnetic graphene nanocomposites with ZnO nanorods and Fe3O4 nanoparticles co-decorated for efficient electromagnetic wave absorption. Compos Part B-Eng 136: 135–142. https://doi.org/10.1016/j.compositesb.2017.10.029 doi: 10.1016/j.compositesb.2017.10.029
![]() |
[17] |
Zhang H, Xie A, Wang C, et al. (2013) Novel rGO/α-Fe2O3 composite hydrogel: Synthesis, characterization and high performance of electromagnetic wave absorption. J Mater Chem A 1: 8547–8552. https://doi.org/10.1039/c3ta11278k doi: 10.1039/c3ta11278k
![]() |
[18] |
Zhang N, Huang Y, Zong M, et al. (2017) Synthesis of ZnS quantum dots and CoFe2O4 nanoparticles co-loaded with graphene nanosheets as an efficient broad band EM wave absorber. Chem Eng J 308: 214–221. https://doi.org/10.1016/j.cej.2016.09.065 doi: 10.1016/j.cej.2016.09.065
![]() |
[19] |
Trey S, Olsson RT, Ström V, et al. (2014) Controlled deposition of magnetic particles within the 3-D template of wood: Making use of the natural hierarchical structure of wood. RSC Adv 4: 35678–35685. https://doi.org/10.1039/c4ra04715j doi: 10.1039/c4ra04715j
![]() |
[20] |
Gan W, Gao L, Zhan X, et al. (2015) Hydrothermal synthesis of magnetic wood composites and improved wood properties by precipitation with CoFe2O4/hydroxyapatite. RSC Adv 5: 45919–45927. https://doi.org/10.1039/c5ra06138e doi: 10.1039/c5ra06138e
![]() |
[21] |
Lou Z, Zhang Y, Zhou M, et al. (2018) Synthesis of magnetic wood fiber board and corresponding multi-layer magnetic composite board, with electromagnetic wave absorbing properties. Nanomaterials 8: 1–14. https://doi.org/10.3390/nano8060441 doi: 10.3390/nano8060441
![]() |
[22] |
Liu TT, Cao MQ, Fang YS, et al. (2022) Green building materials lit up by electromagnetic absorption function: A review. J Mater Sci Technol 112: 329–344. https://doi.org/10.1016/j.jmst.2021.10.022 doi: 10.1016/j.jmst.2021.10.022
![]() |
[23] |
Lou Z, Han X, Liu J, et al. (2021) Nano-Fe3O4/bamboo bundles/phenolic resin oriented recombination ternary composite with enhanced multiple functions. Compos Part B-Eng 226: 109335. https://doi.org/10.1016/J.COMPOSITESB.2021.109335 doi: 10.1016/j.compositesb.2021.109335
![]() |
[24] |
Oka H, Terui M, Osada H, et al. (2012) Electromagnetic wave absorption characteristics adjustment method of recycled powder-type magnetic wood for use as a building material. IEEE Trans Magn 48: 3498–3500. https://doi.org/10.1109/TMAG.2012.2196026 doi: 10.1109/TMAG.2012.2196026
![]() |
[25] |
Pourjafar S, Rahimpour A, Jahanshahi M (2012) Synthesis and characterization of PVA/PES thin film composite nanofiltration membrane modified with TiO2 nanoparticles for better performance and surface properties. J Ind Eng Chem 18: 1398–1405. https://doi.org/10.1016/j.jiec.2012.01.041 doi: 10.1016/j.jiec.2012.01.041
![]() |
[26] |
Oka H, Fujita H (1999) Experimental study on magnetic and heating characteristics of magnetic wood. J Appl Phys 85: 5732–5734. https://doi.org/10.1063/1.370267 doi: 10.1063/1.370267
![]() |
[27] |
Dong Y, Yan Y, Zhang S, et al. (2014) Wood/polymer nanocomposites prepared by impregnation with furfuryl alcohol and Nano-SiO2. BioResources 9: 6028–6040. https://doi.org/10.15376/biores.9.4.6028-6040 doi: 10.15376/biores.9.4.6028-6040
![]() |
[28] |
Rahayu I, Prihatini E, Ismail R, et al. (2022) Fast-growing magnetic wood synthesis by an in-situ method. Polymers 14: 2137. https://doi.org/10.3390/polym14112137 doi: 10.3390/polym14112137
![]() |
[29] |
Zhang X, Zhou R, Rao W, et al. (2006) Influence of precipitator agents NaOH and NH4OH on the preparation of Fe3O4 nano-particles synthesized by electron beam irradiation. J Radioanal Nucl Chem 270: 285–289. https://doi.org/10.1007/s10967-006-0346-8 doi: 10.1007/s10967-006-0346-8
![]() |
[30] |
Fajriani E, Ruelle J, Dlouha J, et al. (2013) Radial variation of wood properties of sengon (paraserianthes falcataria) and jabon (anthocephalus cadamba). J Indian Acad Wood Sci 10: 110–117. https://doi.org/10.1007/s13196-013-0101-z doi: 10.1007/s13196-013-0101-z
![]() |
[31] | Rahayu I, Darmawan W, Nugroho N, et al. (2014) Demarcation point between juvenile and mature wood in sengon (falcataria moluccana) and jabon (antocephalus cadamba). J Trop For Sci 26: 331–339. https://www.jstor.org/stable/43150914 |
[32] |
Priadi T, Sholihah M, Karlinasari L (2019) Water absorption and dimensional stability of heat-treated fast-growing hardwoods. J Korean Wood Sci Technol 47: 567–578. https://doi.org/10.5658/WOOD.2019.47.5.567 doi: 10.5658/WOOD.2019.47.5.567
![]() |
[33] |
Hadi YS, Massijaya MY, Abdillah IB, et al. (2020) Color change and resistance to subterranean termite attack of mangium (acacia mangium) and sengon (falcataria moluccana) smoked wood. J Korean Wood Sci Technol 48: 1–11. https://doi.org/10.5658/WOOD.2020.48.1.1 doi: 10.5658/WOOD.2020.48.1.1
![]() |
[34] | Hartati N, Sudarmonowati E, Fatriasari W, et al. (2010) Wood characteristic of superior sengon collection and prospect of wood properties improvement through genetic engineering. Wood Res J 1: 103–107. https://api.semanticscholar.org/CorpusID:89700771 |
[35] | Krisnawati H, Kallio M, Kanninen M (2011) Anthocephalus Cadamba Miq.: Ecology, Silviculture and Productivity, Bogor: Center for International Forestry Research. https://doi.org/10.17528/cifor/003481 |
[36] |
Laksono GD, Rahayu IS, Karlinasari L, et al. (2023) Characteristics of magnetic sengon wood impregnated with nano Fe3O4 and furfuryl alcohol. J Korean Wood Sci Technol 51: 1–13. https://doi.org/10.5658/WOOD.2023.51.1.1 doi: 10.5658/WOOD.2023.51.1.1
![]() |
[37] |
Jaunslavietis J, Shulga G, Ozolins J, et al. (2018) Hydrophilic-hydrophobic characteristics of wood-polymer composites filled with modified wood particle. Key Eng Mater 762: 176–181. https://doi.org/10.4028/www.scientific.net/KEM.762.176 doi: 10.4028/www.scientific.net/KEM.762.176
![]() |
[38] |
Prihatini E, Wahyuningtyas I, Rahayu I, et al. (2022) Modification of fast-growing wood into magnetic wood with impregnation method using Fe3O4 nanoparticles. J Sylva Lestari 10: 211–222. https://doi.org/10.23960/jsl.v11i2.651 doi: 10.23960/jsl.v11i2.651
![]() |
[39] |
Tathod AP, Dhepe PL (2015) Efficient method for the conversion of agricultural waste into sugar alcohols over supported bimetallic catalysts. Bioresource Technol 178: 36–44. https://doi.org/10.1016/j.biortech.2014.10.036 doi: 10.1016/j.biortech.2014.10.036
![]() |
[40] |
Teng TJ, Arip MNM, Sudesh K, et al. (2018) Conventional technology and nanotechnology in wood preservation: A review. BioResources 13: 9220–9252. https://doi.org/10.15376/biores.13.4.Teng doi: 10.15376/biores.13.4.Teng
![]() |
[41] |
Baysal E, Ozaki SK, Yalinkilic MK (2004) Dimensional stabilization of wood treated with furfuryl alcohol catalysed by borates. Wood Sci Technol 38: 405–415. https://doi.org/10.1007/s00226-004-0248-2 doi: 10.1007/s00226-004-0248-2
![]() |
[42] |
Dong Y, Yan Y, Zhang Y, et al. (2016) Combined treatment for conversion of fast-growing poplar wood to magnetic wood with high dimensional stability. Wood Sci Technol 50: 503–517. https://doi.org/10.1007/s00226-015-0789-6 doi: 10.1007/s00226-015-0789-6
![]() |
[43] |
Li F, Jiang S, Huang J, et al. (2019) Catalytic transfer hydrogenation of furfural to furfuryl alcohol over a magnetic Fe3O4@C catalyst. New J Chem 44: 478–486. https://doi.org/10.1039/c9nj04698d doi: 10.1039/c9nj04698d
![]() |
[44] |
Hou P, Ma M, Zhang P, et al. (2021) Catalytic transfer hydrogenation of furfural to furfuryl alcohol using easy-to-separate core–shell magnetic zirconium hydroxide. New J Chem 45: 2715–2722. https://doi.org/10.1039/d0nj05638c doi: 10.1039/d0nj05638c
![]() |
[45] |
Alibegovic K, Morgan G, Losovyj Y, et al. (2017) Efficient furfuryl alcohol synthesis from furfural over magnetically recoverable catalysts: Does the catalyst stabilizing medium matter? ChemistrySelect 2: 5485–5491. https://doi.org/10.1002/slct.201701100 doi: 10.1002/slct.201701100
![]() |
[46] |
Wahyuningtyas I, Rahayu IS, Maddu A, et al. (2022) Magnetic properties of wood treated with nano-magnetite and furfuryl alcohol impregnation. BioResources 17: 6496–6510. https://ojs.cnr.ncsu.edu/index.php/BRJ/article/view/22098 doi: 10.15376/biores.17.4.6496-6510
![]() |
[47] |
Cheng Z, Wei Y, Liu C, et al. (2020) Lightweight and construable magnetic wood for electromagnetic interference shielding. Adv Eng Mater 22: 1–24. https://doi.org/10.1002/adem.202000257 doi: 10.1002/adem.202000257
![]() |
[48] |
Zheng Y, Song Y, Gao T, et al. (2020) Lightweight and hydrophobic three-dimensional wood-derived anisotropic magnetic porous carbon for highly efficient electromagnetic interference shielding. ACS Appl Mater Interfaces 12: 40802–40814. https://doi.org/10.1021/acsami.0c11530 doi: 10.1021/acsami.0c11530
![]() |
[49] | British Standard (1957) Methods of Testing Small Clear Specimens of Timber, London: British Standard Institution. Available from: https://allcivilstandard.com/wp-content/uploads/2019/02/BS-00373-1957-1999.pdf. |
[50] |
Peternele WS, Monge Fuentes V, Fascineli ML, et al. (2014) Experimental investigation of the coprecipitation method: An approach to obtain magnetite and maghemite nanoparticles with improved properties. J Nanomater 2014: 682985. https://doi.org/10.1155/2014/682985 doi: 10.1155/2014/682985
![]() |
[51] | Cornell RM, Schwertmann U (2003) The Iron Oxides: Structure, Properties, Reactions, Occurencs and Uses, Weinheim: Wiley. https://doi.org/10.1002/3527602097 |
[52] |
Sompech S, Srion A, Nuntiya A (2012) The effect of ultrasonic treatment on the particle size and specific surface area of LaCoO3. Procedia Eng 32: 1012–1018. https://doi.org/10.1016/j.proeng.2012.02.047 doi: 10.1016/j.proeng.2012.02.047
![]() |
[53] |
Oka H, Fujita H, Seki K (2000) Composition and heating efficiency of magnetic wood by induction heating. IEEE Trans Magn 36: 3715–3717. https://doi.org/10.1109/20.908950 doi: 10.1109/20.908950
![]() |
[54] | Bowyer JL, Shmulsky R, Haygreen JG (2007) Forest Products and Wood Science—An Introduction, Iowa: Blackwell Publisher. https://doi.org/10.1002/9780470960035 |
[55] | Rowell RM, Ellis WD (1978) Determination of dimensional stabilization of wood using the water-soak method. Wood Fiber Sci 10: 104–111. https://wfs.swst.org/index.php/wfs/article/view/1004 |
[56] | Hill CAS (2006) Wood Modification: Chemical, Thermal, and Other Processes, West Sussex: Willey. https://doi.org/10.1002/0470021748 |
[57] |
Gerasimov AM, Eremina OV, Cherkasova MV, et al. (2021) Application of particle-size analysis in various industries. J Phys Conf Ser 1728: 012003. https://doi.org/10.1088/1742-6596/1728/1/012003 doi: 10.1088/1742-6596/1728/1/012003
![]() |
[58] |
Jayaprakash J, Srinivasan N, Chandrasekaran P (2014) Surface modifications of CuO nanoparticles using ethylene diamine tetra acetic acid as a capping agent by sol-gel routine. Spectrochim Acta A 123: 363–368. https://doi.org/10.1016/J.SAA.2013.12.080 doi: 10.1016/j.saa.2013.12.080
![]() |
[59] |
Dubey V, Kain V (2018) Synthesis of magnetite by coprecipitation and sintering and its characterization. Mater Manuf Process 33: 835–839. https://doi.org/10.1080/10426914.2017.1401720 doi: 10.1080/10426914.2017.1401720
![]() |
[60] |
Fumis DB, Silveira MLDC, Gaglieri C, et al. (2022) The effect of EDTA functionalization on Fe3O4 thermal behavior. Mat Res 25: 1–6. https://doi.org/10.1590/1980-5373-MR-2022-0312 doi: 10.1590/1980-5373-MR-2022-0312
![]() |
[61] |
Magdalena AG, Silva IMB, Marques RFC, et al. (2018) EDTA-functionalized Fe3O4 nanoparticles. J Phys Chem Solids 113: 5–10. https://doi.org/10.1016/j.jpcs.2017.10.002 doi: 10.1016/j.jpcs.2017.10.002
![]() |
[62] |
Wang M, Wang N, Tang H, et al. (2012) Surface modification of nano-Fe3O4 with EDTA and its use in H2O2 activation for removing organic pollutants. Catal Sci Technol 2: 187–194. https://doi.org/10.1039/c1cy00260k doi: 10.1039/c1cy00260k
![]() |
[63] |
Pereira SV, Colombo FB, De Freitas LAP (2016) Ultrasound influence on the solubility of solid dispersions prepared for a poorly soluble drug. Ultrason Sonochem 29: 461–469. https://doi.org/10.1016/j.ultsonch.2015.10.022 doi: 10.1016/j.ultsonch.2015.10.022
![]() |
[64] |
Dudchenko N, Pawar S, Perelshtein I, et al. (2022) Magnetite nanoparticles: Synthesis and applications in optics. Materials 15: 2601. https://doi.org/10.3390/ma15072601 doi: 10.3390/ma15072601
![]() |
[65] |
Mascolo MC, Pei Y, Ring TA, et al. (2013) Room temperature co-precipitation synthesis of magnetite nanoparticles in a large pH window with different bases. Materials 6: 5549–5567. https://doi.org/10.3390/ma6125549 doi: 10.3390/ma6125549
![]() |
[66] |
Khan I, Saeed K, Khan I (2019) Nanoparticles: Properties, applications and toxicities. Arab J Chem 12: 908–931. https://doi.org/10.1016/j.arabjc.2017.05.011 doi: 10.1016/j.arabjc.2017.05.011
![]() |
[67] |
Fan S, Gao X, Pang J, et al. (2023) Enhanced preservative performance of pine wood through nano-xylan treatment assisted by high-temperature steam and vacuum impregnation. Materials 16: 3976. https://doi.org/10.3390/ma16113976 doi: 10.3390/ma16113976
![]() |
[68] |
Yulianingsih R, Sugiarto Y, Putranto W (2015) Mass transfer characteristics during vacuum impregnation process of papaya fruit in sucrose solution. JTP 16: 159–166. https://jtp.ub.ac.id/index.php/jtp/article/view/515 doi: 10.21776/ub.jtp.2015.016.03.01
![]() |
[69] | Martawijaya A, Hadjodarsono S, Haji M (2005) Atlas Kayu Indonesia, 2 Eds., Bogor: IAWA Journal. |
[70] | Praptoyo H (2005) Comparative study of two types sampling method for measuring cell proportion and fiber dimension on sengon salomon wood. J Ilmu Teknologi Kayu Tropis 3: 60–63. |
[71] |
Ishiguri F, Hiraiwa T, Iizuka K, et al. (2009) Radial variation of anatomical characteristics in paraserianthes falcataria planted in Indonesia. IAWA J 30: 343–352. https://doi.org/10.1163/22941932-90000223 doi: 10.1163/22941932-90000223
![]() |
[72] |
Ibrahim NA, Salleh KM, Fudholi A, et al. (2022) Drying regimes on regenerated cellulose films characteristics and properties. Membranes 12: 445. https://doi.org/10.3390/membranes12050445 doi: 10.3390/membranes12050445
![]() |
[73] |
Ashjari M, Reza A (2010) Efficient dispersion of magnetite nanoparticles in the polyurethane matrix through solution mixing and investigation of the nanocomposite properties. J Inorg Organomet Polym 20: 213–219. https://doi.org/10.1007/s10904-010-9337-x doi: 10.1007/s10904-010-9337-x
![]() |
[74] |
Saha MC, Kabir E, Jeelani S (2023) Enhancement in thermal and mechanical properties of polyurethane foam infused with nanoparticles. Mater Sci Eng A 479: 213–222. https://doi.org/10.1016/j.msea.2007.06.060 doi: 10.1016/j.msea.2007.06.060
![]() |
[75] |
Garskaite E, Stoll SL, Forsberg F, et al. (2021) The accessibility of the cell wall in scots pine (Pinus sylvestris l.) sapwood to colloidal Fe3O4 nanoparticles. ACS Omega 6: 21719–21729. https://doi.org/10.1021/acsomega.1c03204 doi: 10.1021/acsomega.1c03204
![]() |
[76] |
Li W, Ren D, Zhang X, et al. (2016) The furfurylation of wood: A nanomechanical study of modified wood cells. BioResources 11: 3614–3625. https://doi.org/10.15376/biores.11.2.3614-3625 doi: 10.15376/biores.11.2.3614-3625
![]() |
[77] |
Sharif HMA, Mahmood A, Cheng HY, et al. (2019) Fe3O4 nanoparticles coated with EDTA and Ag nanoparticles for the catalytic reduction of organic dyes from wastewater. ACS Appl Nano Mater 2: 5310–5319. https://doi.org/10.1021/acsanm.9b01250 doi: 10.1021/acsanm.9b01250
![]() |
[78] |
Rahayu IS, Wahyuningtyas I, Zaini LH, et al. (2021) Physical properties of impregnated ganitri wood by furfuryl alcohol and nano-SiO2. IOP Conf Ser Earth Environ Sci 891: 012012. https://doi.org/10.1088/1755-1315/891/1/012012 doi: 10.1088/1755-1315/891/1/012012
![]() |
[79] |
Hadi YS, Herliyana EN, Mulyosari D, et al. (2020) Termite resistance of furfuryl alcohol and imidacloprid treated fast-growing tropicalwood species as function of field test. Appl Sci 10: 6101. https://doi.org/10.3390/app10176101 doi: 10.3390/app10176101
![]() |
[80] |
Kong L, Guan H, Wang X (2018) In situ polymerization of furfuryl alcohol with ammonium dihydrogen phosphate in poplar wood for improved dimensional stability and flame retardancy. ACS Sustainable Chem Eng 6: 3349–3357. https://doi.org/10.1021/acssuschemeng.7b03518 doi: 10.1021/acssuschemeng.7b03518
![]() |
[81] |
Segmehl JS, Laromaine A, Keplinger T, et al. (2018) Magnetic wood by: In situ synthesis of iron oxide nanoparticles via a microwave-assisted route. J Mater Chem C 6: 3395–3402. https://doi.org/10.1039/c7tc05849g doi: 10.1039/c7tc05849g
![]() |
[82] |
Dirna FC, Rahayu I, Zaini LH, et al. (2020) Improvement of fast-growing wood species characteristics by MEG and nano SiO2 impregnation. J Korean Wood Sci Technol 48: 41–49. https://doi.org/10.5658/WOOD.2020.48.1.41 doi: 10.5658/WOOD.2020.48.1.41
![]() |
[83] |
Rahayu I, Darmawan W, Nawawi DS, et al. (2022) Physical properties of fast-growing wood-polymer nano composite synthesized through TiO2 nanoparticle impregnation. Polymers 14: 4463. https://doi.org/10.3390/polym14204463 doi: 10.3390/polym14204463
![]() |
[84] |
Ghani RSM, Lee MD (2021) Challenges of wood modification process for plantation eucalyptus: A review of Australian setting. J Korean Wood Sci Technol 49: 191–209. https://doi.org/10.5658/WOOD.2021.49.2.191 doi: 10.5658/WOOD.2021.49.2.191
![]() |
[85] |
Thygesen LG, Barsberg S, Vena TM (2010) Studied by fluorescence spectroscopy and confocal laser. Wood Sci Technol 44: 51–65. https://doi.org/10.1007/s00226-009-0255-4 doi: 10.1007/s00226-009-0255-4
![]() |
[86] |
Scimeca M, Bischetti S, Lamsira HK, et al. (2018) Energy dispersive X-ray (EDX) microanalysis: A powerful tool in biomedical research and diagnosis. Eur J Histochem 62: 89–99. https://doi.org/10.4081/ejh.2018.2841 doi: 10.4081/ejh.2018.2841
![]() |
[87] | Waly SA, Shehata MM, Massoud A (2018) Destructive and nondestructive analysis of some modern coins using ICP-AES and PIXE techniques. Chem Res J 3: 1–8. Available from: https://chemrj.org/download/vol-3-iss-1-2018/chemrj-2018-03-01-01-08.pdf. |
[88] |
Bartz W, Górka M, Rybak J, et al. (2021) The assessment of effectiveness of SEM- EDX and ICP-MS methods in the process of determining the mineralogical and geochemical composition of particulate matter deposited on spider webs. Chemosphere 278: 130454. https://doi.org/10.1016/j.chemosphere.2021.130454 doi: 10.1016/j.chemosphere.2021.130454
![]() |
[89] |
He M, Xu D, Li C, et al. (2020) Cell wall bulking by maleic anhydride for wood durability improvement. Forests 11: 367. https://doi.org/10.3390/F11040367 doi: 10.3390/f11040367
![]() |
[90] |
Gaitán-Alvarez J, Berrocal A, Lykidis C, et al. (2021) Furfurylation of tropical wood species with and without silver nanoparticles: Part Ⅱ: Evaluation of wood properties. Wood Mater Sci Eng 18: 1112–119. https://doi.org/10.1080/17480272.2021.1992795 doi: 10.1080/17480272.2021.1992795
![]() |
[91] |
Sundrarajan M, Ramalakshmi M (2012) Novel cubic magnetite nanoparticle synthesis using room temperature ionic liquid. E-J Chem 9: 541254. https://doi.org/10.1155/2012/541254 doi: 10.1155/2012/541254
![]() |
[92] | Xu YH, Huang C (2011) Effect of sodium periodate selective oxidation on crystallinity of cotton cellulose. Adv Mat Res 197–198: 1201–1204. https://doi.org/10.4028/www.scientific.net/AMR.197-198.1201 |
[93] |
Wang C, Piao C, Lucas C (2010) Synthesis and characterization of superhydrophobic wood surfaces. J Appl Polym Sci 116: 2658–2667. https://doi.org/10.1002/app.32844 doi: 10.1002/app.32844
![]() |
[94] |
Gan W, Gao L, Liu Y, et al. (2016) The magnetic, mechanical, thermal properties and UV resistance of CoFe2O4/SiO2-coated film on wood. J Wood Chem Technol 36: 94–104. https://doi.org/10.1080/02773813.2015.1074247 doi: 10.1080/02773813.2015.1074247
![]() |
[95] | Coates J (2006) Interpretation of infrared spectra, a practical approach, In: Meyers RA, McKelvy ML, Encyclopedia of Analytical Chemistry, Weinheim: Wiley. https://doi.org/10.1002/9780470027318.a5606 |
[96] |
Kim T, Assary RS, Kim H, et al. (2013) Effects of solvent on the furfuryl alcohol polymerization reaction: UV Raman spectroscopy study. Catal Today 205: 60–66. https://doi.org/10.1016/j.cattod.2012.09.033 doi: 10.1016/j.cattod.2012.09.033
![]() |
[97] |
Pranger LA, Nunnery GA, Tannenbaum R (2012) Mechanism of the nanoparticle-catalyzed polymerization of furfuryl alcohol and the thermal and mechanical properties of the resulting nanocomposites. Compos Part B-Eng 43: 1139–1146. https://doi.org/10.1016/j.compositesb.2011.08.010 doi: 10.1016/j.compositesb.2011.08.010
![]() |
[98] |
Lin CC, Ho JM (2014) Structural analysis and catalytic activity of Fe3O4 nanoparticles prepared by a facile co-precipitation method in a rotating packed bed. Ceram Int 40: 10275–10282. https://doi.org/10.1016/j.ceramint.2014.02.119 doi: 10.1016/j.ceramint.2014.02.119
![]() |
[99] |
Lou Z, Wang Q, Sun W, et al. (2022) Regulating lignin content to obtain excellent bamboo-derived electromagnetic wave absorber with thermal stability. Chem Eng J 430: 133178. https://doi.org/10.1016/j.cej.2021.133178 doi: 10.1016/j.cej.2021.133178
![]() |
[100] |
Wan Nor WFK, Soh SKC, Azmi AAAR, et al. (2018) Synthesis and physicochemical properties of magnetite nanoparticles (Fe3O4) as potential solid support for homogeneous catalysts. Malaysian J Anal Sci 22: 768–774. https://doi.org/10.17576/mjas-2018-2205-04 doi: 10.17576/mjas-2018-2205-04
![]() |
[101] |
Gieroba B, Krysa M, Wojtowicz K, et al. The FT-IR and raman spectroscopies as tools for biofilm characterization created by cariogenic streptococci. Int J Mol Sci 21: 3811. https://doi.org/10.3390/ijms21113811 doi: 10.3390/ijms21113811
![]() |
[102] |
Wang LL, Li N, Zhao T, et al. (2019) Magnetic properties of FeNi3 nanoparticle modified pinus radiata wood nanocomposites. Polymers 11: 421. https://doi.org/10.3390/polym11030421 doi: 10.3390/polym11030421
![]() |
[103] | Ramadani IWS (2015) Characterization of Line Broadening and 2θ0 Correction in X-Ray Diffraction Analysis, Surabaya: Sepuluh Nopember Institute of Technology. Available from: https://repository.its.ac.id/71784/1/1113201044-Master%20Thesis.pdf. |
[104] | Agarwal UP, Reiner RR, Ralph SA (2011) Cellulose crystallinity of woods, wood pulps, and agricultural fibers by FT-Raman spectroscopy. 16th International Symposium on Wood, Fiber, and Pulping, 1: 69–74. |
[105] |
Fadli A, Komalasari, Adnan A, et al. (2019) Synthesis of magnetite nanoparticles via co-precipitation method. IOP Conf Ser Mater Sci Eng 622: 1–7. https://doi.org/10.1088/1757-899X/622/1/012013 doi: 10.1088/1757-899X/622/1/012013
![]() |
[106] |
Batista NL, Olivier P, Bernhart G, et al. (2016) Correlation between degree of crystallinity, morphology and mechanical properties of PPS/carbon fiber laminates. Mat Res 19: 195–201. https://doi.org/10.1590/1980-5373-MR-2015-0453 doi: 10.1590/1980-5373-MR-2015-0453
![]() |
[107] |
Sejati PS, Akong FO, Torloting C, et al. (2022) Fully wood based novel translucent and thermoplastic materials by solvent-free esterification. RSC Adv 12: 35206–35214. https://doi.org/10.1039/d2ra06555j doi: 10.1039/d2ra06555j
![]() |
[108] | Susanti S (2014) Crystal Structure Study Magnetic Nanoparticles (Fe3O4) as a Function of Temperature Synthesis of Results Using Sonochemical. Yogyakarta: Universitas Islam Negeri Sunan Kalijag. |
[109] |
Ström V, Olsson RT, Rao KV. (2010) Real-time monitoring of the evolution of magnetism during precipitation of superparamagnetic nanoparticles for bioscience applications. J Mater Chem 20: 4168–4175. https://doi.org/10.1039/c0jm00043d doi: 10.1039/c0jm00043d
![]() |
[110] |
Fadia SL, Rahayu I, Nawawi DS, et al. (2023) The physical and magnetic properties of sengon (falcataria moluccana) wood impregnated with synthesized magnetite nanoparticles. J Sylva Lestari 11: 408–426. https://doi.org/10.23960/jsl.v11i3.761 doi: 10.23960/jsl.v11i3.761
![]() |
[111] |
Li Z, Chanéac C, Berger G, et al. (2019) Mechanism and kinetics of magnetite oxidation under hydrothermal conditions. RSC Adv 9: 33633–33642. https://doi.org/10.1039/c9ra03234g doi: 10.1039/c9ra03234g
![]() |
[112] |
Yu BY, Kwak SY (2010) Assembly of magnetite nanoparticles into spherical mesoporous aggregates with a 3-D wormhole-like porous structure. J Mater Chem 20: 8320–8328. https://doi.org/10.1039/C0JM01274B doi: 10.1039/C0JM01274B
![]() |
[113] |
Prihatini E, Ismail R, Rahayu IS, et al. (2023) Uji performa alat vakum tekan termodifikasi untuk impregnasi kayu. J Pengelolaan Lab Pendidik 5: 75–82. https://doi.org/10.14710/jplp.5.2.75-82 doi: 10.14710/jplp.5.2.75-82
![]() |
[114] | Tebriani S, Rifai H (2016) Analisis pengaruh ukuran bulir serta domain magnetik terhadap kesuburan tanah perkebunan sawit. Nat Sci J 4: 616–627. https://ejournal.uinib.ac.id/jurnal/index.php/naturalscience/article/view/454 |
[115] |
Tang T, Fu Y (2020) Formation of chitosan/sodium phytate/nano-Fe3O4 magnetic coatings on wood surfaces via layer-by-layer self-assembly. Coatings 10: 51. https://doi.org/10.3390/coatings10010051 doi: 10.3390/coatings10010051
![]() |
[116] |
Umehara Y, Endo H, Watanabe M, et al. (2018) Frequency spectra of vibration transmissibility for magnetic elastomers with various plasticizer contents. AIMS Mater Sci 5: 44–53. https://doi.org/10.3934/matersci.2018.1.44 doi: 10.3934/matersci.2018.1.44
![]() |
[117] |
Lam UT, Mammucari R, Suzuki K, et al. (2008) Processing of iron oxide nanoparticles by supercritical fluids. Ind Eng Chem Res 47: 599–614. https://doi.org/10.1021/ie070494+ doi: 10.1021/ie070494+
![]() |
[118] | Inoue A, Kong F (2022) Soft magnetic materials, In: Olabi AG, Encyclopedia of Smart Materials, Oxford: Elsevier, 10–23. https://doi.org/10.1016/B978-0-12-803581-8.11725-4 |
[119] |
Moya R, Gait J, Berrocal A, et al. (2022) In situ synthesis of Fe3O4 nanoparticles and wood composite properties of three tropical species. Materials 15: 3394. https://doi.org/10.3390/ma15093394 doi: 10.3390/ma15093394
![]() |
[120] |
Saxena N, Singh M (2017) Efficient synthesis of superparamagnetic magnetite nanoparticles under air for biomedical applications. J Magn Magn Mater 429: 166–176. https://doi.org/10.1016/j.jmmm.2017.01.031 doi: 10.1016/j.jmmm.2017.01.031
![]() |
[121] |
Fliegans J, Rado C, Soulas R, et al. (2021) Revisiting the demagnetization curves of Dy-diffused Nd-Fe-B sintered magnets. J Magn Magn Mater 520: 1–29. https://doi.org/10.1016/j.jmmm.2020.167280 doi: 10.1016/j.jmmm.2020.167280
![]() |
[122] |
Nypelö T (2022) Magnetic cellulose: Does extending cellulose versatility with magnetic functionality facilitate its use in devices? J Mater Chem C 10: 805–818. https://doi.org/10.1039/d1tc02105b doi: 10.1039/d1tc02105b
![]() |
[123] | Kirupakar BR, Vishwanath BA, Padma SM, et al. (2016) Vibrating sample magnetometer and its application in characterisation of magnetic property of the anti cancer drug magnetic microspheres. Int J Pharm Drug Anal 4: 227–233. |
[124] |
Schoppa A, Delarbre P (2014) Soft magnetic powder composites and potential applications in modern electric machines and devices. IEEE Trans Magn 50: 4–7. https://doi.org/10.1109/TMAG.2013.2290135 doi: 10.1109/TMAG.2013.2290135
![]() |
[125] |
Ying Y, Hu L, Li Z, et al. (2023) Preparation of densified fine-grain high-frequency MnZn ferrite using the cold sintering process. Materials 16: 3454. https://doi.org/10.3390/ma16093454 doi: 10.3390/ma16093454
![]() |
[126] |
Wang S, Zheng J, Zheng D, et al. (2022) Low core losses of Fe-based soft magnetic composites with an Zn-O-Si insulating layer obtained by coupling synergistic photodecomposition. Materials 15: 8660. https://doi.org/10.3390/ma15238660 doi: 10.3390/ma15238660
![]() |
[127] |
Das R, Ye L, Lal SS, et al. (2023) Fabrication and soft magnetic properties of FeSiB based flakes with insulating surface layer suitable for high frequency power applications. AIP Adv 13: 025210. https://doi.org/10.1063/9.0000406 doi: 10.1063/9.0000406
![]() |
[128] |
Nguyen KDV, Vo KDN (2020) Magnetite nanoparticles-TiO2 nanoparticles-graphene oxide nanocomposite: Synthesis, characterization and photocatalytic degradation for Rhodamine-B dye. AIMS Mater Sci 7: 288–301. https://doi.org/10.3934/MATERSCI.2020.3.288 doi: 10.3934/MATERSCI.2020.3.288
![]() |