Abstract
In this paper, we propose a convexification method for the reversed-time problem of a complex Ginzburg–Landau equation by introducing a new Carleman estimate for the complex Ginzburg–Landau operator, which holds on an arbitrary time interval. We construct a weighted Tikhonov-like functional and prove its global strict convexity. We establish both the existence and uniqueness of the minimizer, along with the global convergence of the associated gradient projection method toward the exact solution. These results ensure global convergence, unlike conventional least-squares minimization techniques, which only offer local convergence.
Keywords:
complex Ginzburg–Landau equation; reversed-time problem; convexification; Carleman estimate MSC:
35R30; 35R25; 35Q56
1. Introduction
The Ginzburg–Landau equation originated in the work of Ginzburg and Landau [1] as a model for superconductivity. Subsequently, the theory found applications in broader contexts such as phase transitions [2] and pattern-forming systems [3]. In 1969, Newell and Whitehead [4] and independently Segel [5] derived real-valued Ginzburg–Landau equations as amplitude equations for long waves. The complex-valued counterpart was later obtained by Stewartson and Stuart [6]. A typical example is the classical cubic complex Ginzburg–Landau equation (CGL), which takes the form
where is the imaginary unit, is a complex amplitude, is the coefficient of a linear driving term, and . The coefficients and are positive real numbers, which can be normalized to 1 by rescaling t and z. Many techniques are illustrated through the linearized CGL:
This equation also serves as the amplitude equation in pattern formation and describes the one-dimensional reaction diffusion of two chemical species [3]. Note that the linear CGL operator includes the heat operator as a special case and approaches the Schrödinger operator as . This connection makes the inverse problems for these equations mathematically interesting.
The well-posedness of the CGL and related equations has been extensively studied; see, e.g., [7,8,9,10,11,12,13,14,15,16,17,18,19] and references therein. Among these, some works established the existence and uniqueness of solutions for the linear CGL equation [8,10,18]. In particular, we focus on -in-time solutions as in [13,14]. The controllability and observability of parabolic-type equations have also been widely investigated [20,21,22,23,24,25,26]. In particular, the controllability of the CGL was studied in [27,28], which established null-controllability results based on Carleman estimates and sectorial operator theory.
In some physical regimes, the nonlinear term in the CGL is either neglected or treated linearly, so that the equation becomes linear. In the present paper, we consider the following reversed-time problem for the linear CGL. Let and be a bounded domain with boundary . Denote
Fix satisfying
and for some constant ,
We define the complex Ginzburg–Landau operator as
where is a given constant. Consider the linear CGL
where is a potential, subject to the zero Dirichlet boundary condition
and the terminal condition
The target problem involves finding a function satisfying (6)–(8) under conditions (3)–(5). Given the potential q and the terminal value g, we seek to reconstruct the solution z for . In contrast to the classical forward problem, the reversed-time problem considered here is ill-posed in the Hadamard sense, meaning that the solution lacks continuous dependence on the terminal data.
Conventional numerical methods for such problems typically rely on the minimization of least-squares Tikhonov-like functionals. However, these functionals often suffer from multiple local minima and ravines, which cause gradient-type descent methods to converge to arbitrary local minima unless the initial guess is sufficiently close to the exact solution. Such a precise initial guess is rarely available in practice, resulting in only local convergence. In contrast, a numerical method is called globally convergent if it is guaranteed, by a rigorous theorem, to produce a point in a sufficiently small neighborhood of the exact solution without any a priori knowledge of that neighborhood.
The concept of the convexification method was first introduced by Klibanov and his coauthors in 1995–1997 [29,30] to address the global convergence issue for inverse problems. The existence and uniqueness of the minimizer of the convexified functional were first established in [31]. Subsequently, the convexification methodology was extended to a range of problems, including the Helmholtz equation [32,33,34], hyperbolic equations [35,36,37], and electrical impedance tomography [38], and more recently for coefficient inverse problems of mean field games [39] and for 1D inverse problems with experimental data [40]. For parabolic equations with reversed-time, a convergent numerical approach was developed in [41]. However, the convexification method is a concept rather than a ready-to-use algorithm: each new problem requires its own version of the convexification method. In particular, there are few results on convexification for complex-valued equations. The main difficulty is the imaginary term in the operator . For a real parabolic operator, the derivation of the Carleman estimate follows a standard procedure where the signs of the resulting terms are well-controlled. In the complex case, however, the presence of i introduces additional cross-terms with indefinite signs, which must be carefully estimated.
For convexification, we construct a weighted Tikhonov-like functional for the reversed-time problem of the CGL, where is the parameter in the Carleman weight function . Given a convex bounded set of arbitrary diameter , one can choose sufficiently large such that the functional is strictly convex on , eliminating multiple local minima. Following the methodology in [31], we prove the existence and uniqueness of the minimizer of on and the global convergence of the gradient projection method to that minimizer. Moreover, as the noise level in the terminal data tends to zero, the minimizers converge to the correct solution of the reversed-time problem on the time interval , which means the minimizers stabilize with respect to small noise. Since the diameter R of is arbitrary, this amounts to global convergence.
The rest of this paper is organized as follows. Section 2 presents the main results of the convexification approach for the CGL reversed-time problem, namely the global strict convexity of the weighted Tikhonov-type functional, the existence and uniqueness of its minimizer, and the global convergence of the gradient projection method. Section 3 is devoted to the proof of a new Carleman estimate for the CGL operator, which is established through a four-step argument. Section 4 contains the proofs of Theorems 1–4. Finally, Section 5 provides a brief summary of the paper and discusses possible directions for future work. This is a purely theoretical work. Numerical experiments are not included and will be addressed in future research.
2. Statement of Main Results
We now state the main theoretical results of this work. We first introduce a transformation that converts the reversed-time problem into a form suitable for the convexification framework. Based on this transformation, we construct a weighted Tikhonov-like functional and establish its global strict convexity. We then demonstrate that the minimizer exists and is unique. We also establish the global convergence of the gradient projection method toward the exact solution. Finally, we provide accuracy estimates in the presence of noise in the terminal data.
Recall that by (8), the function is defined as . The following transformation is applied to the function :
Then, (6)–(8) lead to
where
Since we need to be bounded in , we assume that
Let k be an integer satisfying , where is the largest integer not exceeding . The Sobolev embedding theorem then ensures that and
where the constant depends only on Q. Define the subspace as
Given an arbitrary number , we introduce the bounded function set as
Hence, (13) implies that
where depends only on Q and R. The closure is taken with respect to the -norm.
Then, we introduce our Carleman weight function (CWF), which depends only on time variable that is,
where , , is a large parameter. We seek an approximate solution of problem (10)–(11) in . To this end, we choose and minimize the following weighted Tikhonov-like functional:
where is a regularization parameter and the multiplier balances the two terms in (18).
- Minimization problem. Minimize the functional on the set .
We now state the main results concerning the functional . The following theorem establishes the global strict convexity of on , which guarantees the absence of local minima and is the key result of the convexification method. We outline the strategy for proving the strict convexity of . The proof relies on the Carleman estimate established in Section 3. The main idea is to use this estimate to show that for sufficiently large , the quadratic term determines the convexity of the functional, yielding the strict convexity inequality (21). Details are given in Section 4.
Theorem 1
(The central theorem of this paper). Assume that conditions (3)–(5) and (11) hold. Then, for parameter , the functional has the Fréchet derivative at every point . Let be the constant of Theorem 5. Then, there exist constants
depending only on listed parameters such that if , the functional is strictly convex on for all , i.e., for all , , and , the following inequality holds:
Remark 1.
The constant in (21) is independent of λ and α. The strict convexity of on ensures that the minimization problem has a unique global minimizer, and it is also a key to prove the global convergences, which are established in the following theorems.
Regarding the existence and uniqueness of the minimizer, we establish Theorem 2 in the following.
Theorem 2.
To actually compute the minimizer whose existence is guaranteed by Theorem 2, we develop the gradient projection algorithm for minimizing over the convex set .
denotes the orthogonal projection from onto . Choose an arbitrary initial point and a parameter . The gradient projection iteration is then defined as
The following theorem establishes the global convergence of the gradient projection method to the unique minimizer.
Theorem 3
(Convergence of the gradient projection method). Let be the number of Theorem 1. Choose . Let be the unique minimizer of the functional on . Then, there exists a sufficiently small number such that for every , there exists such that
Consider now the case of the data containing noise. We use again one of Tikhonov’s concepts of regularization. More precisely, using (13), we assume that there exist exact noiseless data in (11), and there exists an exact solution of problem (10), where g is, respectively, replaced with . Let be the level of noise in the data , i.e.,
The following theorem provides the accuracy and convergence rate estimates for the minimizer and the gradient projection method in the presence of noise.
Theorem 4
(Estimates of the accuracy and the convergence rate). Assume that there exists the exact solution of problem (10) and condition (24) holds. Let be the number of Theorem 1. Select an arbitrary . For any , set as in Lemma 3.1 of [41]. Let
be sufficiently small such that . Let be the unique minimizer of on . Let be the number defined in Theorem 3. Let and be the numbers of Theorem 3. Then, the following estimates hold:
where , and is a positive constant.
Remark 2.
The choice of in Theorem 4 is necessary for the theoretical convergence analysis as . However, from a computational perspective, such an exponentially small α may lead to ill-conditioning of the discrete problem. In practical implementations, one may choose a slightly larger α and use a posteriori parameter selection strategy. A detailed numerical study of this issue is left for future work.
Remark 3.
Unlike the local convergence of conventional least-squares minimization techniques, the convergences in Theorems 3 and 4 are global.
The proofs of Theorems 1–4 are given in Section 4 below.
3. Carleman Estimate
In this section, we establish a Carleman estimate for the complex Ginzburg–Landau operator . We choose a suitable time-dependent CWF, which allows us to obtain an estimate on an arbitrary time interval . The result is stated in Theorem 5.
We first recall an identity from Corollary 2.1 of [42] (see Lemma 1 below). Based on this identity, by choosing a suitable CWF and performing some appropriate constructions, we obtain our Carleman estimate.
Lemma 1
([42] Corollary 2.1). Let and satisfy for . Let and . Set , , and
Then,
where
Theorem 5
(Carleman estimate). Let and satisfy for . Let and . Set and . By setting , there exist numbers ,
depending only on listed parameters such that the following Carleman estimate holds:
We are now in a position to prove Theorem 5.
Proof of Theorem 5.
Differentiate with respect to x and t to obtain
The proof is divided into four steps.
- Step 1. Firstly, by integrating (27) over Q, we haveThen, we estimate the left-hand side of the inequality (37). From (28) and (31), we obtainLet be the outward normal vector to at the point . Using Gauss’s formula, (29), and (35), we haveRecall that on . Obviously, we getWe now analyze the terms on the right-hand side of (37). By (34), we haveandSimilarly, we obtainFrom (30) and (34)–(36), we obtainSubstituting (38) and (40)–(44) into (37), and using , we haveBy , we have
The estimate in (45) involves only . We now derive an additional term involving . Therefore, we will proceed with the next steps.
- Step 2. Construct the following two terms:andSumming up (46) with (47), and using and on , we haveNext, we estimate the left-hand side of the above inequality (48) asThen, we estimate the right-hand side of the above inequality (48) asFinally, integrating (48) over Q and using (49) and (50), we obtainMultiplying (51) by and summing up with (45), we obtain
This completes the proof of Theorem 5. □
Remark 4.
By applying the chosen weight function to Corollary 2.1 of [42], we initially derive (45), which primarily involves only the term. We then develop additional terms (46)–(47). This process ultimately yields our improved Carleman estimate (33), which includes both the term and the gradient term . This allows us to obtain the accuracy estimates in . Moreover, the constants depends on b. As , the estimate formally recovers the real parabolic case [41].
4. Proofs of the Main Theorems
In this section, we prove Theorems 1–4 stated in Section 2. The proof of Theorem 1 is based on the Carleman estimate established in Section 3, combined with the transformation and functional construction introduced in Section 2.
Proof of Theorem 1.
Consider arbitrary functions . We denote . Then,
Hence, by (16),
Then,
where and refer to the linear and nonlinear parts of (62) in h, respectively. The linear part is given by
We represent the term in (62) as
Thus, (18) and (62)–(64) imply that
where is the scalar product in . Assuming temporarily that h is an arbitrary function of , consider the expression :
Clearly, is a bounded linear functional. By Riesz theorem, there exists a unique function such that
Also, (65)–(67) imply that
Hence, S is the Fréchet derivative of the functional at ,
We now come back again to the case when . Using (65)–(69), we obtain
It follows from (33), (64), , and the Cauchy–Schwarz inequality that
Since , we obtain
Then, by recalling and choosing based on the same parameters as those listed in (19) such that , we have
where depends on Q and R. (72) implies (21).
This completes the proof of Theorem 1. □
We now prove Theorem 2.
Proof of Theorem 2.
The strict convexity of the functional on follows from Theorem 1. Next, we prove the Lipschitz continuity of the Fréchet derivative .
We now prove Theorem 3.
Proof of Theorem 3.
Using Lemma 2.3 of [31] and Theorem 2, we obtain
Next, by (22) and (74), we obtain
which implies (23).
This completes the proof of Theorem 3. □
Following the lines of the proof of Theorem 5.4 in [41], we prove Theorem 4.
Proof of Theorem 4.
From (18), and where is the exact solution of problem (10), we have
By and (24), which implies . Hence,
Applying Theorem 2 and Lemma 2.1 of [31], we obtain
Combining (76) and (77), we have
By (21), we obtain
Then, (78) and (79) imply that
Choose such that
Then,
For any , we have
where . From (80) and (81), we obtain
We choose , which implies that for sufficiently small . Conversely, from (81) and (82), we have , and it follows that
By (83) and (84), we have
Finally, by combining (25) with (23), we obtain
This completes the proof of Theorem 4. □
5. Conclusions
In this paper, we developed a convexification method for the reversed-time problem of the linear CGL. We established a new Carleman estimate for the complex Ginzburg–Landau operator on an arbitrary time interval. Based on this estimate, we constructed a weighted Tikhonov-like functional and proved its global strict convexity on the of arbitrary radius . We proved the existence and uniqueness of the minimizer of on and established the global convergence of the gradient projection method to this minimizer. We also provided stability estimates in the presence of noisy terminal data. This is a purely theoretical work; numerical experiments are not included. Possible future work includes a numerical implementation of the gradient projection method and an extension to the nonlinear CGL.
Author Contributions
Conceptualization, H.Q. and G.Y.; methodology, H.Q. and G.Y.; formal analysis, H.Q. and G.Y.; writing—original draft preparation, H.Q.; writing—review and editing, G.Y.; supervision, G.Y. All authors have read and agreed to the published version of the manuscript.
Funding
The research of H.Q. was supported in part by the National Key R&D Program of China under grant 2023YFA1009002. The research of G.Y. was supported in part by NSFC (No. 11771074 and No. 12371421).
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
No new data were created or analyzed in this study. Data sharing is not applicable.
Acknowledgments
The authors would like to thank the anonymous reviewers for their valuable comments and suggestions.
Conflicts of Interest
The authors declare no conflicts of interest.
Abbreviations
The following abbreviations are used in this manuscript:
| CGL | Complex Ginzburg–Landau equation |
| CWF | Carleman weight function |
References
- Ginzburg, V.L.; Landau, L.D. On the theory of superconductivity. Zh. Eksp. Teor. Fiz. 1950, 20, 1064–1082. [Google Scholar]
- Nishiura, Y. Far-from-Equilibrium Dynamics. In Translations of Mathematical Monographs; AMS: Providence, RI, USA, 2002; Volume 209. [Google Scholar]
- Cross, M.C.; Hohenberg, P.C. Pattern formation outside of equilibrium. Rev. Mod. Phys. 1993, 65, 851–1112. [Google Scholar] [CrossRef] [Scilit]
- Newell, A.C.; Whitehead, J.A. Finite bandwidth, finite amplitude convection. J. Fluid Mech. 1969, 38, 279–303. [Google Scholar] [CrossRef] [Scilit]
- Segel, L.A. Distant side-walls cause slow amplitude modulations of cellular convection. J. Fluid Mech. 1969, 38, 203–224. [Google Scholar] [CrossRef] [Scilit]
- Stewartson, K.; Stuart, J.T. A non-linear instability theory for a wave system in plane Poiseuille flow. J. Fluid Mech. 1971, 48, 529–545. [Google Scholar] [CrossRef] [Scilit]
- Clément, P.; Okazawa, N.; Sobajima, M.; Yokota, T. A simple approach to the Cauchy problem for complex Ginzburg-Landau equations by compactness methods. J. Differ. Equ. 2012, 253, 1250–1263. [Google Scholar] [CrossRef] [Scilit][Green Version]
- Ginibre, J.; Velo, G. The Cauchy problem in local spaces for the complex Ginzburg-Landau equation I. Compactness methods. Phys. D Nonlinear Phenom. 1996, 95, 191–228. [Google Scholar] [CrossRef] [Scilit]
- Ginibre, J.; Velo, G. The Cauchy problem in local spaces for the complex Ginzburg-Landau equation II. Contract. Methods Comm. Math. Phys. 1997, 187, 45–79. [Google Scholar] [CrossRef] [Scilit]
- Levermore, C.D.; Oliver, M. The complex Ginzburg-Landau equation as a model problem. Lect. Appl. Math. 1996, 31, 141–190. [Google Scholar]
- Lu, H.; Bates, P.W.; Lü, S.; Zhang, M. Dynamics of the 3-D fractional complex Ginzburg-Landau equation. J. Differ. Equ. 2015, 259, 5276–5301. [Google Scholar] [CrossRef] [Scilit]
- Matsumoto, T.; Tanaka, N. Semigroups of locally Lipschitz operators associated with semilinear evolution equations of parabolic type. Nonlinear Anal. 2008, 69, 4025–4054. [Google Scholar] [CrossRef] [Scilit]
- Matsumoto, T.; Tanaka, N. Well-posedness for the complex Ginzburg-Landau equations. Ser. Math. Sci. Appl. 2010, 32, 429–442. [Google Scholar]
- Okazawa, N. Smoothing effect and strong L2-wellposedness in the complex Ginzburg-Landau equation. Lect. Notes Pure Appl. Math. 2006, 251, 265–288. [Google Scholar]
- Okazawa, N.; Yokota, T. Subdifferential operator approach to strong well-posedness of the complex Ginzburg- Landau equation. Discret. Contin. Dyn. Syst. 2010, 28, 311–341. [Google Scholar] [CrossRef] [Scilit]
- Okazawa, O.; Yokota, T. Monotonicity method applied to the complex Ginzburg-Landau and related equations. J. Math. Anal. Appl. 2002, 267, 247–263. [Google Scholar] [CrossRef] [Scilit]
- Yokota, T. Monotonicity and compactness methods applied to the nonlinear Schrödinger and related equations. Nonlinear Anal. Appl. Lakshmikantham His 80th Birthd. 2003, 2, 939–956. [Google Scholar]
- Yokota, T.; Okazawa, N. Smoothing effect for the complex Ginzburg-Landau equation. Dyn. Contin. Discret. Impuls. Syst. Ser. A Math. Anal. 2006, 13, 305–316. [Google Scholar]
- Yang, Y. On the Ginzburg-Landau wave equation. Bull. Lond. Math. Soc. 1990, 22, 167–170. [Google Scholar] [CrossRef] [Scilit]
- Ammar-Khodja, F.; Benabdallah, A.; Gonzalez-Burgos, M.; de Teresa, L. Recent results on the controllability of linear coupled parabolic problems: A survey. Math. Control Relat. Fields 2011, 1, 267–306. [Google Scholar] [CrossRef] [Scilit]
- Coron, J.M. Control and Nonlinearity; Mathematical Surveys and Monographs 136; AMS: Providence, RI, USA, 2007. [Google Scholar]
- Fursikov, A.V.; Imanuvilov, O.Y. Controllability of Evolution Equations; Lecture Notes Series 34; Seoul National University: Seoul, Republic of Korea, 1996. [Google Scholar]
- Wang, G. L∞-null controllability for the heat equation and its consequence for the time optimal control problem. SIAM J. Control Optim. 2008, 47, 1701–1720. [Google Scholar] [CrossRef] [Scilit]
- Zuazua, E. Control and numerical approximation of the wave and heat equations. In Proceedings of the International Congress of Mathematicians, Madrid, Spain, 22–30 August 2006; Volume 3, pp. 1389–1417. [Google Scholar]
- Zuazua, E. Controllability and Observability of Partial Differential Equations: Some Results and Open Problems. In Handbook of Differential Equations: Evolutionary Equations; Elsevier Science: Amsterdam, The Netherland, 2006; Volume 3, pp. 527–621. [Google Scholar]
- Zhang, X. A unified controllability/observability theory for some stochastic and deterministic partial differential equations. In Proceedings of the International Congress of Mathematicians, Hyderabad, India, 19–27 August 2010; Volume 4, pp. 3008–3034. [Google Scholar]
- Rosier, L.; Zhang, B. Controllability of the Ginzburg-Landau equation. Comptes Rendus Math. Acad. Sci. Paris 2008, 346, 167–172. [Google Scholar] [CrossRef] [Scilit]
- Rosier, L.; Zhang, B. Null controllability of the complex Ginzburg-Landau equation. Ann. l’Inst. Henri Poincaré C Anal. Non LinéAire 2009, 26, 649–673. [Google Scholar] [CrossRef] [Scilit]
- Klibanov, M.V. Global convexity in a three-dimensional inverse acoustic problem. SIAM J. Math. Anal. 1997, 28, 1371–1388. [Google Scholar] [CrossRef] [Scilit]
- Klibanov, M.V.; Ioussoupova, O.V. Uniform strict convexity of a cost functional for threedimensional inverse scattering problem. SIAM J. Math. Anal. 1995, 26, 147–179. [Google Scholar] [CrossRef] [Scilit]
- Bakushinskii, A.B.; Klibanov, M.V.; Koshev, N.A. Carleman weight functions for a globally convergent numerical method for ill-posed Cauchy problems for some quasilinear PDEs. Nonlinear Anal. Real World Appl. 2017, 34, 201–224. [Google Scholar] [CrossRef] [Scilit]
- Klibanov, M.V.; Kolesov, A.E.; Nguyen, D.L. Convexification method for an inverse scattering problem and its performance for experimental backscatter data for buried targets. SIAM J. Imaging Sci. 2019, 12, 576–603. [Google Scholar] [CrossRef] [Scilit]
- Klibanov, M.V.; Kolesov, A.E.; Sullivan, A.; Nguyen, L. A new version of the convexification method for a 1D coefficient inverse problem with experimental data. Inverse Probl. 2018, 34, 29. [Google Scholar] [CrossRef] [Scilit]
- Khoa, V.A.; Klibanov, M.V.; Nguyen, L.H. Convexification for a 3D inverse scattering problem with the moving point source. arXiv 2019, arXiv:1911.10289. [Google Scholar]
- Baudouin, L.; De Buhan, M.; Ervedoza, S. Convergent algorithm based on Carleman estimates for the recovery of a potential in the wave equation. SIAM J. Numer. Anal. 2017, 55, 1578–1613. [Google Scholar] [CrossRef] [Scilit]
- Beilina, L.; Klibanov, M.V. Globally strongly convex cost functional for a coefficient inverse problem. Nonlinear Anal. Real World Appl. 2015, 22, 272–288. [Google Scholar] [CrossRef] [Scilit]
- Klibanov, M.V.; Li, J.Z.; Zhang, W. Convexification for the inversion of a time dependent wave front in a heterogeneous medium. SIAM J. Appl. Math. 2019, 79, 1722–1747. [Google Scholar] [CrossRef] [Scilit]
- Klibanov, M.V.; Li, J.Z.; Zhang, W. Convexification of electrical impedance tomography with restricted Dirichlet-to-Neumann map data. Inverse Probl. 2019, 35, 035005. [Google Scholar] [CrossRef] [Scilit]
- Klibanov, M.V.; Li, J.Z.; Yang, Z. Convexification for a coefficient inverse problem of mean field games. Inverse Probl. Imaging 2025, 19, 219–252. [Google Scholar] [CrossRef] [Scilit]
- Klibanov, M.V.; Le, T.T.; Nguyen, L.H.; Sullivan, A.; Nguyen, L. Convexification-based globally convergent numerical method for a 1D coefficient inverse problem with experimental data. Inverse Probl. Imaging 2022, 16, 1579–1618. [Google Scholar] [CrossRef] [Scilit]
- Klibanov, M.V.; Yagola, A.G. Convergent numerical methods for parabolic equations with reversed time via a new Carleman estimate. Inverse Probl. 2019, 35, 30. [Google Scholar] [CrossRef] [Scilit]
- Fu, X.Y. Null controllability for the parabolic equation with a complex principal part. J. Funct. Anal. 2009, 257, 1333–1354. [Google Scholar] [CrossRef] [Scilit]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.